Binary windows for the discrete Fourier transform

An efficient structure is suggested for the frequency-domain windowing of discrete Fourier transforms. In this scheme, multiplications are replaced by shifts in the position of the binary point. Three new window functions are described which can be realized by the suggested structure.