A new polynomial-time algorithm for linear programming
Combinatorica
Atomic Decomposition by Basis Pursuit
SIAM Review
Operations Research
Convex Optimization
Adaptive equalization of time-varying MIMO channels
Signal Processing - Content-based image and video retrieval
TR-MUSIC: a robust frequency estimation method in impulsive noise
Signal Processing
Detection of fading overlapping multipath components
Signal Processing - Signal processing in UWB communications
Toeplitz and circulant matrices: a review
Communications and Information Theory
A complex generalized Gaussian distribution: characterization, generation, and estimation
IEEE Transactions on Signal Processing
SPARLS: the sparse RLS algorithm
IEEE Transactions on Signal Processing
Multipath time-delay detection and estimation
IEEE Transactions on Signal Processing
Efficient decision feedback equalization for sparse wireless channels
IEEE Transactions on Wireless Communications
Just relax: convex programming methods for identifying sparse signals in noise
IEEE Transactions on Information Theory
De-noising by soft-thresholding
IEEE Transactions on Information Theory
Measurements and models of radio frequency impulsive noise for indoor wireless communications
IEEE Journal on Selected Areas in Communications
Improved Image Recovery From Compressed Data Contaminated With Impulsive Noise
IEEE Transactions on Image Processing
Hi-index | 0.08 |
In this paper, an algorithm for sparse channel estimation, called @?"1-regularized least-absolutes (@?"1-LA), and an algorithm for equalization, called linear least-absolutes (LLA), in non-Gaussian impulsive noise are proposed. The proposed approaches are based on the minimization of the absolute error function, rather than the squared error function. By replacing the standard modulus with the @?"1-modulus of complex numbers, the resulting optimization problem can be efficiently solved through linear programming. The selection of an appropriate regularization parameter is also addressed. Numerical results demonstrate that the proposed algorithms, compared with the classical methods, are more robust to impulsive noise and have a superior accuracy.