Hardware Accelerator for Vector Quantization by Using Pruned Look-Up Table

Vector quantization (VQ) is an elementary technique for image compression. However, searching for the nearest codeword in a codebook is time-consuming. The existing schemes focus on softwarebased implementation to reduce the computation. However, such schemes also incur extra computation and limit the improvement. In this paper, we propose a hardware-based scheme “Pruned Look-Up Table” (PLUT) which could prune possible codewords. The scheme is based on the observation that the minimum one-dimensional distance between the tested vector and its matched codeword is usually small. The observation inspires us to select likely codewords by the one-dimensional distance, which is represented by bitmaps. With the bitmaps containing the positional information to represent the geometric relation within codewords, the hardware implementation can succinctly reduce the required computation of VQ. Simulation results demonstrate that the proposed scheme can eliminate more than 75% computation with...

• Type: Conference
• Year: 2005
• Where: ICCSA
• Authors: Pi-Chung Wang, Chun-Liang Lee, Hung-Yi Chang, Tung-Shou Chen
• Keywords: Applied Computing, Codewords, ICCSA 2005, Minimum One-dimensional Distance, One-dimensional Distance