资源列表
slm_modified
- selective mapping as a reduction technique for PAPR in OFDM systems
ofdm
- ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING PERFORMANCE CALCULATION OF BER MEASUREMENT-ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING PERFORMANCE CALCULATION OF BER MEASUREMENT..
mfiles
- matlab6.5的源代码，包含了所有实例的源代码，请多多支持-matlab6.5 source code, contains all instances of the source code, a lot of support! !
OFDMFREQUENCYOFFSET
- plotting Consecutive OFDM Subcarriers in Time domain..This program plots sensitivity of OFDM subcarriers with Carrier frequency offset(CFO)-plotting Consecutive OFDM Subcarriers in Time domain..This program plots sensitivity of OFDM subcarriers with
LU
- 此程序能进行矩阵的lu分解，对初学者很有帮助-This procedure can be the lu decomposition matrix, useful for beginners
gabp
- 遗传算法优化神经网络：使用遗传算法对BP网络权值阈值进行优化，再用BP算法训练网络-Genetic algorithm neural networks: Using genetic algorithm of BP network weights to optimize the threshold value, then BP algorithm training network
Optimization_Newton
- 设r是f(x) = 0的根，选取x0作为r初始近似值，过点（x0,f(x0)）做曲线y = f(x)的切线L，L的方程为y = f(x0)+f (x0)(x-x0)，求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0)，称x1为r的一次近似值。过点（x1,f(x1)）做曲线y = f(x)的切线，并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1)，称x2为r的二次近似值。重复以上过程，得r的近似值序列，其中x(n+1)=x(n)－f(x(n))/f (x(n))
Decomposition_LU
- 将系数矩阵A转变成等价两个矩阵L和U的乘积 ，其中L和U分别是下三角和上三角矩阵。当A的所有顺序主子式都不为0时，矩阵A可以唯一的分解为A=LU。其中L是单位下三角矩阵，U是上三角矩阵。 -The coefficient matrix A into two matrices L and U is equivalent to the product, where L and U are lower triangular and upper triangular matrix. When A mas
Decomposition_QR
- QR分解法是三种将矩阵分解的方式之一。这种方式，把矩阵分解成一个正交矩阵与一个上三角矩阵的积。QR 分解经常用来解线性最小二乘法问题。QR 分解也是特定特征值算法即QR算法的基础。-QR decomposition are the three ways of decomposition of the matrix. In this way, the matrix decomposition into an orthogonal matrix and an upper triangular mat
m-sequence-generator.
- 电子信息工程专业课程设计报告，用matlab实现m序列发生器-Electronic and Information Engineering curriculum design, implementation using matlab m-sequence generator
Region-growing-method
- 区域生长分割 matlab 手动点击设定种子点-Click on region growing segmentation matlab manual seed point set
daima
- 动态蚁群算法求解TSP问题，出自华中科技大学-Dynamic ant colony algorithm for TSP problem, from Huazhong University of Science and Technology