Patent US5262776A successfully refreshed from Google Patents.
US5262776A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Process for use with lempel/gin encoding
Assignee: Siemens AG
•
Filing: 1990-03-21
•
Granted: 1993-11-16
•
Expires: 2010-03-21
Abstract
Abstract PCT No. PCT/DE90/00223 Sec. 371 Date Dec. 11, 1991 Sec. 102(e) Date Dec. 11, 1991 PCT Filed Mar. 21, 1990 PCT Pub. No. WO91/00652 PCT Pub. Date Jan. 10, 1991.An A. Lempel and J. Ziv code is frequently used for coding a sequence of elements of, for example, coefficients of a discrete cosine transform for image values of picture elements of a reproduced image. An extremely fast code generation process is disclosed for this. In coding steps, code words are marked at coding sites in accordance with the partial sequences found. The coding steps are linked by coding step pointers. The sequence of elements from a primary sequence can be converted into elements from a reduced set of elements using escape sequences.
Inventors
- 👤 Robert Kutka
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 14:00
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/3084; H03M7/3086
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
133 words
A process for coding a sequence of elements by generating a Lempel/Ziv code for partial sequences, comprising the steps of: constructing a linked list having a linked tree structure from tables, said tables being coding stages; providing in each of the coding stages for each element of the sequence of elements a location, referred to as a coding site, at which a code word and a coding stage pointer to a subsequent coding stage may be assigned to a respective element; assigning a respective code word to a partial sequence to be coded at a respective coding site, to which a respective coding stage pointer points, the respective coding stage pointer belonging to a further partial sequence which is produced by deletion of a last element of the partial sequence to be coded.
Claim 2
Dependent Claim
133 words
A process for coding a sequence of elements by generating a Lempel/Ziv code for partial sequences, comprising the steps of: constructing a linked list having a linked tree structure from tables, said tables being coding stages; providing in each of the coding stages for each element of the sequence of elements a location, referred to as a coding site, at which a code word and a coding stage pointer to a subsequent coding stage may be assigned to a respective element; assigning a respective code word to a partial sequence to be coded at a respective coding site, to which a respective coding stage pointer points, the respective coding stage pointer belonging to a further partial sequence which is produced by deletion of a last element of the partial sequence to be coded.
Claim 3
Dependent Claim
18 words
The process according to claim 1, wherein each of the code words has between 10 and 16 bits.
Claim 4
Dependent Claim
21 words
The process according to claim 1, wherein an element of the sequence of elements is represented with 4 to 8 bits.
Claim 5
Dependent Claim
25 words
The process according to claim 1, wherein a number of coding stages is between one half and one seventh of a number of code words.
Claim 6
Dependent Claim
20 words
The process according to claim 1, wherein a maximum number of elements of partial sequences is between 100 and 500.
Claim 7
Dependent Claim
28 words
The process according to claim 1, wherein the elements of the sequence of elements are coefficients of a discrete cosine transform of image values of a digital image.
Claim 8
Dependent Claim
21 words
The process according to claim 1, wherein the steps of the process are carried out by means of a general-purpose computer.
Claim 9
Dependent Claim
15 words
The process according to claim 1, wherein each of the code words has 14 bits.
Claim 10
Dependent Claim
19 words
The process according to claim 1, wherein an element of the sequence of elements is represented with 6 bits.
Claim 11
Dependent Claim
21 words
The process according to claim 1, wherein a number of coding stages is one third of a number of code words.
Claim 12
Dependent Claim
17 words
The process according to claim 1, wherein a maximum number of elements of partial sequences is 250.
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) | 1996-11-15 | 1997-05-17 | 1997-11-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-11-15 | 2001-05-17 | 2001-11-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-11-15 | 2005-05-17 | 2005-11-16 | $7700.00 | Window Closed / Lapsed |