Computer Science – Information Theory
Scientific paper
2012-04-18
Computer Science
Information Theory
5 pages, 2 figures and 1 table; IEEE Global Telecommunications Conference (GLOBECOM 2011), 2011
Scientific paper
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.
Fiorina Jocelyn
Ismail Amr
Sari Hikmet
No associations
LandOfFree
A New Low-Complexity Decodable Rate-5/4 STBC for Four Transmit Antennas with Nonvanishing Determinants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A New Low-Complexity Decodable Rate-5/4 STBC for Four Transmit Antennas with Nonvanishing Determinants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Low-Complexity Decodable Rate-5/4 STBC for Four Transmit Antennas with Nonvanishing Determinants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-411149