fiebang

啁啾光纤光栅，反应其延时功能，不同波长的反射光谱图(Chirped fiber grating, the response delay function, different wavelengths of reflection spectra)

this is a kmeans clustering code writen in matlab

一个简单的modulation的例子,关于AM,FM,载波等(a simple modulation example, on the AM, FM, etc. Carrier)

这是一个matlab人脸识别程序代码，有GUI界面(This is a face recognition matlab code, there is a GUI interface)

matlab实现CIC滤波器，包括积分滤波器和梳状滤波器(Matlab implementation of the CIC filter, including integral filter and comb filter)

一个经典的分块DCT数字图像水印算法 嵌入 提取(A classical DCT block of digital image watermark embedding algorithm extracts)

calculate the mean of a vector

含DG的配网无功优化计算研究，包括风力发电和光伏电池微型燃气轮机和燃料电池(Distribution network with DG' s reactive power optimization studies, including micro-wind turbines and photovoltaic cells and fuel cells)

模糊控制应用实例-洗衣机的模糊控制 以洗衣机的洗涤时间的模糊控制系统设计为例，其控制是一个开环的模糊决策过程。 包括下面三个程序 （1）污泥和油脂隶属函数设计仿真程序；（2）洗涤时间隶属函数设计仿真程序；（3）洗衣机模糊控制系统仿真程序(Fuzzy control application examples- Fuzzy Control of washing machines Washing machine washing time fuzzy control system design, for example, the control is an open-loop fuzzy decision-making process. Include the following three program (1) design and simulation program of the sludge and grease membership function (2) washing time membership function design simulation program (3) washing machine fuzzy control system simulation program)

This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform [12, 10] in two and three dimensions. The first digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is based on the wrapping of specially selected Fourier samples. The two implementations essentially differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both digitaltransformations return a table of digital curvelet coefficients indexed by a scale parameter, anorientation parameter, and a spatial location parameter. And both implementations are fast in the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.