Low-Complexity Decoder Based on Conditional ML for QOSTBC

In this letter, we present a new decoder for quasi-orthogonal space-time block code (QOSTBC) based on conditional maximum-likelihood (ML) decoder. The proposed decoder results in the decoding complexity of O(L 1 ), where L is the constellation size. In addition, by decomposing the real and imaginary...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2018-08, Vol.22 (8), p.1548-1551
Main Authors: Nassaji, Ehsan, Almasi, Mojtaba Ahmadi, Fardad, Mohammad
Format: Article
Language:English
Subjects:
Bit error rate
Codes
Complexity
Complexity theory
conditional ML decoder
Constellations
Decoders
Decoding
Error detection
Estimation
Maximum likelihood decoding
multi-input multi-output system
Quadrature amplitude modulation
Quality of service
Quasi-orthogonal space-time code
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, we present a new decoder for quasi-orthogonal space-time block code (QOSTBC) based on conditional maximum-likelihood (ML) decoder. The proposed decoder results in the decoding complexity of O(L 1 ), where L is the constellation size. In addition, by decomposing the real and imaginary components of the received signals, we further reduce the complexity of the decoder. Unlike many of previous decoders proposed for QOSTBC, our decoder is compatible with any complex-valued constellation such as quadrature amplitude modulation. Furthermore, the advantage of the proposed decoder with respect to other decoders is analyzed in terms of preprocessing and detection complexity. The simulation results show the identical bit error rate performance of the proposed and conventional ML decoder.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2018.2828825