Abstract
This paper describes a low-complexity turbo equalizer for coded sparse multipath channels whose length can span hundreds of symbol intervals. First, for single-input-single-output (SISO) systems, an existing parallel-trellis framework, which consists of a bank of identical regular trellises, is exploited to construct the maximum a posteriori (MAP) equalizer in the turbo equalizer. This MAP equalizer, when combined with prefiltering, can equalize a broad selection of sparse multipath channels, including those with nonminimum phase, by using only M-state trellises, where M is the constellation size. For multiple-input-multiple-output (MIMO) systems, a MIMO prefilter and a bank of M-state parallel-trellis MAP equalizers are deployed according to a layering structure. The total number of states needed is only N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> M, where N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> is the number of transmit antennae. For both SISO and MIMO systems, a class of binary convolutional and turbo codes having sparse generator polynomials are chosen as the coding schemes. These codes partially integrate channel interleaving with encoding, which allows a simple channel interleaver with low latency and memory storage requirement to be employed. The MAP decoders for these codes can also be implemented with the same parallel-trellis framework as the MAP equalizers. Overall, parallel processing is supported throughout the turbo equalizers. The amount of computational time reduction when compared to a turbo equalizer using a single-trellis MAP equalizer and decoder is proportional to the number of trellises in the parallel-trellis MAP equalizer and decoder. The performance of the parallel-trellis turbo equalizers is evaluated on static and Rayleigh fading sparse multipath channels via Monte Carlo simulations
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.