SVG

说明：  精通MATLAB优化计算算法，非线性最小二乘问题。共3个程序。(Proficient in MATLAB optimization calculation algorithm, nonlinear least squares problems. A total of three procedures.)

本代码是《通信信号处理》课程的大作业相应的代码。主要是通信信号发射端的仿真，具体功能是：1. 产生任意长度的伪随机序列，将序列映射为I,Q两路的信号，2.均方根升余弦滤波器成型. 3.经过通带衰减为3dB的倾斜滤波器（模拟信道衰落效果）4.插零，半带滤波器升抽样。 5.NCO处理单元调制(This code is communication signal processing courses corresponding to the large code. Mainly is the simulation of the communication signal transmitter, the specific functions are: 1. Produce arbitrary length of the pseudo-random sequence, the sequence mapping for the I, Q two-way signal, 2. Raise the root-mean-square filter forming 3. After passband attenuation 3dB tilt filter (analog channel fading effect) 4. Insert zero, half-band filter l sampling. 5. NCO processing unit modulation)

XGM SOA model for semiconductor optical amplifier

等间距线性阵列，阵元数M=8，阵元间距d= λ /2，等幅加权，目标方位φr =0°。产生空间白噪声矢量（复高斯分布）。 设阵列信号矢量元素s(m)=exp[j mψr]，其信号幅度为1，该阵元接收机附加的高斯噪声为n(m)=nmr+jnmi，其中实虚部均为独立同分布N(0, σ2)的高斯随机数，则该通道合成信号x(m)=s(m) + n(m)，其中信噪比为： SNR = 10 lg[1/(2σ2)] = – 3 – 10 lg(σ2) (dB) (The spacing of the linear array, and the array element number M = 8, the array element spacing d = λ/2, equal amplitude weighted target azimuth φR = 0. Space generated white noise vector (complex Gaussian distribution). Let array signal vector elements s (m) = exp [j mψr], the signal amplitude, the element receiver additional Gaussian noise n (m) = nmr+jnmi which the real and imaginary parts are independent and identically distributed N ( Gaussian random numbers of 0, σ2), the channel the synthesis signal x (m) = s (m) the PPLS n (m), where SNR is: SNR = 10 lg [1/(2σ2)] =- 3- 10 lg (σ2) (dB))

非常有用的matlab实用例程,mei you mi ma(very useful practical Matlab routines, mei you mi ma)

最短路 matlab 以最短行走中国为例 可视化整个过程 遗传算法(TSP GA MATLAB)

移动衰落信道，该书是英文版，非常好的一本书，还有matlab源代码。(Mobile fading channel, the book is the English version, a very good book, there are matlab source code.)

smuilink仿真教程 十分详细，适合自学的人(smuilink Simulation Tutorial)

利用MATLAB实现龙格库塔，进而解欧拉方程。(Using matlab realize Runge-Kutta, Euler equations solution)

Graph-Based Segmentation 是经典的图像分割算法，该算法是基于图的 贪心聚类 算法，实现简单，速度比较快，精度也还行。(Graph based Segmentation is a classical image Segmentation algorithms, the algorithm is Based on the figure of greedy clustering algorithm, speed is faster, and easy to implement precision is also ok.)