The Discrete Fourier Transform (DFT) is a mapping between a finite set of discrete points in the frequency and time domains. DFT requires an input function which is discrete and non-zero, such as a sampling from an analogue audio signal.

learn more… | top users | synonyms

1
vote
0answers
47 views

Proving DFT equation

How can I prove the equation $(3)$? I can't understand why there is a $2/N$ in $(3)$. Why he just get the second term in DFT? Consider a sinusoidal input signal of frequency $\omega$ given by ...
4
votes
2answers
80 views

Difference between Fourier Transform and DFT? - Example

I have read many excellent answers to similar questions, but never one this specific. Here is another way to ask it. Why is the modulation transfer function (MTF) of $\textrm{rect}(x/5) = ...
0
votes
0answers
55 views

DFT of a continuous quasi-periodic signal

If I have a continuous quasi-periodic signal and I want to do a DFT of signal then what could be appropriate length of continuous signal that I should consider for sampling? I want to do DFT of the ...
1
vote
2answers
23 views

what is the reason for the Change in DFT analysis after downsampling

firstly the original signal's dft analysis is this the signal is sammpled at 1000Hz the signal is then downsampled under different rates such as 25Hz this is the dft analysis of the signal ...
0
votes
1answer
24 views

Sub Band DFT response

With a DFT lets say I had a signal occupying 0Hz to 2048Hz and i am using 2048 bins. Can a DFT by design (say FFTW) only calculate the responses in a Sub Band like 768Hz to 1280Hz or -64Hz to -256Hz ...
0
votes
2answers
43 views

DFT analysis of a physical signal

what is the reason for the result that has been obtained from the DFT of the signal of these two images. The first image is a DFT analysis of a physical signal u which has a time history shown below ...
0
votes
1answer
43 views

Derive DFT of $x[2n]$ [closed]

Question is to find DFT, $G_7(k)$ of $g_7(n)$ = $x(2n)$. For purpose of illustration only, we can assume that $x(n)$ can be represented by envelope shown in corresponding figure. Shown in Figure ...
1
vote
0answers
25 views

How to convert a spatial frequency in a 2D-DFT into the units radians per pixel?

Let's say I have a 2D image, and I take the discrete Fourier Transform (via FFT) of that image. In the frequency domain, I get the following image: In this image, let's just assume all the spatial ...
1
vote
1answer
44 views

Computation of Only Even or Odd Frequency Bins of DFT

I have an algorithm where I am computing the FFT of a large signal. However, I desire only the even or odd terms of the DFT of the signal, but not both. Currently, I discard these undesired terms. Is ...
1
vote
1answer
43 views

Difference between fft(signal, nfft) and fft(signal)

I want to know the difference between these following commands (matlab) and why I get two different outputs? fft(signal); fft(signal, nfft); I found that ...
0
votes
1answer
28 views

Complex Conjugate Sinusoids in Forward DFT

I hope this isn't such a dumb question, but I'm finally getting to grips with the inner workings of the DFT. What I'm having trouble understanding is why the basis complex sinusoids in the "forward" ...
0
votes
2answers
33 views

What does it mean for the DFT phase to be relative to a cosine wave?

The following paragraph from Understanding Digital Signal Processing got me puzzled: The answer is: The DFT phase at the frequency $mf_s/N$ is relative to a cosine wave at that same frequency of ...
0
votes
1answer
28 views

Deriving the DFT magnitude of $A\cos(2\pi nk/N)$

