chengxu

贝叶斯压缩感知的仿真程序，此程序使用LAPLACE先验，(This is a simple example to test the fast Laplace algorithm from the following paper: S. D. Babacan, R. Molina, A. K. Katsaggelos. bayesian Compressive Sensing using Laplace Priors)

Created for generate fractals on sierspinsky shape.

找出一个4行5列的二维数组的”鞍点”，即该位置上的元素在该行上最大，在该列上最小。也有可能没有鞍点。(identify a line 4 5 2-D array of "saddle point," that is the position of the element in the largest firms, out of the smallest. They may not saddle point.)

fast smoothing of noise images

说明：  第2章 Simulink使用基础.ppt 第3章 动态系统模型及其Simulink表示.ppt(Chapter 2 the basis of Simulink use. Ppt Chapter 3 dynamic system model and its Simulink said. Ppt)

GPR DETECTION TARGET

多目标的粒子群算法例程，可以通过该粒子群遗传优化算法，进行matlab编程仿真，得到优化结果(Particle Swarm Optimization)

路径规划算法,采用人工智能方法模仿机器人通过障碍找到目标(route recognition)

compressive sensing theory

BCH(15,5,7)a communication system consists of binary source, 3 error-correcting BCH code of length 15 over GF(24) (i.e, BCH (15,5,7 code), the primitive polynomial is p(x)=1+x+x4), BPSK modulator, AWGN channel, coherent demodulator, decoder (either BMA or EA could be utilized to solve the error locator polynomial) and sink. Simulate and draw its error performance with and without BCH coding, together with the theoretical no-coding curve, i.e. two BER-EbNo curves.(a communication system consists of binary source, 3 error-correcting BCH code of length 15 over GF(24) (i.e, BCH (15,5,7 code), the primitive polynomial is p(x)=1+x+x4), BPSK modulator, AWGN channel, coherent demodulator, decoder (either BMA or EA could be utilized to solve the error locator polynomial) and sink. Simulate and draw its error performance with and without BCH coding, together with the theoretical no-coding curve, i.e. two BER-EbNo curves. )