Variable Length Coding for Fixed Rate, Low Latency, Low Complexity Compression Applications

In order to maximize coding efficiency the coding algorithm must ensure the probability of encoding a sequence of n quantized symbols at a rate smaller than R is maximized (i.e. there is no need to increase the quantization step size). This optimization problem is different from the one solved by algorithms like Huffman coding in which it is assumed that a large sequence of symbols are being coded. We proposed a new coding algorithm that solves the above optimization problem.