Reconfigurable Enhanced Path Metric Updater Unit for Space Time Trellis Code Viterbi Decoder

Mohd Azlan Abu, Harlisya Harun, Mohammad Yazdi Harmin, Noor Izzri Abdul Wahab, Mohd Khairil Rahmat, Mohd Fairuz Abd Hamid, Aizat Faiz Ramli


Space Time Trellis Code (STTC) encoding and decoding techniques are effective for delivery of a reliable information because of the signal to noise ratio is very small. Even though the Viterbi algorithm is complicated to be designed, these methods typically used large memory space to store the information that have been processed mainly at the Path Metric Updater (PMU). Therefore, an effective memory management technique is one of the key factors in designing the STTC Viterbi decoder for low power consumption applications. This paper proposed the PMU memory reduction technique especially on Traceback activities that usually required a lot of memories for storing the data that has been processed in the past part by using Altera Quartus 2 and 0.18 µm Altera CPLD 5M570ZF256C5 as targeted hardware. Through this method, the reduction achieved at least 66% of memory requirements and 75% improvements in processing time without a significanct effects on the outputs results of the STTC Viterbi Decoder for 4-PSK modulation technique by using 50MHz clocks.


Space Time Trellis Code; Viterbi Decoder; Register Transfer Level;

Full Text:



K. T. Shr, H. D. Chen and Y. H. Huang, "A Low-Complexity Viterbi Decoder for Space-Time Trellis Codes," IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 57, no. 4, (2010), 873-885.

D. A. El-Dib and M. I. Elmasry, “Modified register-exchange viterbi decoder for low-power wireless communications,” IEEE Trans. on Circuits and Systems I, vol. 51, no. 2, (2004), 371-378.

E. Boutillon and N. Demassieux, “High speed low power architecture for memory management in Viterbi decoder,” IEEE Int. Symp. Circuits and Systems, vol. 4, (1996), 284-287.

J. Ryu, S. Kim, J. Cho, H. Park, and Y. Chang, “Lower power Viterbi decoder architecture with a new clock-gating traceback unit,” 6th Int. Conf. VLSI and CAD, (1999), pp. 297-300.

P. J. Black and T. H. Meng, “A 140Mbis 32-state radix-4 Viterbi decoder,” IEEE Trans. Solid State Circuits, vol. 27. no. 12, (1992), 1877- 1885.

C. C. Lin, Y. H. Shih, H. C. Chang, C.Y. Lee, “Design of a power– reduction Viterbi Decoder of WLAN Application,” IEEE Trans. Circuit and Systems I, vol. 52, (2005), 1148-1156.

Yun-Ching Tang; Do-Chen Hu, Weiyi Wei, Wen-Chung Lin, and Hongchin Lin, “A memory-efficient architecture for low latency viterbi decoders,” IEEE Int. Symp. on VLSI Design, Automation and Test, VLSI-DAT '09, (2009), 335-338.

Rongchun Li, Yong Dou, Jie Zhou, and Guoqing Lei, “A High throughput Reconfigurable Viterbi Decoder,” Int. Conference on Wireless Communications and Signal Processing, (2011), 1-6.

A. K. Mishra and P. P. Jiju, "Low power, dynamically reconfigurable, memoryless systolic array based architecture for Viterbi decoder," Energy, Automation, and Signal (ICEAS), 2011 International Conference on Engineering and Applied Sciences,(2011),1-5.

C. Yu, Y. S. Su, B. S. Lin, P. H. Cheng and S. J. Chen, "A memoryless Viterbi decoder for LTE systems," The 1st IEEE Global Conference on Consumer Electronics 2012, (2012), 643-644.

C. Yu, Y. S. Su, B. S. Lin, P. H. Cheng and S. J. Chen, "A dual-coderate memoryless Viterbi decoder for wireless communication systems," 2013 IEEE International Conference on Consumer Electronics (ICCE), (2013), 578-579.

M. Valinataj, “Reliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures”,.International Journal of Engineering, 27(4 (A)), (2014), 509–516.

M. Ahmadian-Attari, “Multilevel Input Ring-TCM Coding Scheme: A Method For Generating High-Rates Codes International Journal of Engineering, (2001), 14(3), 209–214.

S J Azhari and H Kaabi, “A Novel Data Compression Technique For 4-20 mA Current Loop Transmitters”, International Journal of Engineering, 14(1), 35–40.


  • There are currently no refbacks.

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

ISSN: 2180-1843

eISSN: 2289-8131