A Quasi-Random Approach to Space-Time Codes

This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission rate and antenna numbers. We outline a turbo-type iterative decoding algorithm with complexity growing linearly with the transmit antenna number, and independently of the layer number. We develop simple techniques for fast performance assessment. Based on these techniques, efficient power allocation strategies are examined, which greatly enhance the system performance. Simulation results show that the proposed code can achieve near-capacity performance at low decoding complexity.

• Type: Journal
• Year: 2008
• Where: TIT
• Authors: Keying Y. Wu, Li Ping
• Keywords: Fast Performance Assessment, Iterative Decoding Algorithm, Low Decoding Complexity, TIT 2008