code

已实现了MATLAB下的音频AGC，效果还可以，做起来才发觉比较简单，关键是要有高效的算法。如果能在实现AGC的同时做到噪音消除和回音消除，则效果更佳。(MATLAB has been achieved under the audio AGC, the effect can be done only to find relatively simple, the key is to have efficient algorithms. If you can do while in the realization of the AGC noise cancellation and echo cancellation, the better.)

MATLAB Source Code of 3D Rigid body Transformation

数字下变频DDC的matlab原码，采用cordic算法(DDC The DDC matlab source code, you can refer to see)

matlab实现特征值的计算，对于初学者非常有用。从书上下载的源代码。(Feature is matlab calculation, is very useful for beginners. Downloaded from the book source code.)

运行结果三张图片直观看出相干积累前后信号图谱对比，简单直观使读者能明白相干积累功能用途(Three images visually see the results before and after the coherent accumulation patterns contrast signal, simple and intuitive so that readers can understand the functional use of coherent accumulation)

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.

自抗扰仿真源码，含有simulink框图和s语言(ADRC source of emulation and s contain simulink block diagram language)

数据与计算机通信相关知识的详细介绍和研究。( Data and computer communications)

说明：  关于可见光通信信道建模的有关对数正态pdf的MATLAB代码。(MATLAB code of lognormal PDF for modeling of visible light communication channel.)

算法，采用Dijk算法，求网络所有点的最短路径和网络的平均最短路径(Algorithm, using Dijk algorithm, and all points of the shortest network path and the average shortest path network)