代码搜索：plot
找到约 10,000 项符合「plot」的源代码
代码结果 10,000
www.eeworm.com/read/464825/7060441
m ex_07_06_1.m
% ex_07_06_1.m : 习题 7.6
clear all;
N=31;
wr=boxcar(N); % for boxcar window;
[WR,f]=freqz(wr,1,256,'whole',1);
WR=20*log10(abs(WR)/abs(WR(1)));
wt=triang(N); % for triangle window
[WT,f]=f
www.eeworm.com/read/464825/7060446
m ex_09_10_1.m
% ex_09_10_1.m : 习题 9.10
clear all;
close all;
t=0:0.01:3;
a(1:100)=1;
a(101:200)=-1;
a(201:301)=1;
fs=1;
fc=.3;
figure('color','w');
subplot(421)
plot(t,a)
ylabel('a(t)')
axis([0 3
www.eeworm.com/read/464825/7060467
m ex_07_01_1.m
% ex_07_01_1.m : 习题 7.1
clear all;
close all;
N=28;
wn=0.25;
b1=fir1(N,wn,'stop',boxcar(N+1));
b2=fir1(N,wn,'stop',hamming(N+1));
[h1,w1]=freqz(b1,1,256,1);
[h2,w2]=freqz(b2,1,256,1)
www.eeworm.com/read/465040/7064703
m 3-4-5-2.m
%绘制指数函数曲线
p=-1:0.05:1;
t=exp(-p);
plot(p,t);
grid;
title('exponential function');
xlabel('x');
ylabel('y');
figure;
%建立并训练网络
for i=1:5
net=newgrnn(p,t,i/10);
y(i,:)=sim(net,p);
en
www.eeworm.com/read/254517/7072433
m cfreqz.m
% CFREQZ Function to plot pole-zero plot and transfer function of complex poles
% and zeros
%
% CFREQZ (zeros, poles, k) plots the pole zero diagram and tranfer function specified
%
www.eeworm.com/read/322305/7072510
m mfe_distrib_aux.m
function mfe_distrib_aux(x,dists,edft,radiobut,rems);
%MFE_DISTRIB_AUX Auxiliary routine for MFE_DISTRIB.
% MFE_DISTRIB_AUX(X,DISTS,EDFT,RADIOBUT,REMS) runs the computations and
% displays results
www.eeworm.com/read/221007/7074548
m ex5_8.m
t=0:0.01:2*pi;
x=exp(i*t);
y=[x;2*x;3*x]';
plot(y)
grid on; %加网格线
box on; %加坐标边框
axis equal %坐标轴采用等刻度
www.eeworm.com/read/172061/7074826
m kruskal.m
function [out,len]=kruskal(map)
%求最小生成树算法,通过kruskal算法求最优树,并给出相应图像.
%用法:
% 首先输入矩阵:
% map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边长n]
% 再用[out,len]=kruskal(map)求最优树
%参数说明
% map----3列邻接
www.eeworm.com/read/172061/7074827
m dijkstra.m
function [p,v]=dijkstra(map,u1,u2)
%求网络最短路径的dijkstra算法
%用法:
% 首先输入矩阵:
% map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边长n]
% 和u1,u2
% 注意：这里map为无向图。
% 再用[p,v]=dijkstra(map,u1,u2)求最短路径
www.eeworm.com/read/373224/7081735
m lpc.m
close all
clear
clc
[x,fs]=wavread('speech.wav');%读入数据
% 预加重滤波器
xx=double(x);
y=filter([1 -0.9495],1,xx);
N=160;
y1=y(1:N);
w1=hamming(N);
y2=(y1.*w1)';%加窗 取一帧数据
p=30;%预测阶数
%首先求自相关函数
r=ze