Open Access Open Access  Restricted Access Subscription or Fee Access

FPGA Implementation of Digit-Serial Architecture for Various Digit-Size and Wordlength in Viterbi Decoder

T. Kalavathidevi, K.V. Punitha, Dr. C. Venkatesh

Abstract


Convolutional code is an essential Forward Error Correcting (FEC) code for many wireless communication systems. Viterbi decoder is an optimal algorithm for decoding a convolution code. The design of an efficient Integrated Circuit (IC) in terms of power, area and speed simultaneously has become a challenging problem. Power dissipation is recognized as a critical parameter in modern Very Large Scale Integrated circuit (VLSI) design field. The major source of power dissipation is dynamic power dissipation, which is due to the total switching activity. Viterbi decoder employed in digital wireless communication is complex and dissipates large power. The proposed method focuses on power reduction of Viterbi decoderat architecture level. The proposed method is to obtain high speed and low power Viterbi decoder using digit-serial architecture for various digit size and word length. In the digit-serial architecture N bits are processed per clock cycle and a word is processed per W/N clock cycles (W-word length, N-digit size). Digit-serial architecture achieves high speed and low power. Viterbi decoder is designed with code rate k/n=¼, constraint length K= 3, word length W=8, 32 and digit size N=2, 4. The functionality is simulated and verified using Modelsim and synthesized using Xilinx FPGA SPARTAN3.

Keywords


Digit-Serial Architecture, Digit-Size, Unfolding

Full Text:

PDF

References


Keshab K.parhi, VLSI digital signal processing systems: design and implementation, A Wilsey-Interaction publication 1999.

Keshab K.parhi, “ A systematic approach for design of digit-serial signal processing architectures,” IEEE Trans. Circuits and Systems, vol. 38,No. 4,April 1991.

Irfan Habib, Ozgun Paker and Sergei Sawitzki, “Design Space Exploration of Hard-Decision Viterbi Decoding Algorithm and VLSI Implementation.,” IEEE Trans. on Very Large Scale Integration VLSI Systems, Vol.18, No.5, pp.794-807.

Seongjoo Lee “An efficient implementation method of parallel processing viterbi decoders for UWB systems,” International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON, pp.512-515.

Lei-ou Wang and Zhe-ying Li , “Design and implementation of a parallel processing Viterbi decoderusing FPGA,” International Conference on Artificial Intelligence and Education (ICAIE), pp.77-80.

P. K Meher , “High-throughput hardware-efficient digit-serial architecture for field multiplication over GF (2m),” International Conference on Information, Communications & Signal Processing, pp.1-5.

Levent Aksoy, Cristiano Lazzari, Eduardo Costa, Paulo Flores and Jose Monteiro (2011), “Optimization of area in digit-serial Multiple Constant Multiplications at gate-level.” IEEE International Conference on Circuits and Systems (ISCAS), pp. 2737-2740.

Lupin Chen, Jinjin He, and Zhongfeng Wang, “Design of Low-Power Memory-Efficient Viterbi Decoder.” IEEE Workshop on Signal Processing Systems, pp.132-135, Nov.2007.

Sunil P. Joshi and Roy Paily, “Low Power Viterbi decoderby Modified ACSU architecture and Clock Gating Method.” International conference on Communications and Signal Processing (ICCSP), 2011, pp.499-503.

Min Woo Kim and Jun Dong Cho, “A VLSI design of high speed bit-level viterbi decoder.” IEEE Asia Pacific Conference on Circuits and Systems, 2006. APCCAS 2006, pp.309-312.

.Kalavathidevi T. and Venkatesh C. “FPGA implementation of bit-level pipelined digit-serial unfolding VLSI architecture for a Viterbi decoder.”GESTS International Transaction on Computer Science and Engineering, vol 57, No1.Dec. 2009, pp 181-190.

Shieh M .D, Wang T. P and Yang D .W (2009), „Low-power Register-Exchange survivor memory architectures for Viterbi decoders.‟ Circuits, Devices & Systems, IET, vol.3, pp. 83-90.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.