This paper describes a novel, scalable, parallel Fast Fourier Transform (FFT) architecture mapping that supports transform lengths that are not powers of two or four, that provides low latency as well as high throughput, that can do both 1-D and 2-D Discreet Fourier Transforms (DFTs), that is ideally suited to today's complex FPGA architectures, that possesses all the regularity and design simplicity of systolic arrays, and that is naturally suited ...