Discrete Fourier Transform question

  • #1
Hi, I am learning fourier transformation by my own. I am reading a book "Fourier Transformation" by R. Bracewell. In chapter 11, in examples of discrete fourier transforms, it gives for N =2, {1 0} transforms to 1/2{1 1}. I can do this in matlab but I can't figure it out how to do it by hand. Searching over the internet, I came across some material but it did not help. Can someone explain me how to get those transforms. Thanks
 

Answers and Replies

  • #3
marcusl
Science Advisor
Gold Member
2,774
432
Bracewell's is an excellent book. The result you quote should be obvious except, perhaps, for the normalization in front which would usually be used for the inverse DFT (the forward DFT would have the factor 1). I don't have this book here but look at his definition of the DFT and check the normalization.
 
  • #4
2
0
Computing a discrete Fourier transform is basically the same as computing the coefficients of a Fourier series (except for the normalization factor). If you are confused by this simple question, then reviewing how to compute Fourier series might help.
 

Related Threads on Discrete Fourier Transform question

  • Last Post
Replies
4
Views
9K
  • Last Post
Replies
3
Views
3K
Replies
6
Views
1K
  • Last Post
Replies
5
Views
8K
Replies
7
Views
12K
Replies
4
Views
8K
  • Last Post
Replies
3
Views
1K
Top