FPGA implementation of overhead reduction algorithm for interspersed redundancy bits using EEDC
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Normally, in data transmission, extra parity bits are added to the input message which were derived from its input and a pre-defined algorithm. The same algorithm is used by the receiver to check the consistency of the delivered information, to determine if it is corrupted or not. It recovers and compares the received information, to provide matching and correcting the corrupted transmitted bits if there is any. This paper aims the following objectives: to use an alternative error detection-correction method, to lessens both the fixed number of the required redundancy bits ‘r’ in cyclic redundancy checking (CRC) because of the required polynomial generator and the overhead of interspersing the rin Hamming code. The experimenta lresults were synthesized using Xilinx Virtex-5 FPGA and showed a significant increase in both the transmission rate and detection o frandom errors. Moreover, thisp roposal can be a better option for detecting and correcting errors.
Abstract
Normally, in data transmission, extra parity bits are added to the input message which were derived from its input and a pre-defined algorithm. The same algorithm is used by the receiver to check the consistency of the delivered information, to determine if it is corrupted or not. It recovers and compares the received information, to provide matching and correcting the corrupted transmitted bits if there is any. This paper aims the following objectives: to use an alternative error detection-correction method, to lessens both the fixed number of the required redundancy bits ‘r’ in cyclic redundancy checking (CRC) because of the required polynomial generator and the overhead of interspersing the rin Hamming code. The experimenta lresults were synthesized using Xilinx Virtex-5 FPGA and showed a significant increase in both the transmission rate and detection o frandom errors. Moreover, thisp roposal can be a better option for detecting and correcting errors.
참고문헌 (12)
- M. Liu, "Research on the Distribution and Self-Similarity Characteristics of End-to-End Network Delay", International Journal of Future Generation Communication and Networking, 8, pp.291~302 (2015)
- I. M. A. D. Suarjaya, "A New Algorithm for Data Compression Optimization", International Journal of Advanced Computer Science and Applications, 3 (2012)
- J. M. Tang, "High-Speed Transmission of Adaptively Modulated Optical OFDM Signals Over Multimode Fibers Using Directly Modulated DFBs", Journal of Lightwave Technology, 24 (2006)
- H. Al-Bahadili, "A Novel Lossless Data Compression Scheme Based on the Error Correcting Hamming Codes", Computers and Mathematics with Applications, 56 (2008)
- I. R. Irvin, "Cyclic redundancy checks with factorable generators", IEEE Proceedings–Communications, 150, pp.17~20 (2003)
- S. I. Park, "Extended Hamming accumulate codes and modified irregular repeat accumulate codes", Electronics Letters, 10, pp.467~468 (2002)
- P. Kora, "Single Bit Error Detection and Correction using Novel Hamming Code Method", Imperial Journal of Interdisciplinary Research (IJIR), 3 (2017)
- P. Koopman, "Cyclic redundancy code (CRC) polynomial selection for embedded networks", Proceedings of The International Conference on Dependable Systems and Networks (2004)
- R. T. Murade, "The Design and Implementation of a Programmable Cyclic Redundancy Check(CRC) Computation Circuit Architecture using FPGA", International Journal of Science and Modern Engineering(IJISME), 1 (2013)
- H. Mukhtar, "CRC-Free Hybrid ARQ System using Turbo Product Codes", IEEE Transactions on Communications, 62 (2014)
- A. H. Saleh, "Design of Hamming Code for 64-bit Single Error Detection and correction with VHDL", Diyala Journal of Engineering Sciences, 8 (2015)
- H. Wang, "A Kind of Performance Improvement of Hamming Code", Information and Management Engineering, Proceedings of International Conference in ICCIC (2011)