By Topic

The discrete Fourier transform data sequence need not be circularly defined

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
$31 $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

1 Author(s)
van den Bos, A. ; Dept. of Appl. Phys., Delft Univ. of Technol.

Three key discrete Fourier transform (DFT) theorems, namely, those on inversion, shift, and convolution, are considered without assumptions on the data sequence. It is shown that the three DFT theorems can be proved without the usual assumption that the data sequence is circular and that the circularity of DFT shift and convolution is a consequence of the DFT properties, not necessarily of those of the data sequence. The advantage of this alternative viewpoint is that puzzling circularity assumptions with respect to nonperiodic data sequences are avoided

Published in:

Education, IEEE Transactions on  (Volume:33 ,  Issue: 4 )