Work

Space-time codes with controllable ML decoding complexity for any number of transmit antennas

Year: 2007

Type: conference-paper

Abstract: We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for M transmit antennas can be varied from ML decoding of 2lceillog2Mrceil-1symbols together to single symbol ML decoding. For ML decoding of 2lceillog2Mrceil-n(n = 1,2,hellip) symbols together, a diversity of min(M, 2lceillog2Mrceil-n+1) can be achieved. Numerical results show that the performance of the constructed code when 2lceillog2Mrceil-1symbols are decoded together is quite close to the performance of ideal rate-1 orthogonal codes (that are non-existent for more than 2 transmit antennas).

Source: IEEE International Symposium on Information Theory (ISIT)

DOI: 10.1109/isit.2007.4557660

Authors: Naresh Sharma, Pavan R. Pinnamraju, Constantinos B. Papadias

Institutions: Tata Institute of Fundamental Research, Indian Institute of Technology Delhi, Athens Information Technology

Language: English

Topic: Advanced Wireless Communication Techniques

Subfield: Electrical and Electronic Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2049846289

FWCI: 0.503

Cites: 14

Cited by: 1

Related to: