ScholarLens Back to search
2007•Unpublished venueRequires access

A 2�2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding

Javier M. Paredes, Alex B. Gershman, M. Gharavi-Alkhansari

Open publisher page 63 citations

Abstract

A new 2timesx2 full-rate full-diversity space-time block code (STBC) is proposed that satisfies the non-vanishing determinant property and offers a reduced computational complexity as compared to the other existing full-rate codes. The performance of our new STBC is shown to be comparable to that of the best full-rate STBCs known so far. This performance is achieved at the decoding complexity which is substantially lower than that of the standard sphere decoder.

About this research paper

What this paper is about

A new 2timesx2 full-rate full-diversity space-time block code (STBC) is proposed that satisfies the non-vanishing determinant property and offers a reduced computational complexity as compared to the other existing full-rate codes. The performance of our new STBC is shown to be comparable to that of the best full-rate STBCs known so far. This performance is achieved at the decoding complexity which is substantially lower than that of the standard sphere decoder.

Why it matters

OpenAlex reports 63 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A new 2timesx2 full-rate full-diversity space-time block code (STBC) is proposed that satisfies the non-vanishing determinant property and offers a reduced computational complexity as compared to the other existing full-rate codes. The performance of our new STBC is shown to be comparable to that of the best full-rate STBCs known so far. This performance is achieved at the decoding complexity which is substantially lower than that of the standard sphere decoder.

Key concepts: Space–time block code, Decoding methods, Block code, Full Rate, Algorithm, Code (set theory), Computer science, Space time

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
A 2�2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding — Research Paper | ScholarLens