Coded data generation or conversion – Digital code to digital code converters – To or from code based on probability
Patent
1993-05-13
1995-05-23
Williams, Howard L.
Coded data generation or conversion
Digital code to digital code converters
To or from code based on probability
H03M 730
Patent
active
054185327
ABSTRACT:
Method and system are provided for efficient, multiplication-free arithmetic coding wherein data which represents an alphabet of source symbols is compressed and decompressed in a data transmission system. Multiplications are replaced with single shift-and-add operation using a suitable shift register wherein a multiplier has at most two bits. The shift-and-add operation approximates the width of a new subinterval within a predetermined interval. This approximation is a function of both the width of a current subinterval and a total count of source symbols in a statistical source model. In this way, an adaptive model can be accommodated as well as a fixed model for the statistics of the source symbols. In one embodiment, the multiplier is preferably determined by a table look-up having a small number of entries and which can be easily implemented by hardware or software.
REFERENCES:
patent: 4652856 (1987-03-01), Mohiuddin et al.
patent: 4989000 (1991-01-01), Chevion et al.
Bell Communications Research Inc.
Giordano Joseph
Suchyta Leonard Charles
Williams Howard L.
LandOfFree
Method and system for efficient, multiplication-free arithmetic does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for efficient, multiplication-free arithmetic , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for efficient, multiplication-free arithmetic will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2143027