FINITE-FIELD DIVISION BASED ON RECURSIVE DIVISION ALGORITHM AND COMPOSITE FIELDS

A new division scheme for GF(2(m)) is presented This scheme is based o n the recursive division algorithm and composite fields ofthe form GF( 2(2n)) (m = 2n). The new division scheme offers reduced time complexit y ofapproximately O(2(n)) when compared to traditional bit-serial arch itectures with O(2(2n)). The scheme also offers lower hardware require ments when compared to bit-parallel architectures. The circuit archite cture presented supports implementation in VLSI systems due to its reg ular and hardware efficient structures and is therefore suited to the implementation of Reed-Solomon codecs.