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

Groups > comp.programming > #3263 > unrolled thread

IHCA compression algorithm

Back to article view | Back to comp.programming

Contents

  IHCA compression algorithm aminer <aminer@toto.net> - 2013-04-21 13:09 -0700

#3263 — IHCA compression algorithm

Hello,

I have just downloaded the IHCA compression
algorithm from this website:

http://objectegypt.com/

And i have wrote a Parallel IHCA and begin
testing it against my Parallel LZO and my Parallel LZ4 , they say on the 
IHCA website that it  has the same performance as the LZO algorithm , 
but i have noticed on my benchmarks
that Parallel IHCA(that i wrote) is much more slower than my Parallel 
LZO and my Parallel LZ4 , so i think the ICHCA is a poor quality 
software that you must avoid, so please use my Parallel archiver and 
Parallel compression library cause with my Parallel LZO and my Parallel 
LZ4 they are now one of the fastest in the world.

I have also used solid compression like with the  tar.lzma format and i 
have found that my Parallel archiver, with maximum level compression 
that is clLZMAMax, compresses to the same size as 7Zip with maximum 
level compression and with a dictionary size of 8 MB and it compresses 
13% better than WinRar with maximum level compression and it is muh 
better than WinZip on compression ratio .

How to use solid compression with my Parallel archiver ?

Just archive your files with clLZMANone and  after that compress your 
archive with clLZMAMax, Parallel archiver will then compress to the same 
size as 7Zip with maximum level compression and with a dictionary size 
of 8 MB and it will compress 13% better than WinRar with maximum level 
compression and it will compress muh better than WinZip with maximum 
level compression .

You can download my Parallel archiver and
my Parallel compression library  that are very stable now
from:

http://pages.videotron.com/aminer/


Thank you,
Amine Moulay Ramdane.

[toc] | [standalone]

Back to top | Article view | comp.programming

csiph-web