deposit_your_work

COMPARISON OF TWO NOVEL LIST SPHERE DETECTOR ALGORITHMS FOR MIMO-OFDM SYSTEMS

Files in this item

Files Size Format View
2006_PIMRC_Markus.pdf 170.2Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: COMPARISON OF TWO NOVEL LIST SPHERE DETECTOR ALGORITHMS FOR MIMO-OFDM SYSTEMS
Author: Myllylä, Markus; Silvola, Pirkka; Juntti, Markku; Cavallaro, Joseph R.
Type: Conference Paper
Publisher: IEEE
Citation: M. Myllylä, P. Silvola, M. Juntti and J. R. Cavallaro,"COMPARISON OF TWO NOVEL LIST SPHERE DETECTOR ALGORITHMS FOR MIMO-OFDM SYSTEMS," in IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), 2006
Abstract: In this paper, the complexity and performance of two novel list sphere detector (LSD) algorithms are studied and evaluated in multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system. The LSDs are based on the K-best and the Schnorr-Euchner enumeration (SEE) algorithms. The required list sizes for LSD algorithms are determined for a 2×2 system with 4- quadrature amplitude modulation (QAM), 16-QAM, and 64-QAM. The complexity of the algorithms is compared by studying the number of visited nodes per received symbol vector by the algorithm in computer simulations. The SEE based LSD algorithm is found to be a less complex and a feasible choice for implementation compared to the K-best based LSD algorithm.
Date Published: 2006-09-01

This item appears in the following Collection(s)

  • ECE Publications [1043 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