Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
0Activity
0 of .
Results for:
No results containing your search query
P. 1
digital signal processing practical 5

digital signal processing practical 5

Ratings: (0)|Views: 4|Likes:
Published by Atit Patel
Experiment 5

Discrete Fourier Transform & Inverse Discrete Fourier Transform
Program 1: Write a program to find the fast Fourier transform of the given signal. clc; clear All; close All; x=input('Enter The Sequence:-') N=length(x) if (N
elseif (N8) D=16-N x=[x zeros(1,D)] end

N = length(x) for j=1:1:N A=0; for k = 1:1:N R(j)=x(k)*(cos(2*pi*(k-1)*(j-1)/length(x))); A=R(j)+A; end R(j)=A; end R for j=1:1:length(x)

ATM
Experiment 5

Discrete Fourier Transform & Inverse Discrete Fourier Transform
Program 1: Write a program to find the fast Fourier transform of the given signal. clc; clear All; close All; x=input('Enter The Sequence:-') N=length(x) if (N
elseif (N8) D=16-N x=[x zeros(1,D)] end

N = length(x) for j=1:1:N A=0; for k = 1:1:N R(j)=x(k)*(cos(2*pi*(k-1)*(j-1)/length(x))); A=R(j)+A; end R(j)=A; end R for j=1:1:length(x)

ATM

More info:

Published by: Atit Patel on Nov 05, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

09/17/2013

pdf

text

original

 
 
Experiment 5
Discrete Fourier Transform & Inverse
 
Discrete Fourier Transform
Program 1:Write a program to find the fast Fourier transform of the given signal.
clc;clear All;close All;x=input('Enter The Sequence:-') N=length(x)if (N<=4)D=4-Nx=[x zeros(1,D)]elseif(N<8 && N>4)D=8-Nx=[x zeros(1,D)] elseif (N<16 && N>8) D=16-Nx=[x zeros(1,D)]end  N = length(x)for j=1:1:NA=0;for k = 1:1:NR(j)=x(k)*(cos(2*pi*(k-1)*(j-1)/length(x)));A=R(j)+A;endR(j)=A;endfor j=1:1:length(x)
D
IGITAL
S
IGNAL
P
ROCESSING
M.E. (E.C.), 1
ST
S
EMESTER
 
A
TMIYA
 
I
NSTITUTE
O
F
 
T
ECHNOLOGY
 
& S
CIENCE
,
AJKOT
.
 
 
Experiment 5
Discrete Fourier Transform & Inverse
 
Discrete Fourier Transform
A=0;for k = 1 : 1 : length(x)I(j)=x(k)* (sin((2*pi*(k-1)*(j-1))/length(x)));A=I(j)+A;endI(j)=A; endInew=R+i*IAnsswer----------Enter The Sequence:-[1 2 3 4]x =1 2 3 4 N =4D =0x =1 2 3 4 N =4R =
D
IGITAL
S
IGNAL
P
ROCESSING
M.E. (E.C.), 1
ST
S
EMESTER
 
A
TMIYA
 
I
NSTITUTE
O
F
 
T
ECHNOLOGY
 
& S
CIENCE
,
AJKOT
.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->