Sphere decoding with a probabilistic tree pruning
- Authors
- Shim, Byonghyo; Kang, Insung
- Issue Date
- 10월-2008
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- lattice; maximum likelihood decoding; multiple-input-multiple-output (MIMO) system; probabilistic noise constraint; probabilistic tree pruning; sphere constraint; sphere decoding (SD)
- Citation
- IEEE TRANSACTIONS ON SIGNAL PROCESSING, v.56, no.10, pp.4867 - 4878
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON SIGNAL PROCESSING
- Volume
- 56
- Number
- 10
- Start Page
- 4867
- End Page
- 4878
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/122602
- DOI
- 10.1109/TSP.2008.923808
- ISSN
- 1053-587X
- Abstract
- In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a probabilistic noise constraint on top of the sphere constraint, a more stringent necessary condition is provided, particularly at an early stage, and, hence, branches unlikely to be survived are removed in the early stage of sphere search. The tradeoff between the performance and complexity is easily controlled by a single parameter, so-called pruning probability. Through the analysis and simulations, we show that the complexity reduction is significant while maintaining the negligible performance degradation.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Informatics > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.