US5839100A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Lossless and loss-limited compression of sampled data signals
Assignee: Altera Corp
•
Filing: 1996-04-22
•
Granted: 1998-11-17
•
Expires: 2016-04-22
Abstract
Abstract An efficient method for compressing audio and other sampled data signals without loss, or with a controlled amount of loss, is described. The compression apparatus contains a subset selector, an approximator, an adder, two derivative encoders, a header encoder, and a compressed block formatter. The decompression apparatus contains a compressed block parser, a header decoder, two integration decoders, an approximator, and an adder. The compressor first divides each block of input samples into a first subset and a second subset. The approximator uses the first subset samples to approximate the second subset samples. An error signal is created by subtracting the approximated second subset samples from the actual second subset samples. The first subset samples and error signal are separately encoded by the derivative encoders, which select the signal's derivative that requires the least amount of storage for a block floating point representation. A compressed block formatter combines the compression control parameters, encoded subset array, and encoded error array into a compressed block. The decompression apparatus first parses the compressed block into a header, an encoded first subset array, and an encoded error array. The header decoder recovers the compression control parameters from the header. Using the compression control parameters, the integration decoders reconstruct the first subset and error arrays from their block floating point representations. The approximator uses the first subset samples to approximate the original second subset samples. The adder combines the subset samples, the error samples, and the approximated second subset samples to identically re-create the original, uncompressed signal. An indexing method is described which allows random access to specific uncompressed samples within the stream of compressed blocks.
Inventors
- 👤 Albert William Wegener
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 15:12
CPC Classifications
H; H04; H04B; H04B14/00; H04B14/02; H04B14/06; H04B14/066; H04B14/068
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
343 words
A sampled data compression method which compresses input blocks of digitized signals, especially speech, audio, or audiovisual signals, that are regularly sampled at a rate of K samples per second and B bits per sample, where said input blocks are replaced by a stream of compressed blocks comprising: (a) grouping said sampled data signal into input blocks containing N consecutive samples, in which each said input block requires N*B bits of storage or transmission, (b) applying a partitioning method to each said input block to create a first subset containing N1 samples of the input signal and a second subset containing N2 samples of the input signal, where N1+N2=N, (c) applying an approximation method to said first subset of N1 samples to create an approximation signal containing N2 samples which approximates said second subset, (d) subtracting said approximation signal from said second subset to create an error signal containing N2 samples, (e) applying an encoding method to said first subset of N1 samples to create an encoded first subset requiting C1 bits of storage or transmission, wherein said encoded first subset identically represents said first subset of N1 samples using fewer than N1*B bits, (f) applying an encoding method to said error signal of N2 samples to create an encoded error signal requiring C2 bits of storage or transmission, wherein said encoded error signal identically represents said error signal of N2 samples using fewer than N2*B bits, (g) creating a header containing control bits requiring C3 bits of storage or transmission, which said control bits indicate said block size N, said partitioning method used to create said first subset, said approximation method used to create said approximation signal, said encoding method used to encode said first subset, and said encoding method used to encode said error signal, (h) combining said encoded first subset, said encoded error signal, and said header containing control bits into a compressed block requiring C1+C2+C3 bits of storage or transmission, where C1+C2+C3 is less than N*B, and (i) combining consecutive said compressed blocks into said stream of compressed blocks.
Claim 2
Dependent Claim
343 words
A sampled data compression method which compresses input blocks of digitized signals, especially speech, audio, or audiovisual signals, that are regularly sampled at a rate of K samples per second and B bits per sample, where said input blocks are replaced by a stream of compressed blocks comprising: (a) grouping said sampled data signal into input blocks containing N consecutive samples, in which each said input block requires N*B bits of storage or transmission, (b) applying a partitioning method to each said input block to create a first subset containing N1 samples of the input signal and a second subset containing N2 samples of the input signal, where N1+N2=N, (c) applying an approximation method to said first subset of N1 samples to create an approximation signal containing N2 samples which approximates said second subset, (d) subtracting said approximation signal from said second subset to create an error signal containing N2 samples, (e) applying an encoding method to said first subset of N1 samples to create an encoded first subset requiting C1 bits of storage or transmission, wherein said encoded first subset identically represents said first subset of N1 samples using fewer than N1*B bits, (f) applying an encoding method to said error signal of N2 samples to create an encoded error signal requiring C2 bits of storage or transmission, wherein said encoded error signal identically represents said error signal of N2 samples using fewer than N2*B bits, (g) creating a header containing control bits requiring C3 bits of storage or transmission, which said control bits indicate said block size N, said partitioning method used to create said first subset, said approximation method used to create said approximation signal, said encoding method used to encode said first subset, and said encoding method used to encode said error signal, (h) combining said encoded first subset, said encoded error signal, and said header containing control bits into a compressed block requiring C1+C2+C3 bits of storage or transmission, where C1+C2+C3 is less than N*B, and (i) combining consecutive said compressed blocks into said stream of compressed blocks.
Claim 3
Dependent Claim
22 words
The method of claim 1, wherein said step of applying a partitioning method to create a first subset is performed using decimation.
Claim 4
Dependent Claim
26 words
The method of claim 1, wherein said step of applying a partitioning method to create a first subset is performed by selecting local maxima and minima.
Claim 5
Dependent Claim
23 words
The method of claim 1, wherein said step of applying an approximation method to create an approximation signal is performed using Bessel interpolation.
Claim 6
Dependent Claim
23 words
The method of claim 1, wherein said step of applying an approximation method to create an approximation signal is performed using cubic interpolation.
Claim 7
Dependent Claim
25 words
The method of claim 1, wherein said step of applying an encoding method to create an encoded first subset is performed using a derivative encoder.
Claim 8
Dependent Claim
25 words
The method of claim 1, wherein said step of applying an encoding method to create an encoded first subset is performed using a Huffman encoder.
Claim 9
Dependent Claim
25 words
The method of claim 1, wherein said step of applying an encoding method to create an encoded error signal is performed using a derivative encoder.
Claim 10
Dependent Claim
25 words
The method of claim 1, wherein said step of applying an encoding method to create an encoded error signal is performed using a Huffman encoder.
Claim 11
Dependent Claim
38 words
The method of claim 1, further including a method for compressing said sampled data signal with a predetermined degradation factor which reduces the amplitude of said sampled data signal by an amount controlled by said predetermined degradation factor.
Claim 12
Dependent Claim
37 words
The method of claim 1, further including a method for compressing said sampled data signal with a predetermined degradation factor which reduces the amplitude of said error signal by an amount controlled by said predetermined degradation factor.
Claim 13
Dependent Claim
147 words
The method of claim 1, in which at least one of the following selections is made in order to minimize the size of each compressed block, and in which the resulting selections are indicated by control bits stored within said compressed block header, further including: (a) from a plurality of partitioning methods, selecting that partitioning method which creates the smallest compressed block, (b) from a plurality of approximation methods, selecting that approximation method which creates the smallest compressed block, (c) from a plurality of encoding methods, selecting that encoding method which creates the smallest encoded first subset, (d) from a plurality of encoding methods, selecting that encoding method which creates the smallest encoded error signal, and (e) identifying said selected partitioning method, said selected approximation method, said selected first subset encoding method, and said selected error signal encoding method using control bits in said compressed block header.
Claim 14
Dependent Claim
38 words
The method of claim 12, further including a method for compressing said sampled data signal with a predetermined degradation factor which reduces the amplitude of said sampled data signal by an amount controlled by said predetermined degradation factor.
Claim 15
Dependent Claim
37 words
The method of claim 12, further including a method for compressing said sampled data signal with a predetermined degradation factor which reduces the amplitude of said error signal by an amount controlled by said predetermined degradation factor.
Claim 16
Dependent Claim
46 words
The method of claim 12, in which said stream of compressed blocks is stored in a storage medium in a format containing the following: (a) said compressed block header containing said selection parameters, (b) said minimally encoded first subset, and (c) said minimally encoded error signal.
Claim 17
Dependent Claim
173 words
In the sampled data compression system of claim 12, a decompression method for recovering said stream of sampled data signals from said stream of compressed blocks, comprising the steps of: (a) recovering said partitioning method, approximation method, first subset encoding method, and error signal encoding method control bits from said compressed block header, (b) applying the decoding method corresponding to said first subset encoding method control bits to recover said first subset from said compressed block, (c) applying the decoding method corresponding to said selected error signal encoding method control bits to recover said error signal from said compressed block, (d) applying the approximation method specified by said approximation method control bits to said recovered first subset to create an approximated second subset, (e) adding said approximated second subset to said recovered error signal to create a recovered second subset, and (f) applying the subset recombination method corresponding to said selected partitioning method control bits which combines said first subset and said recovered second subset into said recovered stream of sampled data signals.
Claim 18
Dependent Claim
31 words
The method of claim 15, further including increasing the amplitude of said recovered stream of sampled data signals by an amount specified by amplitude control bits in said compressed block header.
Claim 19
Dependent Claim
28 words
The method of claim 15, further including increasing the amplitude of said recovered error signal by an amount specified by amplitude control bits in said compressed block header.
Claim 20
Dependent Claim
214 words
In the sampled data compression system of claim 1, a decompression method for recovering said stream of sampled data signals from said compressed stream of compressed blocks, said decompression method comprising the steps of: (a) separating each said compressed block into a block header, an encoded first subset, and an encoded error signal, (b) recovering the first subset encoding method control bits, the error signal encoding method control bits, the approximation method control bits, and the subset partitioning method control bits from said block header, (c) applying the decoding method corresponding to the encoding method specified by said first subset encoding method control bits to recover the first subset, (d) applying the decoding method corresponding to the encoding method specified by said error signal encoding method control bits to recover the error signal, (e) processing said recovered first subset in the manner specified by said approximation method control bits to create an approximated second subset, (f) adding said approximated second subset to said recovered error signal to create a reconstructed second subset, (d) combining said recovered first subset and said reconstructed second subset in the manner corresponding to said subset partitioning method control bits to create a recovered uncompressed block, and (h) combining consecutive said uncompressed blocks into said stream of sampled data signals.
Claim 21
Dependent Claim
303 words
In a sampled data decompression system, a decompression method for recovering a stream of sampled data signals from a stream of compressed blocks, each compressed block containing an encoded first subset derived by partitioning said sampled data signal into a first subset and a second subset, an encoded error signal derived by subtracting said second subset from an approximated second subset generated using said first subset as input to an approximation method, and a header containing control bits which indicate said partitioning method used to create said first subset, said approximation method used to create said approximation signal, said encoding method used to encode said first subset, and said encoding method used to encode said error signal, said decompression method comprising the steps of: (a) separating each said compressed block into a block header, an encoded subset, and an encoded error signal, (b) recovering the first subset encoding method control bits, the error signal encoding method control bits, the approximation method control bits, and the subset partitioning method control bits from said block header, (c) applying the decoding method corresponding to the encoding method specified by said first subset encoding method control bits to recover the first subset, (d) applying the decoding method corresponding to the encoding method specified by said error signal encoding method control bits to recover the error signal, (e) processing said recovered first subset in the manner specified by said approximation method control bits to create an approximated second subset, (f) adding said approximated second subset to said recovered error signal to create a reconstructed second subset, (g) combining said recovered first subset and said reconstructed second subset in the manner corresponding to said subset partitioning method control bits to create a recovered uncompressed block, and (h) combining consecutive said uncompressed blocks into said stream of sampled data signals.
Claim 22
Dependent Claim
303 words
In a sampled data decompression system, a decompression method for recovering a stream of sampled data signals from a stream of compressed blocks, each compressed block containing an encoded first subset derived by partitioning said sampled data signal into a first subset and a second subset, an encoded error signal derived by subtracting said second subset from an approximated second subset generated using said first subset as input to an approximation method, and a header containing control bits which indicate said partitioning method used to create said first subset, said approximation method used to create said approximation signal, said encoding method used to encode said first subset, and said encoding method used to encode said error signal, said decompression method comprising the steps of: (a) separating each said compressed block into a block header, an encoded subset, and an encoded error signal, (b) recovering the first subset encoding method control bits, the error signal encoding method control bits, the approximation method control bits, and the subset partitioning method control bits from said block header, (c) applying the decoding method corresponding to the encoding method specified by said first subset encoding method control bits to recover the first subset, (d) applying the decoding method corresponding to the encoding method specified by said error signal encoding method control bits to recover the error signal, (e) processing said recovered first subset in the manner specified by said approximation method control bits to create an approximated second subset, (f) adding said approximated second subset to said recovered error signal to create a reconstructed second subset, (g) combining said recovered first subset and said reconstructed second subset in the manner corresponding to said subset partitioning method control bits to create a recovered uncompressed block, and (h) combining consecutive said uncompressed blocks into said stream of sampled data signals.
Claim 23
Dependent Claim
20 words
The decompression method of claim 20, wherein said step of applying a decoding method is performed using an integration decoder.
Claim 24
Dependent Claim
20 words
The decompression method of claim 20, wherein said step of applying a decoding method is performed using a Huffman decoder.
Claim 25
Dependent Claim
26 words
The decompression method of claim 20, wherein said step of processing said recovered first subset to create an approximated second subset is performed using Bessel interpolation.
Claim 26
Dependent Claim
26 words
The decompression method of claim 20, wherein said step of processing said recovered first subset to create an approximated second subset is performed using cubic interpolation.
Claim 27
Dependent Claim
60 words
The decompression method of claim 20, further including the step of accessing a specific section of uncompressed samples from within said compressed stream of code signals using an index, said index containing a list of compressed block sizes, each entry of said list representing the storage required for a predetermined number of uncompressed samples within said stream of code signals.
References Cited (Backward Citations)
GB2117608A
Cited
US4558302A
Cited
US4558302B1
Cited
US4546342A
Cited
US4680797A
Cited
US5142656A
Cited
US5083310A
Cited
US5317672A
Cited
US5394508A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-11-16 | 2002-05-18 | 2002-11-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-16 | 2006-05-18 | 2006-11-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-16 | 2010-05-18 | 2010-11-17 | $7700.00 | Window Closed / Lapsed |