A note on parallel and pipeline computation of fast unitary transforms
B.J. Fino, V. Ralph Algazi · NASA STI Repository (National Aeronautics and Space Administration) · 1974
The parallel and pipeline organization of fast unitary transform algorithms such as the Fast Fourier Transform are discussed. The efficiency is pointed out of a combined parallel-pipeline processor of a transform such as the Haar transform in which 2 to the n minus 1 power hardware butterflies generate a transform of order 2 to the n power every computation cycle.