Adaptive lossless coding scheme of lattice vector quantisation

In the process of quantisation, a lattice vector quantiser (LVQ) generates radius and index sequences. In lossless coding, the radius sequence is run-length coded and then Huffman or arithmetic coded, and the index sequence is represented by fixed binary bits. The author has improved the LVQ lossless coding by removing the redundant information between radius sequence and index sequence. An algorithm is developed that redistributes radius and index sequences. The algorithm adaptively shifts down large indices to smaller values and reduces the index bits. Hence, the proposed LVQ lossless coding method reduces the gap between actual coding bit rates and the optimal bit rate boundary. For a Laplacian source the proposed lossless coding scheme achieves more than 10% of bit reduction at bit rates higher than 0.7 bits/sample over the traditional lossless coding method