CG1.m

自己编写的比例导引法 simulink 打击机动目标(I have written simulink proportional navigation law against maneuvering targets)

模拟退化算法，用于解决TSP问题，有GUI(Analog degradation algorithm for solving TSP problem, there GUI)

计算方法中，拉格朗日插值法的源代码。在最后，绘出了拉格朗日插值法的图像和原图像的比较。原创。(Calculation method, Lagrange interpolation source code. In the end, draw a comparison image and the original image Lagrange interpolation. Original.)

由2个麦克风组成的麦克风阵列，画出它的方向图(Microphone arrays of the two microphones, shown in Fig its direction)

matlab实现jpeg编解码，对学习jpegde 很有帮助(jpeg codec matlab implementation of the study jpegde helpful)

这是一个正交交叉的量子行为粒子群算法的matlab程序（MOQPSO）,用户可以根据需求自己更换目标函数(this is an multi-collapse Orthogonal cross quantum-behaved particle swarm optimization program of matlab，the user can revise the Object function for your need.)

随机信号通过4fsk调制经过瑞利衰落信道的误码率仿真(reilaign channel)

K-均值算法的Matlab源代码，比较简短(Matlab source code of K-means algorithm )

通信的数字化是它能与计算机技术和数字信号处理技术相结合的基础，而实现通信数字化的前提是信源能提供的各种用于传递的消息，例如语音、图像、数据、文字等都必须以数字化形式表示。而信源编码是数字通信系统中的重要组成部分，他是保证信号有效传输的一种重要方式。霍夫曼编码依据字符出现的概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，其优越的性能被广泛使用在数字通信系统中。霍夫曼编码已经成为数据压缩的灵魂算法。本文介绍了无失真编码算法的构造，霍夫曼编码的规则和特点，同时分析了对信源进行优化的方法，最后通过MATLAB仿真来讨论比较二元霍夫曼编码、三元霍夫曼编码以及信源扩展编码的效率，来实现霍夫曼码的优化构造。(The digital communication is it can and computer technology and digital signal processing technology in combination of the base, and realize the digital communication is the premise of source can provide all kinds of used to deliver news, such as voice, video and data and text must take the digital form said. And the source coding digital communication system is the important component, he is to ensure the effective transmission signal is an important way. Huffman coding based on the probability of characters appear to construct different "the average length of the shortest code words, sometimes called the best coding, superior performance is widely used in digital communication system. Huffman coding has become the soul of data compression algorithm. This paper introduces the structure of the encoding algorithm without distortion, Huffman coding rules and characteristics, and analysis of the source of the optimization method, and finally by MATLAB simulation to discuss compares two yu)

In this work, we are interested in the problem of the coding channel with impulsive noise, whose goal is to correct the errors due to the channel at the time of a numeric transmission. In particular, the convolutional turbocodes constitutes the last progress in this domain and it is very close to the theoretical limit predicted by Shannon in 1948. The objective of this work is to study and to test this coding with the modulation BPSK, to improve the bit error rate (BER) in presence a additive white impulsive GGD noise using the MAP algorithm.