Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding

DOI10.1016/0306-4573(94)90008-6zbMath0818.94024OpenAlexW2049942966MaRDI QIDQ1345810

Gennady Feygin, P. Glenn Gulak, Paul Chow

Publication date: 24 August 1995

Published in: Information Processing and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0306-4573(94)90008-6

zbMATH Keywords

algorithmsarithmetic codingVLSI complexityexcess code length

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Arithmetic codes (94B40)

Related Items (1)

Adaptive arithmetic coding using fuzzy reasoning and grey prediction

This page was built for publication: Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding