Implementasi pada FPGA atas Soft-Output Viterbi Algorithm (SOVA) untuk Pengawasandian Turbo

  • Daryus Chandra Universitas Gadjah Mada
  • Budi Setiyanto Universitas Gadjah Mada
  • Sri Suning Kusumawardani Universitas Gadjah Mada
Keywords: Penyandian kanal, teknik koreksi galat, sandi turbo, SOVA, FPGA

Abstract

There are two kinds of algorithm that widely used for decoding the turbo codes, those are Soft-Output Viterbi Algorithm (SOVA) and Maximum A Posteriori Algorithm (MAP). MAP Algorithm gives a better result on error correcting capability, but the consequence it has higher complexity algorithm, in contrary to SOVA. This paper presented a design for decoding turbo codes using SOVA with Very high-speed integrated circuit Hardware Description Language (VHDL) as the modelling program and the design is implemented on the FPGA. Implementation result shows that SOVA occupies 159 slices or 3% of the available slices in Xilinx Spartan-3E, 105 flip flop (1%), 278 LUT (2%), and 141 IOB (60%) with maximum frequency clock is 43,384 MHz. FPGA implementation of SOVA decoder is able to correct up to six non-burst error symbols from 16 received symbols, but SOVA fails to perform its errorcorrecting capability for three consecutive error symbols. SOVA decoder can be implemented for turbo decoding by combining SOVA decoder with interleaver and deinterleaver.

References

C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes (1) " in IEEE International Conference on Communications, 1993, pp. 1064-1070

C. Berrou and A. Glavieux, “Near Optimum Error Correcting Coding And Decoding: Turbo-Codes,” IEEE Transactions on Communications, vol. 44, no. 10, pp. 45–55, 1996.

S. S. Kusumawardani and B. Sutopo, “Designing 1 Bit Error Correcting Circuit on FPGA using BCH Codes,” in International Conference on Electrical, Electronics, Communication, and Information, 2001, pp. 1-5

E. G. S. Wardhana, B. Sutopo, and S. S. Kusumawardani, “Implementasi Pengawasandian Viterbi dengan FPGA,” Universitas Gadjah Mada, 2003

M. Hsu and J. Huang, “High Performance and Low Complexity Max Log-MAP Algorithm for FPGA Turbo Decoder,” in International Conference on Advanced Communication Technology, 2005, pp. 833 838.

K. Kalyani, A. S. A. Vardhini, and S. Rajaram, “FPG of Turbo Decoder for LTE Standard,” Jounal of Artificial Intelligence, vol. 6, no. 1, pp. 22–32, 2013.

P. Robertson, E. Villebrun, and P. Hoeher, “A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms in the Log Domain,” in IEEE International Conference on Communications, 1995, pp. 1009 1013.

P. Robertson, P. Hoeher, and E. Villebrun, “Optimal and Sub Maximum A Posteriori Algorithms Suitable for Turbo Decoding,” Emerging Telecommunications Technology, vol. 8, pp.

L. Papke, P. Robertson, and E. Villebrun, “Improved Decoding with the SOVA in a Parallel Concatenated (Turbo International Conference on Communications, 1996, pp. 102

L. Lin, C. Y. Tsui, and R. S. Cheng Decoder Scheme for Turbo Code Decoding,” in IEEE International Symposium on Circuits and Systems, 1997, pp. 2

D. Wang and H. Kobayashi, “Low-Codes,” in IEEE 51st Vehicular Technolog pp. 1035–1039.

R. Nordman, “Application of the Berrou SOVA Algorithm in Decoding of A Turbo Code,” European Transactions on Telecommunications, vol. 14, no. 3, pp. 245–254, May 2003.

B. Sklar, “Fundamentals of Turbo C

J. Hagenauer and P. Hoeher, “A Viterbi Algorithm with Soft Decision Outputs and Its Applications,” in IEEE Global Telecommunications Conference, 1989, pp. 1680–1686.

J. A. Heller and I. M. Jacobs, “Viterbi Decoding for Sate Communication,” IEEE Transactions on Communication Technology, vol. 19, no. 5, pp. 835–848, 1971.

B. Setiyanto, Dasar-Dasar Telekomunikasi. Yogyakarta: Sakti, 2010.

How to Cite
Daryus Chandra, Budi Setiyanto, & Sri Suning Kusumawardani. (1). Implementasi pada FPGA atas Soft-Output Viterbi Algorithm (SOVA) untuk Pengawasandian Turbo. Jurnal Nasional Teknik Elektro Dan Teknologi Informasi, 2(4), 274-279. Retrieved from https://dev.journal.ugm.ac.id/v3/JNTETI/article/view/3116
Section
Articles