A CMOS IC for Gb/s Viterbi decoding: system design and VLSI implementation
نویسندگان
چکیده
AbstructAt present, the Viterbi algorithm (VA) is widely used in communication systems for decoding and equalization. The achievable speed of conventional Viterbi decoders (VD’s) is limited by the inherent nonlinear add-compare-select (ACS) recursion. The aim of this paper is to describe system design and VLSI implementation of a complex system of fabricated ASIC’s for high speed Viterbi decoding using the “minimized method” (MM) parallelized VA. We particularly emphasize the interaction between system design, architecture and VLSI implementation as well as system partitioning issues and the resulting requirements for the system design flow. Our design objectives were 1) to achieve the same decoding performance as a Conventional VD using the parallelized algorithm, 2) to achieve a speed of more than 1 Gb/s, and 3) to realize a system for this task using a single cascadable ASIC. With a minimum system configuration of four identical ASIC’s produced by using 1.0 p CMOS technology, the design objective of a decoding speed of 1.2 Gb/s is achieved. This means, compared to previous implementations of Viterbi decoders, the speed is increased by an order of magnitude.
منابع مشابه
Design Trade-offs in the VLSI Implementation of High-Speed Viterbi Decoders and their Application to MLSE in ISI Cancellation
A 64 state fully parallel Viterbi decoder in 90 nm CMOS technology compatible with WLAN IEEE 802.11 standard is described. Optimisation of different decoder architectures ranging from radix-2 to radix-16 for reaching multi-Gb/s throughput is performed and trade-offs w.r.t. energy efficiency and area are laid out. Best simulated throughput after placement and routing reaches the value of 3.1Gb/s...
متن کاملNovel Viterbi decoder VLSI implementation and its performance
This paper presents an advanced, high-speed, and universal-coding-rate Viterbi decoder VLSI implementation. Two novel circuit design schemes have been proposed: “scarce state transition (SST)” and “direct high-coding-rate convolutional code generation and variable-rate Viterbi decoding.” SST makes it possible to omit the final decision circuit and to reduce the required path memory length witho...
متن کاملReduced-complexity column-layered decoding and implementation for LDPC codes
Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low complexity column-layered decoding schemes and VLSI architectures for multi-Gb/s applications. At first, the Min-Sum algorithm is incorporated into the column-layered...
متن کاملA VLSI Implementation of a Cascade Viterbi Decoder with Traceback
A novel VLSI implementation of the Viterbi algorithm based on a cascade architecture is presented. Survivor sequence memory management is implemented using a new single read pointer traceback technique. The overall design for a 16-qtate, rate 1/2 decoder requires about 26000 transistors and a core area of 8.5 mma in a 1.2 pm two-level metal CMOS technology.
متن کاملVLSI Architecture of Configurable Low Complexity Hard Decision Viterbi Decoder
A Viterbi algorithm has served as a powerful method for decoding of the convolutional code so as to control errors in data transmission over a noisy channel. It is based on maximum likelihood algorithm for decoding the data. However, the hardware implementation of Viterbi algorithm become crucial as it consumes large resources due to its complexity. This paper discusses the implementation of an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. VLSI Syst.
دوره 4 شماره
صفحات -
تاریخ انتشار 1996