US4152697A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Parallel run-length decoder
Assignee: Xerox Corp
•
Filing: 1976-08-11
•
Granted: 1979-05-01
•
Expires: 1996-08-11
Abstract
Abstract System and method for parallel decoding of character data in run length format to produce data in dot matrix form for presentation to a display device. The data for successive runs is stored in registers and processed in parallel to provide address data for memory devices programmed to deliver predetermined output data patterns in response to the address data.
Inventors
- 👤 Ronald E. Rider
- 👤 Butler W. Lampson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 03:40
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/46; G; G06; G06T; G06T9/00; G06T9/005; G09; G09G; G09G5/00; G09G5/22; G09G5/24; G09G5/42
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
105 words
A decoder for parallel conversion of binary run length data to a dot matrix format for presentation to a display, comprising: register means for storing binary coded data representing the lengths of successive runs of dots to be displayed, output means for selectively delivering predetermined patterns of output data in the dot matrix format in accordance with input signals applied thereto, and means responsive concurrently to a plurality of digits of the coded data in the register means for applying input signals to the output means to cause said means to deliver output data patterns for runs of the lengths represented by the coded data.
Claim 2
Dependent Claim
105 words
A decoder for parallel conversion of binary run length data to a dot matrix format for presentation to a display, comprising: register means for storing binary coded data representing the lengths of successive runs of dots to be displayed, output means for selectively delivering predetermined patterns of output data in the dot matrix format in accordance with input signals applied thereto, and means responsive concurrently to a plurality of digits of the coded data in the register means for applying input signals to the output means to cause said means to deliver output data patterns for runs of the lengths represented by the coded data.
Claim 3
Dependent Claim
15 words
The decoder of claim 1 wherein the output means comprises a programmable read only memory.
Claim 4
Dependent Claim
35 words
The decoder of claim 1 wherein the means for applying input signals to the output means comprises a plurality of binary adders connected in a tree network between the register means and the output means.
Claim 5
Dependent Claim
74 words
In a system for generating characters for display in a dot matrix format on a medium scanned in discrete lines: means for providing coded number data representing the lengths of successive runs of dots in each scan line passing through a character, means for decoding a plurality of the digits of the number data in parallel, and means for providing output data patterns in the dot matrix format for presentation to the display medium.
Claim 6
Dependent Claim
74 words
In a system for generating characters for display in a dot matrix format on a medium scanned in discrete lines: means for providing coded number data representing the lengths of successive runs of dots in each scan line passing through a character, means for decoding a plurality of the digits of the number data in parallel, and means for providing output data patterns in the dot matrix format for presentation to the display medium.
Claim 7
Dependent Claim
64 words
The system of claim 4 wherein the means for providing output data patterns includes a memory device programmed to provide predetermined output data patterns in response to predetermined address inputs, and said means for decoding includes means responsive to the coded data for applying address inputs to the memory device, whereby the data patterns produced by the output device correspond to the coded data.
Claim 8
Dependent Claim
99 words
In a decoder for converting binary coded run length data to a dot matrix format for display on a medium scanned in discrete lines: a plurality of input registers, means for applying the data for successive runs to successive ones of the registers, memory means programmed to provide predetermined output data patterns in the dot matrix format in response to address inputs applied thereto, and a plurality of binary adders connected in a tree network between the input registers and the memory means for parallel processing of the run length data to provide address inputs for the memory means.
Claim 9
Dependent Claim
99 words
In a decoder for converting binary coded run length data to a dot matrix format for display on a medium scanned in discrete lines: a plurality of input registers, means for applying the data for successive runs to successive ones of the registers, memory means programmed to provide predetermined output data patterns in the dot matrix format in response to address inputs applied thereto, and a plurality of binary adders connected in a tree network between the input registers and the memory means for parallel processing of the run length data to provide address inputs for the memory means.
Claim 10
Dependent Claim
32 words
The decoder of claim 6 wherein the memory means comprises a plurality of programmable read only memories (PROM's) and means for combining the outputs of the PROM's in a logical OR function.
Claim 11
Dependent Claim
38 words
The decoder of claim 6 wherein successive portions of the data are decoded during successive clock cycles, together with means for clearing the register for each run when all of the data for that run has been decoded.
Claim 12
Dependent Claim
52 words
The decoder of claim 6 wherein successive portions of the data are decoded during successive clock cycles and the means for applying the data to each input register includes means for replacing the data for a partially decoded run with the portion of the data yet to be decoded for that run.
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) | 1982-04-30 | 1982-10-30 | 1983-05-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1986-04-30 | 1986-10-30 | 1987-05-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1990-04-30 | 1990-10-30 | 1991-05-01 | $7700.00 | Window Closed / Lapsed |