Method of efficient branch metric computation for a Viterbi convolutional decoder
US5912908A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Nov 21, 1997 |
| Grant date | Jun 15, 1999 |
| Priority date | — |
| Expiry date | Nov 21, 2017 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L1/0054
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method of efficient branch metric computation for a Viterbi convolutional decoder wherein a reduced and optimized set of branch metrics is distributed among one or more base sets is provided. A sequence of data transformations and associations are defined according to the connections of the delay elements in the convolutional encoder to its outputs. Each encoder state is associated with one of the base sets and one of several groups of path metric equations. During the add portion of the add-compare-select phase of Viterbi decoding, a branch metric value is extracted from the base set associated with the encoder state being evaluated. The group of path metric equations associated with state being evaluated are evaluated using the extracted branch metric value. The results of the addition are then be processed according to the remaining steps of the Viterbi algorithm.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.