pith. sign in

arxiv: 1204.3997 · v1 · pith:HITC6Z6Ynew · submitted 2012-04-18 · 💻 cs.IT · math.IT

A New Low-Complexity Decodable Rate-5/4 STBC for Four Transmit Antennas with Nonvanishing Determinants

classification 💻 cs.IT math.IT
keywords complexitylow-complexitystbccodedecodablepropertyrate-5average
0
0 comments X
read the original abstract

The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a new low-complexity decodable rate-5/4 full-diversity 4 x 4 STBC. We provide an analytical proof that the proposed code has the Non-Vanishing-Determinant (NVD) property, a property that can be exploited through the use of adaptive modulation which changes the transmission rate according to the wireless channel quality. We compare the proposed code to the best existing low-complexity decodable rate-5/4 full-diversity 4 x 4 STBC in terms of performance over quasi-static Rayleigh fading channels, worst- case complexity, average complexity, and Peak-to-Average Power Ratio (PAPR). Our code is found to provide better performance, lower average decoding complexity, and lower PAPR at the expense of a slight increase in worst-case decoding complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.