Generator

正交变换源程序，带vc工程。 学习正交变换算法的有力工具。(Orthogonal transformation source code, with vc works. Orthogonal transformation algorithm to learn a powerful tool.)

递归神经网络-实时学习训练算法代码，亲测可用，简洁无误，容易上手。( Recursive neural network- real-time learning training algorithm code, pro-test available, simple and correct, easy to use.)

把十六进制数转换为十进制数，简单方便！能用于串口通信数据处理中(The hexadecimal number is converted to a decimal number, is simple and convenient! Can be used for serial communication data processing)

EDFA的掺铒光纤长度模拟计算，附3篇相关论文，330mw的980nm泵泵浦，3db的泵浦吸收，12m最佳长度已经的到验证，可作为EDFA设计参考 (EDFA erbium-doped fiber length simulation of three related papers, 330mw of 980nm pump pump pump 3db absorption 12m optimum length has been to verify, can be used as the EDFA design reference)

多项式的加减法运算，输入的多项式带有未知数x和数字(Polynomial addition and subtraction calculations)

提供函数能进行1维2维的FFT，输入输出的序列长度应为2的整数次方倍(Provides functions can be one-dimensional two-dimensional FFT, sequence length input and output should be an integer power of 2 times)

对平面上给定的多点进行多项式曲线的拟合，可设置拟合多项式的次数(Given more points on the plane polynomial curve fitting, you can set the number of polynomial fitting)

新建复数类进行复数运算，重载+、=+、*、/等运算符用于复数间的运算。(New complex class complex operation, overloading+ =+,*,/operator for computing the plural.)

针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足，本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化，并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率，提高解的精确，同时还保持了较低的计算复杂度，具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)

本程序包括：DFT（离散傅里叶变换），FFT（快速傅里叶变换），IFFT（快速傅里叶逆变换），conv（卷积：圆周卷积、线性卷积），主要应用于信号处理，既可以对实序列做上述操作，也可以对复序列。(This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circular convolution, linear convolution), mainly used signal processing, either on the actual sequence to do the operation, can also be complex sequence.)