-
lqrdmdfe
matlab code for lqrdmdfe algorithm in mimo ofdm systems for 4x4 and 8x8 systems.
- 2010-10-19 16:59:11下载
- 积分:1
-
jade
基于四阶累积量的联合对角化,其中给出两种四阶累积量计算方法,方便理解。这个算法还是比较难的,可以参看下独立分量分析中的jade算法(Fourth-order cumulant-based joint diagonalization, which gives two fourth-order cumulant method, easy to understand. This algorithm is quite difficult, you can see under the jade independent component analysis algorithm)
- 2010-05-21 22:27:22下载
- 积分:1
-
31500385OSTBC_OFDM
在空时分组码的MIMO-OFDM系统条件下,对信道,子载波,比特和功率进行分配,仿真结果表明,系统有良好的吞吐量性能(Space-time block codes in MIMO-OFDM system under the conditions of the channel, subcarrier, bit, and power allocation, simulation results show that the throughput of the system has good performance)
- 2011-01-09 17:20:46下载
- 积分:1
-
youhua1
遗传算法的电机优化程序,个人专门编写的,对于初学者来说,可以借鉴(function youhua1()
遗传算法
n-- 种群规模
ger-- 迭代次数
pc--- 交叉概率
pm-- 变异概率
v-- 初始种群(规模为n)
f-- 目标函数值
fit-- 适应度向量
vx-- 最优适应度值向量
vmfit-- 平均适应度值向量
clear all
close all
clc 清屏
tic 计时器开始计时
n=20 ger=100 pc=0.9 pm=0.1 初始化参数
生成初始种群
v=init_population(n,44) 得到初始种群,22串长,生成20*22的0-1矩阵
[N,L]=size(v) 得到初始规模行,列
disp(sprintf( Number of generations: d ,ger))
disp(sprintf( Population size: d ,N))
disp(sprintf( Crossover probability: .3f ,pc))
disp(sprintf( Mutation probability: .3f ,pm)) sprintf可以控制输出格式
待优化问题)
- 2020-12-11 20:19:19下载
- 积分:1
-
PID-Optimization
this program in matlab
- 2012-02-03 20:07:25下载
- 积分:1
-
boost_switching
BOOST SWITCHING PV SOLAR CELL
- 2016-08-02 21:14:28下载
- 积分:1
-
svc
支持向量机实现代码!(Support vector machine to achieve code!)
- 2007-08-04 10:39:11下载
- 积分:1
-
PIDCONTROLMATLAB
一种用MATLAB实现的控制,能达到很优的效果,大家不防试试。(A MATLAB implementation of the control, can achieve the very excellent results, we do not try prevention.)
- 2009-03-14 09:40:05下载
- 积分:1
-
caipiao
一个gui案例,可以产生随机的双色球数据,免去你的烦恼(For a gui case can produce random ShuangSeQiu data, and turn away your troubles)
- 2012-11-24 22:01:44下载
- 积分:1
-
蚁群算法的优化计算(TSP优化问题)
说明: 采用蚁群算法解决TSP旅行商问题。先用dijkstra算法生成初始次优路径,再用蚁群算法搜索全局最优路径。(Ant colony algorithm is used to solve TSP traveling salesman problem. First, Dijkstra algorithm is used to generate the initial suboptimal path, and then ant colony algorithm is used to search the global optimal path.)
- 2020-03-21 18:19:54下载
- 积分:1