A Method to Handle BCH(n,k,t) Algorithm Over Large GF(n) in Practical Hardware Implementations

Abstract

This paper presents an approach to handle elements from GF(2n), in hardware implementation with minimum costs of area. The method is described by exemplifying with minimum costs of the area. The method is described by exemplifying the practical implementation of the BCH(n,k,t) scheme over GF(2n), where n is large (n > 6), on reconfigurable FPGA hardware with minimum costs of area. There are many papers in the open literature that presents hardware implementations of algorithms over GF(2n) but none of them addresses the problem of hardware resources employed. There are many situations in which an area-optimized implementation is more suitable than a speed-optimized implementation.