The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Este artigo apresenta uma arquitetura VLSI de alto rendimento para compactação e descompactação de dados LZFG. Para reduzir o custo de hardware e manter os sistemas de numeração do nó interior e do nó folha, modificamos a estrutura de dados original do LZFG. Comparado com a árvore LZFG original, o número de caracteres em nossa estrutura de dados LZFG modificada deve ser maior que um para estabelecer um novo nó interior abaixo do nó raiz
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Jin-Ming CHEN, Che-Ho WEI, "A High-Throughput VLSI Architecture for LZFG Data Compression" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 3, pp. 497-509, March 2002, doi: .
Abstract: This paper presents a high-throughput VLSI architecture for LZFG data compression and decompression. To reduce the hardware cost and maintain both of the interior node and the leaf node numbering systems, we modify the original LZFG data structure. Compared to the original LZFG tree, the number of characters in our modified LZFG data structure must be greater than one to establish one new interior node down the root node
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_3_497/_p
Copiar
@ARTICLE{e85-d_3_497,
author={Jin-Ming CHEN, Che-Ho WEI, },
journal={IEICE TRANSACTIONS on Information},
title={A High-Throughput VLSI Architecture for LZFG Data Compression},
year={2002},
volume={E85-D},
number={3},
pages={497-509},
abstract={This paper presents a high-throughput VLSI architecture for LZFG data compression and decompression. To reduce the hardware cost and maintain both of the interior node and the leaf node numbering systems, we modify the original LZFG data structure. Compared to the original LZFG tree, the number of characters in our modified LZFG data structure must be greater than one to establish one new interior node down the root node
keywords={},
doi={},
ISSN={},
month={March},}
Copiar
TY - JOUR
TI - A High-Throughput VLSI Architecture for LZFG Data Compression
T2 - IEICE TRANSACTIONS on Information
SP - 497
EP - 509
AU - Jin-Ming CHEN
AU - Che-Ho WEI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2002
AB - This paper presents a high-throughput VLSI architecture for LZFG data compression and decompression. To reduce the hardware cost and maintain both of the interior node and the leaf node numbering systems, we modify the original LZFG data structure. Compared to the original LZFG tree, the number of characters in our modified LZFG data structure must be greater than one to establish one new interior node down the root node
ER -