Design of forward adaptive hybrid quantiser with Golomb–Rice code for compression of Gaussian source

Gaussian source coding based on variance‐mismatched three‐level scalar quantisation using Q ‐function approximations

“…In that case, a lossless signal compression is realised. Some of the most exploited variable‐length coding algorithms are Huffman [3, 5, 6, 7], Lempel‐Ziv [3] and Golomb‐Rice coding [3, 8, 9]. It is important to note that, among the listed techniques, Huffman coding is the most suitable for utilisation in low‐level quantisation, as it is able to ensure compact codeword lengths [3, 4, 10].…”

“…When confronted to the entropy, which is the lower bound for bit rate (the first Shannon theorem), the coding efficiency is very close to unity. However, in high‐level scalar quantisation, the Golomb‐Rice code is more frequently used, since it can provide similar performance as Huffman code along with reduced complexity in the encoding/decoding process [8, 9].…”