Early-pruned K-best sphere decoding algorithm based on radius constraints

Yi Hsuan Wu, Yu Ting Liu, Hsiu Chi Chang, Yen Chin Liao, Hsie-Chia Chang

    研究成果: Conference contribution同行評審

    21 引文 斯高帕斯(Scopus)

    摘要

    A technique to prune the paths for K-best sphere decoding algorithm (SDA) based on radius constraint is presented. The proposed scheme preserves breadth-first searching nature, and the distinct radii for each decoding layer are theoretically derived from the system model with the noise statistics. In addition, based on the data range provided by the radius, a low complexity sorting strategy is proposed. The proposed method can apply to SDA with various path cost functions. Euclidean norm and sum of absolute difference are demonstrated in this paper. With SNR degradation less than 0.2dB, more than 47% and 90% computation complexity can be reduced in 16-QAM and 64-QAM 4 x 4 MIMO detection, respectively.

    原文English
    主出版物標題ICC 2008 - IEEE International Conference on Communications, Proceedings
    頁面4496-4500
    頁數5
    DOIs
    出版狀態Published - 12 9月 2008
    事件IEEE International Conference on Communications, ICC 2008 - Beijing, China
    持續時間: 19 5月 200823 5月 2008

    出版系列

    名字IEEE International Conference on Communications
    ISSN(列印)0536-1486

    Conference

    ConferenceIEEE International Conference on Communications, ICC 2008
    國家/地區China
    城市Beijing
    期間19/05/0823/05/08

    指紋

    深入研究「Early-pruned K-best sphere decoding algorithm based on radius constraints」主題。共同形成了獨特的指紋。

    引用此