Browse > Article
http://dx.doi.org/10.5392/JKCA.2010.10.12.070

Development on Improved of LZW Compression Algorithm by Mixed Text File for Embedded System  

Cho, Mi-Nam (동신대학교 정보통신공학과)
Ji, Yoo-Kang (동신대학교 정보통신공학과)
Publication Information
The Journal of the Korea Contents Association / v.10, no.12, 2010 , pp. 70-76 More about this Journal
Abstract
This paper Extended ELZW(EBCDIC Lempel Ziv Welch) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangeul, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1byte LZW algorithm as 5.22 percent and superior to 2byte LZW algorithm as 8.96 percent.
Keywords
LZW Algorithm; Packing; Sqeezing; Cruching; Squashing;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M. Pechura, “File Archival Techiques Using Data Compression,” Comm.ACM, Vol.25, No.9, pp.605-609, 1982(9).   DOI   ScienceOn
2 M. B. Lin, “A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionaries,” Journal of VLSI signal processing systems for signal, image, and video technology, Vol.26, No.3 pp.369-381, 2004.
3 김대영, 이성열, 이혜영, “모바일 시스템을 위한 연결 데이터 압축 알고리즘”, 컴퓨터그래픽스학회논문지, 제14권, 제1호, pp.27-33, 2008.
4 정진욱, “리얼 타임 환경에서 압축 코딩과 암호 코딩의 결합”, 한국정보과학회논문지, 제17권, 제6호, 1990.
5 한승조, “완성형 한글을 위한 압축 코딩과 암호화 방법”, 한국정보과학회논문지, 제20권, 제9호, 1993.
6 신광철, 한상용, “LZW 알고리즘의 초기 사전 확장을 통한 효과적인 Hyper-Text 문서 압축”, 한국정보과학회논문지, 제29권, 제1호, p.689, 2002.
7 H. K. Reghbati, “An Overview of Data Copression Techiques,” Computer, Vol.14, No.4, pp.71-76, 1981(4),
8 W. H. Lenug, “Inducing Codes Form Exaples,” DCC '91, Data Compression Conference, pp.267-276, 1991(4).