Talk:DFT matrix

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Mathematics (Rated Start-class, Low-importance)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
Start Class
Low Importance
 Field: Discrete mathematics

Roots of unity[edit]

The article says:

The matrix W of size nxn, may be described as a Vandermonde matrix:

W=V( w ) where w is a vector  w_i = \omega_n^i, the nth root of unity.

This strikes me as badly written... surely the vector w isn't the nth root of unity, but rather the vector consisting of each of the nth roots of unity beginning with 1 and progressing around the origin of the complex plane in an anti-clockwise direction? I'm not quite sure that this is right, so don't want to fix it. JulesH 20:09, 20 November 2006 (UTC)

Exactly, your interpretation is correct, if you look at the page history I've written this line with the comment "should be word'd better", I do apologise. Anyway, I ment to write 'w' is a vector, whose ith coord (hence  w_i ), is the nth root of unity. Maybe adding the word "where" after "vector" helps, anyway, please do word this better, I just have to add this line, as the page had the 2,4,8 instances of the matrix with no reference to the general form (which is simpler to look at, well sortof) Oyd11 02:36, 28 December 2006 (UTC)

Normalization[edit]

It seems like this article uses the 1/sqrt(N) convention in front, which makes it inconsistent with the article on DFTs! Could someone w/ expertise comment? EdenEH (talk) 22:56, 27 January 2010 (UTC)

There are multiple conventions in widespread use; no single scaling is "correct". In many practical situations it is convenient to put all of the 1/N scaling on one of the transforms (e.g. this makes the convolution theorem a bit nicer, as well as being computationally convenient, and FFT algorithms are marginally cleaner to derive without the extra constant factor running around). On the other hand, from a linear-algebra viewpoint in which the DFT appears as a matrix, it is conceptually convenient to scale it so as to be unitary, since it makes it easier to apply well-known properties of unitary matrices. — Steven G. Johnson (talk) 03:18, 28 January 2010 (UTC)

Image[edit]

the image that shows the graphical interpretation of each of the modes is slightly incorrect: for X[4], the Nyquist (highest) frequency, the imaginary part is zero everywhere and not a sine function.