Re: Winograd FFT for a power of two?
- From: Muzaffer Kal <kal@xxxxxxxxx>
- Date: Wed, 26 Nov 2008 18:50:04 -0800
On Wed, 26 Nov 2008 18:56:18 -0600, "gct" <smcallis@xxxxxxxxx> wrote:
I'm trying to find a good reference on creating a Winograd FFT for small
powers of two (<= 16). But all the stuff I'm finding seems to indicate
that the transform size needs to be a product of two coprime numbers. But
I know I've seen small power of 2 Winograd's before, Winograd's original
paper even has results for them. Does anyone know where I can find a good
resource on this?
This book has detailed descriptions of all small Winograd's
algorithms:
http://www.amazon.com/Handbook-Real-Time-Fast-Fourier-Transforms/dp/0780310918/ref=sr_1_1?ie=UTF8&s=books&qid=1227754032&sr=1-1
Muzaffer Kal
DSPIA INC.
ASIC/FPGA Design Services
http://www.dspia.com
.
- References:
- Winograd FFT for a power of two?
- From: gct
- Winograd FFT for a power of two?
- Prev by Date: Re: Open letter to Rune Allnor
- Next by Date: Re: Open letter to Rune Allnor
- Previous by thread: Winograd FFT for a power of two?
- Next by thread: numerical precision of FFTs when interpolating
- Index(es):
Relevant Pages
|
