Computer Science – Information Theory
Scientific paper
2010-09-17
Computer Science
Information Theory
accepted to conference
Scientific paper
Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS<=1. Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding (BICMB-CP), on the other hand, can achieve full diversity without the condition RcS<=1. However, the decoding complexity of BICMB-CP is much higher than BICMB. In this paper, a reduced complexity decoding technique, which is based on Sphere Decoding (SD), is proposed to reduce the complexity of Maximum Likelihood (ML) decoding for BICMB-CP. The decreased complexity decoding achieves several orders of magnitude reduction, in terms of the average number of real multiplications needed to acquire one precoded bit metric, not only with respect to conventional ML decoding, but also, with respect to conventional SD.
Ayanoglu Ender
Li Boyu
Park Hong Ju
No associations
LandOfFree
Reduced Complexity Decoding for Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reduced Complexity Decoding for Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced Complexity Decoding for Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-476494