Patent US4591829A successfully refreshed from Google Patents.
US4591829A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Run length code decoder
Assignee: Canon Inc
•
Filing: 1983-08-17
•
Granted: 1986-05-27
•
Expires: 2003-08-17
Abstract
Abstract A run length code decoder, constructed to reduce the number of times of memory access to attain a high speed operation, decodes a run length code such as a modified Huffman code in a facsimile machine. It determines a memory address to be read next from a memory which contains a decode table for the run length code by a result of an arithmetic operation of a predetermined address of the memory, a content at the predetermined address and a next data derived from an input code.
Inventors
- 👤 Takashi Takeda
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 17:23
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/419
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
110 words
A binary code decoder comprising: memory means for containing a decode table for decoding a binary code consisting of a plurality of binary signals; count means for counting one kind of the binary signals; determining means for determining an address of said memory means to be first accessed in accordance with a count of said count means and for determining a decode address of the binary code in accordance with data recorded at the first accessed address of said memory means and remaining portions of the binary code not counted by said count means; and reading means for reading data recorded at the decode address determined by said determining means.
Claim 2
Dependent Claim
110 words
A binary code decoder comprising: memory means for containing a decode table for decoding a binary code consisting of a plurality of binary signals; count means for counting one kind of the binary signals; determining means for determining an address of said memory means to be first accessed in accordance with a count of said count means and for determining a decode address of the binary code in accordance with data recorded at the first accessed address of said memory means and remaining portions of the binary code not counted by said count means; and reading means for reading data recorded at the decode address determined by said determining means.
Claim 3
Dependent Claim
16 words
A binary code decoder according to claim 1 wherein the binary code is a variable-length code.
Claim 4
Dependent Claim
23 words
A binary code decoder according to claim 1 wherein said count means counts "0" signals successively from the beginning of the binary code.
Claim 5
Dependent Claim
30 words
A binary code decoder according to claim 1 wherein data recorded in said memory means is provided with a code indicating whether or not the recorded data is decode data.
Claim 6
Dependent Claim
38 words
A binary code decoder according to claim 1 wherein said determining means decides whether data read by said reading means is decode data and, when the data is not decode data, said determining means determines the next address.
Claim 7
Dependent Claim
50 words
A binary code decoder according to claim 1 wherein said determining means decides whether data read by said reading means is decode data and, when the data is not decode data, said determining means determines the next address by adding the data to the remaining portions of the binary code.
Claim 8
Dependent Claim
17 words
A binary code decoder according to claim 1 wherein the binary code is a run length code.
Claim 9
Dependent Claim
104 words
A run length code decoder comprising: memory means containing a decode table for a run length code represented by a code tree; count means for counting the number of predetermined bits included in an input code consisting of a combination of "0's" and "1's", wherein said predetermined bits counted by said count means are leading "0's" in said input code; means for determining an address of said memory means to be first accessed in accordance with a count of said count means; and means for sequentially and selectively accessing addresses of said memory means to produce a decoded signal of said run length code.
Claim 10
Dependent Claim
104 words
A run length code decoder comprising: memory means containing a decode table for a run length code represented by a code tree; count means for counting the number of predetermined bits included in an input code consisting of a combination of "0's" and "1's", wherein said predetermined bits counted by said count means are leading "0's" in said input code; means for determining an address of said memory means to be first accessed in accordance with a count of said count means; and means for sequentially and selectively accessing addresses of said memory means to produce a decoded signal of said run length code.
Claim 11
Dependent Claim
99 words
A run length code decoder comprising: detection means for detecting one input code; count means for counting the number of other input codes; arithmetic operation means for receiving a detection signal from said detection means and a count from said count means and arithmetically operating said count and a predetermined initial value; memory means containing a decode table for a run length code represented by a code tree, an address of said memory means to be first accessed being determined by an output of said arithmetic operation means; and means for outputting a signal decoded by said memory means.
Claim 12
Dependent Claim
99 words
A run length code decoder comprising: detection means for detecting one input code; count means for counting the number of other input codes; arithmetic operation means for receiving a detection signal from said detection means and a count from said count means and arithmetically operating said count and a predetermined initial value; memory means containing a decode table for a run length code represented by a code tree, an address of said memory means to be first accessed being determined by an output of said arithmetic operation means; and means for outputting a signal decoded by said memory means.
Claim 13
Dependent Claim
29 words
A run length code decoder according to claim 9 wherein said detection means detects an input "1" signal and said count means counts the number of input "0" signals.
Claim 14
Dependent Claim
116 words
A run length code decoder comprising: memory means containing a decode table for a run length code represented by a code tree, said memory means determining an address in accordance with an input signal; arithmetic operation means for arithmetically operating a predetermined address set to said memory means, a content at said predetermined address and the next data derived from the input code to determine an address of said memory means to be next read; end detection means for detecting an end of decoding operation based on a signal produced by said memory means; and means for outputting a signal decoded by said memory means in response to a detection signal from said end detection means.
Claim 15
Dependent Claim
116 words
A run length code decoder comprising: memory means containing a decode table for a run length code represented by a code tree, said memory means determining an address in accordance with an input signal; arithmetic operation means for arithmetically operating a predetermined address set to said memory means, a content at said predetermined address and the next data derived from the input code to determine an address of said memory means to be next read; end detection means for detecting an end of decoding operation based on a signal produced by said memory means; and means for outputting a signal decoded by said memory means in response to a detection signal from said end detection means.
Claim 16
Dependent Claim
191 words
A run length code detector comprising: detection means for detecting one input code; count means for counting the number of other input codes; memory means containing a decode table for a run length code represented by a code tree, an address of said memory means to be first accessed being determined by a count of said count means; first arithmetic operation means for receiving a detection signal from said detection means, outputting the count of said count means to said memory means and arithmetically operating a next data derived from the input code and other input signal; second arithmetic operation means for supplying a result of an arithmetic operation of a predetermined address from said first arithmetic operation means and a content at the predetermined address of said memory means, or a predetermined initial value to said memory means and supplying said other input signal to said first arithmetic operation means; end detection means for detecting an end of decoding operation by a signal outputted from said memory means; and means for outputting a signal decoded by said memory means in response to a detection signal from said end detection means.
Claim 17
Dependent Claim
191 words
A run length code detector comprising: detection means for detecting one input code; count means for counting the number of other input codes; memory means containing a decode table for a run length code represented by a code tree, an address of said memory means to be first accessed being determined by a count of said count means; first arithmetic operation means for receiving a detection signal from said detection means, outputting the count of said count means to said memory means and arithmetically operating a next data derived from the input code and other input signal; second arithmetic operation means for supplying a result of an arithmetic operation of a predetermined address from said first arithmetic operation means and a content at the predetermined address of said memory means, or a predetermined initial value to said memory means and supplying said other input signal to said first arithmetic operation means; end detection means for detecting an end of decoding operation by a signal outputted from said memory means; and means for outputting a signal decoded by said memory means in response to a detection signal from said end detection means.
Claim 18
Dependent Claim
29 words
A run length code decoder according to claim 12 wherein said detection means detects an input "1" signal and said count means counts the number of input "0" signals.
Claim 19
Dependent Claim
55 words
A run length code decoder according to claim 12 wherein when said first arithmetic operation means receives the count from said count means and the predetermined initial value from said second arithmetic operation means, the address of said memory means to be first accessed is determined by the output of said first arithmetic operation means.
Claim 20
Dependent Claim
56 words
A run length code decoder according to claim 12 wherein when said first arithmetic operation means receives the next data derived from the input code and the operation result from said second arithmetic operation means, the address of said memory means to be next read is determined by the output of said first arithmetic operation means.
Claim 21
Dependent Claim
28 words
A run length code decoder according to claim 12 wherein said first arithmetic operation means and said second arithmetic operation means are adders for adding input signals thereto.
Claim 22
Dependent Claim
55 words
A run length code decoder according to claim 13, wherein when said first arithmetic operation means receives the count from said count means and the predetermined initial value from said second arithmetic operation means, the address of said memory means to be first accessed is determined by the output of said first arithmetic operation means.
Claim 23
Dependent Claim
56 words
A run length code decoder according to claim 13, wherein when said first arithmetic operation means receives the next data derived from the input code and the operation result from said second arithmetic operation means, the address of said memory means to be next read is determined by the output of said first arithmetic operation means.
Claim 24
Dependent Claim
28 words
A run length code decoder according to claim 13, wherein said first arithmetic operation means and said second arithmetic operation means are adders for adding input signals thereto.
References Cited (Backward Citations)
US3925780A
Cited
US4121259A
Cited
US4207599A
Cited
US4311989A
Cited
US4492983A
Cited
US4475174A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-05-26 | 1989-11-25 | 1990-05-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-05-26 | 1993-11-25 | 1994-05-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-05-26 | 1997-11-25 | 1998-05-27 | $7700.00 | Window Closed / Lapsed |