Conference Paper

FPGA Implementation of Encoder for (15, k) Binary BCH Code Using VHDL and Performance Comparison for Multiple Error Correction Control

DOI: 10.1109/CSNT.2012.170 Conference: IEEE International Conference on Communication Systems and Network Technologies, Volume: 2

ABSTRACT In this paper we have designed and implemented (15, k) a BCH Encoder on FPGA using VHDL for reliable data transfer in AWGN channel with multiple error correction control. The digital logic implementation of binary encoding of multiple error correcting BCH code (15, k) of length n=15 over GF (2 4) with irreducible primitive polynomial x 4 +x+1 is organised into shift register circuits. Using the cyclic codes, the reminder b(x) can be obtained in a linear (15-k) stage shift register with feedback connections corresponding to the coefficients of the generated polynomial. Three encoder are designed using VHDL to encode the single, double and triple error correcting BCH code (15, k) corresponding to the coefficient of generated polynomial. Information bit is transmitted in unchanged form upto k clock cycles and during this period parity bits are calculated in the LFSR then the parity bits are transmitted from k+1 to 15 clock cycles. Total 15-k numbers of parity bits with k information bits are transmitted in 15 codeword. Here we have implemented (15, 5, 3), (15, 7, 2) and (15, 11, 1) BCH code encoder on Xilinx Spartan 3 FPGA using VHDL and the simulation & synthesis are done using Xilinx ISE 10.1. Also a comparative performance based on synthesis & simulation on FPGA is presented.

Download full-text


Available from: Amit Kumar Panda, Sep 26, 2015
1 Follower
464 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Error Correcting Codes are required to have a reliable communication through a medium that has an unacceptable bit error rate and low signal to noise ratio. In IEEE 802.15.6 2.4GHz Wireless Body Area Network (WBAN), data gets corrupted during the transmission and reception due to noises and interferences. Ultra low power operation is crucial to prolong the life of implantable devices. Hence simple block codes like BCH (63, 51, 2) can be employed in the transceiver design of 802.15.6 Narrowband PHY. In this paper, implementation of BCH (63, 51, t = 2) Encoder and Decoder using VHDL is discussed. The incoming 51 bits are encoded into 63 bit code word using (63, 51) BCH encoder. It can detect and correct up to 2 random errors. The design of an encoder is implemented using Linear Feed Back Shift Register (LFSR) for polynomial division and the decoder design is based on syndrome calculator, inversion-less Berlekamp-Massey algorithm (BMA) and Chien search algorithm. Synthesis and simulation were carried out using Xilinx ISE 14.2 and ModelSim 10.1c. The codes are implemented over Virtex 4 FPGA device and tested on DN8000K10PCIE Logic Emulation Board. To the best of our knowledge, it is the first time an implementation of (63, 51) BCH encoder and decoder carried out.
    08/2014; 3(3). DOI:10.5121/ijit.2014.3301
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Video steganography has become a popular topic due to the significant growth of video data over the Internet. The performance of any steganography algorithm depends on two factors: embedding efficiency and embedding payload. In this paper, a high embedding payload of video steganography algorithm has been proposed based on the BCH coding. To improve the security of the algorithm, a secret message is first encoded by BCH(n,k,t) coding. Then, it is embedded into the discrete wavelet transform (DWT) coefficients of video frames. As the DWT middle and high frequency regions are considered to be less sensitive data, the secret message is embedded only into the middle and high frequency DWT coefficients. The proposed algorithm is tested under two types of videos that contain slow and fast motion objects. The results of the proposed algorithm are compared to both the Least Significant Bit (LSB) and [1] algorithms. The results demonstrate better performance for the proposed algorithm than for the others. The hiding ratio of the proposed algorithm is approximately 28%, which is evaluated as a high embedding payload with a minimal tradeoff of visual quality. The robustness of the proposed algorithm was tested under various attacks. The results were consistent.
    2015 International IEEE Wireless Telecommunications Symposium, New York; 04/2015