← Back to Patent Explorer
US4800441A Expired / Lapsed US ⏱️ 0.0 years remaining

Binary data compression and expansion processing apparatus

Assignee: Toshiba Corp
•
Filing: 1987-02-24
•
Granted: 1989-01-24
•
Expires: 2007-02-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A binary data compression and exansion processing apparatus of this invention has an input data holding section for holding input code data. In an address section, bit data having a predetermined length is selected from code data held in the holding section in accordance with an instruction from an addition section, and address data for a decode section is generated from instruction data from a control section and the selected data. The decode section generates data associated with the run length in response to the generated address data, and outputs data indicating the length of the decoded code data portion. The addition section adds the data indicating the length to the previous instruction, and outputs sum data as the next instruction. When the sum data becomes equal to an input bit width, the control section outputs an instruction to the input data holding section so as to input the next code data. Therefore, the decoding processing apparatus of this invention can parallel-process input code data in a pipeline manner.

Inventors

  • 👤 Fumitaka Sato

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 17:09
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/417; H04N1/4175; G; G06; G06T; G06T9/00; G06T9/005; H03M7/46

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 170 words
A binary data compression and expansion processing apparatus which can decode code data in a pipeline manner, comprising: holding means for receiving the code data having a first predetermined length, and for holding the latest code data for a second predetermined length; block output means for receiving the held code data in said holding means, for producing a code data block from input control data and a code data portion selected in accordance with bit position data input thereto, and for outputting the produced code data block in accordance with an output instruction; decoding means for generating data indicating a length of a code unit and run length data corresponding to the code unit beginning from a leading bit of the code data block in accordance with an input of the code data block; and bit position designation means for outputting the held bit position data to said block output means, and for updating the bit position data in accordance with the code unit length data from said decoding means.
Claim 2
Dependent Claim 170 words
A binary data compression and expansion processing apparatus which can decode code data in a pipeline manner, comprising: holding means for receiving the code data having a first predetermined length, and for holding the latest code data for a second predetermined length; block output means for receiving the held code data in said holding means, for producing a code data block from input control data and a code data portion selected in accordance with bit position data input thereto, and for outputting the produced code data block in accordance with an output instruction; decoding means for generating data indicating a length of a code unit and run length data corresponding to the code unit beginning from a leading bit of the code data block in accordance with an input of the code data block; and bit position designation means for outputting the held bit position data to said block output means, and for updating the bit position data in accordance with the code unit length data from said decoding means.
Claim 3
Dependent Claim 82 words
The apparatus according to claim 1, wherein the code unit is one of a make-up code, a terminating code, an identification code of a horizontal mode, a vertical mode code, a pass mode code, and the EOL code, and said decoding means includes a one-dimensional code table for decoding the make-up code and the terminating code, and a two-dimensional code table for decoding the identification code of the horizontal mode, the vertical mode code, the pass mode code, and the EOL code.
Claim 4
Dependent Claim 72 words
The apparatus according to claim 1, wherein said bit position designation means comprises: bit position data holding means for holding the input bit position data; and adding means for adding the bit position data from said bit position data holding means and the code unit length data from said decoding means, and for outputting as the bit position data a part of the added result to said bit position data holding means.
Claim 5
Dependent Claim 101 words
The apparatus according to claim 3, wherein said bit position designation means further comprises means for outputting a subtracting result of data indicating the first predetermined length from the added result as the bit position data when the added result is the first predetermined length data or more, and for outputting the added result as the bit position data when the added result is under the first predetermined length data, and said holding means for receiving the next code data having the first predetermined length when the added result by said adding means is the first predetermined length data or more.
Claim 6
Dependent Claim 33 words
The apparatus according to claim 1, wherein the output instruction is input when an image generation processing for a code decoded immediately before the code corresponding to the current code unit is completed.
Claim 7
Dependent Claim 143 words
The apparatus according to claim 5, wherein the code unit encoded by M 2 R method is decoded next by said decoding means, said decoding means further includes means for outputting state information to decode the next code unit, and the apparatus further comprises: line end detecting means for detecting that the decoding processing proceeds to the line end; and control means for outputting the control data to said block output means in accordance with the state information, the control data being output such that the current code unit is decoded as a white color when it is detected that the decoding processing proceeds to the line end, and wherein the output instruction is input to said block output means after the control data as the white color is output when it is detected that the decoding processing proceeds to the line end.
Claim 8
Dependent Claim 24 words
The apparatus according to claim 6, wherein the output instruction is input to said block output means subsequent to decode a first EOL code.
Claim 9
Dependent Claim 62 words
The apparatus according to claim 1, wherein the code unit is one of each of a plurality of divided portions of the make-up code, each of a plurality of divided portions of the terminating code, the identification code of the horizontal mode, the vertical mode code, the pass mode code, and each of a plurality of divided portions of the EOL code.
Claim 10
Dependent Claim 155 words
The apparatus according to claim 8, wherein the make-up code, the terminating code, and the EOL code are divided into two portions, said decoding means includes a one-dimensional code table 1 for decoding first portions of the make-up code and the terminating code, a one-dimensional code table 2 for decoding second portions of the make-up code and the terminating code, a two-dimensional code table for decoding the identification code of the horizontal mode, the vertical mode code, and the pass mode code, and a special code table for decoding the EOL code, and the output instruction is input to said block output means when the image generation processing for the immediately preceding code of the code corresponding to the current code unit is completed, and is subsequenty input to said block output means when the decoded code unit is one of the first portions of the make-up code, the terminating code, and the EOL code.
Claim 11
Dependent Claim 77 words
The apparatus according to claim 9, wherein said decoding means further includes an uncompressed code table for decoding an uncompressed code, and for generating the run length data as the code unit length data, an identification code of the compressed code being decoded by the special code table, and the apparatus further includes register means for holding the uncompressed code, and said block output means further includes means for outputting the uncompressed code to said register means.
Claim 12
Dependent Claim 101 words
A binary data compression and expansion processing apparatus which can decode code data in parallel, comprising: addressing means for generating address data from input control data and input code data including a code unit as units of codes to be decoded; decoding means, having a plurality of code tables for decoding code units, for outputting next state data indicating a table to be referred to to decode the next code unit and run length data of the decoded code unit; and control means for outputting the control data to decode the current code unit in accordance with the next state data.
Claim 13
Dependent Claim 101 words
A binary data compression and expansion processing apparatus which can decode code data in parallel, comprising: addressing means for generating address data from input control data and input code data including a code unit as units of codes to be decoded; decoding means, having a plurality of code tables for decoding code units, for outputting next state data indicating a table to be referred to to decode the next code unit and run length data of the decoded code unit; and control means for outputting the control data to decode the current code unit in accordance with the next state data.
Claim 14
Dependent Claim 64 words
The apparatus according to claim 11, wherein the code unit is one of a make-up code and a terminating code, and the decoding means includes a white run one-dimensional code table for decoding a white run make-up code, and a white run terminating code, and a black run one-dimensional code table for decoding a black run make-up code, and a black run terminating code.
Claim 15
Dependent Claim 184 words
The apparatus according to claim 11, wherein the code unit is one of: each of two-divided portions of a make-up code, each of two-divided portions of a terminating code, an identification code in a horizontal mode, a vertical mode code, a pass mode code, and each of two-divided portions of an EOL code, and said decoding means includes a white run one-dimensional code table 1 for decoding first portions of the white run make-up code and the white run terminating code, a white run one-dimensional code table 2 for decoding second portions of the white run make-up code and the white run terminating code, a black run one-dimensional code table 1 for decoding first portions of the black run make-up code and the black run terminating code, a black run one-dimensional code table 2 for decoding second portions of the black run make-up code and the black run terminating code, a two-dimensional code table for decoding the identification code of the horizontal mode, the vertical mode code, the pass mode and a special code table for decoding a second portion of the EOL code.
Claim 16
Dependent Claim 46 words
The apparatus according to claim 13, wherein said control means further comprises means for outputting the control data to said addressing means such that the next code unit is decoded as a white run when decoding processing is completed up to the end of a line.
Claim 17
Dependent Claim 222 words
The apparatus according to claim 13, wherein said control means includes means for outputting the control data to said addressing means in accordance with the next state data, such that the two-dimensional code table is referred to to decode the next code unit when one of the vertical mode code, the pass mode code, and the black run terminating code is decoded, such that the white run one-dimensional code table 1 is referred to when one of the identificaiton code in the horizontal mode and the white run make-up code is decoded, such that the white run one-dimensional code table 2 is referred to when one of the first portions of the white run make-up code and the white run terminating code is decoded, such that the black run one-dimensional code table 1 is referred to when one of the white run terminating code and the black run make-up code is decoded, such that the black run one-dimensional code table 2 is referred to when one of the first portions of the black run make-up code and the black run terminating code is decoded, such that the special code table is referred to when "0" bits succeed for six bits or more in the two-dimensional code table, and when "0" bits succeed for eight bit or more in the one-dimensional code tables.
Claim 18
Dependent Claim 93 words
The apparatus according to claim 11, wherein the code unit is one of a make-up code, a terminating code, an identification code of a horizontal mode, a vertical mode code, a pass mode code, and an EOL code, and the decoding means includes a white run one-dimensional code table for decoding a black run make-up code, and a black run terminating code, a two-dimensional code table for decoding the identification code of the horizontal mode, the vertical mode code, the pass mode code, and a special code table for decoding the EOL code.
Claim 19
Dependent Claim 46 words
The apparatus according to claim 13, wherein said control means further comprises means for outputting the control data to said addressing means such that the next code unit is doceded as a white run when decoding processing is completed up to the end of a line.
Claim 20
Dependent Claim 160 words
The apparatus according to claim 17, wherein said control means includes means for outputting the control data to said addressing means in accordance with the next state data, such that the two-dimensional code table is referred to to decode the next code unit when the vertical mode code and the pass mode code is decoded as the code unit, such that the white run one-dimensional code table is referred to to decode the next code unit when the identification code in the horizontal mode is decoded, such that the black run one-dimensional code table is referred to to decode the next code unit when the black run terminating code is decoded, and such that the special code table is referred to to decode the next code unit when "0" bits are successive for six bits or more in the two-dimensional code table and "0" bits are successive for eight bits or more in the white and black one-dimensional code tables.

References Cited (Backward Citations)

DE3137704A1 Cited
US4562484A Cited
GB2146874A Cited
DE3543081A1 Cited
US4760461A Cited
US4760459A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-01-24 1992-07-25 1993-01-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-01-24 1996-07-25 1997-01-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-01-24 2000-07-25 2001-01-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag