# 1.7 The dft: frequency domain with a computer analysis

 Page 1 / 1
This module will take the ideas of sampling CT signals further by examining how such operations can be performed in the frequency domain and by using a computer.

## Introduction

We just covered ideal (and non-ideal) (time) sampling of CT signals . This enabled DT signal processing solutions for CTapplications ( ):

Much of the theoretical analysis of such systems relied on frequency domain representations. How do we carry out thesefrequency domain analysis on the computer? Recall the following relationships: $x(n)\stackrel{\mathrm{DTFT}}{}X()$ $x(t)\stackrel{\mathrm{CTFT}}{}X()$ where  and  are continuous frequency variables.

## Sampling dtft

Consider the DTFT of a discrete-time (DT) signal $x(n)$ . Assume $x(n)$ is of finite duration $N$ ( i.e. , an $N$ -point signal).

$X()=\sum_{n=0}^{N-1} x(n)e^{-in}$
where $X()$ is the continuous function that is indexed by thereal-valued parameter $-\pi \le \le \pi$ . The other function, $x(n)$ , is a discrete function that is indexed by integers.

We want to work with $X()$ on a computer. Why not just sample $X()$ ?

$X(k)=X(\frac{2\pi }{N}k)=\sum_{n=0}^{N-1} x(n)e^{-i\times 2\pi \frac{k}{N}n}$
In we sampled at $=\frac{2\pi }{N}k$ where $k=\{0, 1, , N-1\}$ and $X(k)$ for $k=\{0, , N-1\}$ is called the Discrete Fourier Transform (DFT) of $x(n)$ .

The DTFT of the image in is written as follows:

$X()=\sum_{n=0}^{N-1} x(n)e^{-in}$
where  is any $2\pi$ -interval, for example $-\pi \le \le \pi$ .

where again we sampled at $=\frac{2\pi }{N}k$ where $k=\{0, 1, , M-1\}$ . For example, we take $M=10$ . In the following section we will discuss in more detail how we should choose $M$ , the number of samples in the $2\pi$ interval.

(This is precisely how we would plot $X()$ in Matlab.)

## Case 1

Given $N$ (length of $x(n)$ ), choose $(M, N)$ to obtain a dense sampling of the DTFT ( ):

## Case 2

Choose $M$ as small as possible (to minimize the amount of computation).

In general, we require $M\ge N$ in order to represent all information in $\forall n, n=\{0, , N-1\}\colon x(n)$ Let's concentrate on $M=N$ : $x(n)\stackrel{\mathrm{DFT}}{}X(k)$ for $n=\{0, , N-1\}$ and $k=\{0, , N-1\}$ $\mathrm{numbers}\mathrm{Nnumbers}$

## Discrete fourier transform (dft)

Define

$X(k)\equiv X(\frac{2\pi k}{N})$
where $N=\mathrm{length}(x(n))$ and $k=\{0, , N-1\}$ . In this case, $M=N$ .

## Dft

$X(k)=\sum_{n=0}^{N-1} x(n)e^{-i\times 2\pi \frac{k}{N}n}$

## Inverse dft (idft)

$x(n)=\frac{1}{N}\sum_{k=0}^{N-1} X(k)e^{i\times 2\pi \frac{k}{N}n}$

## Interpretation

Represent $x(n)$ in terms of a sum of $N$ complex sinusoids of amplitudes $X(k)$ and frequencies $\forall k, k\in \{0, , N-1\}\colon {}_{k}=\frac{2\pi k}{N}$

Fourier Series with fundamental frequency $\frac{2\pi }{N}$

## Remark 1

IDFT treats $x(n)$ as though it were $N$ -periodic.

$x(n)=\frac{1}{N}\sum_{k=0}^{N-1} X(k)e^{i\times 2\pi \frac{k}{N}n}$
where $n\in \{0, , N-1\}$

What about other values of $n$ ?

$x(n+N)=\mathrm{???}$

## Remark 2

