Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compression > #2173

Re: Finite State Entropy

Show all headers | View raw

Am 17.12.2013 10:53, schrieb yann.collet.73@gmail.com:
> A new method to perform Entropy compression,
> featuring the speed of Huffman, and the accuracy of Arithmetic :
> 
> http://fastcompression.blogspot.fr/2013/12/finite-state-entropy-new-breed-of.html

Consider adding a concise abstract of what this article is about and how
your idea compares to well-established state-of-the-art. The only thing
to that effect I found so far was

  "In a nutshell, this coder provides the same level of
   performance as Arithmetic coder, but only requires additions,
   masks, and shifts."

But this is actually not unique to your implementation. There are
already more than one table-driven (multiplierless) arithmetic coders
out there that are already used in current standards like JBIG,
JPEG2000, and H264.

Cheers!
sg

Back to comp.compression | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Finite State Entropy yann.collet.73@gmail.com - 2013-12-17 01:53 -0800
  Re: Finite State Entropy sg <sgesemann@gmail.invalid> - 2013-12-22 15:38 +0100
    Re: Finite State Entropy Jarek Duda <dudaj@interia.pl> - 2013-12-22 14:18 -0800
    Re: Finite State Entropy earl_colby_pottinger@yahoo.com - 2013-12-22 14:22 -0800
      Re: Finite State Entropy Jarek Duda <dudaj@interia.pl> - 2013-12-22 14:29 -0800
        Re: Finite State Entropy earl_colby_pottinger@yahoo.com - 2013-12-23 07:12 -0800

csiph-web