The basis-change algorithm for fast finite field transforms

A computational algorithm is developed which involves the change of basis of field elements during the nontrivial evaluation of coset elements. This finite field arithmetic is equipped with cyclic shifting for scaling, simple table lookups for polynomial reduction, and a series of component-wise mod...

Full description

Saved in:
Bibliographic Details
Published inIEEE Proceedings of the SOUTHEASTCON '91 pp. 221 - 224 vol.1
Main Authors Kao, R.-S., Taylor, F.J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1991
Subjects
Arithmetic
Discrete Fourier transforms
Discrete transforms
Fast Fourier transforms
Galois fields
Pipelines
Polynomials
Signal processing algorithms
Table lookup
Very large scale integration
Online AccessGet full text

Cover

More Information
Summary:A computational algorithm is developed which involves the change of basis of field elements during the nontrivial evaluation of coset elements. This finite field arithmetic is equipped with cyclic shifting for scaling, simple table lookups for polynomial reduction, and a series of component-wise modular adders. Application of these concepts to the existing fast transform not only serves to simplify the transform, but also leads to the development of a very compact signal processing device which can be implemented as a building block and seamlessly integrated with a discrete Fourier transform (DFT) system. Once the butterfly operation module of a cyclotronic coset based on the algorithm is developed, the integration of the modules leads to an efficient VLSI implementation of the pipeline stages of the fast transform.< >
ISBN:9780780300330
0780300335
DOI:10.1109/SECON.1991.147741