並列摘要
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.
參考文獻
Search Algorithm Using Principal Component Analysis,” Journal of Visual
Communication and Image Representation Volume 8, Issue 1, March 1997,
[2] C.-C. Chang andW.-C.Wu, “Fast Planar-Oriented Ripple Search Algorithm
[4] K.-A.-Y. Chun, D. J. Love, “Performance Analysis of Random Vector Quantization
etc.: Packings in Grassmannian Spaces,” Exper. Math., vol. 5, no. 2, pp.