Back to results
US 7,346,218 B2Granted
Method and apparatus for encoding and decoding subband decompositions of signals
AssigneeKT Tech, Inc.
InventorsRobert W. Buccigrossi, Bao T. Lerner, John F. Pierce
Life of this patent
Estimating the term…
Abstract
An aspect of the present invention includes a method of encoding coefficients of a subband decomposition, to prepare the coefficients for compression. Another aspect of the present invention includes an inverse method of decoding coefficients of a subband decomposition, after they have been decompressed. Particular features and other aspects of the present invention are indicated in the specification, including the drawings and claims.
Claims4
A method of efficiently decoding and receiving a signal, including:
- receiving an encoded signal;
- decompressing the signal to produce a zero tree encoded signal;
- decoding the zero tree encoded signal, including
- reconstructing at least one of an A-tree or a B-tree of leading zero values for a pyramid of coefficients having parent and child relationships,
- wherein parent nodes in the A-tree indicate a minimum number of leading zeros for coefficients at children nodes and descendants of the children nodes and
- wherein grandparent nodes in the B-tree indicate a minimum number of leading zeros for coefficients at grandchildren nodes and descendants of the grandchildren nodes;
- and
- reconstructing an original signal from the A-tree and/or B-tree of zero values and coefficients;
- and
- outputting or storing to memory the reconstructed original signal;
- whereby changing a non-leading bit in a coefficient of the A-tree and/or B-tree changes a signal amplitude for a part of the reconstructed original signal represented by the changed coefficient plus at least grandchild coefficients and subsequent descendent coefficients.
8 more elements
A method of efficiently encoding and sending a signal, including:
- receiving an original signal for encoding and compression;
- encoding the original signal to a zero tree encoded signal, including
- constructing at least one of an A-tree or a B-tree of leading zero values for a pyramid of coefficients having parent and child relationships,
- wherein parent nodes in the A-tree indicate a minimum number of leading zeros for coefficients at children nodes and descendants of the children nodes and
- wherein grandparent nodes in the B-tree indicate a minimum number of leading zeros for coefficients at grandchildren nodes and descendants of the grandchildren nodes;
- and
- walking the A-tree and/or B-tree to construct a stream including zero values and coefficients;
- and
- compressing the stream;
- outputting or storing to memory the compressed signal;
- whereby changing a non-leading bit in a coefficient of the A-tree and/or B-tree changes a signal amplitude for a part of the stream represented by the changed coefficient plus at least grandchild coefficients and subsequent descendent coefficients.
8 more elements
Dependencies are inferred from the claim text.