‘Instant’ Fourier transform

Abstract

The fast Fourier transform andd the fast Walsh transform are too slow for some real-time applications. For binary data, an ‘instant’ Fourier transform is based on harmonic analysis in a space of 2n-tuples of 0s and 1s. Simple, modular logic finishes transforming 2n real-time serial binary data one clock pulse after the last datum arrives.