Simple but effective fast codebook searching algorithms for vector quantisation are presented. The Euclidean distance (L-2 norm) calculation requires a number of multiplications. The proposed algorithms use the L-1 no...
详细信息
Simple but effective fast codebook searching algorithms for vector quantisation are presented. The Euclidean distance (L-2 norm) calculation requires a number of multiplications. The proposed algorithms use the L-1 norm between the input vector and codeword to discard many unlikely codewords. Since the proposed algorithms significantly reduce the number of multiplications, a considerable reduction in encoding time is achieved. Simulation results confirm the effectiveness of the proposed algorithms.
暂无评论