10 October 2016 in IEEE Transactions on Communications
In probabilistic equalization of channels with intersymbol interference, the BCJR algorithm and its approximations become intractable for high order modulations, even for moderate channel dispersions. In this paper we introduce a novel soft equalizer to approximate the symbol a posteriori probabilities (APP) where the expectation propagation (EP) algorithm is used to provide an accurate estimation. This new soft equalizer is presented as a block solution, denoted as block-EP (BEP), where the structure of the matrices involved is exploited to reduce the complexity order to OpLN2q, i.e., linear in the length of the channel, L, and quadratic in the frame length, N. The solution is presented in complex-valued formulation within a turbo equalization scheme. This algorithm can be cast as a linear minimummean- squared-error (LMMSE) turbo equalization with double feedback architecture where constellations being discrete is a restriction exploited by the EP that provides a first refinement of the APP. In the experiments included, the BEP exhibits a robust performance, regardless of the channel response, with gains in the range 1:5-5 dB compared to the LMMSE equalization.
23 August 2019 in IEEE Transactions on Signal Processing
We propose a novel adaptive kernel-based regression method for complex-valued signals: the generalized complex-valued kernel least-mean-square (gCKLMS). We borrow from the new results on widely linear reproducing kernel Hilbert space (WL-RKHS) for nonlinear regression and complex-valued signals, recently proposed by the authors. This paper shows that in the adaptive version of the kernel regression for complex-valued signals we need to include another kernel term, the so-called pseudo-kernel. This new solution is endowed with better representation capabilities in complex-valued fields since it can efficiently decouple the learning of the real and the imaginary part. Also, we review previous realizations of the complex KLMS algorithm and its augmented version to prove that they can be rewritten as particular cases of the gCKLMS. Furthermore, important conclusions on the design of the kernels are drawn that help to greatly improve the convergence of the algorithms. In the experiments, we revisit the nonlinear channel equalization problem to highlight the better convergence of the gCKLMS compared to previous solutions. Also, the flexibility of the proposed generalized approach is tested in a second experiment with non-independent real and imaginary parts. The results illustrate the significant performance improvements of the gCKLMS approach when the complex-valued signals have different properties for the real and imaginary parts.
17 July 2006 in IEEE Transactions on Signal Processing
Blind source separation (BSS) aims at the reconstruction of unknown mutually independent signals, so-called sources, from their mixtures observed at the output of a sensor array. The BSS of instantaneous linear mixtures, which finds application in numerous fields, can be solved through the statistical tool of independent component analysis (ICA). This paper concentrates on the analytic solutions for the fundamental two-signal ICA scenario. A novel estimation class, so-called general weighted fourth-order estimator (GWFOE), is put forward, which is based on the fourth-order statistics of the whitened sensor output. By means of a weight parameter, the GWFOE is able to unify a variety of apparently disparate estimation expressions previously scattered throughout the literature, including the well-known JADE method in the two-signal case. A theoretical asymptotic performance analysis is carried out, resulting in the GWFOE large-sample mean square error and the source-dependent weight value of the most efficient estimator in the class. To extend the pairwise estimators to the general scenario of more than two sources, an improved Jacobi-like optimization technique is proposed. The approach consists of calculating the necessary sensor-output fourth-order statistics at the initialization stage of the algorithm, which can lead to significant computational savings when large sample blocks are processed. Based on this idea, adaptive algorithms are also devised, showing very satisfactory convergence characteristics. Experiments illustrate the good performance of these optimal pairwise ICA strategies, in both off- and on-line processing modes
30 June 2015 in IEEE Signal Processing Letters
This letter presents a novel time-of-arrival (TOA) blind estimation technique for ultra wideband energy detection receivers with reduced complexity. The proposed method is blind in the sense that it does not exploit any information about channel or noise power. This new approach is based on a set of approximations of the exact likelihood function (ELF) of the observed energy. Even though these approximations achieve an important reduction of complexity, the shape of the new approximated function is accurate enough compared to the ELF. Application of a threshold to the differential of the approximated log-likelihood function completes the procedure. Simulations show that the performance of the proposed method in terms of the cumulative distribution function of the estimation error approaches that of a method based on the ELF and a genie-aided algorithm with perfect knowledge of the optimal threshold.
1 December 2011 in IEEE Transactions on Vehicular Technology
The authors present a blind channel estimation of cyclic prefix (CP) orthogonal frequency-division multiplexing (OFDM) systems with nonredundant precoding based on second-order statistics. The study analyzes first the mean square error for the estimation of the covariance matrix of the received symbols. We prove that, for high and medium signal-to-noise ratios (SNRs), the estimation error in the diagonal entries of the covariance matrix exhibits a lower error than that in the off-diagonal elements. This behavior holds for SNR values in digital communication. Contrary to general belief, we prove that the diagonal of this matrix can be used for channel estimation. Hence, we develop a novel algorithm that utilizes this result. We also develop a low-complexity version that provides acceptable results with reduced computational requirements. Finally, we analyze the covariance matrix and propose another new algorithm with noise suppression capabilities. Some experimental results for Rayleigh channels are included to support these conclusions. In addition, they illustrate better performance of the new methods, compared with previous proposals and with the Cramér-Rao bound (CRB).