Proof that the IDFT inverts the DFT for $n\in \{0, , N-1\}$

$\frac{1}{N}\sum_{k=0}^{N-1} X(k)e^{i\times 2\pi \frac{k}{N}n}=\frac{1}{N}\sum_{k=0}^{N-1} \sum_{m=0}^{N-1} x(m)e^{-i\times 2\pi \frac{k}{N}m}e^{i\times 2\pi \frac{k}{N}n}=\mathrm{???}$

## Computing dft

Given the following discrete-time signal ( ) with $N=4$ , we will compute the DFT using two different methods (the DFTFormula and Sample DTFT):

• DFT Formula
$X(k)=\sum_{n=0}^{N-1} x(n)e^{-i\times 2\pi \frac{k}{N}n}=1+e^{-i\times 2\pi \frac{k}{4}}+e^{-i\times 2\pi \frac{k}{4}\times 2}+e^{-i\times 2\pi \frac{k}{4}\times 3}=1+e^{-i\frac{\pi }{2}k}+e^{-i\pi k}+e^{-i\frac{3}{2}\pi k}$
Using the above equation, we can solve and get thefollowing results: $x(0)=4$ $x(1)=0$ $x(2)=0$ $x(3)=0$
• Sample DTFT. Using the same figure, , we will take the DTFT of the signal and get the following equations:
$X()=\sum_{n=0}^{3} e^{-in}=\frac{1-e^{-i\times 4}}{1-e^{-i}}=\mathrm{???}$
Our sample points will be: ${}_{k}=\frac{2\pi k}{4}=\frac{\pi }{2}k$ where $k=\{0, 1, 2, 3\}$ ( ).

## Periodicity of the dft

DFT $X(k)$ consists of samples of DTFT, so $X()$ , a $2\pi$ -periodic DTFT signal, can be converted to $X(k)$ , an $N$ -periodic DFT.

$X(k)=\sum_{n=0}^{N-1} x(n)e^{-i\times 2\pi \frac{k}{N}n}$
where $e^{-i\times 2\pi \frac{k}{N}n}$ is an $N$ -periodic basis function (See ).

Also, recall,

$x(n)=\frac{1}{N}\sum_{n=0}^{N-1} X(k)e^{i\times 2\pi \frac{k}{N}n}=\frac{1}{N}\sum_{n=0}^{N-1} X(k)e^{i\times 2\pi \frac{k}{N}(n+mN)}=\mathrm{???}$

## Illustration

When we deal with the DFT, we need to remember that, in effect, this treats the signal as an $N$ -periodic sequence.

## A sampling perspective

Think of sampling the continuous function $X()$ , as depicted in . $S()$ will represent the sampling function applied to $X()$ and is illustrated in as well. This will result in our discrete-time sequence, $X(k)$ .

Remember the multiplication in the frequency domain is equal to convolution in the time domain!

## Inverse dtft of s()

$\sum$ 2 k N
Given the above equation, we can take the DTFT and get thefollowing equation:
$N\sum$ n m N S n

Why does equal $S(n)$ ?

$S(n)$ is $N$ -periodic, so it has the following Fourier Series :

${c}_{k}=\frac{1}{N}\int_{-\left(\frac{N}{2}\right)}^{\frac{N}{2}} (n)e^{-i\times 2\pi \frac{k}{N}n}\,d n=\frac{1}{N}$
$S(n)=\sum$ 2 k N n
where the DTFT of the exponential in the above equation is equal to $(-\frac{2\pi k}{N})$ .

So, in the time-domain we have ( ):

## Connections

Combine signals in to get signals in .

Do somebody tell me a best nano engineering book for beginners?
what is fullerene does it is used to make bukky balls
are you nano engineer ?
s.
what is the Synthesis, properties,and applications of carbon nano chemistry
so some one know about replacing silicon atom with phosphorous in semiconductors device?
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
how to fabricate graphene ink ?
for screen printed electrodes ?
SUYASH
What is lattice structure?
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!