deposit_your_work

Novel Sort-Free Detector with Modified Real-Valued Decomposition (M-RVD) Ordering in MIMO Systems

Files in this item

Files Size Format View
2008_GLOBECOM_Amiri.pdf 283.6Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Novel Sort-Free Detector with Modified Real-Valued Decomposition (M-RVD) Ordering in MIMO Systems
Author: Amiri, Kiarash; Dick, Chris; Rao, Raghu; Cavallaro, Joseph R.
Type: Conference Paper
Publisher: IEEE
Citation: K. Amiri, C. Dick, R. Rao and J. R. Cavallaro,"Novel Sort-Free Detector with Modified Real-Valued Decomposition (M-RVD) Ordering in MIMO Systems," in IEEE Global Communications Conference (GLOBECOM), 2008, pp. 1-5.
Abstract: K-best MIMO detection technique is the prominent method of simplifying the detection complexity in MIMO systems while maintaining BER performance comparable with the optimum maximum-likelihood (ML) detection technique. However, sorting the candidate nodes in the tree search of the conventional K-best detection can take a significant number of cycles which would reduce the achievable data rate of the detector. In order to reduce this delay, and keep high performance at the same time, we propose using a novel sort-free based MIMO detector which avoids the demanding sorting step. Moreover, this detector utilizes a novel modified real-valued decomposition (M-RVD) ordering that, when compared to the conventional real valued decomposition scheme, can improve the BER performance at no extra computational cost. We show that our proposed detector can outperform the conventional K-best detector with a smaller combination of computation and latency requirements.
Date Published: 2008-11-01

This item appears in the following Collection(s)

  • ECE Publications [1030 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • CMC Publications [275 items]
    Publications by Rice Faculty and graduate students in multimedia communications