Return
Low-Complexity Decoder Based on Conditional ML for QOSTBC
DOI:10.1109/LCOMM.2018.2828825.png)
Abstract
En 中文
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 0(/) ), 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.
Keywords:
Quasi-orthogonal space-time code
conditional ML decoder
multi-input multi-output system
bit error rate
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
Amphomycin: effect of the lipopeptide antibiotic on the glycosylation and extraction of dolichyl monophosphate in calf brain membranes
Biochemistry
IF0
High Potency VEGFRs/MET/FMS Triple Blockade by TAS-115 Concomitantly Suppresses Tumor Progression and Bone Destruction in Tumor-Induced Bone Disease Model with Lung Carcinoma Cells
PLOS ONE
IF0

