一種新型快速搜尋編碼簿演算法

Abstract

在這篇論文中，我捫提出了一種新型的演算法降低編碼簿搜尋的複雜度。在每次評估中，大約一半的編碼字會被視為不適合而被剔除。除此之外，論文中提出了兩種訊號雜訊比的下限，當編碼簿擁有大量的編碼字時，兩種下限計算出來的結果與實際數據相符。最後從複雜度分析以及模擬的圖表中，我們可以看見在大型的編碼簿時，使用此編碼簿的優勢。

In this thesis, we propose an algorithm to reduce the complexity to search the most suitable codeword for a given codebook. It is proven in the thesis that about half codewords are eliminated in each iteration. In addition, we derive two lower bounds for the proposed algorithm and show that they reach the actual SNR loss in high resolution codebook. Furthermore, the complexity analysis and simulations are given to see that the advantages of taking this algorithm are revealed in the scenario of large codebook size.