Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Adaptive Parallel and Iterative QRDM Algorithms for Spatial Multiplexing MIMO Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Mohaisen, M. ; Grad. Sch. of IT & T, Inha Univ., Incheon, South Korea ; KyungHi Chang ; Bontae Koo

QR-decomposition with M-algorithm (QRDM) achieves quasi-ML performance in multiple-input multiple output (MIMO) multiplexing systems. Nevertheless, QRDM performs avoidable computations because of its systematic search strategy and its unawareness of the channel and noise conditions. Another drawback is that QRDM has a sequential nature which limits the capabilities of pipelining. In this paper, we propose semi-ML adaptive parallel QRDM (APQRDM) and iterative QRDM (AIQRDM) algorithms based on set grouping. Using the set grouping, the tree-search stage of QRDM algorithm is divided into partial detection phases (PDP). Therefore, when the tree search stage of QRDM is divided into 4 PDPs, the APQRDM latency is one fourth of that of the QRDM, and the hardware requirements of AIQRDM is approximately one fourth of that of QRDM. Moreover, simulation results show that in 4 × 4 system and at Eb/No of 14 dB, APQRDM decreases the average computational complexity to approximately 43% of that of the conventional QRDM. Also, at Eb/No of 0 dB, AIQRDM reduces the computational complexity to about 54% and the average number of metric comparisons to approximately 10% of those required by the conventional QRDM and AQRDM.

Published in:

Vehicular Technology Conference Fall (VTC 2009-Fall), 2009 IEEE 70th

Date of Conference:

20-23 Sept. 2009