Talk:Non-uniform discrete Fourier transform
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
What is NDFT really?
[edit]The new info added by new editor User:Ytw1987, sourced to Marvasti, seems to contradict what this stub said before, and which he left, which was that "the input signal is not sampled at equally-spaced intervals". As Marvasti and other sources (e.g this book) say, what's nonuniformly sampled is the frequency space, not the input. They needs to be fixed; hopefully I understand it correctly.
I have reverted the new editor elsewhere, for lack of edit summaries or other justifications for adding large amount of new unwikified content, unsourced or sourced only to Marvasti. Ytw1987, if you are Marvasti, or if the only book you have is the one by Marvasti, or whatever, it would be best to just let us know, so we don't have to wonder whether you have a WP:COI. Your edits will be more welcome if you are more clear about where you're coming from. A good place would be your user page. Dicklyon (talk) 23:51, 2 July 2012 (UTC)
In 'Direct inversion of the NUDFT-1,' it says x[n] are the coefficients of the interpolating polynomial. Later, the coefficients, are c0, c1, c2... It would be clearer to express that they are equal, x[0]=c0, x[1]=c1. (At least that's what I think it wants to express.) Worse, though is that c2 is presumably a coefficient, yet it depends upon z^-1, making c2 a function of z, c2(z).
- — Preceding unsigned comment added by 71.191.240.37 (talk) 21:28, 29 November 2023 (UTC)