We consider code design of threaded and natural space-time cdes [1, 2] and analyze their performance. We show by a cunterexample that, for these codes, even if the binary rank criterion is not satisfyed, they demonstrate full diversity performance in the region of interest when iterative decoding is used. Hence, the relevant parameter for efficient code design is not the rank diversity. We conjecture that this parameter is the block-diversity. We provide simulation results, and, in order to reinforce our conjecture, we analyze the behavior of the iterative interference cancellation decoder by using density evolution with the Gaussian approximation.
Analysis and design of natural and threaded space-time codes with iterative decoding
Asilomar 2002, 36th IEEE Annual Asilomar conference on signals, systems and computers - November 3-6, 2002, Pacific Grove, USA
Systèmes de Communication
© 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/1038