Paper Info
Title
Full-Diversity Space-Time-Frequency Coding with Very Low Complexity for the ML Decoder
Abstract
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.
Year
DOI
Venue
2012
10.1109/LCOMM.2012.031212.112648
Communications Letters, IEEE
Keywords
Field
DocType
computational complexity,maximum likelihood decoding,radio receivers,space-time block codes,ML decoder,STFBC,block codes,computational complexity,full-diversity space-time-frequency coding,quasi-static channels,receiver,MIMO-OFDM,Wireless communication,fading channels,quasi-static channels,space-time-frequency coding
MIMO-OFDM,Transmitter,Computer science,Block code,Communication channel,Real-time computing,Coding (social sciences),Orthogonal frequency-division multiplexing,Computational complexity theory,Encoding (memory)
Journal
Volume
Issue
ISSN
16
5
1089-7798
Citations 
PageRank 
References 
6
0.48
3
Authors
2
Name
Order
Citations
PageRank
Mostafa Shahabinejad1405.62
Siamak Talebi26115.12