LZX (algorithm)


LZX (algorithm)

:"LZX is also the name of the programming language used in the OpenLaszlo platformLZX is the name of an LZ77 family compression algorithm. It is also the name of a file archiver with the same name. Both were invented by Jonathan Forbes and Tomi Poutanen.

Instances of use of the LZX algorithm

Amiga LZX

LZX was publicly released as an Amiga file archiver in 1995, while the authors were studying at the University of Waterloo in Canada. The software was shareware, which was common for compression software at the time. The registered version contained fixes and improvements not available in the evaluation version. In 1997, the authors gave away a free keyfile, which allowed anyone to use the registered version, as they had stopped work on the archiver and stopped accepting registrations.


=Microsoft Cabinet files=

In 1997, Forbes went to work for Microsoft, and Microsoft's cabinet archiver was enhanced to include the LZX compression method. Improvements included a variable search window size; Amiga LZX was fixed to 64 kibibytes, Microsoft LZX could range on powers of two between 32 and 2048 kilobytes. A special preprocessor was added to detect Intel 80x86 "CALL" instructions, converting their operands from relative addressing to absolute addressing, thus calls to the same location resulted in repeated strings that the compressor could match, improving compression of 80x86 binary code.

Microsoft Compressed HTML Help (CHM) files

When Microsoft introduced the replacement to their classic Help file format, they chose to compress all of the HTML data with the LZX algorithm. However, in order to improve random access speed, the compressor was altered to reset itself after every 64 kilobyte interval and re-align to a 16-bit boundary after every 32 kilobyte interval. Thus, the HTMLHelp software could immediately seek to the nearest 64 kilobyte interval and start decoding from there, rather than decoding from the beginning of the compressed datastream at all times.


=Microsoft EBook Reader (LIT) files=

Microsoft LIT files are simply an extension of the CHM file format, and thus also use LZX compression.

Windows Imaging Format (WIM) files

Windows Imaging Format, the installation/drive image file format of Windows Vista, uses LZX as one of the compression methods [http://www.apcstart.com/site/jbannan/2006/07/759/build-your-own-vista-install-dvd] .

Decompressing LZX files

The unlzx program can unpack Amiga LZX archives. The cabextract program can unpack Microsoft cabinet files using the LZX method. There are a multitude of cross-platform tools for decompiling or viewing CHM files, as stated in the CHM article. LIT files can be unpacked using the Convert LIT software.

ee also

*List of archive formats
*List of file archivers
*Comparison of file archivers

External links

* [http://xavprods.free.fr/lzx/ The LZX page, including many versions of the Amiga LZX archiver]
* [http://main.aminet.net/misc/unix/unlzx.c.gz unlzx source code]
* [http://www.cabextract.org.uk/ cabextract (includes source code)]
* [http://www.convertlit.com/ Convert LIT (includes source code)]


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • μ-law algorithm — Companding of μ law and A law algorithms The µ law algorithm (often u law, ulaw, or mu law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. Companding algorithms reduce the dynamic… …   Wikipedia

  • A-law algorithm — Graph of μ law A law algorithms An A law algorithm is a standard companding algorithm, used in European digital communications systems to optimize, i.e., modify, the dynamic range of an analog signal for digitizing. It is similar to the μ law… …   Wikipedia

  • List of file formats — This is an incomplete list, which may never be able to satisfy particular standards for completeness. You can help by expanding it with reliably sourced entries. See also: List of file formats (alphabetical) This is a list of file formats… …   Wikipedia

  • List of archive formats — This is a list of file formats used by archivers and compressors used to create archive files. Contents 1 Archiving only 2 Compression only 3 Archiving and compression 4 …   Wikipedia

  • Data compression — Source coding redirects here. For the term in computer programming, see Source code. In computer science and information theory, data compression, source coding or bit rate reduction is the process of encoding information using fewer bits than… …   Wikipedia

  • Lossless data compression — is a class of data compression algorithms that allows the exact original data to be reconstructed from the compressed data. The term lossless is in contrast to lossy data compression, which only allows an approximation of the original data to be… …   Wikipedia

  • Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… …   Wikipedia

  • Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… …   Wikipedia

  • Code-excited linear prediction — (CELP) is a speech coding algorithm originally proposed by M.R. Schroeder and B.S. Atal in 1985. At the time, it provided significantly better quality than existing low bit rate algorithms, such as residual excited linear prediction and linear… …   Wikipedia

  • Abraham Lempel — Infobox Scientist name = Abraham Lempel imagesize = 400 caption = Abraham Lempel in 2007 birth date = birth place = Lvov, Poland residence = flag|Israel work institution = Technion Israel Institute of Technology field = Information theory known… …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.