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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 22; číslo 8; s. 1548 - 1551
Hlavní autoři: Nassaji, Ehsan, Almasi, Mojtaba Ahmadi, Fardad, Mohammad
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2018.2828825