About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
Area-efficient architectures for the Viterbi algorithm
Abstract
An architecture model for area-efficient implementation of the Viterbi algorithm is described. The authors present a systematic way of partitioning and scheduling N trellis states into P add-compare-selects (N > P), which are connected by a fixed-interconnection or a multistage-interconnection network. The proposed architecture allows pipelining to increase the throughput rate even when the channel has memory or intersymbol interference. Design strategies of path metric storage are also discussed. Favorable results are presented for trellises of de Bruijn graphs and matched-spectral-null (MSN) trellis codes.