Simulated annealing based multiuser detection for synchronous SDMA system

In this treatise, a novel Simulated Annealing (SA) based Multi-User Detection (MUD) is proposed in synchronous Space Division Multiple Access (SDMA) system. SA MUD modifies experiential Cooling Schedule (CS) of traditional SA algorithm according to its use in MUD. Moreover, in order to ensure sufficient diversity acquired in the whole Markov chain and to prevent from being trapped at local optima, Uniform Mutation (UM) based trial vector generation scheme is brought forward. In addition, the optimal solution recording scheme is also invoked in case of being lost during cooling process. Simulation results illustrate that in comparison with Genetic Algorithm (GA) MUD in the same simulation conditions, without turbo processing and soft-information, SA MUD proposed in this paper performs better, approaching the performance of Maximum Likelihood (ML) MUD and imposes lower complexity

Nature-inspired Cuckoo Search Algorithm for Side Lobe Suppression in a Symmetric Linear Antenna Array

In this paper, we proposed a newly modified cuckoo search (MCS) algorithm integrated with the Roulette wheel selection operator and the inertia weight controlling the search ability towards synthesizing symmetric linear array geometry with minimum side lobe level (SLL) and/or nulls control. The basic cuckoo search (CS) algorithm is primarily based on the natural obligate brood parasitic behavior of some cuckoo species in combination with the Levy flight behavior of some birds and fruit flies. The CS metaheuristic approach is straightforward and capable of solving effectively general N-dimensional, linear and nonlinear optimization problems. The array geometry synthesis is first formulated as an optimization problem with the goal of SLL suppression and/or null prescribed placement in certain directions, and then solved by the newly MCS algorithm for the optimum element or isotropic radiator locations in the azimuth-plane or xy-plane. The study also focuses on the four internal parameters of MCS algorithm specifically on their implicit effects in the array synthesis. The optimal inter-element spacing solutions obtained by the MCS-optimizer are validated through comparisons with the standard CS-optimizer and the conventional array within the uniform and the Dolph-Chebyshev envelope patterns using MATLABTM. Finally, we also compared the fine-tuned MCS algorithm with two popular evolutionary algorithm (EA) techniques include particle swarm optimization (PSO) and genetic algorithms (GA)

Interest and Applicability of Meta-Heuristic Algorithms in the Electrical Parameter Identification of Multiphase Machines

Multiphase machines are complex multi-variable electro-mechanical systems that are receiving special attention from industry due to their better fault tolerance and power-per-phase splitting characteristics compared with conventional three-phase machines. Their utility and interest are restricted to the definition of high-performance controllers, which strongly depends on the knowledge of the electrical parameters used in the multiphase machine model. This work presents the proof-of-concept of a new method based on particle swarm optimization and standstill time-domain tests. This proposed method is tested to estimate the electrical parameters of a five-phase induction machine. A reduction of the estimation error higher than 2.5% is obtained compared with gradient-based approaches.Plan Estatal 2013-2016 Retos - Proyectos I+D+i DPI2013-44278-RPlan Estatal 2013-2016 Retos - Proyectos I+D+i DPI2016-76144-

Sparsity and adaptivity for the blind separation of partially correlated sources

Blind source separation (BSS) is a very popular technique to analyze multichannel data. In this context, the data are modeled as the linear combination of sources to be retrieved. For that purpose, standard BSS methods all rely on some discrimination principle, whether it is statistical independence or morphological diversity, to distinguish between the sources. However, dealing with real-world data reveals that such assumptions are rarely valid in practice: the signals of interest are more likely partially correlated, which generally hampers the performances of standard BSS methods. In this article, we introduce a novel sparsity-enforcing BSS method coined Adaptive Morphological Component Analysis (AMCA), which is designed to retrieve sparse and partially correlated sources. More precisely, it makes profit of an adaptive re-weighting scheme to favor/penalize samples based on their level of correlation. Extensive numerical experiments have been carried out which show that the proposed method is robust to the partial correlation of sources while standard BSS techniques fail. The AMCA algorithm is evaluated in the field of astrophysics for the separation of physical components from microwave data.Comment: submitted to IEEE Transactions on signal processin