Probability quantiser for multiplication free binary arithmetic code

With a probability quantiser similar to the Lloyd-Max quantiser; the probability of a less probable symbol is approximated for a multiplication free binary arithmetic code. The authors compare the proposed method with several binary arithmetic codes in terms of the performance degradation caused by eliminating multiplications from the operations; the efficiency of the probability quantiser is then shown