제안 방법

• In this paper, we consider two algorithms called the most and least greedy algorithms for the optimal bit allocation and study their dual relationship. In particular, we provide dual propositions for bit allocation based on the well-known optimal bit allocation formula.
• In this paper, we investigated the dual properties for the optimal bit allocation based on the well-known high-resolution formular for transform coding. We observed that when one more bits is available in addition to the given bit allocation, it must be allocated to the most greedy quantizer, namely, one that has the greatest distortion among the coefficient quantizers.