A Computationally Efficient Search Space for QRM-MLD Signal Detection

Hur, Hoon; Woo, Hyun-Myung; Yang, Wonyoung; Bahng, Seungjae; Park, Youn-Ok; Kim, Jaekwon

doi:10.1587/transcom.e92.b.1045

Cited by 1 publication

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2(b) and then, the M-algorithm is carried out for the pruned tree structure. In [12]- [16], methods to reduce the number of symbol candidates to be involved in the path metric computation were also proposed. However, the preliminary decision is performed successively in the M-algorithm and therefore the decision reliability in early stages is likely to be low because the elements of R closer to the right positions tend to drop with larger probability in single carrier transmission [19].…”

Section: -Step Qrm-mlbdmentioning

confidence: 99%

“…2, based on the preliminary decision using MMSE-FDE, prior to conducting the M-algorithm. Consequently, by using 2-step QRM-MLBD, more accurate decision can be done in early stages compared to methods in [12]- [16].…”

Section: -Step Qrm-mlbdmentioning

confidence: 99%

“…To reduce the computational complexity of QRM-MLBD, several methods to reduce the required value of M were proposed [9]- [11]. In addition, the methods to reduce the number of symbol candidate to be involved in the path metric computation were proposed [12]- [16] by performing preliminary decision successively in M-algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

2-Step QRM-MLBD for Broadband Single-Carrier Transmission

Temma

Yamamoto

Lee

et al. 2012

IEICE Trans. Commun.

View full text Add to dashboard Cite

Maximum likelihood block signal detection employing QR decomposition and M-algorithm (QRM-MLBD) can significantly improve the bit error rate (BER) performance of single-carrier (SC) transmission while significantly reducing the computational complexity compared to maximum likelihood detection (MLD). However, its computational complexity is still high. In this paper, we propose the computationally efficient 2-step QRM-MLBD. Compared to conventional QRM-MLBD, the number of symbol candidates can be reduced by using preliminary decision made by minimum mean square error based frequency-domain equalization (MMSE-FDE). The BER performance achievable by 2-step QRM-MLBD is evaluated by computer simulation. It is shown that it can significantly reduce the computational complexity while achieving almost the same BER performance as the conventional QRM-MLBD.

show abstract

Section: -Step Qrm-mlbdmentioning

confidence: 99%

Section: -Step Qrm-mlbdmentioning

confidence: 99%