| Summary: | 碩士 === 國立臺北科技大學 === 電機工程系所 === 94 === VQ is a popular and efficient technology for signal processing and data compression. However, the computation requirement on the full-search algorithm is dramatically large. To overcome this issue, many approaches such as TIE, PDE,and Tree-structured … are employed to reduce the computation.
Binary search is a powerful algorithm. It will reduce the search space dramatically. However, the binary search can be worked on the one-dimension space only. The space dimension of VQ is very large for the goal on data compression. In the past, the tree-structure VQ was proposed to eliminate the search space. In this approach, the search space is really down. However, the quality and correction-rate is also down.
In this thesis, the new algorithm for binary search on VQ application is proposed. In this approach, the search space is really down. Moreover, the quality is also kept. With comparison to the traditional VQ, the average correction-rate is 99.6% and the 57% of search space is reduced. These performances is superior than tree-structured VQ.
|
|---|
