ReadFID

利用matlab 和 差分方法求解非线性方程(Difference Methods Partial Differential Equations)

利用matlab的lpc function 實做出將input source音檔算出其coefficent and gain並由上述資料可以重新合成還原音訊(The lpc function using matlab real audio file to make the input source is calculated by its coefficent and gain reduction above information can be re-synthesized audio)

在matlab环境下利用小波实现噪声的去除(Matlab environment in the realization of the use of wavelet noise removal)

Generation of room impulse genration with thiran filter

我们设计和实验证明 布拉格光栅波分复用器 三波长的平面光波电路复用 公交车站台。1310和1550 nm的光，被设计成 由一个半周期通过定向耦合器分离后 和一个完整的周期耦合作用与0.07和0.19分贝的损失， 分别。1492 nm的光反射回来的布拉格 光栅对定向耦合器及其制作少损失 超过2分贝。我们也介绍和讨论新概念 集成光学三工收发器，使用此过滤器。 (We designed and experimentally demonstrated a Bragg grating-assisted wavelength-division-multiplexing filter for the three-wavelength multiplexing on a planar-lightwave-circuit platform. The 1310- and 1550-nm lights were designed to be separated after passing the directional coupler by a half-cycle and a full-cycle coupling actions with losses of 0.07 and 0.19 dB, respectively. The 1492-nm light was reflected back by a Bragg grating fabricated on the directional coupler and its loss was less than 2.0 dB. We also introduced and discussed the new concept of an integrated optical triplexer transceiver using this filter.)

matlab代码实现一个快速时钟恢复的代码，这里可以看到一个具体的clock and data recovery的例子(it is about clock and data recovery，is a very useful tools to simulate the problems in communication!)

小波滤波，可用于心电信号、脉搏波信号的滤波(Wavelet filtering, can be used for ECG, pulse wave signal filtering)

遗传算法实例，是一个计划编排问题，适用于各类计划编排的优化问题。(GA example, is a programming issue, applicable to all types of programming optimization.)

频率响应分析 FDD法 测频率 频率响应分析 FDD法 测频率 频率响应分析 FDD法 测频率(FDD frequency response analysis method to measure the frequency of the frequency response analysis method to measure the frequency FDD FDD frequency response analysis method to measure the frequency)

TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.