Breadth First Algorithms for App Detectors Over Mimo Channels
Loading...
Files
Date
Authors
Journal Title
Journal ISSN
Volume Title
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
For iterative decoding of multiple antenna systems concatenated with an outer error correcting code, it is important to use an a posteriori probability detector for the MIMO detection to achieve near capacity performance. To avoid full APP detection, we propose a reduced complexity detector based on breadth first algorithms. Although these algorithms are sub-optimal, we show that they can provide a good list of candidates for the APP calculation. Furthermore, by exploiting the a priori information delivered from the outer decoder, it is possible to decrease the MIMO detector complexity at each iteration. Using simulation results, we will compare the performance of the proposed detectors with the list sphere detector.
Description
2004 IEEE International Conference on Communications; Paris; France; 20 June 2004 through 24 June 2004
Keywords
Concatenated codes, Fading channels, MIMO detection, Reduced complexity algorithm, Soft decoding, MIMO detection, Soft decoding, Concatenated codes, Fading channels, Reduced complexity algorithm
Fields of Science
0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
Le Ruyet, D., Bertozzi, T., and Özbek, B. (2004). Breadth first algorithms for APP detectors over MIMO channels. IEEE International Conference on Communications, 2, 926-930. doi:10.1109/ICC.2004.1312637
WoS Q
Scopus Q

OpenCitations Citation Count
23
Volume
2
Issue
Start Page
926
End Page
930
PlumX Metrics
Citations
CrossRef : 23
Scopus : 28
Captures
Mendeley Readers : 5
SCOPUS™ Citations
28
checked on Apr 28, 2026
Web of Science™ Citations
20
checked on Apr 28, 2026
Page Views
920
checked on Apr 28, 2026
Downloads
543
checked on Apr 28, 2026
Google Scholar™


