Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
Summary :
We propose use of QR factorization with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antenna fading channel. QR factorization with sort decreases the complexity of searching part of the decoder with small increase in the complexity required for preprocessing part of the decoder. Dijkstra's algorithm decreases the complexity of searching part of the decoder with increase in the storage complexity. The computer simulation demonstrates that the complexity of the decoder is reduced by the proposed methods significantly.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.10 pp.2571-2576
- Publication Date
- 2004/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Communication Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takayuki FUKATANI, Ryutaroh MATSUMOTO, Tomohiko UYEMATSU, "Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 10, pp. 2571-2576, October 2004, doi: .
Abstract: We propose use of QR factorization with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antenna fading channel. QR factorization with sort decreases the complexity of searching part of the decoder with small increase in the complexity required for preprocessing part of the decoder. Dijkstra's algorithm decreases the complexity of searching part of the decoder with increase in the storage complexity. The computer simulation demonstrates that the complexity of the decoder is reduced by the proposed methods significantly.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_10_2571/_p
Copy
@ARTICLE{e87-a_10_2571,
author={Takayuki FUKATANI, Ryutaroh MATSUMOTO, Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder},
year={2004},
volume={E87-A},
number={10},
pages={2571-2576},
abstract={We propose use of QR factorization with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antenna fading channel. QR factorization with sort decreases the complexity of searching part of the decoder with small increase in the complexity required for preprocessing part of the decoder. Dijkstra's algorithm decreases the complexity of searching part of the decoder with increase in the storage complexity. The computer simulation demonstrates that the complexity of the decoder is reduced by the proposed methods significantly.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2571
EP - 2576
AU - Takayuki FUKATANI
AU - Ryutaroh MATSUMOTO
AU - Tomohiko UYEMATSU
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2004
AB - We propose use of QR factorization with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antenna fading channel. QR factorization with sort decreases the complexity of searching part of the decoder with small increase in the complexity required for preprocessing part of the decoder. Dijkstra's algorithm decreases the complexity of searching part of the decoder with increase in the storage complexity. The computer simulation demonstrates that the complexity of the decoder is reduced by the proposed methods significantly.
ER -
English
