Patent US4583078A successfully refreshed from Google Patents.
US4583078A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Serial Viterbi decoder
Assignee: Comsat Corp
•
Filing: 1984-11-13
•
Granted: 1986-04-15
•
Expires: 2004-11-13
Abstract
Abstract A serial Viterbi decoder in which a single set of circuits is sequentially used for all the encoder states to calculate the maximum probability path, as measured against received signals, of unencoded signal sequences to reach each encoder state. The path to any encoder state having the maximum probability is traced back to output the oldest encoded signals.
Inventors
- 👤 Ajit Shenoy
- 👤 Peter N. Johnson, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 15:30
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/41
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
278 words
A Viterbi decoder for use in decoding a signal generated by an encoder processing as input a sequence of a plurality of possible encoder states and advancing through said sequence to produce in each of a plurality of decoding periods a transmitted signal dependent upon said sequence in accordance with a code, said decoder comprising: signal receiving means for quantizing for one of said decoding periods a received signal resultant from said transmitted signal; means for generating a plurality of replicas of transmitted signals that would lead to one of a plurality of new encoder states, each replica leading to said new encoder state via an associated branch; comparing means for measuring a difference between said quantized received signal and each of said replicas, said difference being a branch metric of the branch associated with said each replica; adding means for adding said branch metric to a state metric of a prior encoder state linked to said new encoder state by said associated branch; selecting means for selecting the branch to said new encoder state which has the minimum sum of said added branch metric and state metric, said minimum sum being the state metric of said new encoder state, whereby said selected branch and a path associated with the prior encoder state linked to said new encoder state by said selected branch defines the path associated with said new encoder state; means for sequentially generating said new encoder states, wherein said replica generating means, said comparing means and said selecting means complete their operation upon one said new encoder state between the times said state generating means generates said new encoder states in said one decoding period.
Claim 2
Dependent Claim
278 words
A Viterbi decoder for use in decoding a signal generated by an encoder processing as input a sequence of a plurality of possible encoder states and advancing through said sequence to produce in each of a plurality of decoding periods a transmitted signal dependent upon said sequence in accordance with a code, said decoder comprising: signal receiving means for quantizing for one of said decoding periods a received signal resultant from said transmitted signal; means for generating a plurality of replicas of transmitted signals that would lead to one of a plurality of new encoder states, each replica leading to said new encoder state via an associated branch; comparing means for measuring a difference between said quantized received signal and each of said replicas, said difference being a branch metric of the branch associated with said each replica; adding means for adding said branch metric to a state metric of a prior encoder state linked to said new encoder state by said associated branch; selecting means for selecting the branch to said new encoder state which has the minimum sum of said added branch metric and state metric, said minimum sum being the state metric of said new encoder state, whereby said selected branch and a path associated with the prior encoder state linked to said new encoder state by said selected branch defines the path associated with said new encoder state; means for sequentially generating said new encoder states, wherein said replica generating means, said comparing means and said selecting means complete their operation upon one said new encoder state between the times said state generating means generates said new encoder states in said one decoding period.
Claim 3
Dependent Claim
16 words
A Viterbi decoder as recited in claim 1, wherein said generating means sequentially generates said replicas.
Claim 4
Dependent Claim
26 words
A Viterbi decoder as recited in claim 1, wherein said selecting means comprises: a state metric memory for storing state metrics for all new encoder states.
Claim 5
Dependent Claim
51 words
A Viterbi decoder is recited in claim 1, further comprising: means for selecting the minimum of all state metrics of said new encoder states; and means for subtracting said selected minimum state metric from each of said state metrics of each said new encoder state to form an adjusted state metric.
Claim 6
Dependent Claim
26 words
A Viterbi decoder as recited in claim 3, wherein said comparing means comprises a memory containing differences addressed by said quantized received signal and said replica.
Claim 7
Dependent Claim
39 words
A Viterbi decoder as recited in claim 5, further comprising: a path memory for storing a designator for each selected branch; and means for tracing one of said paths in said path memory over a plurality of decoding periods.
Claim 8
Dependent Claim
52 words
A Viterbi decoder as recited in claim 6: further comprising means for selecting the minimum of all state metrics of said new encoder states; and wherein said tracing means traces said one path beginning at the designator to the selected branch linked to new encoder state having said selected minimum state metric.
Claim 9
Independent Claim
240 words
A method for Viterbi decoding a signal generated by an encoder processing as input a sequence of a plurality of possible encoder states and advancing through said sequence to produce in each of a plurality of decoding periods a transmitted signal dependent upon said sequence in accordance with a code, said method comprising the steps of: measuring a received signal once per a decoding period; generating one of a plurality of encoder states; generating a plurality of replicas of a transmitted signal that would lead to said generated encoder state, each replica leading to said generated encoder state via an associated branch; measuring differences between said measured received signal and each of said replicas of each of said branches; adding said difference of each said branch to a state metric of an encoder state of a prior decoding period linked to said generated encoder state by said associated branch; selecting the branch to said generated encoder state having the minimum sum of said difference and state metric, said minimum sum being the state metric of said generated encoder state, whereby said selected branch and a path associated with the encoder state of said prior encoding period linked to said generated encoder state by said selected branch defines the path associated with said generated encoder state; and repeating said state generating, replica generating, distance measuring, adding and selecting steps for a plurality of said encoder states in said one decoding period.
Claim 10
Independent Claim
240 words
A method for Viterbi decoding a signal generated by an encoder processing as input a sequence of a plurality of possible encoder states and advancing through said sequence to produce in each of a plurality of decoding periods a transmitted signal dependent upon said sequence in accordance with a code, said method comprising the steps of: measuring a received signal once per a decoding period; generating one of a plurality of encoder states; generating a plurality of replicas of a transmitted signal that would lead to said generated encoder state, each replica leading to said generated encoder state via an associated branch; measuring differences between said measured received signal and each of said replicas of each of said branches; adding said difference of each said branch to a state metric of an encoder state of a prior decoding period linked to said generated encoder state by said associated branch; selecting the branch to said generated encoder state having the minimum sum of said difference and state metric, said minimum sum being the state metric of said generated encoder state, whereby said selected branch and a path associated with the encoder state of said prior encoding period linked to said generated encoder state by said selected branch defines the path associated with said generated encoder state; and repeating said state generating, replica generating, distance measuring, adding and selecting steps for a plurality of said encoder states in said one decoding period.
Claim 11
Dependent Claim
44 words
A method of Viterbi decoding as recited in claim 8, further comprising the steps of: storing designators for all branches selected in a plurality of decoding periods in a memory; and tracing one said path in said memory for a plurality of decoding periods.
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) | 1989-04-14 | 1989-10-14 | 1990-04-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-04-14 | 1993-10-14 | 1994-04-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-04-14 | 1997-10-14 | 1998-04-15 | $7700.00 | Window Closed / Lapsed |