eetop.cn_HCS300

1）已知2N点实数序列 N=64。用一个64点的复数FFT程序，一次算出 ，并绘出频谱 。 （2）已知某序列 在单位圆上的N=64等分样点的Z变换 。用N点IFFT程序计算 ，绘出图像 。 (1) known 2N-point sequence of real numbers N = 64. With a 64-point complex FFT process, a calculated and mapped the spectrum. (2) known to a certain sequence in the unit circle on the N = 64 sub-samples of the Z transform. N-point IFFT procedures used, the mapped image.)

eASY wAY TO dETECT bACKROUND

mimoofdm with more accurate ls estimation

说明：  krenal graph cut is a co segmentation method for the segmentation of the brain tumor

code to decode raw eeg data..eeg sample matrices

讲述经验模态分解的应用，对于其原理及消噪功能有很好的介绍(About the application of EMD)

数学建模迪卡斯特拉算法，最短路问题图论的应用(Mathematical modeling Ducasse Terra algorithm)

用Thompsson算法找到数组中的outlier，具体用法可以用help查阅。(Thompson algorithm used to find the array of outliers, the specific usage can help.)

Simulate MIMO system with BER and capacity

说明：  基于matlab的桁架有限元分析，对理解位移法的有限元分析非常有帮助(finite element analysis with matlab)