Data compression and decompression scheme using a search tree in

Details Data compression and decompression scheme using a search tree in Data compression and decompression scheme using a search tree in

1996-05-08

1998-11-24

Hoff, Marc S.

Coded data generation or conversion

Digital code to digital code converters

Adaptive coding

341 50, H03M 730

Patent

active

058413766

ABSTRACT:
A dictionary has a plurality of entries each for storing a pointer that indicates the head of a character string of input data stored in a data memory. A longest-coincidence character string that coincides with a character string to be coded over a longest length (i.e., a longest-coincidence length) is searched for from among the character strings indicated by the respective pointers. The longest-coincidence length and an index of an entry storing a pointer indicating the head of the longest-coincidence character string are coded, and a resulting code is written to a code memory. An entry storing the pointer indicating the head of the coded character string is added to the dictionary, to update it.

REFERENCES:
patent: 4464650 (1984-08-01), Eastman et al.
patent: 4558302 (1985-12-01), Welch
patent: 4701745 (1987-10-01), Waterworth
patent: 4814746 (1989-03-01), Miller et al.
patent: 4876541 (1989-10-01), Storer
patent: 4906991 (1990-03-01), Fiala et al.
patent: 5003307 (1991-03-01), Whiting et al.
patent: 5016009 (1991-05-01), Whiting et al.
patent: 5049881 (1991-09-01), Gibson et al.
patent: 5115484 (1992-05-01), Johnson
patent: 5126739 (1992-06-01), Whiting et al.
patent: 5146221 (1992-09-01), Whiting et al.
patent: 5150119 (1992-09-01), Yoshida et al.
patent: 5239298 (1993-08-01), Wei
patent: 5254990 (1993-10-01), Yoshida et al.
patent: 5406281 (1995-04-01), Klayman
J. Ziv, et al., "A Universal Algorithm for Sequential Data Compression" IEEE Transations on Information Theory, vol. IT-23, No. 3, pp. 337-343, 1977.
J. Ziv, et al., "Compression of Individual Sequences via Variable-Rate Coding", vol. IT-24, No. 5, pp. 530-536, 1978.
T. C. Bell., et al., "Better OPM/L Text Compression", IEEE Transations on Communications, vol. COM-34, No. 12, pp. 1176-1182, 1986.

Affiliated with

Also associated with

Rating

Data compression and decompression scheme using a search tree in does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data compression and decompression scheme using a search tree in, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression and decompression scheme using a search tree in will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1707845