Re: fast universal compression scheme and its implementation in VHDL
- From: "Matt Mahoney" <matmahoney@xxxxxxxxx>
- Date: 29 Aug 2005 07:38:18 -0700
Jens Mander wrote:
> - what would you think are the most promising algorithms for my purpose
> (i.e. when statistics and semantics of the input data are unknown), first of
> all I thought of delta encoding, sorted RLE, LZ, ....?
LZ77 is fast and easy to implement. You replace strings with pointers
to previous occurrences. The problem, like with most compression
algorithms is that it uses a lot of memory and there is no real
advantage over a software implementation.
-- Matt Mahoney
.
- References:
- fast universal compression scheme and its implementation in VHDL
- From: Jens Mander
- fast universal compression scheme and its implementation in VHDL
- Prev by Date: Re: fast universal compression scheme and its implementation in VHDL
- Next by Date: Any type of compressed file always corrupts on extraction
- Previous by thread: Re: fast universal compression scheme and its implementation in VHDL
- Next by thread: Any type of compressed file always corrupts on extraction
- Index(es):