Efficient algorithm for channel-optimised vector quantisation

Abstract

An efficient method is presented for increasing the speed of the clustering process for channel-optimised vector quantisation (COVQ), in which the Hamming distances between the indices of codevectors are utilised. Simulation results demonstrate that with a small increase in pre-processing and memory costs, the training lime of the new algorithm has been reduced significantly while the encoding quality remains unchanged.