US4295125A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and means for pipeline decoding of the high to low order pairwise combined digits of a decodable set of relatively shifted finite number of strings
Assignee: International Business Machines Corp
•
Filing: 1980-04-28
•
Granted: 1981-10-13
•
Expires: 2000-04-28
Abstract
Abstract An apparatus for ensuring continuous flow through a pipeline processor as it relates to the serial decoding of FIFO Rissanen/Langdon arithmetic string code of binary sources. The pipeline decoder includes a processor (11, 23) and a finite state machine (21, FSM) in interactive signal relation. The processor generates output binary source signals (18), status signals (WASMPS, 31) and K component/K candidate next integer-valued control parameters (L0, k0; L1, k1; 25). These signals and parameters are generated in response to the concurrent application of one bit from successive arithmetic code bits, a K component present integer-value control parameter (52) and K component vector representation (T, TA) of the present internal state (51) of the associated finite state machine (FSM). The FSM makes a K-way selection from K candidate next internal states and K candidate next control parameters. This selection uses no more than K 2 +K computations. The selected signals are then applied to the processor in a predetermined displaced time relation to the present signals in the processor. As a consequence, this system takes advantage of the multi-state or "memory" capability of an FSM in order to control the inter-symbol influence and facilitate synchronous multi-stage pipeline decoding.
Inventors
- 👤 Glen G. Langdon, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 09:56
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/4006
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
171 words
A recursively operating information handling system comprising a processor (11, 23) and a finite state machine (21, FSM) in interactive signal relation, CHARACTERIZED IN THAT: the processor includes: means (FIG. 6/201, 202) for generating output signals (18), K component/K candidate next integer-valued control parameters (L0, k0; L1, k1; 25) and status signals (WASMPS, 31) jointly responsive to successive coded input signals (5, 7, 9), K component present integervalued control parameters (52), and a K component vector representation (T, TA) of the FSM present internal state (51); the FSM includes: calculating means (113); memory means (109, 111, 115-121) for storing vector representations of the present and K next candidate FSM internal states and K next candidate control parameters; and means (FIG. 5/123, 216, 52; 124, 220) including the calculating means responsive to the generated status signals and parameters from the processor for accessing the memory means and for selecting the next internal state and next parameter by making a K-way selection from the K candidate internal states and the K candidate parameters.
Claim 2
Dependent Claim
171 words
A recursively operating information handling system comprising a processor (11, 23) and a finite state machine (21, FSM) in interactive signal relation, CHARACTERIZED IN THAT: the processor includes: means (FIG. 6/201, 202) for generating output signals (18), K component/K candidate next integer-valued control parameters (L0, k0; L1, k1; 25) and status signals (WASMPS, 31) jointly responsive to successive coded input signals (5, 7, 9), K component present integervalued control parameters (52), and a K component vector representation (T, TA) of the FSM present internal state (51); the FSM includes: calculating means (113); memory means (109, 111, 115-121) for storing vector representations of the present and K next candidate FSM internal states and K next candidate control parameters; and means (FIG. 5/123, 216, 52; 124, 220) including the calculating means responsive to the generated status signals and parameters from the processor for accessing the memory means and for selecting the next internal state and next parameter by making a K-way selection from the K candidate internal states and the K candidate parameters.
Claim 3
Dependent Claim
52 words
A system according to claim 1, wherein the FSM executes the K-way selection in no more than K 2 +K calculations, and further wherein the vector representation of the next internal state and parameters are applied to the processor in predetermined displaced time relation to the present internal state vectors and parameters.
Claim 4
Dependent Claim
41 words
A system according to claim 1, wherein each K component vector representation of either a present or next FSM internal state consists of two components T, TA, in which T is an arbitrary number string and TA is a trial augend.
Claim 5
Dependent Claim
77 words
A system according to claim 1, wherein, the processor includes: register means (201) for storing successive coded input signals; means (5, 7, 15) for shifting said input signals into the input register means; and a subtract and shift circuit (FIG. 6/201, 202, 203) for executing a magnitude difference operation between the register stored input signals and at least one component of the K component FSM present internal state vector, and for generating an output signal responsive thereto.
Claim 6
Dependent Claim
26 words
A system according to claim 4, wherein the component of the present internal state used for executing the magnitude difference operation is an updated trial augend.
Claim 7
Dependent Claim
28 words
A system according to claim 1, wherein successive coded input signals form a FIFO arithmetic code string, and further, wherein successive output signals form a binary symbol string.
Claim 8
Independent Claim
177 words
An apparatus for recursively decoding an instantaneous FIFO binary arithmetic number string into a series of binary source symbols comprising: first means (23) for generating a binary source symbol (18) by the magnitude comparison between a predetermined portion of an arithmetic code string applied thereto and an updated trial augend, said first means includes means (202, 203) responsive to a present integer-valued parameter for controlling the relative magnitude between the arithmetic code string and the updated trial augend; and means for generating a status signal (WASMPS, 31) identifying the Boolean value of the previous bit decoded; second means (11) responsive to the output signal for accessing K component/K candidate next integervalued control parameters (L0, k0; L1, k1; 25) and third means (21) including a memory for storing vector representations of the present and K next candidate control parameters and K next trial augends for K-way selecting and updating the trial augend from said candidates and applying them to said first means in predetermined displaced time relation to the next candidate control parameters applied to said third means.
Claim 9
Independent Claim
177 words
An apparatus for recursively decoding an instantaneous FIFO binary arithmetic number string into a series of binary source symbols comprising: first means (23) for generating a binary source symbol (18) by the magnitude comparison between a predetermined portion of an arithmetic code string applied thereto and an updated trial augend, said first means includes means (202, 203) responsive to a present integer-valued parameter for controlling the relative magnitude between the arithmetic code string and the updated trial augend; and means for generating a status signal (WASMPS, 31) identifying the Boolean value of the previous bit decoded; second means (11) responsive to the output signal for accessing K component/K candidate next integervalued control parameters (L0, k0; L1, k1; 25) and third means (21) including a memory for storing vector representations of the present and K next candidate control parameters and K next trial augends for K-way selecting and updating the trial augend from said candidates and applying them to said first means in predetermined displaced time relation to the next candidate control parameters applied to said third means.
Claim 10
Dependent Claim
170 words
A recursively operated information handling system comprising a processor and a finite state machine (FSM) in interactive signal relation, the processor includes: means for generating output signals, K component/K candidate next integer-valued control parameters, and status signals jointly responsive to successive coded input signals, K component present integer-valued control parameter and K component vector representation of the FSM present internal state; the FSM includes: calculating means; memory means for storing vector representation of present and K next candidate FSM internal states and K next candidate control parameters; means, including the calculating means, responsive to the status signal and parameters for accessing the memory means and for selecting the next internal state and next parameter by making a K-way selection from the K-candidate internal states and K candidate next control parameters using more than K 2 +K computations, the selected next state signals being applied to the processor in predetermined displaced time relation to the present state signals, whereby substantially continuous and uninterrupted flow of data through the system is maintained.
Claim 11
Dependent Claim
170 words
A recursively operated information handling system comprising a processor and a finite state machine (FSM) in interactive signal relation, the processor includes: means for generating output signals, K component/K candidate next integer-valued control parameters, and status signals jointly responsive to successive coded input signals, K component present integer-valued control parameter and K component vector representation of the FSM present internal state; the FSM includes: calculating means; memory means for storing vector representation of present and K next candidate FSM internal states and K next candidate control parameters; means, including the calculating means, responsive to the status signal and parameters for accessing the memory means and for selecting the next internal state and next parameter by making a K-way selection from the K-candidate internal states and K candidate next control parameters using more than K 2 +K computations, the selected next state signals being applied to the processor in predetermined displaced time relation to the present state signals, whereby substantially continuous and uninterrupted flow of data through the system is maintained.
References Cited (Backward Citations)
US4025771A
Cited
US4122440A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-10-12 | 1985-04-13 | 1985-10-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-10-12 | 1989-04-13 | 1989-10-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-10-12 | 1993-04-13 | 1993-10-13 | $7700.00 | Window Closed / Lapsed |