zhucijingxiang

a m.file that simulate BPSK with encoder, and channel burst is considered.

modelling techniques are explained here

Description All the filters have needed neighbor data the current pixel in the image,here this function(res_window=cover_window(how many neighbor value for row ,how many neighbor value for column ,input image) produce the result( res_window(row,col,total size)) input inp_img=2d data(row * col) w=cover size w=[3 3] = 3x3 cover pixel generation output o_img=result 3d o_img(w(1),w(2),r*col) if inp_img=[1 2 3 4 5 6 ] w=[3 3] Soloution it will construct new image new_img=[0 0 0 0 0 0 1 2 3 0 0 4 5 6 0 0 0 0 0 0] result o_img(:,:,1)=[0 0 0 0 1 2 0 4 5] o_img(:,:,2)=[0 0 0 1 2 3 4 5 6] finally o_img(1:3,1:3,6) example a=imread( pears.png ) b=rgb2gray(a) c=cover_window( b,[3 3]) 3x3 window construction

matlab中信噪比计算程序，可以检验使用matlab内置函数添加的噪声是否正确(Can be tested using matlab citic noise ratio calculation, matlab built-in functions to add noise is correct )

The Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. For these reasons Padé approximants are used extensively in computer calculations.

机器人matlab编程课本的程序，每一个程序都很好。(The Program of Robot Matlab Programming Textbook)

维特比硬判决的译码程序，可以经过简单修改适应任何的约束长度(Hard-decision Viterbi decoding process can be simply adapted to any constraint length)

互相关函数,cross-correlation function

说明：  高通滤波器，带通滤波器，数字FIR滤波器(The Shannon entropy is a measure of the average information content one is missing when one does not know the value of the random variable. The concept was introduced by Claude E. Shannon in his 1948 paper "A Mathematical Theory of Communication". Shannon s entropy represents an absolute limit on the best possible lossless compression of any communication, under certain constraints: treating messages to be encoded as a sequence of independent and identically-distributed random variables, Shannon s source coding theorem shows that, in the limit, the average length of the shortest possible representation to encode the messages in a given alphabet is their entropy divided by the logarithm of the number of symbols in the target alphabet. )

说明：  多目标优化的例证，用粒子群算法做的。调试过，没问题，能用。(multi-objective ,PSO)