Quasi-orthogonal STBC with minimum decoding complexity

In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a maximum-likelihood (ML) decoder for this MDC-QO-STBC, for any numb...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications Vol. 4; no. 5; pp. 2089 - 2094
Main Authors: YUEN, Chau, YONG LIANG GUAN, TJENG THIANG TJHUNG
Format: Journal Article
Language:English
Published: Piscataway, NJ IEEE 01.09.2005
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algebra
Antennas
Applied sciences
Block codes
Codes
Complexity
Decoding
Exact sciences and technology
Maximum likelihood decoding
Maximum likelihood detection
Minimum decoding complexity (MDC)
Modulation
Modulation coding
Optimization
Phase modulation
Phase shift keying
Power distribution
Quadrature amplitude modulation
quasi-orthogonal space-time block code (QO-STBC)
quasi-orthogonality constraints
Radiocommunications
Scalability
Studies
Symbols
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Transmitting antennas
Wireless communication
Performance evaluation
Block code
Space-time codes
Quadrature amplitude modulation
Scalability
Amplitude modulation
quasi- orthogonal space-time block code (QO-STBC)
Orthogonality
quasi-orthogonality constraints
Maximum likelihood decoding
Joint detection
Phase shift keying
M ary modulation
Transmitting antenna
Coding
Power distribution
Algorithm complexity
Minimum decoding complexity (MDC)
Rotation angle
ISSN:1536-1276, 1558-2248
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a maximum-likelihood (ML) decoder for this MDC-QO-STBC, for any number of transmit antennas, only requires the joint detection of two real symbols. Assuming the use of a square or rectangular quadratic-amplitude modulation (QAM) or multiple phase-shift keying (MPSK) modulation for this MDC-QO-STBC, we also obtain the optimum constellation rotation angle, in order to achieve full diversity and optimum coding gain. We show that the maximum achievable code rate of these MDC-QO-STBC is 1 for three and four antennas and 3/4 for five to eight antennas. We also show that the proposed MDC-QO-STBC has several desirable properties, such as a more even power distribution among antennas and better scalability in adjusting the number of transmit antennas, compared with the coordinate interleaved orthogonal design (CIOD) and asymmetric CIOD (ACIOD) codes. For the case of an odd number of transmit antennas, MDC-QO-STBC also has better decoding performance than CIOD.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2005.853890