Answers are grounded in this paper and cite their sources.
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 NTM, where NTis 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
No takes yet. Share an insight, caveat, or question.
Lee et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: