Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
نویسندگان
چکیده
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. key words: MIMO fading channel, maximum likelihood detection, sphere decoder, lattice
منابع مشابه
Complexity analysis for ML-based sphere decoder achieving a vanishing performance-gap to brute force ML decoding
This work identifies the computational reserves required for the maximum likelihood (ML)-based sphere decoding solutions that achieve, in the high-rate and high-SNR limit, a vanishing gap to the error-performance of the optimal brute force ML decoder. These error performance and complexity guarantees hold for most multiple-input multiple-output scenarios, all reasonable fading statistics, all c...
متن کاملDiplomarbeit MIMO Receivers Using Soft Information
Multiple input multiple output (MIMO) wireless systems that use multiple transmit and receive antennas allow a gain in reliability (diversity gain) and capacity (multiplexing gain). Unfortunately, these advantages come at the cost of higher computational complexity, particularly when using soft detection (SD). SD features improved performance compared to hard detection and is a prerequisite for...
متن کاملTree-Based Adaptive Spatial Detection for Adaptive Modulated MIMO Systems "Best of R&D Track"
Adaptive Multiple-Input Multiple-Output (MIMO) systems achieve a much higher information rate than conventional fixed schemes due to their ability to adapt their configurations according to the wireless communications environment. However, current adaptive MIMO detection schemes exhibit either low performance (and hence low spectral efficiency) or huge computational complexity. In particular, w...
متن کاملSoft decision decoding of the orthogonal complex MIMO codes for three and four transmit antennas
Orthogonality is a much desired property for MIMO coding. It enables symbol-wise decoding, where the errors in other symbol estimates do not affect the result, thus providing an optimality that is worth pursuing. Another beneficial property is a low complexity soft decision decoder, which for orthogonal complex MIMO codes is known for two transmit (Tx) antennas i.e. for the Alamouti code. We pr...
متن کاملLow-complexity dominance-based Sphere Decoder for MIMO Systems
The sphere decoder (SD) is an attractive low-complexity alternative to maximum likelihood (ML) detection in a variety of communication systems. It is also employed in multiple-input multiple-output (MIMO) systems where the computational complexity of the optimum detector grows exponentially with the number of transmit antennas. We propose an enhanced version of the SD based on an additional cos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.IT/0410040 شماره
صفحات -
تاریخ انتشار 2004