A Pipeline Design of a Fast Prime Factor DFT on a Finite Field

Authors:
T. K. Truong;I. S. Reed;I. -S. Hsu;H. -C. Shyu;H. M. Shao
Affiliations:
-;-;-;-;-
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 2
Cited 2

Introduction to VLSI Systems

Introduction to VLSI Systems
Number Theory in Digital Signal Processing

Number Theory in Digital Signal Processing

Data Routing Networks for Systolic/Pipeline Realization of Prime Factor Mapping

IEEE Transactions on Computers
A Pipeline Design for the Realization of the Prime Factor Algorithm Using the Extended Diagonal Structure

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

A conventional prime factor discrete Fourier transform (DFT) algorithm of the Winograd type is used to realize a discrete Fourier-like transform on the finite field GF(q/sup /n). A pipeline structure is used to implement this prime-factor DFT over GF(q/sup /n). This algorithm is developed to compute cyclic convolutions of complex numbers and to aid in decoding the Reed-Solomon codes. Such a pipeline fast prime-factor DFT algorithm over GF(q/sup /n) is regular, simple, expandable, and naturally suitable for most implementation technologies. An example illustrating the pipeline aspect of a 30-point transform over GF(q/sup /n) is presented.