The Effect of Preprocessing to the Complexity of List Sphere Detector Algorithms

Files in this item

Files Size Format View
2008_WPMC_sphere_myllyla.pdf 1.221Mb application/pdf Thumbnail

Show simple item record

Item Metadata Myllylä, Markus
Juntti, Markku
Cavallaro, Joseph R. 2012-06-15T22:00:19Z 2012-06-15T22:00:19Z 2008-09-01
dc.description.abstract A list sphere detector (LSD) is an enhancement of a sphere detector (SD) that can be used to approximate the soft output MAP detector used in the detection of the multiple-input multiple-output (MIMO) signals. The LSD algorithm executes a tree search on the given lattice and returns a candidate list. The LSD algorithm complexity, i.e., the number of visited nodes in the search tree, can be decreased by applying proper ordering of the transmitted spatial streams in the detection. In this paper, we study the effect of two sophisticated preprocessing methods, the channel matrix column ordering based on Euclidean norm and the sorted QR decomposition (SQRD), to the performance and complexity of the LSD algorithms and compare them to the traditional QR decomposition (QRD). We show that the SQRD preprocessing is a simple way to decrease complexity of the LSD and it decreases the number of visited nodes approximately 20 - 30% compared to the QRD which results in significant number of saved arithmetic operations in the LSD. We also show that the plain channel matrix column ordering is not feasible preprocessing method to be used with LSD in highly correlated channel realization.
dc.description.sponsorship Elekrobit
dc.description.sponsorship Nokia
dc.description.sponsorship Nokia Siemens Networks (NSN)
dc.description.sponsorship Texas Instruments
dc.description.sponsorship Finnish Funding Agency for Technology and Innovation
dc.description.sponsorship Tekes
dc.language.iso eng
dc.publisher WPMC
dc.subject List sphere detector (LSD)
MAP detector
Preprocessing methods
dc.title The Effect of Preprocessing to the Complexity of List Sphere Detector Algorithms
dc.type Conference paper Center for Multimedia Communication
dc.citation.location Lapland, Finland
dc.citation.conferenceDate 2008
dc.type.dcmi Text
dc.identifier.citation M. Myllylä, M. Juntti and J. R. Cavallaro, "The Effect of Preprocessing to the Complexity of List Sphere Detector Algorithms," 2008.

This item appears in the following Collection(s)

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