dprca

本工具箱描述了非线性盲源分离的原理及算法(This toolkit described the principle and algorithm of nonlinear blind source separation)

通过傅里叶变换的方法，对两个单频信号的相位差进行计算，信号相关性计算(Fourier transform method, the phase difference between two single-frequency signal is calculated)

最优化方面的牛顿法算法，方便入门同学学习(Newton' s method algorithm optimized with respect to the most convenient entry students learning)

This program illustrates the Fuzzy c-means segmentation of an image. This program converts an input image into two segments using Fuzzy k-means algorithm. The output is stored as fuzzysegmented.jpg in the current directory. This program can be generalised to get n segments an image by means of slightly modifying the given code.

对检层法测井中出现的浅层时间倒转问题实现模拟，更好的理解测井中的这一问题。(Logging on Logging Method shallow back in time to appear in the issue of analog, a better understanding of logging in this issue.)

对一个四阶系统用DMC算法进行控制仿真，可移植性强，只需改变系统模型即可(With a fourth-order DMC algorithm to control system simulation, portability, you can simply change the system model)

线性相关 求逐月异常序列x(n,12)和y(n,12)(n是年)相同月份之间的滞后超前nt年的相关系数rt(-nt:nt,12)，其中nt最大的滞后或超前时间（单位：年）。 (Linearly related to demand monthly abnormal sequence x (n, 12) and y (n, 12) (n is the year) ahead of the same month lag between the years of the correlation coefficient nt rt (-nt: nt, 12), in which nt the largest lag or lead time (unit: years).)

内含大量关于优化问题的函数，如线性优化，整数规划，非线性规划(Contains a large number of optimization functions, such as linear optimization, integer programming, nonlinear programming)

this source code is wwdc in matlab

A 4 bit twisted ring counter is a sequential circuit which produces the following sequence of output values: 0000, 1000, 1100, 1110, 1111, 0111, 0011, 0001 and then repeats. Design a circuit for a 4 bit twisted ring counter that uses four D flip flops. Draw a state transition diagram, a state table and a schematic for your circuit. Design an alternate implementation using just three flip flops and draw a state transition diagram, state table and a schematic for your circuit. If your designs are extended to implement an n bit twisted ring counter, how many flip flops are required using each of the two approaches. In what situations would you prefer the first method? In what situations would you prefer the second?