Citation
Abstract
A new Viterbi decoder for convolutional codes with constraint lengths up to 15, called the Big Viterbi Decoder, is under development for the Deep Space Network. It will be demonstrated by decoding data from the Galileo spacecraft, which has a rate 1/4, constraint-length 15 convolutional encoder on board. In this article, the mathematical theory underlying the design of the very-large-scale-integrated (VLSI) chips that are being used to build this decoder is explained. The deBruijn graph B,, describes the topology of a fully parallel, rate 1/v, constraint length n+2 Viterbi decoder, and it is shown that B, can be built by appropriately “wiring together” (i.e., connecting together with extra edges) many isomorphic copies of a fixed graph called a “B, building block.” The efficiency of such a building block is defined as the fraction of the edges in B,, that are present in the copies of the building block. It 1s shown, among other things, that for any a < 1, there exists a graph G which is a B, budding block of efficiency > a for all sufficiently large n. These results are illustrated by describing a special hierarchical family of deBruijn building blocks, which has led to the design of the gate-array chips being used in the Big Viterbi Decoder.
Details
- Volume
- 42-100
- Published
- February 15, 1990
- Pages
- 180–190
- File Size
- 516.2 KB