US5042036A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Process for realizing the Viterbi-algorithm by means of parallel working structures
Assignee: HEINRICH MEYR EUPENER STR 356 D-5100 AACHEN GERMANY
•
Filing: 1988-06-29
•
Granted: 1991-08-20
•
Expires: 2008-06-29
Abstract
Abstract A method for implementing the Viterbi algorithm (Viterbi decoder) for very high data rates/decoding rates. The trellis diagram (original trellis diagram) of the Markov process, the original trellis diagram being the basis of such implementation, is considered over a greater period. Transitions of the original trellis diagram are combined in one multi-step transition (multi-step trellis diagram) per each M. The number of transition branches, which rise exponentially, in such a process with M, is reduced to a smaller number by exploiting fundamental properties of the original trellis diagram forming the basis of the multi-step transitions. This eliminates non-optimal transition branches irrespective of the change from one multi-step transition to another. This permits the design of Viterbi decoders for very high data rates, as more time is available for executing the computing operations on number of computers as compared to the maximum permissible time for executing similar (identical) operations in the implementation of the Viterbi algorithm based on the one-step transition of the original trellis diagram.
Inventors
- 👤 Gerhard P. Fettweis
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:25
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/3972; H03M13/395; H03M13/41
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
148 words
A method for implementing and carrying out the Viterbi algorithm with the help of parallel-processing structures, for any desired trellis diagram, comprising: combining blocks of M>1 transitions of the original trellis diagram into multi-step transitions (leading to a multi-step trellis diagram); preprocessing each M-step transition separately using the Viterbi algorithm (based on the original trellis diagram) before decoding the M-step diagram, to reduce the number of computing operations, said number of computing operations rising asymptotically exponentially with M due to the introduction of the multi-step trellis diagram; and allocating the execution of the computing operations to a number of computers in such a way that at a predetermined data rate/decoding rate, the computers have more time available for the execution of the computing operations than the maximally permissible time for executing computing operations in the implementation of the Viterbi algorithm based on the one-step transition (original trellis diagram).
Claim 2
Independent Claim
148 words
A method for implementing and carrying out the Viterbi algorithm with the help of parallel-processing structures, for any desired trellis diagram, comprising: combining blocks of M>1 transitions of the original trellis diagram into multi-step transitions (leading to a multi-step trellis diagram); preprocessing each M-step transition separately using the Viterbi algorithm (based on the original trellis diagram) before decoding the M-step diagram, to reduce the number of computing operations, said number of computing operations rising asymptotically exponentially with M due to the introduction of the multi-step trellis diagram; and allocating the execution of the computing operations to a number of computers in such a way that at a predetermined data rate/decoding rate, the computers have more time available for the execution of the computing operations than the maximally permissible time for executing computing operations in the implementation of the Viterbi algorithm based on the one-step transition (original trellis diagram).
Claim 3
Dependent Claim
31 words
The method as set forth in claim 1, wherein the number (M) of transitions of the original trellis diagram combined in the multi-step transition in the multi-step trellis diagram is variable.
Claim 4
Dependent Claim
106 words
The method as set forth in claim 2, wherein the transition branches of the multi-step trellis diagram are again assembled from their original M transition branches of the multi-step trellis diagram are again assembled from their original M transition branches of the original trellis diagram and subsequently combined to trellis diagrams in a way such that the Viterbi algorithm is used for eliminating non-optimal transition branches in which case the Viterbi algorithm is executed only via a maximum limited number of M o =M recursions and that only the lower number of the selected transition branches is used for the decoding of the multi-step trellis diagram.
Claim 5
Dependent Claim
77 words
The method as set forth in claim 3, wherein for large M's and on the basis of all trellis diagrams jointly describing one multi-step transition, the Viterbi algorithm is executed only for one trellis diagram via all transitions of the trellis diagram, whereas for all other trellis diagrams, the Viterbi algorithm is executed only via F steps/transitions and the routes and metrices selected are supplemented according to the routes and metrices of the completely executed Viterbi algorithm.
Claim 6
Dependent Claim
30 words
The method as set forth in claim 4, wherein each Viterbi algorithm not completely executed is discontinued after F i transitions, where the numbers F i may differ from F.
Claim 7
Dependent Claim
18 words
The method as set forth in claim 3, wherein M o is less than or equal to M.
Claim 8
Dependent Claim
92 words
The method as set forth in claim 1, wherein the transition branches of the multi-step trellis diagram are again assembled from their original M transition branches of the original trellis diagram and subsequently combined to trellis diagrams in a way such that the Viterbi algorithm is used for eliminating non-optimal transition branches in which case the Viterbi algorithm is executed only via a maximum limited number of M o =M recursions and that only the lower number of the selected transition branches is used for the decoding of the multi-step trellis diagram.
Claim 9
Dependent Claim
42 words
The method as defined in claim 1, wherein the multi-step transition branches are combined in trellis diagrams in a way such that all transition branches of the multi-step trellis diagram starting from the same state are combined in exactly one trellis diagram.
Claim 10
Dependent Claim
38 words
The method as set forth in claim 8, wherein all trellis diagrams jointly describing one transition (multi-step) of the multi-step trellis diagram are formed in a way such that said trellis diagrams have the same number of transitions.
Claim 11
Dependent Claim
45 words
The method as set forth in claim 1, wherein any desired quantity of trellis diagrams with limited numbers of transitions are used as the basis for the Viterbi algorithm in the inverse direction (inverse Markov process) instead of their given direction (=sequence of the transitions).
Claim 12
Dependent Claim
18 words
The method as set forth in claim 1, wherein the method may be performed in any desired sequence.
Claim 13
Dependent Claim
33 words
The method as set forth in claim 1, wherein the basic method of introducing an additional hierarchy stage by means of the multi-step trellis diagram is applied to the multi-step trellis diagram itself.
Claim 14
Dependent Claim
196 words
The method of executing the Viterbi algorithm as set forth in claim 1 wherein each transition of the multi-step trellis diagram is based again on its original trellis diagram, the latter being limited across M steps/transitions and complete with respect to the transition branches, such a trellis diagram is expanded by additional F transitions in a way such that when using a Viterbi algorithm for decoding such trellis diagram, such additional F transitions are used in the beginning in order to assure with high probability that in the further execution of Viterbi algorithm on the M transitions (corresponding with the original trellis diagram) of the multi-step transition, the optimal route is obtained as one of the routes (as it would have been found by a continuously executed Viterbi algorithm), and further including the steps of: executing this Viterbi algorithm independently from one multi-step transition to another on a number of independent computers; and processing the routes so obtained, with the help of a superior computer in order to decode the optimal route conforming to the survivor memory of the Viterbi algorithm for decoding the multi-step trellis diagram, such routes extending via a limited number of transitions.
Claim 15
Dependent Claim
37 words
The method as set forth in claim 13, wherein at least one trellis diagram derivable from the original trellis diagram by the combining of transitions is used alternately with the original trellis diagram in any desired sequence.
Claim 16
Dependent Claim
33 words
The method as set forth in claim 13, wherein at least one trellis diagram derivable from the original trellis diagram by the combining of transitions is used instead of the original trellis diagram.
Claim 17
Dependent Claim
33 words
The method as set forth in claim 13, wherein M is larger than the required survivor length B (M>B); and no feedback exists across several multi-step transitions for decoding the multi-step trellis diagram.
Claim 18
Dependent Claim
90 words
The method as set forth in claim 16, wherein additional B transitions are added to each trellis diagram extending over a limited number of F+M transitions (whereby B corresponds with the required survivor length) in a way such that said B transitions are processed by the executed Viterbi algorithm as the last transitions, the distinct route of the decoded transition of the multi-step trellis diagram (=M transitions of the original trellis diagram) is output independent of all other transitions of the multi-step trellis diagram, and no superior computer is required.
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) | 1994-08-19 | 1995-02-18 | 1995-08-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-08-19 | 1999-02-18 | 1999-08-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-08-19 | 2003-02-18 | 2003-08-20 | $7700.00 | Window Closed / Lapsed |