Optimum binary windows for discrete Fourier transforms
K.M.M. Prabhu, H. Renganathan · IEEE Transactions on Acoustics Speech and Signal Processing · 1986
A class of windows, called binary windows, for the frequency-domain implementation of the discrete Fourier transform is proposed. While the conventional time-domain windowing requires N/2 stored values of the data window and N multiplications, the binary windows do not require multiplications or stored constants; rather, they are replaced by shift and add operations. Typical hardware structures are presented for efficient implementation of the binary windows.