登录
首页 » matlab » BTL_Nhom9_VP2012

BTL_Nhom9_VP2012

于 2015-03-31 发布 文件大小:5KB
0 323
下载积分: 1 下载次数: 1

代码说明:

  BTL thay dai, dai so 2, giai tich, tich phan, matlab code, TS Le Xuan Dai

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • ASKmod
    通过此代码,实现ASK调制。模拟基带信号频率为1kHz,正弦载波信号频率为6kHz。(ASK MODULATION)
    2009-06-11 15:25:00下载
    积分:1
  • daitonglvbo1
    matlab带通滤波程序 两个滤波器都是切比雪夫I型数字滤波器,不是巴特沃尔滤波器,包括实例 (bandpass filtering matlab program)
    2014-10-21 21:19:55下载
    积分:1
  • ver_0.8
    CNN - Convolutional neural network class
    2010-06-13 23:09:47下载
    积分:1
  • New
    Standard MCM communications system
    2010-08-10 20:06:05下载
    积分:1
  • hh
    说明:  小波去噪,以Haar和db4小波基为例的去噪代码(wavelet,haar,db4)
    2020-09-02 15:38:08下载
    积分:1
  • Time-domain-analysis-
    对离散信号进行数据采集图样对比,进行时域分析(Discrete signals for data acquisition pattern contrast, the time domain analysis)
    2015-04-13 18:47:58下载
    积分:1
  • 2010.7.4
    自己写的广义LDPC的程序,包括编译码,其中最重要的是一码算法,用的是chase算法,有很好的性能,希望可以跟大家交流改进(Generalized LDPC write procedures, including the encoding and decoding, most important of which is a code algorithm, using a chase algorithm has good performance, hoping to improve communication with everyone)
    2010-08-05 16:09:57下载
    积分:1
  • 01bagProblemGreedy
    0/1背包问题的贪心优化解法 邓宏涛朱蜘 (江汉大学数学与计算机学院武汉430056) 摘要:介绍了0/1背包问题的基本贪心算法的解决策略,通过对贪心算法的改进和优化,找出0/1背包问题的最优解 的很好近似。(0/1 knapsack problem greedy optimization method of邓宏涛Zhu spider (Jianghan University, Mathematics and Computer Science, Wuhan 430056) Abstract: 0/1 knapsack problem of the greedy algorithm to solve the basic strategy of the greedy algorithm through the improvement and optimization, to find 0/1 knapsack problem of the optimal solution of a very good approximation.)
    2009-05-28 17:28:47下载
    积分:1
  • linclass
    这个是用于两类的带有类别的数据的线性分类器,是结构体类型如下判别 y(i) = 1 if W *X(:,i) + b >= 0 2 if W *X(:,i) + b < 0(his function classifies input data X using linear discriminant function: y(i) = argmax W(:,y) *X(:,i)+ b(y) y where parameters W [dim x nfun] and b [1 x nfun] are given in model and nfun is number of discriminant functions. In the binary case (nfun=1) the classification rule is following y(i) = 1 if W *X(:,i)+ b >= 0 2 if W *X(:,i)+ b < 0)
    2011-05-01 17:58:21下载
    积分:1
  • LBM-two-phase
    格子BLOTZMANN方法,两相流 matlab程序(Lattice BLOTZMANN method, two phase flow matlab program)
    2021-03-12 16:49:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载