Now showing items 1-2 of 2

    • Automatic Generation of Prime Length FFT Programs 

      Selesnick, Ivan W.; Burrus, C. Sidney (1996-01-01)
      We describe a set of programs for circular convolution and prime length FFTs that are short, possess great structure, share many computational procedures, and cover a large variety of lengths. The programs make clear the ...
    • Extending Winograd's Small Convolution Algorithm to Longer Lengths 

      Selesnick, Ivan W.; Burrus, C. Sidney (1994-01-15)
      For short data sequences, Winograd's convolution algorithms attaining the minimum number of multiplications also attain a low number of additions, making them very efficient. However, for longer lengths they require a ...