Patent US1787341A successfully refreshed from Google Patents.
Patent US5748786A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5748786A Expired / Lapsed US ⏱️ 0.0 years remaining

Apparatus for compression using reversible embedded wavelets

Assignee: Ricoh Co Ltd
•
Filing: 1994-09-21
•
Granted: 1998-05-05
•
Expires: 2014-09-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for encoding and decoding data is described. The present invention includes a method and apparatus for generating transformed signals in response to input data. In one embodiment, the transformed signals are generated using a reversible wavelet transform. The present invention also includes a method and apparatus for compressing the transformed signals into data representing a losslessly compressed version of the input data. In one embodiment, the present invention decomposes the input data using a non-minimal length reversible filter. The decomposition may be performed using multiple one-dimension filters.

Inventors

  • 👤 Ahmad Zandi
  • 👤 James D. Allen
  • 👤 Edward L. Schwartz
  • 👤 Martin Boliek

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 12:14
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/148; H; H03; H03M; H03M7/00; H03M7/30; H04; H04N; H04N19/00; H04N19/10; H04N19/102; H04N19/12; H04N19/122; H04N19/129; H04N19/134; H04N19/146; H04N19/15; H04N19/156; H04N19/162; H04N19/167; H04N19/169; H04N19/186; H04N19/1883; H04N19/30; H04N19/36; H04N19/46; H04N19/50; H04N19/593; H04N19/60; H04N19/61; H04N19/63; H04N19/635; H04N19/64; H04N19/645; H04N19/647; H04N19/90; H04N19/98; H04N21/00; H04N21/60; H04N21/63; H04N21/637; H04N21/6377; H04N21/65; H04N21/658; H04N19/115; H04N19/13; H04N19/42

Claims Analysis

