A New Class of TAST Codes With A Simplified Tree Structure

Details A New Class of TAST Codes With A Simplified Tree Structure A New Class of TAST Codes With A Simplified Tree Structure

2010-01-19

arxiv.org/abs/1001.3206v2

Computer Science

Information Theory

7 pages, 3 figures, Conference Paper, accepted in WCC'09 (Workshop for Coding and Cryptography 2009)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A New Class of TAST Codes With A Simplified Tree Structure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Class of TAST Codes With A Simplified Tree Structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Class of TAST Codes With A Simplified Tree Structure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-634206