De bruijn graph based VLSI viterbi decoder

摘要

The disclosed system uses a binary tree which is embedded in a De Bruijn graph to sort the survivor paths based on their path metrics. The system includes a sorting algorithm which is implemented in a pipelined fashion. The same communication structure underlining the De Bruijn graph is used, so that no additional communication overhead is required for sorting. The system implementation is parallel resulting in a high throughput.