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

Simple item page
dc.citation.conferenceDate2008en_US
dc.citation.conferenceNameINTERNATIONAL SYMPOSIUM ON WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS (WPMC)en_US
dc.citation.locationLapland, Finlanden_US
dc.contributor.authorMyllylä, Markus
dc.contributor.authorJuntti, Markku
dc.contributor.authorCavallaro, Joseph R.
dc.contributor.orgCenter for Multimedia Communicationen_US
dc.date.accessioned2012-06-15T22:00:19Z
dc.date.available2012-06-15T22:00:19Z
dc.date.issued2008-09-01eng
dc.description.abstractA 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.en_US
dc.description.sponsorshipElekrobiten_US
dc.description.sponsorshipNokiaen_US
dc.description.sponsorshipNokia Siemens Networks (NSN)en_US
dc.description.sponsorshipTexas Instrumentsen_US
dc.description.sponsorshipFinnish Funding Agency for Technology and Innovationen_US
dc.description.sponsorshipTekesen_US
dc.identifier.citationM. Myllyl�, M. Juntti and J. R. Cavallaro, "The Effect of Preprocessing to the Complexity of List Sphere Detector Algorithms," 2008.
dc.identifier.urihttps://hdl.handle.net/1911/64280
dc.language.isoengen
dc.publisherWPMCen_US
dc.subjectList sphere detector (LSD)en_US
dc.subjectMIMOen_US
dc.subjectMAP detectoren_US
dc.subjectPreprocessing methodsen_US
dc.titleThe Effect of Preprocessing to the Complexity of List Sphere Detector Algorithmsen_US
dc.typeConference paperen_US
dc.type.dcmiTexten
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2008_WPMC_sphere_myllyla.pdf
Size:
1.16 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.61 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
ECE Publications
Rice Wireless