Further Improvement on Dynamic Programming forOptimal Bit Allocation

Dynamic programming algorithms based on Lagrange multiplier method is oftenused for obtaining an optimal bit allocation strategy to minimize the total distortion given a constrained rate budget in both source and channel coding applications. Due to possible large quantizer set and improper initialization, the algorithm often suers from heavy computational complexity. There have been many solutions in recent years to the above question. In this paper, a simple but efficiient algorithm is presented to further speed up the convergence of the algorithm. This algorithm can be easily realized and get the final solution much faster. The experimental result shows that our new algorithm can figure out the optimal solution with a speed 5-7 timesfaster than the original algorithm.