Algebraic constructions of optimal space-time trellis codes
Hsiao-feng Lu, P. Vijay Kumar
Abstract
Hsiao-feng Lu, P. Vijay Kumar
Abstract
We first show the criteria for designing binary space-time trellis codes that achieve the optimal rate-diversity tradeoff. Based on the criteria, two systematic constructions of binary space-time trellis codes for any number of transmit antennas and any desirable rate are provided. Finally, by extending our work on the unified construction of space-time codes, these newly constructed binary space-time trellis codes are generalized to a series of codes over a much larger signal constellation, for instance, PAM, QAM and PSK modulations.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We first show the criteria for designing binary space-time trellis codes that achieve the optimal rate-diversity tradeoff. Based on the criteria, two systematic constructions of binary space-time trellis codes for any number of transmit antennas and any desirable rate are provided. Finally, by extending our work on the unified construction of space-time codes, these newly constructed binary space-time trellis codes are generalized to a series of codes over a much larger signal constellation, for instance, PAM, QAM and PSK modulations.
Key concepts: Space–time trellis code, Trellis (graph), Block code, Binary number, Constellation, Algorithm, Computer science, Trellis modulation