Sciweavers

Share
CORR
2004
Springer

Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder

12 years 1 months ago
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR decomposition 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 decomposition with sort decreases the complexity of search part of the decoder with small increase in the complexity required for preprocess 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.
Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uy
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CORR
Authors Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uyematsu
Comments (0)
books