A low-complexity correlation algorithm

Kuang Fu Cheng*, Sau-Gee Chen

*此作品的通信作者

    研究成果: Conference article同行評審

    2 引文 斯高帕斯(Scopus)

    摘要

    For the consideration of low power, and fast code acquisition, four new low-complexity correlation algorithms are proposed in this work. Among them, the one derived by combing the differential coding scheme and a fast filtering algorithm has the lowest complexity. The new algorithm reduces the direct N addition operations to 5N/16. As a result, close to 70% reduction is obtained. When compared with the fast correlation algorithm based on the differential coding scheme, which costs N/2 addition operations, close to 40% reduction is obtained. The new algorithm can be further combined with the sub-expression sharing techniques for a much significant complexity reduction. The proposed design is best suited for DSP realization.

    原文English
    頁(從 - 到)V301-V304
    期刊Proceedings - IEEE International Symposium on Circuits and Systems
    5
    DOIs
    出版狀態Published - 2003
    事件Proceedings of the 2003 IEEE International Symposium on Circuits and Systems - Bangkok, Thailand
    持續時間: 25 5月 200328 5月 2003

    指紋

    深入研究「A low-complexity correlation algorithm」主題。共同形成了獨特的指紋。

    引用此