Large constraint length high speed viterbi decoder based on a modular hierarchial decomposition of the deBruijn graph
US5068859A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jun 19, 1989 |
| Grant date | Nov 26, 1991 |
| Priority date | — |
| Expiry date | Jun 19, 2009 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/41
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A method of formulating and packaging decision-making elements into a long constraint length Viterbi decoder which involves formulating the decision-making processors as individual Viterbi butterfly processors that are interconnected in a deBruijn graph configuration. A fully distributed architecture, which achieves high decoding speeds, is made feasible by novel wiring and partitioning of the state diagram. This partitioning defines universal modules, which can be used to build any size decoder, such that a large number of wires is contained inside each module, and a small number of wires is needed to connect modules. The total system is modular and hierarchical, and it implements a large proportion of the required wiring internally within modules and may include some external wiring to fully complete the deBruijn graph. pg,14
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.