Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm

Sang Ho Choi, Young-Chai Ko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a sub-optimum multiple input-multiple output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation. We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly comparing to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

Original languageEnglish
Title of host publicationIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
DOIs
Publication statusPublished - 2007 Dec 1
Event18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'07 - Athens, Greece
Duration: 2007 Sep 32007 Sep 7

Other

Other18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'07
CountryGreece
CityAthens
Period07/9/307/9/7

Fingerprint

Viterbi algorithm
VLSI circuits
Maximum likelihood
Decoding
Decomposition
Degradation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Choi, S. H., & Ko, Y-C. (2007). Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm. In IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC [4394086] https://doi.org/10.1109/PIMRC.2007.4394086

Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm. / Choi, Sang Ho; Ko, Young-Chai.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. 2007. 4394086.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, SH & Ko, Y-C 2007, Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm. in IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC., 4394086, 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'07, Athens, Greece, 07/9/3. https://doi.org/10.1109/PIMRC.2007.4394086
Choi SH, Ko Y-C. Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm. In IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. 2007. 4394086 https://doi.org/10.1109/PIMRC.2007.4394086
Choi, Sang Ho ; Ko, Young-Chai. / Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm. IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. 2007.
@inproceedings{2504937129a8431496b8e15d762f235d,
title = "Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm",
abstract = "The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a sub-optimum multiple input-multiple output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation. We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly comparing to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.",
author = "Choi, {Sang Ho} and Young-Chai Ko",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/PIMRC.2007.4394086",
language = "English",
isbn = "1424411440",
booktitle = "IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC",

}

TY - GEN

T1 - Implementation-friendly QRM-MLD using trellis-structure based on viterbi algorithm

AU - Choi, Sang Ho

AU - Ko, Young-Chai

PY - 2007/12/1

Y1 - 2007/12/1

N2 - The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a sub-optimum multiple input-multiple output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation. We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly comparing to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

AB - The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a sub-optimum multiple input-multiple output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation. We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly comparing to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

UR - http://www.scopus.com/inward/record.url?scp=44349167749&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44349167749&partnerID=8YFLogxK

U2 - 10.1109/PIMRC.2007.4394086

DO - 10.1109/PIMRC.2007.4394086

M3 - Conference contribution

AN - SCOPUS:44349167749

SN - 1424411440

SN - 9781424411443

BT - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

ER -