Fast configurable polynomial division for error control coding applications

The motivation for this paper is the need for high levels of reliability in modern telecommunication systems requiring very high data transmission rates. The search for technologically independent solutions, easy to implement on low cost and popular devices such as FPGA is an important issue. In this paper, we present a method to improve effectively the speed performance of the polynomial division performed in most error detecting and error correcting circuits. It is based on a pipeline structure for the polynomial division. Furthermore, the proposed solution is fully configurable, both from the static and the dynamic points of view. At synthesis stage, the parallelism level (size of the pipeline structure) and the maximal size of the polynomial divisor must both be chosen. Afterwards, the actual divisor can be chosen and changed while the circuit is running. The architecture proved to be very effective, as data rates up to 2.5 Gbits/s have been reached.

[1]  F. Elguibaly,et al.  A fast parallel multiplier-accumulator using the modified Booth algorithm , 2000 .

[2]  S. K. Nandy,et al.  Design and realization of high-performance wave-pipelined 8×8 b multiplier in CMOS technology , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[3]  Abbas Dandache,et al.  A new processor architecture dedicated to digital modem applications , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[4]  Charles A. Zukowski,et al.  High-speed parallel CRC circuits in VLSI , 1992, IEEE Trans. Commun..

[5]  T. Matsushima,et al.  Parallel Encoder and Decoder Architecture for Cyclic Codes , 1996 .