By Topic

Optimum binary windows for discrete Fourier transforms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Prabhu ; IEEE TASSP ; H. Renganathan

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.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:34 ,  Issue: 1 )