Optimal space-time coding under iterative processing

In this paper, we deal with the design of a full-rate space-time block coding (STBC) scheme optimized for linear iterative decoding over fast fading multiple-input multiple-output (MIMO) channel. A general and simple coding scheme called diagonal threaded space-time (DTST) code is presented for an a...

Full description

Saved in:
Bibliographic Details
Published in:Annales des télécommunications 2014-04, Vol.69 (3-4), p.229-238
Main Authors: Bouvet, Pierre-Jean, Hélard, Maryline
Format: Article
Language:English
Subjects:
Antennas
Applied sciences
Circuits
Coding, codes
Communications Engineering
Computer Communication Networks
Electronics
Engineering
Engineering Sciences
Exact sciences and technology
Information and Communication
Information Systems and Communication Service
Information, signal and communications theory
Multiplexing
Networks
R & D/Technology Policy
Radiocommunications
Signal and communications theory
Signal,Image and Speech Processing
Telecommunications
Telecommunications and information theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we deal with the design of a full-rate space-time block coding (STBC) scheme optimized for linear iterative decoding over fast fading multiple-input multiple-output (MIMO) channel. A general and simple coding scheme called diagonal threaded space-time (DTST) code is presented for an arbitrary number of transmit and receive antennas. Theoretical analysis shows that DTST code associated with linear iterative decoding tends towards full diversity performance while providing maximum MIMO multiplexing gain. Simulation results confirm the ability of DTST to outperform the state-of-the-art STBC and conventional spatial data multiplexing schemes under iterative processing.
ISSN:0003-4347
1958-9395
DOI:10.1007/s12243-013-0353-z