搜索结果
找到约 10 项符合
zeros 的查询结果
按分类筛选
书籍源码 计算全息close all clc clear A=zeros(64) A(15:20,20:40)=1 A(15:50,20:25)=1 A(45:50,20:40)=1 A(30:34,
计算全息close all clc clear
A=zeros(64)
A(15:20,20:40)=1 A(15:50,20:25)=1
A(45:50,20:40)=1 A(30:34,20:35)=1
％ ppp=exp(rand(64)*pi*2*i) A=A.*ppp
％ Author s email: zjliu2001@163.com
figure imshow(abs(A),[])
Fa=fft2(fftshift(A)) Fs=fftshift(Fa)
Am=abs(Fs) ％ amplitude
Ph=angle(Fs) ％ phase
s=11 ...
DSP编程 卡尔曼滤波器matlab程序
load initial_track  s; % y:initial data,s:data with noiseT=0.1;
% yp denotes the sample value of position% yv denotes the sample value of velocity% Y=[yp(n);yv(n)];% error deviation caused by the random acceleration % known dataY=zeros(2,200);Y0=[0;1];Y(:,1)=Y0;A=[1 T    0 1];&nb ...
Linux/Unix编程 The Reed-Somolon code is specified by the finite field, the length (length <= 2^m-1), the numbe
The Reed-Somolon code is specified by the finite field, the length
(length <= 2^m-1), the number of redundant symbols (length-k), and
the initial zero of the code, init_zero, such that the zeros are:
init_zero, init_zero+1, ..., init_zero+length-k-1
数学计算 平均因子分解法
平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies:
(1) U U = X
(2) U is upper triangul ...
人工智能/神经网络 标准的遗传算法代码
标准的遗传算法代码，下面是程序：function y=fitness(chrom,p,aim)
global P_cross P_mutation
[Popsize len]=size(chrom)
fitness_gene=zeros(Popsize,1)
in_he=zeros(4,1)
out_he=zeros(4,1)
in_out=0
out_out=0
人工智能/神经网络 function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 ％ Exponent fo
function [U,center,result,w,obj_fcn]= fenlei(data)
[data_n,in_n] = size(data)
m= 2 ％ Exponent for U
max_iter = 100 ％ Max. iteration
min_impro =1e-5 ％ Min. improvement
c=3
[center, U, obj_fcn] = fcm(data, c)
for i=1:max_iter
if F(U)>0.98
break
else
w_new=eye(in_n,in_n)
center1=sum(cent ...
微处理器开发 44b0公版的测试程序
44b0公版的测试程序， *******************************************************
* NAME : 44BINIT.S *
* Version : 10.JAn.2003 *
* Description: *
* C start up codes *
* Configure memory, Initialize ISR ,stacks *
* Initialize C-variables *
* Fill zeros into zero-initialized C-varia ...
matlab例程 FFTGUI Demonstration of Finite Fourier Transform. FFTGUI(y) plots real(y), imag(y), real(fft(y)
FFTGUI Demonstration of Finite Fourier Transform.
FFTGUI(y) plots real(y), imag(y), real(fft(y)) and imag(fft(y)).
FFTGUI, without any arguments, uses y = zeros(1,32).
When any point is moved with the mouse, the other plots respond.
Inspired by Java applet by Dave Hale, Stanford Explo ...
源码 批处理感知器算法
批处理感知器算法的代码matlab
w1=[1,0.1,1.1;1,6.8,7.1;1,-3.5,-4.1;1,2.0,2.7;1,4.1,2.8;1,3.1,5.0;1,-0.8,-1.3;
&nbsp; &nbsp; 1,0.9,1.2;1,5.0,6.4;1,3.9,4.0];
w2=[1,7.1,4.2;1,-1.4,-4.3;1,4.5,0.0;1,6.3,1.6;1,4.2,1.9;1,1.4,-3.2;1,2.4,-4.0;
&nbsp; &nbsp; 1,2.5,-6.1;1,8.4,3.7;1,4.1,-2.2];
w3=[1,-3.0,-2. ...
习题答案 DTFT的计算
已知系统函数为H(z)=1/[(1-0.2z^-1)(1-0.3z^-1)(1+0.4z^-1)]。试用长除法求h(n)的6点输出。 答案：clc;clear all;b=1;a=poly([0.2,0.3,-0.4]);x=deconv([1,zeros(1,6+4-1-1)],a)