from
DIT Radix-2 FFT with Bit Reversal
by Dinesh Bhati
Decimation in Time Radix2 FFT algorithm by cooley and tuckey
|
| testmyfft1.m |
%SCRIPT TO COMPUTE THE OUTPUT OF INDIVIDUAL STAGES OF DIT RADIX-2 FFT
clc;
clear;
close all;
Nf=4;%INPUT SIZE IN POWERS OF 2
inputstr=rand(Nf,1)%random input with size in powers of 2
bh=[0:Nf-1];
lk=dec2bin(bh,log2(Nf));
for kl=1:Nf%LOOP TO COMPUTE BIT REVERSAL OUTPUT
nj=lk(kl,:);
for i=1:length(nj) njd(i)=str2double(nj(i));end
njdd=0;for i=1:length(njd) njdd=(njd(i))*2^(i-1)+njdd;end;
njdd1(kl)=njdd;
end
njdd1=njdd1+1;
ipbrevstr=inputstr(njdd1);%BIT REVERSAL INPUT TO MY FFT
myfftout=myfftcompact(ipbrevstr)
inbuiltfftout=fft(inputstr)
%%Scripts used are first bitreverse then complex vector generation
|
|
Contact us at files@mathworks.com