You are here: Home » Featured Content » Automatic Generation of Prime Length FFT Programs
 

Automatic Generation of Prime Length FFT Programs

Automatic Generation of Prime Length FFT Programs

Automatic Generation of Prime Length FFT Programs describes a set of programs for circular convolution and prime length Fast Fourier Transforms that are short, possess great structure, share many computational procedures, and cover a large variety of lengths. This work grew out of the doctoral and post doctoral research of Ivan Selesnick working with Professor C. Sidney Burrus at Rice University


See also:

Automatic Generation of Prime Length FFT Programs

Other Featured Content