The effect of LLR clipping to the complexity of list sphere detector algorithms

Simple item page
dc.citation.conferenceDate2007en_US
dc.citation.conferenceName41st Asilomar Conference on Signals, Systems and Computersen_US
dc.citation.firstpage1159en_US
dc.citation.lastpage1563en_US
dc.citation.locationPacific Grove, CAen_US
dc.contributor.authorMyllylä, Markusen_US
dc.contributor.authorAntikainen, Juhoen_US
dc.contributor.authorJuntti, Markkuen_US
dc.contributor.authorCavallaro, Joseph R.en_US
dc.contributor.orgCenter for Multimedia Communicationen_US
dc.date.accessioned2012-06-12T20:51:18Zen_US
dc.date.available2012-06-12T20:51:18Zen_US
dc.date.issued2007-11-01en_US
dc.description.abstractThe optimal detection for coded system requires the use of a maximum a posteriori (MAP) detection. A list sphere detector (LSD) can be used to approximate the MAP detector. Depending on the used list size, LSD provides a tradeoff between the performance and the computational complexity. The LSD output candidate list is used to calculate the approximation of the probability log-likelihood ratio (LLR) of each transmitted bit. The list should be large enough and it should include at least one candidate for both possible bits for good approximation. The use of a small list size causes inaccurate and, especially, very large LLRs that prevent the decoder from correcting the falsely detected signals and, thus, degrades performance. We study the effect of the LLR clipping to the performance and complexity of the LSD algorithm. We show that by limiting the dynamic range of the LLR the required LSD list size can be decreased, and, thus, the complexity of the algorithms is decreased. The optimal dynamic range values for LLR clipping are determined and the effect of the clipping to the complexity of the LSD algorithms is analyzed.en_US
dc.description.sponsorshipElekrobiten_US
dc.description.sponsorshipNokia TPen_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ä, J. Antikainen, M. Juntti and J. R. Cavallaro, "The effect of LLR clipping to the complexity of list sphere detector algorithms," 2007.en_US
dc.identifier.doihttp://dx.doi.org/10.1109/ACSSC.2007.4487492en_US
dc.identifier.otherhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4487492en_US
dc.identifier.urihttps://hdl.handle.net/1911/64249en_US
dc.language.isoengen_US
dc.publisherIEEEen_US
dc.subjectDetection algorithmsen_US
dc.subjectLog-likelihood ratio (LLR)en_US
dc.subjectList sphere detector (LSD) algorithmsen_US
dc.titleThe effect of LLR clipping to the complexity of list sphere detector algorithmsen_US
dc.typeConference paperen_US
dc.type.dcmiTexten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2007_Asilomar_Markus.pdf
Size:
2.71 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