ISIrene Santos

Irene Santos

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Irene Santos has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Low-Complexity Double EP-Based Detector for Iterative Detection and Decoding in MIMO

    by Juan Jose Murillo-Fuentes, Irene Santos, Jose Carlos Aradillas, Matilde Sanchez-Fernandez

    We propose a new iterative detection and decoding (IDD) algorithm for multiple-input multiple-output (MIMO) based on expectation propagation (EP) with application to massive MIMO scenarios. Two main results are presented. We first introduce EP to iteratively improve the Gaussian approximations of both the estimation of the posterior by the MIMO detector and the soft output of the channel decoder. With this novel approach, denoted by double-EP (DEP), the convergence is very much improved with a computational complexity just two times the one of the linear minimum mean square error (LMMSE) based IDD, as illustrated by the included experiments. Besides, as in the LMMSE MIMO detector, when the number of antennas increases, the computational cost of the matrix inversion operation required by the DEP becomes unaffordable. In this work we also develop approaches of DEP where the mean and the covariance matrix of the posterior are approximated by using the Gauss-Seidel and Neumann series methods, respectively. This low-complexity DEP detector has quadratic complexity in the number of antennas, as the low-complexity LMMSE techniques. Experimental results show that the new low-complexity DEP achieves the performance of the DEP as the ratio between the number of transmitting and receiving antennas decreases.


  • Open Access

    A Low-Complexity Double EP-based Detector for Iterative Detection and Decoding in MIMO

    by Juan José Murillo Fuentes, Irene Santos, José Carlos Aradillas, Matilde Sánchez-Fernández

    We propose a new iterative detection and decoding algorithm for multiple-input multiple-output (MIMO) based on expectation propagation (EP) with application to massive MIMO scenarios. Two main results are presented. We first introduce EP to iteratively improve the Gaussian approximations of both the estimation of the posterior by the MIMO detector and the soft output of the channel decoder. With this novel approach, denoted by double-EP (DEP), the convergence is very much improved with a computational complexity just two times the one of the linear minimum mean square error (LMMSE), as illustrated by the included experiments. Besides, as in the LMMSE MIMO detector, when the number of antennas increases, the computational cost of the matrix inversion operation required by the DEP becomes unaffordable. In this work we also develop approaches of DEP where the mean and the covariance matrix of the posterior are approximated by using the Gauss-Seidel and Neumann series methods, respectively. This low-complexity DEP detector has quadratic complexity in the number of antennas, i.e., the same as the low-complexity LMMSE techniques. Experimental results show that the new low-complexity DEP achieves the performance of the DEP as the ratio between the number of transmitting and receiving antennas decreases

  • Channel Equalization With Expectation Propagation at Smoothing Level

    by Irene Santos, Juan Jose Murillo-Fuentes, J. Carlos Aradillas, Eva Arias-De-Reyna

    In this paper we propose a novel turbo equalizer based on the expectation propagation (EP) algorithm. Optimal equalization is computationally unfeasible when high-order modulations and/or large memory channels are used. In these scenarios, low-cost and suboptimal equalizers, such as those based on the linear minimum mean square error (LMMSE), are commonly used. The LMMSE-based equalizer can be efficiently implemented with a Kalman smoother (KS), i.e., a forward and backward Kalman filtering whose predictions are merged in a posterior smoothing step. Recently, it was shown that applying EP at the forward and backward stages of a KS equalizer could significantly improve its performance. In this paper, we investigate applying EP at the smoothing level instead. Also, we propose some further modifications to better exploit the information coming from the channel decoder in turbo equalization schemes. Overall, we remarkably reduce the computational complexity while highly improving the performance in terms of bit error rate.


  • Self and Turbo Iterations for MIMO Receivers and Large-Scale Systems

    by Irene Santos, Juan Jose Murillo-Fuentes

    We investigate a turbo soft detector based on the expectation propagation (EP) algorithm for large-scale multiple-input multiple-output (MIMO) systems. Optimal detection in MIMO systems becomes computationally unfeasible for high-order modulations and/or large number of antennas and approximations are used instead. We propose a new EP-based detector with enhanced estimation in terms of complexity and performance. Specifically, we improve the convergence of the self-iterated EP stage by re-defining the priors to better characterize the information returned by the decoder once the turbo procedure starts. We also review the EP parameters to avoid instabilities when using high-order modulations and to reduce the computational complexity. Simulation results illustrate the robustness and enhanced performance of this novel detector in comparison to previous approaches found in the literature.


  • Recursive Estimation of Dynamic RSS Fields Based on Crowdsourcing and Gaussian Processes

    by Irene Santos, Juan Jose Murillo-Fuentes, Petar M. Djuric

    In this paper, we address the estimation of a time-varying spatial field of received signal strength (RSS) by relying on measurements from randomly placed and not very accurate sensors. We employ a radio propagation model where the path loss exponent and the transmitted power are unknown with Gaussian priors whose hyper-parameters are estimated by applying the empirical Bayes method. We consider the locations of the sensors to be imperfectly known, which entails that they represent another source of error in the model. The propagation model includes shadowing which is considered to be a zero-mean Gaussian process where the correlation of attenuation between two spatial points is quantified by an exponential function of the distance between the points. The location of the transmitter is also unknown and estimated from the data with a weighted centroid approach. We propose to estimate time-varying RSS fields by a recursive Bayesian method and crowdsourcing. The method is based on Gaussian processes (GP), and it produces the joint distribution of the spatial field. Further, it summarizes all the acquired information by keeping the size of the needed memory bounded. We also present the Baysian Cramer-Rao bound (BCRB) of the estimated parameters. Finally, we illustrate the performance of our method with experimental results on synthetic and real data sets.


  • Turbo EP-Based Equalization: A Filter-Type Implementation

    by Irene Santos, Juan Jose Murillo-Fuentes, Eva Arias-De-Reyna, Pablo M. Olmos

    We propose a novel filter-type equalizer to improve the solution of the turbo equalizer, with computational complexity constrained to be quadratic in the filter length. When high-order modulations and/or large memory channels are used the optimal BCJR equalizer is unavailable, due to its computational complexity. In this scenario, the filter-type LMMSE turbo equalization exhibits a good performance compared to other approximations. In this paper, we show that this solution can be significantly improved by using expectation propagation (EP) in the estimation of the a posteriori probabilities. First, it yields a more accurate estimation of the extrinsic distribution to be sent to the channel decoder. Second, compared to other solutions based on EP the computational complexity of the proposed solution is constrained to be quadratic in the length of the. In addition, we review previous EP-based turbo equalization implementations. Instead of considering default uniform priors we exploit the outputs of the decoder. Some simulation results are included to show that this new EP-based filter remarkably outperforms the turbo approach of previous versions of the EP algorithm and also improves the LMMSE solution, with and without turbo equalization.


  • Probabilistic Equalization With a Smoothing Expectation Propagation Approach

    by Irene Santos, Juan Jose Murillo-Fuentes, Eva Arias-De-Reyna, Pablo M. Olmos

    In this paper we face the soft equalization of channels with inter-symbol interference for large constellation sizes, M. In this scenario the optimal BCJR solution and most of their approximations are intractable, as the number of states they track grows fast with M. We present a probabilistic equalizer to approximate the posterior distributions of the transmitted symbols using the expectation propagation (EP) algorithm. The solution is presented as a recursive sliding window approach to ensure that the computational complexity is linear with the length of the frame. The estimations can be further improved with a forward-backward approach. This novel soft equalizer, denoted as smoothing expectation propagation (SEP), is also tested as turbo equalizer, with a low-density parity-check (LDPC) channel decoder. The extensive results reported reveal remarkably good behavior of the SEP. In low dimensional cases, the bit error rate (BER) curves after decoding are closer than 1 dB from those of the BJCR, robust to the channel response. For large M, the SEP exhibits gains in the range 3-5 dB compared to the linear minimum mean square error algorithm.


  • Expectation Propagation as Turbo Equalizer in ISI Channels

    by Irene Santos, Juan Jose Murillo-Fuentes, Rafael Boloix-Tortosa, Eva Arias-De-Reyna, Pablo M. Olmos

    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.