2018
DOI: 10.1109/lcomm.2018.2828825
|View full text |Cite
|
Sign up to set email alerts
|

Low-Complexity Decoder Based on Conditional ML for QOSTBC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…The pairwise-ML method requires more computational complexity, as it has to perform joint ML decoding to recover two pairs of data signals separately, unlike OSTBC which only requires the linear ML method. Therefore, various methods have been proposed to simplify the pairwise-ML decoding scheme [17]- [20]. A linear ML decoding algorithm based on QR decomposition of the channel matrix was proposed in [17].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The pairwise-ML method requires more computational complexity, as it has to perform joint ML decoding to recover two pairs of data signals separately, unlike OSTBC which only requires the linear ML method. Therefore, various methods have been proposed to simplify the pairwise-ML decoding scheme [17]- [20]. A linear ML decoding algorithm based on QR decomposition of the channel matrix was proposed in [17].…”
Section: Introductionmentioning
confidence: 99%
“…A linear ML decoding algorithm based on QR decomposition of the channel matrix was proposed in [17]. In [20], a conditional maximum-likelihood (ML) based detection scheme was proposed to reduce the decoding complexity of the QOSTBC system. Most of the existing QOSTBC schemes that have been developed rely on the assumption that the channel remains quasi-static during the length of the code word symbol periods.…”
Section: Introductionmentioning
confidence: 99%