Total Claims: 31
Claim 1
Independent Claim 195 words
A coder for encoding a plurality of data symbols comprising: a wavelet transform; a formatting unit coupled to receive a plurality of coefficients from the wavelet transform and to format the plurality of coefficients into a set of formatted coefficients; a magnitude memory coupled to receive the set of formatted coefficients and configured to reorder coefficients in trees into an order based on significance, wherein the magnitude memory comprises a plurality of storage areas, wherein each of the plurality of storage areas stores data for a distinct significance level, a plurality of counters, wherein each of the plurality of counters is associated with one of the plurality of storage areas and counter values for each of the plurality of counters provide address locations in the plurality of storage areas for storage of the formatted coefficients and are incremented after storing an individual formatted coefficient; a significance unit coupled to the formatting unit to generate a plurality of decisions in response to each of the set of formatted coefficients; a memory mechanism coupled to receive the plurality of decisions from the significance unit; and a coder coupled to the memory mechanism and configured to encode data.
Claim 2
Dependent Claim 195 words
A coder for encoding a plurality of data symbols comprising: a wavelet transform; a formatting unit coupled to receive a plurality of coefficients from the wavelet transform and to format the plurality of coefficients into a set of formatted coefficients; a magnitude memory coupled to receive the set of formatted coefficients and configured to reorder coefficients in trees into an order based on significance, wherein the magnitude memory comprises a plurality of storage areas, wherein each of the plurality of storage areas stores data for a distinct significance level, a plurality of counters, wherein each of the plurality of counters is associated with one of the plurality of storage areas and counter values for each of the plurality of counters provide address locations in the plurality of storage areas for storage of the formatted coefficients and are incremented after storing an individual formatted coefficient; a significance unit coupled to the formatting unit to generate a plurality of decisions in response to each of the set of formatted coefficients; a memory mechanism coupled to receive the plurality of decisions from the significance unit; and a coder coupled to the memory mechanism and configured to encode data.
Claim 3
Dependent Claim 13 words
The coder defined in claim 1 wherein the coder comprises an entropy coder.
Claim 4
Dependent Claim 26 words
The coder defined in claim 1 wherein the formatting unit comprises a sign magnitude unit configured to convert the plurality of coefficients into sign magnitude format.
Claim 5
Dependent Claim 68 words
The coder defined in claim 3 wherein the sign magnitude unit comprises: a significance determination mechanism to output a significance indication for each coefficient; a sign and mantissa generator coupled to receive each of the plurality of coefficients and to generate a sign and mantissa for said each of the plurality of coefficients; and an index counter for generating an index for each of the plurality of coefficients.
Claim 6
Dependent Claim 15 words
The coder defined in claim 4 wherein the significance determination mechanism comprises a priority encoder.
Claim 7
Dependent Claim 38 words
The coder defined in claim 4 wherein the significance determination mechanism comprises a pair of priority encoders and a selection mechanism to select between outputs from each of the pair of priority encoders to output the significance indication.
Claim 8
Dependent Claim 25 words
The coder defined in claim 3 wherein the sign magnitude unit further comprises means for generating an index for each coefficient indicating a tree location.
Claim 9
Dependent Claim 15 words
The coder defined in claim 1 wherein the wavelet transform comprises a reversible wavelet transform.
Claim 10
Dependent Claim 24 words
The coder defined in claim 1 wherein each of the plurality of formatted coefficients is stored in the magnitude memory based on significance level.
Claim 11
Dependent Claim 16 words
The coder defined in claim 1 wherein the magnitude memory reorders coefficients based on their magnitude.
Claim 12
Dependent Claim 24 words
The coder defined in claim 1 wherein each of the plurality of storage areas comprises a location for each possible coefficient in a subtree.
Claim 13
Dependent Claim 21 words
The coder defined in claim 1 wherein coefficient information is read out of the magnitude memory in descending order of significance.
Claim 14
Dependent Claim 91 words
The coder defined in claim 12 wherein the coefficient information is output from the magnitude memory by, repeatedly, reading out coefficient information at an address indicated by the counter for the highest level of significance and decrementing the counter value until the counter value is zero and then repeating the output of coefficient information for the next highest level of significance, wherein the output of coefficient information continues until all of the plurality of counters have been decremented to zero and all of the plurality of storage areas have been emptied.
Claim 15
Dependent Claim 25 words
The coder defined in claim 1 wherein each counter addresses its individual storage area such that a last in, first out buffer (LIFO) is implemented.
Claim 16
Dependent Claim 25 words
The coder defined in claim 1 wherein each counter addresses its individual storage area such that a first in, first out buffer (FIFO) is implemented.
Claim 17
Dependent Claim 90 words
The coder defined in claim 1 wherein the plurality of counters comprise two banks of counters and the plurality of storage areas comprise two banks of storage areas, and further wherein the magnitude memory uses one of the two banks of counters and one of the two banks of storage areas to receive formatted coefficients from the formatting unit while the magnitude memory uses the other of the two banks of counters and the other of the two banks of storage areas to output formatted coefficients to the significance unit.
Claim 18
Dependent Claim 215 words
A coder for encoding a plurality of data symbols comprising: a wavelet transform; a sign/magnitude unit coupled to receive a plurality of coefficients from the wavelet transform and to format each of the plurality of coefficients into sign magnitude format; a magnitude memory coupled to the sign magnitude unit to reorder coefficients in sign magnitude format into an order based on significance, wherein the magnitude memory comprises a plurality of counters; and a plurality of memories coupled to the plurality of counters, such that each of the plurality of counters is coupled to a distinct one of the plurality of memories, wherein each counter and memory pair is associated with a significance level, such that one of the memories stores each coefficient formatted in sign/magnitude format at a location in said one memory based on an address specified by a count in its associated counter and the count is incremented after an individual formatted coefficient is stored at the location specified by the count; a significance unit coupled to generate a plurality of decisions in response to each of the plurality of coefficients being in sign magnitude format; a tree memory coupled to receive the plurality of decisions from the significance unit; and a coder coupled to the memory mechanism and configured to encode data.
Claim 19
Dependent Claim 215 words
A coder for encoding a plurality of data symbols comprising: a wavelet transform; a sign/magnitude unit coupled to receive a plurality of coefficients from the wavelet transform and to format each of the plurality of coefficients into sign magnitude format; a magnitude memory coupled to the sign magnitude unit to reorder coefficients in sign magnitude format into an order based on significance, wherein the magnitude memory comprises a plurality of counters; and a plurality of memories coupled to the plurality of counters, such that each of the plurality of counters is coupled to a distinct one of the plurality of memories, wherein each counter and memory pair is associated with a significance level, such that one of the memories stores each coefficient formatted in sign/magnitude format at a location in said one memory based on an address specified by a count in its associated counter and the count is incremented after an individual formatted coefficient is stored at the location specified by the count; a significance unit coupled to generate a plurality of decisions in response to each of the plurality of coefficients being in sign magnitude format; a tree memory coupled to receive the plurality of decisions from the significance unit; and a coder coupled to the memory mechanism and configured to encode data.
Claim 20
Dependent Claim 99 words
The coder defined in claim 17 wherein the sign/magnitude unit comprises: a multiplexer (MUX) having a first input, a second input, a selection input, and an output, wherein the first input is coupled to receive a portion of each coefficient and the second input is coupled to receive an inverted version of said each coefficient, and further wherein the selection input is coupled to receive a sign bit indication for said each coefficient, the output being the mantissa; and a priority encoder coupled to receive the mantissa from the MUX to determine the first significant bit of each coefficient.
Claim 21
Dependent Claim 26 words
The coder defined in claim 18 wherein the sign/magnitude unit further comprises a counter to associate an index for each coefficient with a current tree element.
Claim 22
Dependent Claim 24 words
The coder defined in claim 17 wherein each of the plurality of storage areas comprises a location for each possible coefficient in a subtree.
Claim 23
Dependent Claim 28 words
The coder defined in claim 17 wherein each memory location is configured to store a mantissa, a sign bit indication and an index received from the sign/magnitude unit.
Claim 24
Dependent Claim 23 words
The coder defined in claim 17 wherein each counter is enabled to count based on a significance indication received from the sign/magnitude unit.
Claim 25
Dependent Claim 33 words
The coder defined in claim 17 wherein a mantissa, a sign bit indication and an index for each coefficients are read out of the plurality of memories based on descending order of significance.
Claim 26
Dependent Claim 15 words
The coder defined in claim 17 wherein the wavelet transform comprises a reversible wavelet transform.
Claim 27
Dependent Claim 21 words
The coder defined in claim 17 wherein coefficient information is read out of the magnitude memory in descending order of significance.
Claim 28
Dependent Claim 91 words
The coder defined in claim 25 wherein the coefficient information is output from the magnitude memory by, repeatedly, reading out coefficient information at an address indicated by the counter for the highest level of significance and decrementing the counter value until the counter value is zero and then repeating the output of coefficient information for the next highest level of significance, wherein the output of coefficient information continues until all of the plurality of counters have been decremented to zero and all of the plurality of storage areas have been emptied.
Claim 29
Dependent Claim 25 words
The coder defined in claim 17 wherein each counter addresses its individual storage area such that a last in, first out buffer (LIFO) is implemented.
Claim 30
Dependent Claim 25 words
The coder defined in claim 17 wherein each counter addresses its individual storage area such that a first in, first out buffer (FIFO) is implemented.
Claim 31
Dependent Claim 90 words
The coder defined in claim 17 wherein the plurality of counters comprise two banks of counters and the plurality of storage areas comprise two banks of storage areas, and further wherein the magnitude memory uses one of the two banks of counters and one of the two banks of storage areas to receive formatted coefficients from the formatting unit while the magnitude memory uses the other of the two banks of counters and the other of the two banks of storage areas to output formatted coefficients to the significance unit.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-05-04 2001-11-03 2002-05-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-05-04 2005-11-03 2006-05-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-05-04 2009-11-03 2010-05-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag