• DocumentCode
    3146402
  • Title

    Probabilistic and Q-Coder algorithms for binary source adaptation

  • Author

    Langdon, Glen G., Jr.

  • Author_Institution
    Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA
  • fYear
    1991
  • fDate
    8-11 Apr 1991
  • Firstpage
    13
  • Lastpage
    22
  • Abstract
    Developments related to the Q-Coder approach to adaptive binary arithmetic coding are reported. A theorem is established and more probable symbol renorms per less probable symbol at the equilibrium point are plotted for fixed and random augends. Details of Q-Coder evolution into the more easily implemented single-adaptor version are provided
  • Keywords
    data compression; encoding; probability; Q-Coder; adaptive binary arithmetic coding; augends; binary source adaptation; probabilistic algorithms; renorms; Arithmetic; Counting circuits; Monte Carlo methods; Probability distribution; Random number generation; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Compression Conference, 1991. DCC '91.
  • Conference_Location
    Snowbird, UT
  • Print_ISBN
    0-8186-9202-2
  • Type

    conf

  • DOI
    10.1109/DCC.1991.213369
  • Filename
    213369
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3146402