A fast DFT algorithm using complex integer transforms

Details A fast DFT algorithm using complex integer transforms A fast DFT algorithm using complex integer transforms

Feb 1978

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1978dsnpr..43..134r&link_type=abstract

In its The Deep Space Network p 134-140 (SEE N78-24187 15-12)

Computer Science

Algorithms, Discrete Functions, Fourier Transformation, Complex Numbers, Convolution Integrals, Sequencing

Scientific paper

Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.

Affiliated with

Also associated with

No associations

Rating

A fast DFT algorithm using complex integer transforms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast DFT algorithm using complex integer transforms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast DFT algorithm using complex integer transforms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1034709