A Novel PE-based Architecture for Lossless LZ Compression

Yong Surk LEE; Tae Young LEE; Kyu Tae PARK

A Novel PE-based Architecture for Lossless LZ Compression

Yong Surk LEE, Tae Young LEE, Kyu Tae PARK

Full Text Views

0

Cite this

Summary :

This paper proposes a novel VLSI architecture capable of processing the Lempel-Ziv-based data compression algorithm very fast. The architecture is composed of five main blocks, i.e., a PE-based Match Block, a Consecutive Hit Checker, a Pointer Generator, a Length Generator, and a Code Packer. Flexibility of the PE-based structure makes it possible to adapt to various buffer sizes without any loss of speed or additional control overhead. Since it is designed as a VLSI-oriented architecture, it has simple control logic circuitry. It processes exactly one character per clock cycle and the update of a dictionary buffer is automatically done, therefore it does not require additional accumulated shift operations to prepare for the dictionary buffer. The shift operations have been major problems commonly found in most other architectures. When implemented with the currently available 0.5µm CMOS technology, it is proven by critical path analysis that the architecture can achieve over 100 mega samples (characters) per second with a clock frequency of 100 MHz. This is fast enough for real time data compression for many applications.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.1 pp.233-237

Publication Date: 1997/01/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: VLSI Design Technology and CAD

Cite this

Copy

Yong Surk LEE, Tae Young LEE, Kyu Tae PARK, "A Novel PE-based Architecture for Lossless LZ Compression" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 1, pp. 233-237, January 1997, doi: .
Abstract: This paper proposes a novel VLSI architecture capable of processing the Lempel-Ziv-based data compression algorithm very fast. The architecture is composed of five main blocks, i.e., a PE-based Match Block, a Consecutive Hit Checker, a Pointer Generator, a Length Generator, and a Code Packer. Flexibility of the PE-based structure makes it possible to adapt to various buffer sizes without any loss of speed or additional control overhead. Since it is designed as a VLSI-oriented architecture, it has simple control logic circuitry. It processes exactly one character per clock cycle and the update of a dictionary buffer is automatically done, therefore it does not require additional accumulated shift operations to prepare for the dictionary buffer. The shift operations have been major problems commonly found in most other architectures. When implemented with the currently available 0.5µm CMOS technology, it is proven by critical path analysis that the architecture can achieve over 100 mega samples (characters) per second with a clock frequency of 100 MHz. This is fast enough for real time data compression for many applications.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_1_233/_p

Copy

@ARTICLE{e80-a_1_233,
author={Yong Surk LEE, Tae Young LEE, Kyu Tae PARK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Novel PE-based Architecture for Lossless LZ Compression},
year={1997},
volume={E80-A},
number={1},
pages={233-237},
abstract={This paper proposes a novel VLSI architecture capable of processing the Lempel-Ziv-based data compression algorithm very fast. The architecture is composed of five main blocks, i.e., a PE-based Match Block, a Consecutive Hit Checker, a Pointer Generator, a Length Generator, and a Code Packer. Flexibility of the PE-based structure makes it possible to adapt to various buffer sizes without any loss of speed or additional control overhead. Since it is designed as a VLSI-oriented architecture, it has simple control logic circuitry. It processes exactly one character per clock cycle and the update of a dictionary buffer is automatically done, therefore it does not require additional accumulated shift operations to prepare for the dictionary buffer. The shift operations have been major problems commonly found in most other architectures. When implemented with the currently available 0.5µm CMOS technology, it is proven by critical path analysis that the architecture can achieve over 100 mega samples (characters) per second with a clock frequency of 100 MHz. This is fast enough for real time data compression for many applications.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - A Novel PE-based Architecture for Lossless LZ Compression
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 233
EP - 237
AU - Yong Surk LEE
AU - Tae Young LEE
AU - Kyu Tae PARK
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1997
AB - This paper proposes a novel VLSI architecture capable of processing the Lempel-Ziv-based data compression algorithm very fast. The architecture is composed of five main blocks, i.e., a PE-based Match Block, a Consecutive Hit Checker, a Pointer Generator, a Length Generator, and a Code Packer. Flexibility of the PE-based structure makes it possible to adapt to various buffer sizes without any loss of speed or additional control overhead. Since it is designed as a VLSI-oriented architecture, it has simple control logic circuitry. It processes exactly one character per clock cycle and the update of a dictionary buffer is automatically done, therefore it does not require additional accumulated shift operations to prepare for the dictionary buffer. The shift operations have been major problems commonly found in most other architectures. When implemented with the currently available 0.5µm CMOS technology, it is proven by critical path analysis that the architecture can achieve over 100 mega samples (characters) per second with a clock frequency of 100 MHz. This is fast enough for real time data compression for many applications.
ER -