US4910751A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for reversible compression of information-carrying symbols
Assignee: Telefonaktiebolaget LM Ericsson AB
•
Filing: 1987-11-11
•
Granted: 1990-03-20
•
Expires: 2007-11-11
Abstract
Abstract A method of reversibly compressing a sequence x(k) of information-carrying symbols, preferably digital signals which can assume Q discrete values, K being an index assuming integral number values, and consists in that the sequence x(k) is processed in means (1) to form a residue w(k), whereafter a modulo Q operation is carried out on the residue w(k). The modulo Q reducing sequence w(k) is finally encoded to form a compressed sequence n(k), which contains the same information as the original sequence x(k). In reconstructing the sequence x(k), the compressed sequence n(k) is decoded and subsequently processed in inversion means (5) to form a sequence y(k), on which a modulo Q operation is carried out, whereby the original sequence n(k) is obtained. An apparatus for carrying out the method includes means (1), means (2) for carrying out the modulo Q operations and an encoder (3). For carrying out the reconstruction it further includes a decoder (4), means (5) and means (6) for carrying out the modulo Q operation.
Inventors
- 👤 Goran H. Einarsson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 09:38
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/3002
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
126 words
A method of increasing the compression degree when reversibly compressing a sequence x(k) of information carrying symbols which can assume Q discrete values, where k is an integral number, comprising processing said sequence x(k) by creating a prediction value p(k) from at least one of the previous symbols in said sequence x(k) and forming a residue w(k) from said prediction value p(k) and from a number of (N) of said symbols x(k), executing a modulo Q-operation on said residue w(k) such that the entropy for the residue w(k) thus obtained is decreased thereby increasing the compression degree of said sequence x(k), coding the residue w(k) to form a compressed sequence n(k) of information carrying symbols which contains the same information as the original sequence of symbols.
Claim 2
Independent Claim
126 words
A method of increasing the compression degree when reversibly compressing a sequence x(k) of information carrying symbols which can assume Q discrete values, where k is an integral number, comprising processing said sequence x(k) by creating a prediction value p(k) from at least one of the previous symbols in said sequence x(k) and forming a residue w(k) from said prediction value p(k) and from a number of (N) of said symbols x(k), executing a modulo Q-operation on said residue w(k) such that the entropy for the residue w(k) thus obtained is decreased thereby increasing the compression degree of said sequence x(k), coding the residue w(k) to form a compressed sequence n(k) of information carrying symbols which contains the same information as the original sequence of symbols.
Claim 3
Dependent Claim
49 words
A method as claimed in claim 1, wherein the processing step of forming a residue w(k) being a linear filter, which forms the residue w(k) with the aid of additions and multiplications, characterized in that the additions and multiplications are executed as modulo Q additions and modulo Q multiplications.
Claim 4
Dependent Claim
16 words
A method as claimed in claim 2, characterized in that Q is a power of 2.
Claim 5
Dependent Claim
16 words
A method as claimed in claim 1, characterized in that Q is a power of 2.
Claim 6
Independent Claim
74 words
A method of reconstructing a sequence x(k) of information-carrying symbols, which have been compressed according to one of the preceeding claims, said reconstruction method implying that the compressed sequence n(k) is decoded and that the decoded sequence w(k) is processed in inversion means (5) to form a sequence y(k), characterized in that a modulo Q operation is carried out on the sequence y(k) from the inversion means (5) to obtain the original sequence x(k).
Claim 7
Dependent Claim
50 words
A method as claimed in claim 5, said means (5) for forming the sequence y(k) being a linear inversion filter, which forms the sequence y(k) with the aid of additions and multiplications, characterized in that the additions and multiplications are carried out as modulo Q and modulo Q multiplications, respectively.
Claim 8
Dependent Claim
16 words
A method as claimed in claim 6, characterized in that Q is a power of 2.
Claim 9
Dependent Claim
16 words
A method as claimed in claim 5, characterized in that Q is a power of 2.
Claim 10
Dependent Claim
97 words
Apparatus for compressing a sequence x(k) which can assume Q discrete values, where k is an integral number, comprising first means (1) to form a residue w(k) having a starting point in said sequence x(k) of information carrying symbols, second means (2) to perform a modulo Q-operation on said residue w(k), the entropy for the residue w(k) thus obtained being decreased, and coding means (3) to perform a predictive coding of the residue w(k) to create a compressed sequence n(k) of information carrying symbols containing the same information as the original sequence x(k) of information carrying symbols.
Claim 11
Dependent Claim
97 words
Apparatus for compressing a sequence x(k) which can assume Q discrete values, where k is an integral number, comprising first means (1) to form a residue w(k) having a starting point in said sequence x(k) of information carrying symbols, second means (2) to perform a modulo Q-operation on said residue w(k), the entropy for the residue w(k) thus obtained being decreased, and coding means (3) to perform a predictive coding of the residue w(k) to create a compressed sequence n(k) of information carrying symbols containing the same information as the original sequence x(k) of information carrying symbols.
Claim 12
Dependent Claim
45 words
Apparatus as claimed in claim 9, the means (1) for forming a residue w(k) being a linear filter, which forms the residue w(k) with the aid of adders and multipliers, characterized in that the adders and multipliers are modulo Q adders and modulo Q multipliers.
Claim 13
Dependent Claim
86 words
Apparatus for reconstructing a sequence x(k) of information-carrying symbols which have been compressed with apparatus as claimed in claim 10, said reconstruction apparatus including a decoder (4), which is adapted to decode the compressed sequence n(x) to form a decoded sequence w(k), and inversion means (5) adapted to form a sequence y(k) by an inversion operation on the sequence w(k), characterized by means (6) for carrying out a modulo Q operation on the sequence y(k) from the inversion means (5) for obtaining the original sequence x(k).
Claim 14
Dependent Claim
86 words
Apparatus for reconstructing a sequence x(k) of information-carrying symbols which have been compressed with apparatus as claimed in claim 9, said reconstruction apparatus including a decoder (4), which is adapted to decode the compressed sequence n(x) to form a decoded sequence w(k), and inversion means (5) adapted to form a sequence y(k) by an inversion operation on the sequence w(k), characterized by means (6) for carrying out a modulo Q operation on the sequence y(k) from the inversion means (5) for obtaining the original sequence x(k).
Claim 15
Dependent Claim
51 words
Apparatus for reconstructing a sequence x(k) according to claim 12, said means (5) for forming the sequence y(k) being a linear inversion filter which forms the sequence y(k) with the aid of adders and multipliers, characterized in that the adders and multipliers are modulo Q adders and modulo Q multipliers, respectively.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-03-19 | 1993-09-18 | 1994-03-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-03-19 | 1997-09-18 | 1998-03-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-03-19 | 2001-09-18 | 2002-03-20 | $7700.00 | Window Closed / Lapsed |