登录
首页 » matlab » FFT_Audio_Watermark_demo

FFT_Audio_Watermark_demo

于 2013-11-08 发布 文件大小:11KB
0 236
下载积分: 1 下载次数: 14

代码说明:

  將灰階圖形的像素黑白狀態記錄在音頻頻帶的peak改變上已將圖形資訊隱藏在音頻資料中.並提供灰階圖形資料的取出方法(The grayscale pixel monochrome graphics state record changes in the audio band peak graphical information has been hidden in the audio data, and providing information grayscale graphical methods for taking out)

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

发表评论

0 个回复

  • FIRfilterdesign
    说明:  FIR滤波器设计,非常好,大家请下,20 个字太长了,哈人要求啊(FIR filter design)
    2010-04-04 08:19:19下载
    积分:1
  • vblast
    分层空时码V-blast程序,有需要的可以看看啊,感觉不错(the souce for vblast stc)
    2010-05-15 19:02:38下载
    积分:1
  • AZSEDC
    Comme les autres régimes d’états liés présentés précédemment, l’état de quatre impulsions est très sensible à l’énergie de saturation et au gain petit signal. Quand l’énergie de saturation (respectivement le gain petit signal) varie dans la gamme de quelques pJ
    2013-09-18 20:40:25下载
    积分:1
  • kuopintongxin
    扩频通信系统的方针,源码比较详细,并且还包含对扩频通信系统的干扰技术研究(The principle of spread spectrum communication system, the source in more detail, and also includes the interference of spread spectrum communication system technology research)
    2013-03-05 21:48:16下载
    积分:1
  • DVHOP2
    基于粒子群的DV_hop算法的运用,有很好的效果,定位比较好(Algorithm based on particle swarm DV_hop use, have a good effect, better positioning)
    2011-10-23 20:34:06下载
    积分:1
  • different_filter_design
    different filter designing bandpaff lowpass highpass ...
    2013-05-13 13:54:58下载
    积分:1
  • xunhuansaomiao08
    采用内螺旋算法编写的清洁机器人路径规划程序,将房间抽象为栅格矩阵(Spiral algorithm written using cleaning robot path planning program, the room abstract grid matrix)
    2015-08-24 12:41:22下载
    积分:1
  • InSAR-UNwrapping
    一篇关于Insar相位展开的文章,对面分析和各种经典算法和最前沿的算法比较(An article on the Insar phase of the article, the opposite analysis and a variety of classical algorithms and the most cutting-edge algorithm)
    2016-12-05 16:15:43下载
    积分:1
  • minofinline
    this code will help you in minimizing of in-line coded functions
    2010-09-29 16:00:40下载
    积分:1
  • HanoiFolder
    Given a stack of n disks arranged largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack one rod to another, where moves are allowed only if they place smaller disks on top of larger disks
    2015-02-05 20:49:22下载
    积分:1
  • 696516资源总数
  • 106605会员总数
  • 12今日下载