Desktop

自适应均衡器设计用于抑制信号失真，自适应均衡器节拍系数是时变调整的。(Adaptive equalizers remove signal distortion attributed to intersymbol interference in band-limited channels. The tap coefficients of adaptive equalizers are time-varying and can be adapted using several methods. When these do not include the transmission of a training sequence, it is referred to as blind equalization.)

滑模变结构控制在对一级倒立摆的控制，用于基础的变结构控制或者倒立摆控制学习。(Sliding Mode Variable Structure Control on an inverted pendulum control based on variable structure control for inverted pendulum control, or to learn.)

Matlab implementation af Schroeder algorithm

这个是端点检测的程序，用的是基于短时能量和过零率的方法，最后在语音信号的波形图上对检测到的端点进行了标注(This is the endpoint detection process, using a short-term energy and zero-based rate method, the last waveform in the speech signal detected on the endpoint to the mark)

说明：  此算法为最小二乘参数估计的递推算法。运行后得到辨识参数：a1= -1.4981, a2= 0.7038, b1= 1.0476, b2= 0.4704。(The algorithm for the recursive least squares parameter estimation algorithm. After operation to identify the parameters: a1 =-1.4981, a2 = 0.7038, b1 = 1.0476, b2 = 0.4704.)

rectifer sinosoidal first ejm

the attached all programs are based on error control coding for ex. LBC, Convolition, RS code etc. all programs are generalized means for any size input or any type of circuit respectively. the all programs are tested on matlab 2012

P and M class PMU examples for MATLAB

一个关于海杂波仿真，程序用burg法来估计功率谱密度，同时也画出了理论功率谱密度。(About sea clutter simulation procedures used burg method to estimate the power spectral density, but also to draw the theoretical power spectral density.)

文件包括：1.计算平均最短路径；2.计算每个顶点相邻节点的平均度；3.计算每个节点的邻近中心度；4.计算节点的介数（slow）；5.计算节点的介数（faster）；6.计算每条边的介数值；7.快速迪杰斯特拉算法；8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)