2012
Salamanca, Luis; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
Bayesian Equalization for LDPC Channel Decoding Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 60, no 5, pp. 2672–2676, 2012, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation methods, Bayes methods, Bayesian equalization, Bayesian estimation problem, Bayesian inference, Bayesian methods, BCJR (Bahl–Cocke–Jelinek–Raviv) algorithm, BCJR algorithm, Channel Coding, channel decoding, channel equalization, channel equalization problem, Channel estimation, channel state information, CSI, Decoding, equalisers, Equalizers, expectation propagation, expectation propagation algorithm, fading channels, graphical model representation, intersymbol interference, Kullback-Leibler divergence, LDPC, LDPC coding, low-density parity-check decoder, Modulation, parity check codes, symbol posterior estimates, Training
@article{Salamanca2012b,
title = {Bayesian Equalization for LDPC Channel Decoding},
author = {Luis Salamanca and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6129544},
issn = {1053-587X},
year = {2012},
date = {2012-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {60},
number = {5},
pages = {2672--2676},
abstract = {We describe the channel equalization problem, and its prior estimate of the channel state information (CSI), as a joint Bayesian estimation problem to improve each symbol posterior estimates at the input of the channel decoder. Our approach takes into consideration not only the uncertainty due to the noise in the channel, but also the uncertainty in the CSI estimate. However, this solution cannot be computed in linear time, because it depends on all the transmitted symbols. Hence, we also put forward an approximation for each symbol's posterior, using the expectation propagation algorithm, which is optimal from the Kullback-Leibler divergence viewpoint and yields an equalization with a complexity identical to the BCJR algorithm. We also use a graphical model representation of the full posterior, in which the proposed approximation can be readily understood. The proposed posterior estimates are more accurate than those computed using the ML estimate for the CSI. In order to illustrate this point, we measure the error rate at the output of a low-density parity-check decoder, which needs the exact posterior for each symbol to detect the incoming word and it is sensitive to a mismatch in those posterior estimates. For example, for QPSK modulation and a channel with three taps, we can expect gains over 0.5 dB with same computational complexity as the ML receiver.},
keywords = {Approximation methods, Bayes methods, Bayesian equalization, Bayesian estimation problem, Bayesian inference, Bayesian methods, BCJR (Bahl\textendashCocke\textendashJelinek\textendashRaviv) algorithm, BCJR algorithm, Channel Coding, channel decoding, channel equalization, channel equalization problem, Channel estimation, channel state information, CSI, Decoding, equalisers, Equalizers, expectation propagation, expectation propagation algorithm, fading channels, graphical model representation, intersymbol interference, Kullback-Leibler divergence, LDPC, LDPC coding, low-density parity-check decoder, Modulation, parity check codes, symbol posterior estimates, Training},
pubstate = {published},
tppubtype = {article}
}
Cruz-Roldan, Fernando; Dominguez-Jimenez, María Elena; Vidal, Gabriela Sansigre; Amo-Lopez, Pedro; Blanco-Velasco, Manuel; Bravo-Santos, Ángel M
On the Use of Discrete Cosine Transforms for Multicarrier Communications Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 60, no 11, pp. 6085–6090, 2012, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: broadband networks, carrier frequency offset, Carrier-frequency offset (CFO), CFO, channel equalization, computer simulations, Convolution, Data communication, data symbol, DCT, DFT, discrete cosine transform (DCT), discrete cosine transform domain, Discrete cosine transforms, discrete Fourier transforms, discrete multitone modulation (DMT), discrete trigonometric domain, element-by-element multiplication, equalisers, equivalent channel impulse response, linear convolution, mobile broadband wireless communication, mobile radio, Modulation, multicarrier communications, multicarrier data transmission, multicarrier modulation (MCM), multicarrier transceiver, OFDM, orthogonal frequency-division multiplexing (OFDM), Receivers, Redundancy, subcarrier equalizers, symmetric convolution-multiplication property, symmetric redundancy, time-domain analysis, transient response, transmission channel
@article{Cruz-Roldan2012,
title = {On the Use of Discrete Cosine Transforms for Multicarrier Communications},
author = {Fernando Cruz-Roldan and Mar\'{i}a Elena Dominguez-Jimenez and Gabriela Sansigre Vidal and Pedro Amo-Lopez and Manuel Blanco-Velasco and \'{A}ngel M Bravo-Santos},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6252068},
issn = {1053-587X},
year = {2012},
date = {2012-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {60},
number = {11},
pages = {6085--6090},
abstract = {In this correspondence, the conditions to use any kind of discrete cosine transform (DCT) for multicarrier data transmission are derived. The symmetric convolution-multiplication property of each DCT implies that when symmetric convolution is performed in the time domain, an element-by-element multiplication is performed in the corresponding discrete trigonometric domain. Therefore, appending symmetric redundancy (as prefix and suffix) into each data symbol to be transmitted, and also enforcing symmetry for the equivalent channel impulse response, the linear convolution performed in the transmission channel becomes a symmetric convolution in those samples of interest. Furthermore, the channel equalization can be carried out by means of a bank of scalars in the corresponding discrete cosine transform domain. The expressions for obtaining the value of each scalar corresponding to these one-tap per subcarrier equalizers are presented. This study is completed with several computer simulations in mobile broadband wireless communication scenarios, considering the presence of carrier frequency offset (CFO). The obtained results indicate that the proposed systems outperform the standardized ones based on the DFT.},
keywords = {broadband networks, carrier frequency offset, Carrier-frequency offset (CFO), CFO, channel equalization, computer simulations, Convolution, Data communication, data symbol, DCT, DFT, discrete cosine transform (DCT), discrete cosine transform domain, Discrete cosine transforms, discrete Fourier transforms, discrete multitone modulation (DMT), discrete trigonometric domain, element-by-element multiplication, equalisers, equivalent channel impulse response, linear convolution, mobile broadband wireless communication, mobile radio, Modulation, multicarrier communications, multicarrier data transmission, multicarrier modulation (MCM), multicarrier transceiver, OFDM, orthogonal frequency-division multiplexing (OFDM), Receivers, Redundancy, subcarrier equalizers, symmetric convolution-multiplication property, symmetric redundancy, time-domain analysis, transient response, transmission channel},
pubstate = {published},
tppubtype = {article}
}