IR-bandpass-filter-with-entrance-signals

This program simulates the minimization of a simple function with the simple coordinate search method.(Simple coordinate search algorithm)

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).

semi conductor text book

说明：  采用粒子群算法求解可靠性优化问题，程序用MATLAB编写(Using particle swarm optimization algorithm for solving the reliability problems, procedures used to prepare MATLAB)

维纳滤波函数的MATLAB程序，消除信号中的噪声的一个程序，(Wiener filter function of the MATLAB program)

控制表的程序实现，用语言编写存入文本文档中(Program control table, use the language into the text document)

Matlab code that splits avi videos in several parts in order to work with them separately

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)

music与esprit算法，独立函数编写，可实现doa波达角的计算与估计。 (music and esprit algorithm)

说明：  自动化测试工具，便于自动化测试的实现，忘下载(automation testing)