Asynchronous Space Time Block Codes: Low complexity decoding methods

Abstract

In previous works, delay tolerant codes were proposed with variable length ensuring a full transmit diversity for a certain interval of delay profiles. The code performances are enhanced when the code length is incremented; however, this causes an increasing complexity at the receiver which motivates our research for low complexity decoding methods. First, it is shown that optimal decoding methods cannot be used for large code lengths. Moreover, new decoding schemes with reasonable complexity and good performance are proposed for any code length and any tolerated delay.