A Quasi-Random Approach to Space-Time Codes

Konferenz: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
03.04.2006 - 07.04.2006 in Munich, Germany

Tagungsband: TURBO - CODING - 2006

Seiten: 6Sprache: EnglischTyp: PDF

Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt

Wu, Keying; Ping, Li (City University of Hong Kong, Hong Kong)
Yuan, Jinhong (University of New South Wales, Australia)

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.