Computer Science – Information Theory
Scientific paper
2011-10-05
Computer Science
Information Theory
IEEE Journal of Selected Topics in Signal Processing, Vol. 5, No. 8, December 2011
Scientific paper
Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant decoding complexity reduction without performance loss. We show that such complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate BOSTC (Block-Orthogonal STC) that further maximize the QRDM complexity reduction potential. Simulation results of bit error rate (BER) performance against decoding complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-complexity mode, and the code exhibits a desirable complexity saturation property.
Guan Yong Liang
Ren Tian Peng
Yuen Chau
Zhang Er Yang
No associations
LandOfFree
Block-Orthogonal Space-Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction 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 Block-Orthogonal Space-Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block-Orthogonal Space-Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-324656