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

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

2004-10-18

arxiv.org/abs/cs/0410040v1

IEICE Trans. Fundamentals, vol. E87-A, no. 10, pp. 2571-2576, Oct. 2004

Computer Science

Information Theory

6 pages, 6 figures, using a LaTeX style file ieice.cls

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-398879