In this paper, the problem of the deterministic pilot allocation for sparse channel estimation in Orthogonal Frequency Division Multiplexing (OFDM) system is investigated. This method is based on mutual coherence mini...
详细信息
ISBN:
(纸本)9781509055593
In this paper, the problem of the deterministic pilot allocation for sparse channel estimation in Orthogonal Frequency Division Multiplexing (OFDM) system is investigated. This method is based on mutual coherence minimization of the measurement matrix associated with the OFDM system pilot subcarriers. It is known that if the set of pilot pattern is a Cyclic Difference Set (CDS), the mutual coherence of the measurement matrix is minimized. However, CDS in most practical OFDM system is not available. Few research efforts have tackled the problem of pilot allocation by proposing methods that lead to suboptimal solutions in order to ignore the computationally complex exhaustive search method. This contribution, however, proposes two pilot allocation design schemes for the construction of deterministic partial Fourier matrices satisfying the Restricted Isometry Property (RIP) namely, the Generic Random Search (GRS) and Progressive Search (PS) based on bounding the mutual coherence between different columns of the measurement matrix. Simulation results show that the two proposed pilot allocation design schemes are effective and offer a better channel estimation performance in terms of MSE when compared to former pilot allocation design methods.
The energy optimization of resource constrained energy harvesting Wireless Sensor Networks (WSN) have constituted a major research topic in recent years in areas such as environmental monitoring, hazard detection and ...
详细信息
ISBN:
(纸本)9781509050192
The energy optimization of resource constrained energy harvesting Wireless Sensor Networks (WSN) have constituted a major research topic in recent years in areas such as environmental monitoring, hazard detection and industrial applications. Current approaches leverage techniques such as adaptive duty cycling, transmission power adaptation and data reduction methods to minimize energy consumption. However, the majority of the state of the art approaches with WSN research assume that energy generation, although variable, is not controllable in-situ to optimize energy generation. In this paper, we design a low power, low cost, open source solar tracking mechanism for energy harvesting wireless sensors. Furthermore, we formulate the dynamic energy generation system as an optimization problem and from this design an adaptive, lightweight, distributed, prediction free algorithm to maximize the energy generation of the system. Moreover, we evaluate the proposed method using a combination of real trace-driven real solar data based simulation, comparison to a centralized globally optimum solution and real world experimentation. From our evaluation, an improvement of up to 165% in energy generation has been seen when compared to traditional tracking methodologies and that the lightweight distributed implementation is, on average, 99.1% as efficient as the globally optimum solution across 28 distinct testing scenarios.
This paper presents an empirical study comparing the performance of thirty-five boundary constraint-handling methods (BCHM) for PSO in constrained optimization, which were tested in a set of thirty-six well-known cons...
详细信息
ISBN:
(纸本)9781509046010
This paper presents an empirical study comparing the performance of thirty-five boundary constraint-handling methods (BCHM) for PSO in constrained optimization, which were tested in a set of thirty-six well-known constrained problems. Each BCHM is composed as an hybrid consisting of one position update techniques and one velocity update strategy. Results show that the hybrid method that relocates the particles through a position update technique called Centroid and modifies its velocity through the Deterministic Back strategy is able to promote better final results and improving both, the approach to the feasible region and the ability to generate better feasible solutions.
This study is the second using real-coded representation for problems usually solved with a discrete coding. The adaptive generative representation is able to adapt itself on the fly to prior parts of the construction...
详细信息
ISBN:
(纸本)9781509046010
This study is the second using real-coded representation for problems usually solved with a discrete coding. The adaptive generative representation is able to adapt itself on the fly to prior parts of the construction of an object as it assembles it. In the initial study the ability of the representation to take user supplied or problem supplied biases that change its behavior was demonstrated but not explored. In this study the bias is used to change the way evolution explores a fitness landscape for both an RFID antenna design problem and small instances of the traveling salesman problem. Addition of a bias to two different generative representations promotes the evolution of longer antenna designs (a heuristic objective associated with good antennas) while leading the algorithm to generate designs with distinctive shape characteristics. For the traveling salesman, a simple inverse-distance bias for the adaptive generative representation causes a large improvement in performance over a random key representation in 99 of 100 instances studied.
A new method to plan guaranteed to be safe paths in an uncertain environment, with an uncertain initial and final configuration space, while avoiding static obstacles is presented. First, two improved versions of the ...
详细信息
ISBN:
(纸本)9781509028733
A new method to plan guaranteed to be safe paths in an uncertain environment, with an uncertain initial and final configuration space, while avoiding static obstacles is presented. First, two improved versions of the previously proposed BoxRRT algorithm are presented: both with a better integration scheme and one of them with the control input selected according to a desired objective, and not randomly, as in the original formulation. Second, a new motion planner, called towards BoxRRT(star), based on optimal Rapidly-exploring Random Trees algorithm and using interval analysis is introduced. Finally, each of the described algorithms are evaluated on a numerical example. Results show that our algorithms make it possible to find shorter reliable paths with less iterations.
In this paper a special Boundary Search operator is added to the Brain Storm Optimization algorithm leading to the search process towards the feasibility boundary of the hardest current constraint. Two new boundary se...
详细信息
ISBN:
(纸本)9781538608197
In this paper a special Boundary Search operator is added to the Brain Storm Optimization algorithm leading to the search process towards the feasibility boundary of the hardest current constraint. Two new boundary search operator versions are introduced inspired in the analytical geometry division line segment topic and the gradient method, respectively. The algorithm performance is analysed by solving 36 well-know constrained problems, reporting an improvement degree in the range of 22% to 27% of the total of functions in 10D and 50% to 66% of the total of functions in 30D compared with the epsilon DEag algorithm.
Coarse-grained reconfigurable array( CGRA) has an advantage in the implementation of symmetric cryptog raphic algorithms with high performance and flexibility. S pecially, interconnection network is u
ISBN:
(纸本)9781467389808
Coarse-grained reconfigurable array( CGRA) has an advantage in the implementation of symmetric cryptog raphic algorithms with high performance and flexibility. S pecially, interconnection network is u
Resource allocation strategy has been a hot and difficult research topic in the field of cloud computing. We address the problem of resource fairness allocation in heterogeneous cloud computing where the multiple type...
详细信息
ISBN:
(纸本)9781509062966
Resource allocation strategy has been a hot and difficult research topic in the field of cloud computing. We address the problem of resource fairness allocation in heterogeneous cloud computing where the multiple types of resource are considered, which is computationally intractable. There is a significant gap between the solutions obtained by existing heuristic algorithms and the optimal solutions, leading to lower resource utilization and unfair resource allocation. We propose a hybrid algorithm based on ant colony optimization (ACO) and Tabu Search (TS) to maximize the minimum global dominant share in heterogeneous servers. In order to balance the exploitation and exploration of the algorithm, the new self-adaptive parameter settings are introduced as uniformly random numbers to enhance the diversity of the population. Furthermore, we propose a revising operation to change infeasible solutions into feasible solutions. Compared with some algorithms from the literature, the experimental results indicate that our proposed algorithm can maximize the global dominant share fairly and increase the resource utilization, and it is highly adaptable to different situations.
In this work, we introduce beta-expansion, a notion borrowed from number theory, as a theoretical framework to study fast construction of polar codes based on a recursive structure of universal partial order (UPO) and...
详细信息
ISBN:
(纸本)9781509050192
In this work, we introduce beta-expansion, a notion borrowed from number theory, as a theoretical framework to study fast construction of polar codes based on a recursive structure of universal partial order (UPO) and polarization weight (PW) algorithm. We show that polar codes can be recursively constructed from UPO by continuously solving several polynomial equations at each recursive step. From these polynomial equations, we can extract an interval for beta, such that ranking the synthetic channels through a closed-form beta-expansion preserves the property of nested frozen sets, which is a desired feature for low-complex construction. In an example of AWGN channels, we show that this interval for beta converges to a constant close to 1.1892 approximate to 2(1/4) when the code block-length trends to infinity. Both asymptotic analysis and simulation results validate our theoretical claims.
Outlier detection has been shown to be a promising machine learning technique for a diverse array of fields and problem areas. However, traditional, supervised outlier detection is not well suited for problems such as...
详细信息
ISBN:
(纸本)9781538607527
Outlier detection has been shown to be a promising machine learning technique for a diverse array of fields and problem areas. However, traditional, supervised outlier detection is not well suited for problems such as network intrusion detection, where proper labelled data is scarce. This has created a focus on extending these approaches to be unsupervised, removing the need for explicit labels, but at a cost of poorer performance compared to their supervised counterparts. Recent work has explored ways of making up for this, such as creating ensembles of diverse models, or even diverse learning algorithms, to jointly classify data. While using unsupervised, heterogeneous ensembles of learning algorithms has been proposed as a viable next step for research, the implications of how these ensembles are built and used has not been explored.
暂无评论