登录
首页 » matlab » fh

fh

于 2010-04-30 发布 文件大小:1KB
0 235
下载积分: 1 下载次数: 0

代码说明:

说明:  Frequency Hopping Spread Spectrum 这是一个跳频信号的时频分析程序(Frequency Hopping Spread Spectrum is a frequency-hopping time-frequency analysis program)

文件列表:

fh\e1.m
fh

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

发表评论

0 个回复

  • video-code
    Face tracking code. Tracks face in video focusing skin detection
    2013-08-05 19:59:09下载
    积分:1
  • RAYOS2
    PDF aobut diferent book in electrical research for electrical student nd teacher
    2014-02-13 04:21:41下载
    积分:1
  • Manifold
    说明:  流形学习非线性降维的经典算法Isomap(isomap algorithm with the data and the paper in 2000)
    2020-04-07 21:17:14下载
    积分:1
  • BreedPSO
    种子粒子群算法,对粒子群的参数进行了改进,很有效。(Seed particle swarm algorithm, the parameters of PSO has been improved, very effective.)
    2009-10-05 10:50:28下载
    积分:1
  • DPSK
    自己编的,利用MATLAB进行DPSK和PSK编码,可用于数字通信的课程学习中。(Own, and the use of MATLAB for DPSK and PSK encoding, digital communication can be used to study in the curriculum.)
    2009-03-29 12:26:58下载
    积分:1
  • 1N4148
    小电流开关二极管1N4148的详细介绍,包括工作特性和参数(Low current switching diodes 1N4148 in detail, including the operating characteristics and parameters)
    2010-09-14 11:22:48下载
    积分:1
  • kepler_to_cartezian
    This file gets the satellite coordinates in the orbital plane and computes its coordinates in the cartezian system
    2009-06-10 01:14:21下载
    积分:1
  • requir
    列出求素数的程序,所谓素数就是只能被它的自身和1除尽的数(require a prime number)
    2009-12-21 09:39:33下载
    积分:1
  • rsgeng
    说明:  该函数利用高斯频谱产生一维的高斯随机起伏地表。(RSGENG generates 1D Gaussian random rough surfaces with Gaussian Spectrum.)
    2011-03-22 13:35:29下载
    积分:1
  • huffman
    霍夫曼编码的具体方法:先按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率,读出时由该符号开始一直走到最后的“1”, 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好,就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)
    2015-04-04 20:34:08下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载