Full-Diversity Space-Time-Frequency Coding with Very Low Complexity for the ML Decoder

Recently proposed full-diversity space-time-frequency block codes (STFBCs) generally suffer from very high computational complexity at the receiver side. In this paper, we introduce a new class of full-diversity STFBCs for quasi-static (QS) channels which features a comparatively low complexity at t...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 16; no. 5; pp. 658 - 661
Main Authors Shahabinejad, M., Talebi, S.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.05.2012
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Recently proposed full-diversity space-time-frequency block codes (STFBCs) generally suffer from very high computational complexity at the receiver side. In this paper, we introduce a new class of full-diversity STFBCs for quasi-static (QS) channels which features a comparatively low complexity at the receiver. We also demonstrate that our proposed algorithms could offer maximum coding advantage if the transmitter knows partial channel side information. Simulation results also verify that our coding schemes outperform other recently published STFBCs that were considered.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2012.031212.112648