2009Unpublished venueOpen access

A rate-3/2 full-diversity 4×4 space-time code with fast Maximum-Likelihood Decoding

Amr Ismail, Hikmet Sari, Jocelyn Fiorina, Mohamed Oussama Damen

Open full text 6 citations

Abstract

Recently, Space-Time Block Codes (STBCs) with fast Maximum-Likelihood Decoding (MLD) have gained a lot of interest from a practical perspective. B. Rajan et.al proposed a systematic approach to build such codes from the representations of the real Clifford algebras. In the Sari-Sezginer code, another approach was proposed to build fast MLD STBC's. Indeed, the authors used the conditional detection principle and numerical optimization in order to have a large coding gain (thus full diversity) while maintaining a reduced complexity level at the receiver. In this paper we are interested in extending the principle of conditional detection to the case of four transmit antennas. We propose here a full-diversity 4×4 STBC achieving a rate of 3/2 complex symbols per channel use. To the best knowledge of the authors, the highest rate for full transmit diversity 4×4 codes with the same complexity level was reported to be 5/4 complex symbols per channel use (such codes were found independently).

About this research paper

What this paper is about

Recently, Space-Time Block Codes (STBCs) with fast Maximum-Likelihood Decoding (MLD) have gained a lot of interest from a practical perspective. B. Rajan et.al proposed a systematic approach to build such codes from the representations of the real Clifford algebras. In the Sari-Sezginer code, another approach was proposed to build fast MLD STBC's. Indeed, the authors used the conditional detection principle and numerical optimization in order to have a large coding gain (thus full diversity) while maintaining a reduced complexity level at the receiver. In this paper we are interested in extending the principle of conditional detection to the case of four transmit antennas. We propose here a full-diversity 4×4 STBC achieving a rate of 3/2 complex symbols per channel use. To the best knowledge of the authors, the highest rate for full transmit diversity 4×4 codes with the same complexity level was reported to be 5/4 complex symbols per channel use (such codes were found independently).

Why it matters

OpenAlex reports 6 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

Recently, Space-Time Block Codes (STBCs) with fast Maximum-Likelihood Decoding (MLD) have gained a lot of interest from a practical perspective. B. Rajan et.al proposed a systematic approach to build such codes from the representations of the real Clifford algebras. In the Sari-Sezginer code, another approach was proposed to build fast MLD STBC's. Indeed, the authors used the conditional detection principle and numerical optimization in order to have a large coding gain (thus full diversity) while maintaining a reduced complexity level at the receiver. In this paper we are interested in extending the principle of conditional detection to the case of four transmit antennas. We propose here a full-diversity 4×4 STBC achieving a rate of 3/2 complex symbols per channel use. To the best knowledge of the authors, the highest rate for full transmit diversity 4×4 codes with the same complexity level was reported to be 5/4 complex symbols per channel use (such codes were found independently).

Key concepts: Space–time block code, Block code, Decoding methods, Transmit diversity, Coding gain, Computer science, Algorithm, Code (set theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
A rate-3/2 full-diversity 4×4 space-time code with fast Maximum-Likelihood Decoding — Research Paper | ScholarLens