• DocumentCode
    3411279
  • Title

    A new fast approximate arithmetic coder

  • Author

    Barbir, Abbie

  • Author_Institution
    Gandalf Canada Ltd., South Nepean, Ont., Canada
  • fYear
    1996
  • fDate
    31 Mar-2 Apr 1996
  • Firstpage
    482
  • Lastpage
    486
  • Abstract
    The results of a research project conducted at Gandalf, a leader in real time data networking products, to develop a fast arithmetic coder are presented. The speed improvement comes from the development of a hybrid model that generates normalized frequency distributions of the sequence of input symbols. This approach enables the implementation of an arithmetic coder with a reduced number of divide instructions. The new coder obtains significantly improved throughput with minimal loss in compression efficiency. Simulation results showed a doubling in computational speed over standard implementations of the algorithm with minimal reduction in efficiency. The algorithm achieves up to 50% more compression efficiency than the commercially available Stacker LZS compressor
  • Keywords
    arithmetic codes; computational complexity; data compression; Gandalf; compression efficiency; computational speed; fast approximate arithmetic coder; hybrid model; normalized frequency distributions; real time data networking products; Arithmetic; Computational complexity; Computer networks; Costs; Data compression; Electronic mail; Entropy; Frequency; Hybrid power systems; Telecommunication traffic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System Theory, 1996., Proceedings of the Twenty-Eighth Southeastern Symposium on
  • Conference_Location
    Baton Rouge, LA
  • ISSN
    0094-2898
  • Print_ISBN
    0-8186-7352-4
  • Type

    conf

  • DOI
    10.1109/SSST.1996.493552
  • Filename
    493552