In this invention, we introduce a connection indexing algorithm for realizing the arithmetic coding in finite wordlength processors. By determining the number of encoded information bits according to a difference between the finite wordlength and a residual termination parameter defined by the maximum difference of the information bits of any two adjacent symbols in the ordered-probabilities symbols set, the information of the last symbol is split into the current and the subsequent finite length codewords. The two or three encoded symbols split into the current and the subsequent finite length codewords are decoded independently, and the indices thereof are added to form a decoded symbol having an index equal to a sum of the addition.

title = "Method and apparatus for finite-length arithmetic coding",

abstract = "In this invention, we introduce a connection indexing algorithm for realizing the arithmetic coding in finite wordlength processors. By determining the number of encoded information bits according to a difference between the finite wordlength and a residual termination parameter defined by the maximum difference of the information bits of any two adjacent symbols in the ordered-probabilities symbols set, the information of the last symbol is split into the current and the subsequent finite length codewords. The two or three encoded symbols split into the current and the subsequent finite length codewords are decoded independently, and the indices thereof are added to form a decoded symbol having an index equal to a sum of the addition.",

T1 - Method and apparatus for finite-length arithmetic coding

AU - Yang, Jar-Ferr

PY - 1800

Y1 - 1800

N2 - In this invention, we introduce a connection indexing algorithm for realizing the arithmetic coding in finite wordlength processors. By determining the number of encoded information bits according to a difference between the finite wordlength and a residual termination parameter defined by the maximum difference of the information bits of any two adjacent symbols in the ordered-probabilities symbols set, the information of the last symbol is split into the current and the subsequent finite length codewords. The two or three encoded symbols split into the current and the subsequent finite length codewords are decoded independently, and the indices thereof are added to form a decoded symbol having an index equal to a sum of the addition.

AB - In this invention, we introduce a connection indexing algorithm for realizing the arithmetic coding in finite wordlength processors. By determining the number of encoded information bits according to a difference between the finite wordlength and a residual termination parameter defined by the maximum difference of the information bits of any two adjacent symbols in the ordered-probabilities symbols set, the information of the last symbol is split into the current and the subsequent finite length codewords. The two or three encoded symbols split into the current and the subsequent finite length codewords are decoded independently, and the indices thereof are added to form a decoded symbol having an index equal to a sum of the addition.