Low complexity soft sphere decoding via optimal radius control

Jaeseok Lee*, Byonghyo Shim

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper, we present a low-complexity list sphere search algorithm for achieving near-optimal a posteriori (APP) detection in iterative detection and decoding (IDD). Motivated by the fact that the list sphere decoding searching fixed number of lattice points is inefficient in many scenarios, we design a criterion to search lattice points with non-vanishing likelihood and derive the optimal sphere radius satisfying this requirement. Through simulations on realistic IDD systems, we show that the proposed method provides considerable complexity savings while maintaining near-optimal performance.

    Original languageEnglish
    Title of host publication2010 IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications, PIMRC 2010
    Pages414-418
    Number of pages5
    DOIs
    Publication statusPublished - 2010
    Event2010 IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications, PIMRC 2010 - Istanbul, Turkey
    Duration: 2010 Sept 262010 Sept 30

    Publication series

    NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

    Other

    Other2010 IEEE 21st International Symposium on Personal Indoor and Mobile Radio Communications, PIMRC 2010
    Country/TerritoryTurkey
    CityIstanbul
    Period10/9/2610/9/30

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Fingerprint

    Dive into the research topics of 'Low complexity soft sphere decoding via optimal radius control'. Together they form a unique fingerprint.

    Cite this