Optimum binary windows for discrete Fourier transform

This paper presents a set of windows, called binary windows, for frequency domain windowing of discrete Fourier transforms. The new windows suggested do not require multiplications or stored constants. A number of windows are suggested whose main-lobe widths fall between Hamming[1] and the windows suggested by Harris[2] and Nuttall [3], while having better sidelobe behaviour compared to the near-optimum windows suggested by Kaiser[4]. The distinct advantage in using binary windows is the ease with which they can be implemented. Finally, efficient structures are suggested, followed by the plots of the windows, to enable the user in selecting an appropriate window to suit his requirements.