yiweimubiaogenzong

增广递推最小二乘参数辨识matlab程序(Augmented recursive least squares parameter identification procedure)

例子列举所有的进程基类，适合Window编程初学者。(The example gets all the process classes. for the fundamental coder)

该工具包是用来计算MIMO中的凸优化问题，工具包用在matlab中可用来简化计算(The kit is used to calculate the MIMO convex optimization problem in matlab toolkit used to simplify the calculation of available)

本程序为基于粒子群的IEEE 118 节点的电力系统优化调度程序(distributed generation voltage control environmental benefits active/reactive power integrated optimization particle swarm algorithm)

说明：  这是一个基于空时分组编码的MIMO_OFDM通信系统的仿真设计。此系统包括QPSK调制解调，IFFT调制，空时编解码，基于训练符号的信道估计等通信模块。 (This is a space-time block coding based on the MIMO_OFDM Communication System Simulation and Design. This system consists of QPSK modulation and demodulation, IFFT modulation, space time coding and decoding, based on training symbols such as communication channel estimation module.)

my_2bpsk.rar文件包含了一个m文件和一个低通滤波器数据文件，实现的数字通信系统的升余弦基带成型，bpsk数字调制，以及高斯白噪声、接收端相干解调系统处理的各个阶段，并用plot语句画出了相关波形,对于理解数字通信系统有很大的好处。(my_2bpsk.rar file contains an m file and a low-pass filter data file, to achieve the digital communication system raised cosine baseband shaping, bpsk digital modulation, and Gaussian white noise, the receiver coherent detection system at all stages of processing and used to draw the relevant waveform plot statement, the understanding of digital communication systems is highly desirable.)

说明：  交叉相关 图像处理 matlab程序 2D图像(Cross-correlation image processing matlab)

动态规划的matlab程序，参看胡良剑等编《数学实验--使用MATLAB》P180，所举的例子，希望对初学者有用(matlab dynamic programming)

Non negative matrix factorization. Using multiplicative update.

说明：  Manchester码的编码规则是，如果原始数据为“1”，将其编码成“10”；如果原始数据为“0”，将其编码成“01”。这种编码的特点是每个码元中间都有跳变，低频能量较少，便于接收端提取时钟信息。(Manchester, the coding rule is, if the original data is &quot 1&quot , be coded &quot 10&quot if the original data is &quot 0&quot , be coded &quot 01.&quot This code is characterized by the middle of each symbol has a jump, low energy less easy to extract the clock information on the receiving end.)