BLDC_PI_controller

Analytic Model for Gain Modulation in EDFAs

时频分析工具箱是基于matlab的语言设计的一种基于时频分析的信号处理方法.(Time-frequency analysis matlab toolbox is based on the language of design based on time-frequency analysis of signal processing methods.)

这是用Matlab编写的卡拉曼滤波程序，用于PPP精密单点定位。(It is written with Matlab Karaman filtering process, precise point positioning for the PPP.)

MATLAB数字图象处理的主要源码.包括图象去噪变换增强恢复识别压缩的各种算法(MATLAB digital image processing the main source. Transform Image Denoising including enhanced recovery recognition of the compression algorithms)

系统介绍了MATLAB7.0的基本功能，并设计了丰富的实例(MATLAB7.0 system introduced the basic functions and design a wealth of examples)

选择五个不同频段的信号对其进行频谱分析，根据信号的频谱特征设计五个不同的数字滤波器，将五路信号合成一路信号，分析合成信号的时域和频域特点，然后将合成信号分别通过设计好的五个数字滤波器，分离出原来的五路信号，分析得到的五路信号的时域波形和频谱，与原始信号进行比较，说明频分复用的特点。(To select one of five different band signal spectrum analysis and design of five different digital filter based on the spectral characteristics of the signal, the the Rd signal synthesizing all the way to the signal analysis in time domain and frequency domain characteristics of the synthesized signal, and then the synthesis signal by five digital filter designed, separated original signal Rd, the time-domain waveform and spectrum analysis the Rd signal is obtained, to be compared with the original signal, the frequency division multiplexed with the characteristics.)

近场声全息，里边包括全息技术的matlab程序，数据等。(Sound holographic technology, including holographic technology matlab procedures, data, etc.)

提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)

龙贝格积分，MATLAB程序，计算方法作业，内有说明(Romberg integration, MATLAB procedures, calculation methods work, there are instructions)

ASK_FSK_PSK digital signals