Coded data generation or conversion – Digital code to digital code converters – To or from code based on probability
Patent
1989-06-19
1991-01-29
Shoop, Jr., William M.
Coded data generation or conversion
Digital code to digital code converters
To or from code based on probability
341 87, 341 95, 341 60, H03M 730
Patent
active
049890000
ABSTRACT:
An improved method of generating a compressed representation of a source data string, each symbol of which is taken from a finite set of m+1 symbols, a.sub.o to a.sub.m. The method is based on an arithmetic coding procedure wherein the source data string is recursively generated as successive subintervals within a predetermined interval. The width of each subinterval is theoretically equal to the width of the previous subinterval multiplied by the probability of the current symbol. The improvement derives from approximating the width of the previous subinterval so that the approximation can be achieved by a single SHIFT and ADD operation using a suitable shift register.
REFERENCES:
patent: 4122440 (1978-10-01), Langdon, Jr. et al.
patent: 4286256 (1981-08-01), Langdon, Jr. et al.
patent: 4467317 (1984-08-01), Langdon, Jr. et al.
patent: 4516246 (1985-05-01), Kenemuth
patent: 4652856 (1987-03-01), Mohiuddin et al.
patent: 4791403 (1988-12-01), Mitchell et al.
Chevion Dan S.
Karnin Ehud D.
Walach Eugeniusz
Shoop Jr. William M.
Williams H. L.
LandOfFree
Data string compression using arithmetic encoding with simplifie 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 string compression using arithmetic encoding with simplifie, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data string compression using arithmetic encoding with simplifie will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-816678