A New Class of TAST Codes With A Simplified Tree Structure
Abstract
We consider in this paper the design of full diversity and high rate space-time codes with moderate decoding complexity for arbitrary number of transmit and receive antennas and arbitrary input alphabets. We focus our attention to codes from the threaded algebraic space-time (TAST) framework since the latter includes most known full diversity space-time codes. We propose a new construction of the component single-input single-output (SISO) encoders such that the equivalent code matrix has an upper triangular form. We accomplish this task by designing each SISO encoder to create an ISI-channel in each thread. This, in turn, greatly simplifies the QR-decomposition of the composite channel and code matrix, which is essential for optimal or near-optimal tree search algorithms, such as the sequential decoder.
Cite
@article{arxiv.1001.3206,
title = {A New Class of TAST Codes With A Simplified Tree Structure},
author = {Mohamed Oussama Damen and Hesham El Gamal and Ahmed A. Badr},
journal= {arXiv preprint arXiv:1001.3206},
year = {2010}
}
Comments
7 pages, 3 figures, Conference Paper, accepted in WCC'09 (Workshop for Coding and Cryptography 2009)