Optimization of a Systolic Array BCH encoder with Tree-Type Structure

초록

BCH code is one of the most widely used error correcting code for the detection and correction of random errors in the modern digital communication systems. The conventional BCH encoder that is operated in bit-serial manner cannot adequate with the recent high speed appliances. Therefore, parallel encoding algorithms are always a necessity. In this paper, we introduced a new systolic array type BCH parallel encoder. To study the area and speed, several parallel factors of the systolic array encoder is compared. Furthermore, to prove the efficiency of the proposed algorithm using tree-type structure, the throughput and the area overhead was compared with its counterparts also. The proposed BCH encoder has a great flexibility in parallelization and the speed was increased by 40% than the original one. The results were implemented on synthesis and simulation on FPGA using VHDL.

키워드

BCH codeencoderparallel processingtree-type systolic arrays.
제목
Optimization of a Systolic Array BCH encoder with Tree-Type Structure
저자
임덕규Sharad Shakya이제훈
DOI
10.5392/IJoC.2013.9.1.033
발행일
2013-03
유형
Y
저널명
International Journal of Contents
9
1
페이지
33 ~ 37