登录
首页 » matlab » duan1

duan1

于 2015-04-21 发布 文件大小:2KB
0 383
下载积分: 1 下载次数: 37

代码说明:

  实现扩频里随机信号和扩频信号的产生以及用匹配滤波器实现伪码捕获和相干积分和非相干积分得MATLAB程序(Realization of random signals and generating a spread in the spread spectrum signal and the matched filter to achieve pseudo-code acquisition and integration of coherent and non-coherent integration program was MATLAB)

文件列表:

duan1.m,4118,2015-04-15

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

发表评论

0 个回复

  • adpmedian
    这是自适应中值滤波的matlab函数实现,可以清晰的保存图像的细节。(This is the adaptive median filtering matlab function to achieve, you can save the image clear the details.)
    2012-01-07 16:46:31下载
    积分:1
  • decision_tree
    模式识别中训练决策树、测试决策树、计算决策树中熵不纯度的函数。(Pattern recognition training decision tree, test tree, tree entropy calculation is not a function of purity.)
    2013-05-24 15:12:26下载
    积分:1
  • MATLAB-TOOLBOX-FUNCTION
    MATLAB工具箱函数TOOLBOX FUNCTION,方便对照。(MATLAB toolbox function TOOLBOX FUNCTION is convenient control.)
    2012-04-05 10:40:46下载
    积分:1
  • odegalerkin
    This is a galerkin numerical solver. This is a galerkin numerical solver. This is a galerkin numerical solver. This is a galerkin numerical solver.
    2013-04-03 10:54:20下载
    积分:1
  • c4mrnd1
    应用simulink模拟数据分析处理的过程,(simulink UUU)
    2012-03-26 09:58:17下载
    积分:1
  • LS3P
    线性化法仿真三个参考节点定位一个定位节点,随机噪声均方差随机分布在[4,10],多径效应,权重分布在[0.85,1]。(Linearization method simulation of three reference nodes positioning a positioning node, the variance of random noise are randomly distributed in [4,10], multi-path effects, the weight distribution in [0.85,1].)
    2011-11-23 10:17:02下载
    积分:1
  • FH
    这是一个用simulink搭建的经典的跳频模型,对了解跳频有一定的帮助,模型,调试过了,没有问题。(This is a FH model in simulink.)
    2021-03-19 14:59:19下载
    积分:1
  • Sinsis8_Konvolusi-Kontinyu
    convolution signal continue
    2015-03-05 11:40:34下载
    积分:1
  • fast-matlab-src-2.0
    faster corner detection matlab code
    2013-11-29 06:34:16下载
    积分:1
  • K_Means_image_compression
    - K means algorithm is performed with different initial centroids in order to get the best clustering. - The total cost is calculated by summing the distance of each point to its cluster centre and then summing over all the clusters.Based on the minimum overall cost achieved during each iteration of iterKMeans the pixel assignment to their respective clusters are made and final compressed image is obtained. This algorithm will run slower as the number of clusters , size of the image and number of iterations increase.
    2013-07-26 15:49:00下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载