文件名称:11
介绍说明--下载内容来自于网络,使用问题请自行百度
empirical formula with kaiser
clc
clear all
fs=1000
fc=250
df=50
r=0.001
f=fc/fs
dw=2*pi*(df/fs)
a=-20*log(r)
n=floor(((a-8)/(2.285*dw))+1)
if a>50
b=0.1102*(a-8.7)
elseif a>=21 && a<=50
b=0.5842*((a-21)^0.4)+0.07886*(a-21)
elseif a<21
b=0.0
end
w=kaiser(n,b)
for i=1:n
if i~=(n-1)/2
hd(i)= (2*f*sin((i-((n-1)/2))*2*pi*f))/((i-((n-1)/2))*2*pi*f)
elseif i==(n-1)/2
hd(i)=2*f
end
end
for j=1:n
h(j)=w(j)*hd(j)
end
subplot(3,1,1), plot(w)
subplot(3,1,2), plot(h)
subplot(3,1,3), plot(h,n)
- empirical formula with kaiser
clc
clear all
fs=1000
fc=250
df=50
r=0.001
f=fc/fs
dw=2*pi*(df/fs)
a=-20*log(r)
n=floor(((a-8)/(2.285*dw))+1)
if a>50
b=0.1102*(a-8.7)
elseif a>=21 && a<=50
b=0.5842*((a-21)^0.4)+0.07886*(a-21)
elseif a<21
b=0.0
end
w=kaiser(n,b)
for i=1:n
if i~=(n-1)/2
hd(i)= (2*f*sin((i-((n-1)/2))*2*pi*f))/((i-((n-1)/2))*2*pi*f)
elseif i==(n-1)/2
hd(i)=2*f
end
end
for j=1:n
h(j)=w(j)*hd(j)
end
subplot(3,1,1), plot(w)
subplot(3,1,2), plot(h)
subplot(3,1,3), plot(h,n)
clc
clear all
fs=1000
fc=250
df=50
r=0.001
f=fc/fs
dw=2*pi*(df/fs)
a=-20*log(r)
n=floor(((a-8)/(2.285*dw))+1)
if a>50
b=0.1102*(a-8.7)
elseif a>=21 && a<=50
b=0.5842*((a-21)^0.4)+0.07886*(a-21)
elseif a<21
b=0.0
end
w=kaiser(n,b)
for i=1:n
if i~=(n-1)/2
hd(i)= (2*f*sin((i-((n-1)/2))*2*pi*f))/((i-((n-1)/2))*2*pi*f)
elseif i==(n-1)/2
hd(i)=2*f
end
end
for j=1:n
h(j)=w(j)*hd(j)
end
subplot(3,1,1), plot(w)
subplot(3,1,2), plot(h)
subplot(3,1,3), plot(h,n)
- empirical formula with kaiser
clc
clear all
fs=1000
fc=250
df=50
r=0.001
f=fc/fs
dw=2*pi*(df/fs)
a=-20*log(r)
n=floor(((a-8)/(2.285*dw))+1)
if a>50
b=0.1102*(a-8.7)
elseif a>=21 && a<=50
b=0.5842*((a-21)^0.4)+0.07886*(a-21)
elseif a<21
b=0.0
end
w=kaiser(n,b)
for i=1:n
if i~=(n-1)/2
hd(i)= (2*f*sin((i-((n-1)/2))*2*pi*f))/((i-((n-1)/2))*2*pi*f)
elseif i==(n-1)/2
hd(i)=2*f
end
end
for j=1:n
h(j)=w(j)*hd(j)
end
subplot(3,1,1), plot(w)
subplot(3,1,2), plot(h)
subplot(3,1,3), plot(h,n)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
11.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.