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

Simple item page
dc.creatorFukatani, Takayuki
dc.creatorMatsumoto, Ryutaroh
dc.creatorUyematsu, Tomohoko
dc.date2004-10-18
dc.date.accessioned2026-07-07T08:17:43Z
dc.date.available2026-07-07T08:17:43Z
dc.descriptionWe 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.
dc.description6 pages, 6 figures, using a LaTeX style file ieice.cls
dc.identifierhttps://arxiv.org/abs/cs/0410040
dc.identifierhttp://arxiv.org/abs/cs/0410040
dc.identifierIEICE Trans. Fundamentals, vol. E87-A, no. 10, pp. 2571-2576, Oct. 2004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134187
dc.subjectInformation Theory
dc.titleTwo Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
dc.typetext

Files

Collections

arXiv