Low complexity Markov chain Monte Carlo detector for channels with intersymbol interference

Authors:
Rong-Hui Peng;Rong-Rong Chen;Behrouz Farhang-Boroujeny
Affiliations:
Dept. of Electrical and Computer Engineering, University of Utah, Salt Lake City, UT;Dept. of Electrical and Computer Engineering, University of Utah, Salt Lake City, UT;Dept. of Electrical and Computer Engineering, University of Utah, Salt Lake City, UT
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 3
Cited 1

Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems

IEEE Transactions on Signal Processing
Reduced-state BCJR-type algorithms

IEEE Journal on Selected Areas in Communications
Monte carlo equalization for nonlinear dispersive satellite channels

IEEE Journal on Selected Areas in Communications

Markov chain monte carlo detectors for channels with intersymbol interference

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equalization (reported in a previous work) results in a sequential processing algorithm that leads to a long processing delay in the communication link. Using the tool of factor graph, we propose a novel parallel processing algorithm that reduces the processing delay by orders of magnitude. Numerical results show that, both the sequential and parallel processing SISO equalizers perform similarly well and achieve a performance that is only slightly worse than the optimum SISO equalizer. The optimum SISO equalizer, on the other hand, has a complexity that grows exponentially with the size of the memory of the channel, while the complexity of the proposed SISO equalizers grows linearly.