A Convex Relaxation Approach to Higher-Order Statistical Approaches to Signal Recovery

Abstract

In this work, we investigate an efficient numerical approach for solving higher order statistical methods for blind and semi-blind signal recovery from non-ideal channels. We develop numerical algorithms based on convex optimization relaxation for minimization of higher order statistical cost functions. The new formulation through convex relaxation overcomes the local convergence problem of existing gradient descent based algorithms and applies to several well-known cost functions for effective blind signal recovery including blind equalization and blind source separation in both single-input-single-output (SISO) and multi-input-multi-output (MIMO) systems. We also propose a fourth order pilot based cost function that benefits from this approach. The simulation results demonstrate that our approach is suitable for short-length packet data transmission using only a few pilot symbols. Keywords: Blind signal recovery, semi/blind channel equalization, convex optimization, semidefinite programming, rank 1 approximation. 4 Let J b,i denote a blind cost function, for examples, CMA, SWA, or MED, to recover the source i, the cost function for multiple blind source recovery (BSR) is [23], [24] J bsr = NT i=1 J b,i + λ cr · NT i =j Huy-Dung Han Huy-Dung Han received B.S. in

Adaptive Blind MPSK Constellation Recovery and Equalization for Cognitive Radio Applications

“…The most popular ones are based on Godard's constant modulus algorithm (CMA), Shalvi-Weistein (SWA), and minimum entropy criterion (MED) [19] algorithms. These solutions are based on the constant amplitude of phase-modulated signals such as PSK waveforms.…”

Robust secure transmission for wireless information and power transfer in heterogeneous networks

“…The computation complexity of Algorithm 1 is mainly determined by the problem (36), which is a semi-definite programming (SDP) problem and can be solved by IPM. According to [35], the computational order of an SDP problem with g optimisation variables using the IPM is given by O(g 3.5 ). For the problem (36), the number of its optimised variables is counted as…”

SVR Based Blind Signal Recovery for Convolutive MIMO Systems With High-Order QAM Signals

“…Specifically, they work as the corresponding normalized version when the consistency rule is met, otherwise they disregard the cross-correlation term and estimate the dispersion error by a linear function. Actually, all the above online algorithms ordinarily exist multiple local minima and require huge amounts of samples to converge [18], [19].…”