Patent US4334246A successfully refreshed from Google Patents.
US4334246A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data decompressor circuit
Assignee: Xerox Corp
•
Filing: 1980-05-16
•
Granted: 1982-06-08
•
Expires: 2000-05-16
Abstract
Abstract A circuit and method for decompressing video subsequent to its prior compression for transmission or storage. The circuit assumes that the original video generated by a raster input scanner was operated on by a two line one shot predictor, coded using run length encoding into code words of four, eight, or twelve bits and packed into sixteen bit data words. This described decompressor, then, unpacks the data by joining together the sixteen bit data words and then separately the individual code words, converts the code words into a number of all zero four bit nibbles and a terminating nibble containing one or more one bits which constitutes decoded data, inspects the actual video of the preceeding scan line and the previous video bits of the present line to produce depredictor bits and compares the decoded data and depredictor bits to produce the final actual video.
Inventors
- 👤 Amitabh Saran
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 12:43
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/417
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
197 words
A data decompressor for decoding and depredicting a series of scan lines of compressed video data into actual video, said data comprising variable length code words packed into fixed length compressed video data words, said code words comprising a run length portion or a terminating portion, said decompressor comprising: an unpacker for putting together into an unlimited string a series of fixed length data words, and for separating said string into variable length code words, a decoder for translating each of said run length portions of said code words into an output comprising a series of zeros and for translating each of said terminating portions into an output comprising a decoded video pattern for ones and zeros, a depredictor for inspecting selected bits of the actual video in the previous scan line and in the previous bits of the current scan line, and therefrom, producing an output comprising the next set of predicted video bits, and a comparator for comparing the output of said depredictor and the output of said decoder, producing therefrom actual video and for providing said depredictor with said actual video for use in the deprediction of the following sets of predicted video bits.
Claim 2
Dependent Claim
197 words
A data decompressor for decoding and depredicting a series of scan lines of compressed video data into actual video, said data comprising variable length code words packed into fixed length compressed video data words, said code words comprising a run length portion or a terminating portion, said decompressor comprising: an unpacker for putting together into an unlimited string a series of fixed length data words, and for separating said string into variable length code words, a decoder for translating each of said run length portions of said code words into an output comprising a series of zeros and for translating each of said terminating portions into an output comprising a decoded video pattern for ones and zeros, a depredictor for inspecting selected bits of the actual video in the previous scan line and in the previous bits of the current scan line, and therefrom, producing an output comprising the next set of predicted video bits, and a comparator for comparing the output of said depredictor and the output of said decoder, producing therefrom actual video and for providing said depredictor with said actual video for use in the deprediction of the following sets of predicted video bits.
Claim 3
Dependent Claim
28 words
The decompressor of claim 1 wherein said code words are four, eight, or twelve bits in length, and said fixed length data words are sixteen bits in length.
Claim 4
Dependent Claim
33 words
The decompressor of claim 2 further comprising a memory for receiving the actual video output of said comparator for temporarily storing said actual video and for coupling said actual video to said depredictor.
Claim 5
Dependent Claim
36 words
The decompressor of claim 3 werein said unpacker comprises a sixteen bit register pipeline for temporarily holding a plurality of data words while said unpacker selects therefrom the next code word for coupling to said decoder.
Claim 6
Dependent Claim
36 words
The decompressor of claim 4 wherein said decoder comprises a counter which is loaded with the run length portion of said code word, and means to output to said comparator four zero bits for each count.
Claim 7
Dependent Claim
49 words
The decompressor of claim 5 wherein said decoder comprises a ROM which is addressed by said code word to produce a count representing the number of all zero nibbles to be loaded into said counter and said pattern of ones and zeros which constitute the decoded video terminating nibble.
Claim 8
Dependent Claim
58 words
The decompressor of claim 5 wherein said decoder comprises a ROM which is addressed by selected bits of the previous line of actual video and selected previous bits of the current line of actual video to produce four bits of depredicted video which will be compared in said comparator against said decoder output to produce actual video therefrom.
Claim 9
Dependent Claim
31 words
The decompressor of claim 7 wherein said decoder further comprises a boundary code decoder for generating a specific control line output for each associated control code received as a decoder input.
Claim 10
Dependent Claim
60 words
The decompressor of claim 8 wherein the first two bits of said code words indicate the code word length, and wherein said unpacker comprises means responsive to said two leading bits to control said unpacker to output from said pipeline the correct number of bits as the instant code word output, and to move data along said pipeline when necessary.
Claim 11
Independent Claim
141 words
The method of decompressing a series of scan lines of compressed video data comprising code words of four, eight, or twelve bits packed in fixed length data words into actual video comprising the steps of; putting together said fixed length data words into an unlimited string of nibbles, separating said string of nibbles into said code words, each comprising a run length portion or a terminating portion. converting said run length portion into a series of all zero nibbles and said terminating portion into a decoded video nibble having one or more one bits, predicting the current four bits of video from selected bits of the previous line of actual video and from selected previous bits of the current line of actual video, comparing the results of the converting step and the predicting step to produce four bits of actual video.
Claim 12
Independent Claim
141 words
The method of decompressing a series of scan lines of compressed video data comprising code words of four, eight, or twelve bits packed in fixed length data words into actual video comprising the steps of; putting together said fixed length data words into an unlimited string of nibbles, separating said string of nibbles into said code words, each comprising a run length portion or a terminating portion. converting said run length portion into a series of all zero nibbles and said terminating portion into a decoded video nibble having one or more one bits, predicting the current four bits of video from selected bits of the previous line of actual video and from selected previous bits of the current line of actual video, comparing the results of the converting step and the predicting step to produce four bits of actual video.
Claim 13
Dependent Claim
28 words
The method of claim 10 further comprising the step of storing and subsequently outputting each scan line of actual video to enable the repeating of every scan line.
Claim 14
Dependent Claim
38 words
The method of claim 10 further comprising the steps of inspecting each code word prior to said converting step and to decode said code word into a control line output if said code word is a control word.
Claim 15
Dependent Claim
26 words
The method of claim 12 further comprising the step of storing the actual video produced in said comparing step for future use in said predicting step.
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) | 1985-06-07 | 1985-12-07 | 1986-06-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1989-06-07 | 1989-12-07 | 1990-06-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1993-06-07 | 1993-12-07 | 1994-06-08 | $7700.00 | Window Closed / Lapsed |