Reconfigurable Hardware Architectures for Sequential and Hybrid Decoding

A novel reconfigurable sequential decoder architecture based on the Fano algorithm is presented in which the constraint length, the threshold spacing, and the time-out threshold are all run time reconfigurable. To maximize decoding performance, a maximum possible backward depth (of a whole frame) is performed. This is achieved by using shift registers combined with memory to store the information of an entire visited path. A field-programmable gate array) prototype of the decoder is built and actual hardware decoding performances in terms of decoding speeds, bit error rates (BERs), and buffer overflow rates, are obtained and comparisons made. To overcome the decoding delay that is inherent in sequential decoders, a hybrid scheme, including simple block codes and cyclic redundancy check is proposed to limit the number of backward search operations that the sequential decoder has to execute. As a result, a significant reduction in decoding delay and buffer overflow rate is achieved while maintaining comparative decoding performance in terms of BER

[1]  J.R. Cavallaro,et al.  A reconfigurable Viterbi decoder architecture , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[2]  P. Glenn Gulak,et al.  VLSI Structures for Viterbi Receivers: Part I-General Theory and Applications , 1986, IEEE J. Sel. Areas Commun..

[3]  John E. Savage.  The distribution of the sequential decoding computation time , 1966, IEEE Trans. Inf. Theory.

[4]  Dennis Goeckel,et al.  A dynamically reconfigurable adaptive viterbi decoder , 2002, FPGA '02.

[5]  Prashant Jain,et al.  Dynamically Parameterized Algorithms and Architectures to Exploit Signal Variations , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[6]  Stanley J. Simmons,et al.  Sorting-based VLSI architectures for the M-algorithm and T-algorithm trellis decoders , 1995, IEEE Trans. Commun..

[7]  Paul H. Siegel,et al.  Area-efficient architectures for the Viterbi algorithm. I. Theory , 1993, IEEE Trans. Commun..

[8]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[9]  Hsie-Chia Chang,et al.  Design of a power-reduction Viterbi decoder for WLAN applications , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[10]  F. Jelinek.  Fast sequential decoding algorithm using a stack , 1969 .

[11]  D. Falconer.  A hybrid coding scheme for discrete memoryless channels , 1969 .

[12]  Gerhard Fettweis,et al.  Parallel Viterbi algorithm implementation: breaking the ACS-bottleneck , 1989, IEEE Trans. Commun..

[13]  Marios C. Papaefthymiou,et al.  Design of a 20-mb/s 256-state Viterbi decoder , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[14]  Chaitali Chakrabarti,et al.  An approach for adaptively approximating the Viterbi algorithm to reduce power consumption while decoding convolutional codes , 2004, IEEE Transactions on Signal Processing.

[15]  John Cocke,et al.  Bootstrap Hybrid Decoding for Symmetrical Binary Input Channels , 1971, Inf. Control..

[16]  S. Simmons,et al.  A reduced-power algorithm and VLSI architecture for sequential decoding , 2000, 2000 Canadian Conference on Electrical and Computer Engineering. Conference Proceedings. Navigating to a New Era (Cat. No.00TH8492).

[17]  Yiqun Zhu,et al.  A Novel High-Speed Configurable Viterbi Decoder for Broadband Access , 2003, EURASIP J. Adv. Signal Process..

[18]  G. Forney,et al.  A High-Speed Sequential Decoder: Prototype Design and Test , 1971 .

[19]  Tong Zhang.  A high throughput limited search trellis decoder for convolutional code decoding , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[20]  Thomas Noll,et al.  Implementation of scalable power and area efficient high-throughput Viterbi decoders , 2002 .

[21]  Stanley J. Simmons,et al.  Breadth-first trellis decoding with adaptive effort , 1990, IEEE Trans. Commun..

[22]  Liang-Gee Chen,et al.  IC design of an adaptive Viterbi decoder , 1996 .

[23]  John B. Anderson,et al.  Limited search trellis decoding of convolutional codes , 1989, IEEE Trans. Inf. Theory.

[24]  Arne Svensson,et al.  Sequential Decoding of Convolutional Codes for Rayleigh Fading Channels , 2002, Wirel. Pers. Commun..

[25]  Elwyn R. Berlekamp,et al.  A lower bound to the distribution of computation for sequential decoding , 1967, IEEE Trans. Inf. Theory.

[26]  Robert Mario Fano,et al.  A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.

[27]  W. A. Lushbaugh,et al.  Design and preliminary performance tests of a flexible, high speed sequential decoder for deep space channels , 1970 .

[28]  S. Wicker.  Error Control Systems for Digital Communication and Storage , 1994 .

[29]  J. Layland.  Buffer Management for Sequential Decoding , 1974, IEEE Trans. Commun..

[30]  F. Jelinek,et al.  Channel Coding with a Sequential Algebraic Coding Scheme , 1971 .

[31]  Tong Zhang,et al.  Parallel high-throughput limited search trellis decoder VLSI design , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[32]  D.E. Dodds,et al.  A modular bit-serial architecture for large constraint length Viterbi decoding , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[33]  Hannu Tenhunen,et al.  Design of a super-pipelined Viterbi decoder , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[34]  Antonio Ortega,et al.  Buffer control for variable complexity Fano decoders , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[35]  H.-L. Lou,et al.  Implementing the Viterbi algorithm , 1995, IEEE Signal Process. Mag..

[36]  F. Huband,et al.  Implementation of Reed-Solomon Erasure-Correcting Decoder for Hybrid Coding Scheme , 1971 .

[37]  I. Jacobs,et al.  Sequential decoding for efficient communication from deep space , 1967, IEEE Transactions on Communication Technology.

[38]  Javier D. Bruguera,et al.  VLSI implementation of an area-efficient architecture for the Viterbi algorithm , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[39]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[40]  Paul H. Siegel,et al.  Area-efficient architectures for the Viterbi algorithm II. Applications , 1993, IEEE Trans. Commun..

[41]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .

[42]  Mohamed I. Elmasry,et al.  Low-power register-exchange Viterbi decoder for high-speed wireless communications , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[43]  M. Nakagawa,et al.  Reconfigurable systolic Viterbi decoder , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[44]  K.M. Chugg,et al.  Algorithm and circuit co-design for a low-power sequential decoder , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).