Abstract
The max-log list demapper has been widely employed in the implementations of a coded multiple-input-multiple-output (MIMO) receiver, where only a candidate list of signal vectors is examined in the likelihood-ratio calculation to reduce complexity. Traditionally, the candidate list is generated in the original-lattice domain, which, unfortunately, results in severe degradation in the performance of the demapper if the channel is in ill-condition. In this paper, two new lattice-reduction-aided max-log list demappers are proposed, i.e., one for an iterative receiver and the other for a noniterative receiver. With similar complexity, the proposed demappers provide significant gains over existing demappers, particularly for the cases with a small list size and/or under a spatially correlated channel, due to the new algorithms for the generation of the candidate list. In addition, for the iterative receiver, the prior information coming out of the decoder is exploited to lower the complexity of the demapper.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call