A Single Symbol Maximum-Likehood Decoder for Four Transimit Antenna QOSTBC

2013 ◽  
Vol 427-429 ◽  
pp. 1502-1505
Author(s):  
Nai Qian Zhang ◽  
Li Biao Jin ◽  
Guo Cheng Wu ◽  
Jie Cong Lin
Keyword(s):  
Block Code ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Modulation Scheme ◽  
Time Block ◽  
Orthogonal Space ◽  
Symbol Detection ◽  
Single Complex ◽  
High Level ◽  
Ml Detection

This letter proposes a very low-complexity maximum likelihood (ML) detection algorithm for the quasi-orthogonal space-time block code (QOSTBC) with four transmits antennas. The low-complexity single-complex-symbol detection is based on QR decomposition and the expansion of equalization via a diagonal matrix transformation. The proposed strategy enables the QOSTBC to achieve ML performance with significant reduction in computational load for any high-level modulation scheme.

An Improved Low Complexity Detection Algorithm for Quasi-Orthogonal STBC

2012 ◽  
Vol 195-196 ◽  
pp. 175-180
Author(s):  
Zhong Er Nie ◽  
An Guo Wang ◽  
Ning Ma
Keyword(s):  
Block Code ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Error Rates ◽  
Time Block ◽  
Orthogonal Space ◽  
Single Complex ◽  
Linear Receivers ◽  
Ber Performance ◽  
Better Than

In this paper, based on QR decomposition, an improved detection algorithm for quasi-orthogonal space-time block code (QOSTBC) using square QAM constellation is presented. In the proposed method, by executing single complex symbol twi-detection for each block and selecting the optimal result, the BER performance is much better than that of the linear receivers. Compared with conventional maximum-likelihood (ML) decoding, though the bit error rates (BER) performance is with a slight loss, the improved detection algorithm reduces the decoding complexity significantly. The derivation and simulation results of the proposed algorithm are presented.

A Novel QO-STBC Scheme with Linear and Single-Symbol Decoding

2013 ◽  
Vol 373-375 ◽  
pp. 698-703
Author(s):  
Li Biao Jin ◽  
Jun Guo ◽  
Jian Zhang
Keyword(s):  
Maximum Likelihood ◽  
Transmission Rate ◽  
Design Procedure ◽  
Maximum Likelihood Decoding ◽  
Time Block ◽  
Decoding Complexity ◽  
Block Coding ◽  
Orthogonal Space ◽  
Symbol Detection ◽  
Single Complex

In this paper, a quasi-orthogonal space time block coding (QO-STBC) scheme with maximum likelihood (ML) decoding via simple linear and single-complex-symbol detection is proposed. We present a fast and simple linear decode processing by embedding a transformed signal space. The method benefits from the reduced maximum likelihood decoding complexity via the pre-interleaving to QO-STBC. We also proposed codes with 3/4 of the full transmission rate for the specific cases of 8 transmit antennas. Finally, the numerical results show the proficiency of our design procedure, demonstrating that significant improvements in BER are achievable when the rate or receive antennas increases.

Low-Complexity Soft-ML Detection Algorithm for Modified-DCM in WiMedia UWB Systems

2013 ◽  
Vol E96.B (3) ◽  
pp. 910-913 ◽  
Author(s):  
Kilhwan KIM ◽  
Jangyong PARK ◽  
Jihun KOO ◽  
Yongsuk KIM ◽  
Jaeseok KIM
Keyword(s):  
Low Complexity ◽  
Detection Algorithm ◽  
Ml Detection

An FPGA Implementation of TCM Cascade Space Time Block Code

2012 ◽  
Vol 195-196 ◽  
pp. 901-903
Author(s):  
Jun Wu ◽  
Xiao Bo Wu
Keyword(s):  
Block Code ◽  
Space Time ◽  
Coded Modulation ◽  
Diversity Gain ◽  
Modulation Scheme ◽  
Time Block ◽  
Coding Gain ◽  
Space Time Block Code ◽  
Concatenated Code ◽  
Trellis Coded

Trellis coded (TCM) modulation can obtain the coding gain without increase the transmission power and the bandwidth but it can not obtain diversity gain, and space-time block code (STBC) can provide diversity gain in a simple encoding and decoding way, though its coding gain is not very satisfied. This article will achieve a STBC-class networking trellis coded modulation scheme based on FPGA to further study the performance of the concatenated code.

Sign in / Sign up

Export Citation Format

Share Document