登录
首页 » matlab » FFTReconstruction

FFTReconstruction

于 2021-04-14 发布 文件大小:1KB
0 220
下载积分: 1 下载次数: 227

代码说明:

  可以实现全息图的一次快速傅里叶变换,对全息图进行再现,也可以用于全息干涉图的再现(Hologram can be achieved in a fast Fourier transform, reconstruction hologram can also be used for reproduction of holographic interferograms)

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

发表评论

0 个回复

  • predictedcontrol
    预测控制,通过当前输入和预测未来输出来控制输出值,使系统尽快达到稳定。(Predictive control to predict the future by the current input and output to control the output value, allowing the system to stabilize as soon as possible.)
    2009-11-04 21:21:39下载
    积分:1
  • sub_njd
    说明:  一种信号处理的算法的源代码,自己编的很好用(A signal of a method)
    2010-03-26 21:24:45下载
    积分:1
  • pca
    基于matlab的主成分分析源程序进行贡献度分析(The principal component analysis based on matlab source contribution analysis conducted)
    2013-06-12 08:44:12下载
    积分:1
  • jj
    说明:  先对图像均衡化 增强对比度 加噪声 然后分别进行空域和频域滤波(First, the contrast enhanced image equalization plus noise and then separate airspace and frequency domain filtering)
    2010-04-29 19:28:06下载
    积分:1
  • figure9
    radar code it is for phase memo radar which use to detect anymies and increae beam width and efficiency
    2014-08-09 17:25:35下载
    积分:1
  • LMSmatlab
    变步长的LMS自适应滤波算法matlab程序(Variable step size LMS adaptive filtering algorithm matlab program)
    2015-10-21 08:37:34下载
    积分:1
  • samp1
    说明:  利用matlab来实现求振动振型和固有频率。(Seeking to achieve vibration and natural frequency of vibration.)
    2011-03-23 20:52:28下载
    积分:1
  • rbnnet_166
    网上下的一个关于径向基函数网络应用实例,希望大家能有用(the Internet on an RBF network application examples and I hope that we can be useful)
    2006-08-21 09:51:04下载
    积分:1
  • 7941940PPP_code
    非常好的精密单点定位程序,直接下载星历和钟差文件就能计算。(Very good precise point positioning procedures, direct download ephemeris and clock error file can be calculated.)
    2020-11-15 00:09:42下载
    积分:1
  • Fastdiscretecurvelettransforms
    This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform [12, 10] in two and three dimensions. The first digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is based on the wrapping of specially selected Fourier samples. The two implementations essentially differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both digitaltransformations return a table of digital curvelet coefficients indexed by a scale parameter, anorientation parameter, and a spatial location parameter. And both implementations are fast in the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.
    2011-10-30 15:57:56下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载