Given that $$x(n) = A\cos(2\pi nk/N),$$ the $N$-point DFT of $x(n)$ can be expressed as follows—the derivation can be found in here: $$X(m) = \color{red}{\frac{A}{2}\sum_{n=1}^{N-1}e^{-j2\pi ...
0
votes
1answer
30 views

Where does $\frac{N}{2}$ came from in approximating an N-point DFT?

I've came across the author saying that ... for a real cosine input having k cycles in the N-point input time sequence, the amplitude response of an N-point DFT bin in terms of the bin index m is ...
1
vote
1answer
45 views

Why is N-point DFT approximated by the sinc function?

While looking into DFT leakage, I've came across the author saying that "..., the amplitude response of an N-point DFT bin in terms of the bin index m is approximated by the sinc function." ...
0
votes
2answers
48 views

How to do the highest resolution FFT?

I wish to do the FFT of streaming audio data coming into a computer. I am just interested in frequencies from 80 Hz up to 1000 Hz but with a frequency resolution of 3 to 4 Hz and no more. Basically ...
1
vote
3answers
64 views

Performing DFT of streaming audio problem. Is there a limit?

I am trying to write software that will perform the discrete fourier transform of real time data coming from the microphone into the sound card on a computer. I am using Java with the javax.sound ...
0
votes
1answer
40 views

Possible to shift image pixel-wise with FFT?

I know we can shift an image entirely with FFT as http://stackoverflow.com/questions/25827916/matlab-shifting-an-image-using-fft However, is it possible to shift the image pixel-wise? I just found a ...
1
vote
3answers
88 views

DFT of discrete signals, why do we only analyze frequency bins equal to number of input samples?

If we have a signal $x[n]$ such that we have $N$ samples i.e. $n=0, \ldots, N-1$, then when we analyze the DFT $X[k]$ we only analyze for $k=0,\dots,N-1$ as well. Why is the range of $k$ tied to ...
0
votes
2answers
70 views

Why are the basis functions for DFT so?

When you get a DFT of a signal, you use the basis functions as: $e^{-j2\pi kn/N}$ Why is it so? Why don't we use the conjugate, $e^{j2\pi kn/N}$, or any other function?
1
vote
2answers
107 views

DFT of real sinusoids - why sum over -$N/2$ to $N/2-1$ as opposed to $0$ to $N-1$?

I'm going through a Coursera course on signal processing, and we're just introduced to DFTs. We are told that if you have a complex sinusoidal signal $x[n]$ where $n=0,1...\ N-1$, its DFT is given ...
0
votes
1answer
60 views

Effect of cyclic prefix and zero-padding in OFDM

What happens if zeros are added instead of cyclic prefix in OFDM system? How does it affect performance of system?
0
votes
0answers
27 views

How to get N point DFT using two 2N point DFT

If I have 2 8 point DFT, how will I compute 4 point DFT using this. And how can I compute 8 point DFT using 2 4 point DFT. Do we need to do zero padding for this?
0
votes
0answers
28 views

How to find Galois Field $\textrm{GF}(p)$ from any $n$-point DFT

How to find a finite field $\textrm{GF}(p)$ (where $p$ is a prime number) (here I want to find the value of $p$ only)that is as small as possible and efficient computation can be performed for (let's ...
2
votes
2answers
119 views

Extracting accurate phase and amplitude information from FFT with an arbitrary number of samples

This is a followup question to one I asked earlier based on the chat after the answer given by @hotpaw2, and cross-posted from stackoverflow since it was suggested it is more relevant to DSP. I have a ...
0
votes
1answer
64 views

What is the physical significance of the Fourier coefficients in the DFT of audio signals and how can they be best displayed in a spectrogram?

I am trying to display the spectrogram of an input audio signal (a newcomer to all things spectral here). The amplitudes of my audio signal can be assumed to be normalized between -1 and +1. Suppose ...
2
votes
2answers
36 views

non-uniform sampling on the unit circle - applications

If there is an N-point sequence, it has a Fourier Transform. DFT of this sequence is the sampling of the Fourier Transform at N equally spaced points on the unit circle. What happens if we take some ...
0
votes
1answer
60 views

What is plotted against the DFT of a windowed sampled signal?

I'm given a continuous-time analog signal $x_a(t) = \cos(2\pi f_1t)+\sin(2\pi f_2t)$, for some frequency $f_1, f_2$. I'm asked to sample $x_a(t)$ at $F_s=1024\textrm{ Hz}$, apply a 128-point Hamming ...
1
vote
0answers
36 views

Discrete Fourier Transform for text analysis?

I would like to determine the number of text-blocks verifying a roughly similar pattern. I have the intuition that I could do it using some Discrete Fourier Transform (DFT)-like methodology. Example: ...
5
votes
1answer
57 views

Would it be feasible to implement the Sliding DFT on a digital signal processor?

The Sliding DFT generates the spectrum for every input sample. Using the FFT, the spectrum is generated only after a certain number of samples (N) are obtained. It appears to me as though the cycles ...
0
votes
0answers
55 views

Number of samples needed to convert a analog->digital, frequency bound, signal with decent quality to the Fourier domain

Similiar question(s) have been asked before, but I didn't fully get the answer I was looking for, so I figured I'd ask again. My excuses if there's something really basic in signal processing I've ...
1
vote
2answers
48 views

DFT have independent variable in between 0 to $\frac{1}{2}$ no of samples

I was learning of Fourier Transform from this book 'Scientist and Engineer Guide to DSP'. Suppose we have a digital periodic signal and there are 128 of samples of it in the time domain i.e X[0] to ...
1
vote
3answers
66 views

Transfer function of linear phase filter & its frequency domain representation

Text of my exercise request: Determine the transfer function $H(z)$ of a causal linear phase FIR filter with zeros at $z= \frac{1}{3}$ and $z=-2$. The value of the impulse response at $n=0$ equals ...
0
votes
1answer
27 views

Discrete signals in spectrum to Analog : DFT

An analog signal $x(t)$ was sampled for a period $T$ of $1 \text{ms}$. The resulting, discrete signal is denoted as $x[n]$. Now you are given the spectrum $X[k]$ of the sampled signal $x[n]$. Doubts ...
0
votes
1answer
34 views

IDFT of H(z) sampled in N values

If a have a causal IIR filter described by $H(z)$ and I sample it in $N$ equispaced values around the unit circle, I get a DFT of $N$ points. That DFT corresponds to $h[n]$ truncated in $n=N-1$ or to ...
0
votes
1answer
90 views

Time scaling in DFT?

Let $x[n]$ be a real signal whose length $N$ is even. Let $y[n]=x[2n]+jx[2n+1]$ a signal whose length is $M=\frac{N}{2}$. $X[k]$ for $k=0,...,N-1$ and $Y[k]$ for $k=0,...,M-1$ are the respective ...
0
votes
1answer
35 views

Analysis of a LTI system using DFT

Consider an LTI system $$H(z)=1-\frac{1}{2}z^{-1}+\frac{3}{4}z^{-2}$$ Let $x[n]=(\frac{1}{3})^n\cdot u[n]$ be the input signal. It is desired to determine the output for $n=0,1...,N_a$. To ...
1
vote
1answer
37 views

DFT of a cosine/sine wave?

I'm seeing everywhere that the DFT of a sinusoid (i.e. a sine that has been windowed with a rectangular window) are just two deltas. What I don't understand is why the DFT is not the convolution of ...
0
votes
0answers
32 views

Applying Filter to Complex Data

I have data being streamed in the time domain, I would like to use a transfer function for a low pass filter in order to filter the data. I use DFT to get the data to the frequency domain, in the form ...
1
vote
1answer
71 views

Determine sequence's value from equally null circular convolution DFT

Can anyone help with this exercise from my Signal Processing exam? The text is: Given two sequences $x$ and $y$ whose supports are respectively $[0,1]$ and $[0,3]$ and their circular ...
0
votes
2answers
88 views

How to realize DFT6 with 3 DFT2 blocks?

Is it possible to realize DFT of 6 samples by using 3 DFT2 blocks? For example if had 2 * N samples by one step of decimation in frequency or time is possible to reduce DFT(2N) to 2 * DFT(N). So if we ...
1
vote
1answer
70 views

Why is the DFT used for spectrograms rather than the DCT?

Related to Could a DCT be used for an audio magnitude spectrum rather than DFT?, but more on the (audio) spectrogram side of things I've been reading about the DCT (such as from here) and it ...
2
votes
2answers
55 views

Sampling H(z) to get DFT

Suppose that I have a $H(z)$ and I sample it to get a DFT of 15 values. Let's call this DFT $H_{1}[k]$. Then, suppose I antitransform $H(z)$ and grab the first 10 values of the sequence, and then I ...
0
votes
2answers
90 views

Relationship between z-transform and DFT

I'm studying for a Signals Processing exam and came across an exercise that I'm finding pretty difficult to solve. It says: Asume there is a signal $x[n]$ of length $N$. Its ...
0
votes
1answer
85 views

DFT normalization for amplitude estimation

After an interesting recent answer, I'm doing some research on proper DFT normalization for sinusoidal peak estimation. It's clear that to get the correct amplitude from DFT peaks we need to normalize ...
0
votes
1answer
99 views

Relation between sawtooth Fourier coefficients and its DFT

I'm having some trouble with understanding the DFT of a sawtooth single period signal and its relation with sawtooth Fourier coefficients. Let's say I have a signal $$ s(t) = \frac{At}{T} - ...
0
votes
1answer
61 views

Oversampled polyphase filter banks

i would a confirm of this: with polyphase structure is possible only design a filter bank with a INTEGER oversampling ratio? For non-integer i've seen the weighted overlap-add metod, is right? thanks ...
0
votes
3answers
96 views

Formulas of the Fourier transform family

It has annoyed me that there doesn't seem to be a source online where the complete complex Fourier transform family is presented with every variable defined. The lack of definitions can be a nuisance ...
4
votes
1answer
90 views

Accuracy of IFFT(FFT(X)) unit transformation

I want to use FFTs to do seriously accurate interpolation on band-limited data. To do that, I need to get a handle on the fundamental accuracy of the FFT() and IFFT() algorithms available. My idea ...
-1
votes
1answer
42 views

Trouble understanding discrete Fourier Transform

In the paper Calculation of a constant Q spectral transform - J.C.Brown it is mentioned The conventional linear frequency representation given by the discrete Fourier transform gives rise to a ...