By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mostafa Shahabinejad ; Department of Electrical Engineering, Shahid Bahonar University of Kerman, Kerman, Iran, and the Advanced Communications Research Institute, Sharif University, Tehran, Iran ; Siamak Talebi

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.

Published in:

IEEE Communications Letters  (Volume:16 ,  Issue: 5 )