搜索资源列表
cp0101_bandwidth
- 第一步是计算输人信号单边功率谱密度(ESD)。使用快 %速傅里叶(FFr)算法将信号从时域转换到频域。因为FFr算法的输出是离散谱,而这 %里我们需要的是连续谱,因此需要引人不同的比例因子来实现从离散谱到连续谱的转换。 %在第二步中,我们利用迭代算法计算出相对于特定阂值的ESD的最高和最低频率,从而 %估算出被检测信号所占用的带宽。这种算法同时适用于基带信号和已调制信号。最后, %在第三步中,我们给出了输出图形的原代码。
FFP
- 计算水声传播的快速场(FFP)程序,基于传播矩阵,迭代和快速傅里叶变换方法。-underwater acoustic field computing Fast FIELD Program, based on TMM, FFT etc.
Gerchberg_Papoulis
- Gerchberg_Papoulis利用反复应用傅里叶变换与反变换及加入已知条件的迭代算法,解决带限函数外推。-Gerchberg_Papoulis using repeated application of Fourier transform and inverse transform and adding the known conditions of the iterative algorithm to solve band-limited function extrapolation.
GS-fourior
- 利用GS算法优化傅里叶变换,经过上百甚至上千次的迭代,是的加密结果更加优化-GS for fourior transmisson
Mixedthreshold_Image-Recovery
- 代码给出了基于混合门限带迭代步长的稀疏图像重构。特别地,压缩采样矩阵为抽样傅里叶变换矩阵,利用2D-FFT,大大降低了计算复杂度。-The mixedthreshold sparse image reconstruction with step is given in the package. In particular, the 2D-FFT is used to disign the sample matrix, which can reduce the computational comp
FFT
- 快速傅里叶变换,基于迭代算法,适于数字滤波和图像处理-Fast Fourier transform, based on iterative algorithms, suitable for digital filtering and image processing
OSS
- 迭代傅里叶变换(Iterative Fourier Transform,IFT)的一种算法,用HIO和ER混合迭代求解-Iterative Fourier transform (Iterative Fourier Transform, IFT) of an algorithm, using iterative solution mixed HIO and ER
sFFT-1.0-2.0.tar
- 稀疏傅里叶变换算法利用了数字信号处理,特别是高斯和多尔夫-切比雪夫滤波器的技术。与传统的解决方法不同,对于这个问题我们的算法是不迭代的。也就是说,它用一种类似绘制/流式算法的方式“一次”识别并估计k个最大系数,而并非估计“大”系数以及在提示下相减、递归。-Sparse Fast Fourier Transform (SFFT) is a class of sub-linear time algorithms for computing the discrete Fourier transfo
IFTA
- 简单迭代傅里叶变换算法的代码,主要用了快速傅里叶变换函数 (IFTA)-Iterative Fourier Transform Algothrim (IFTA)
IFT_pat
- 采用迭代快速傅里叶变化进行方向图综合,可以对大型阵列快速综合,即给定目标方向图,求权值。还可拓展到非均匀阵列-pattern synthesis using iterative FFT techniques reference: "element failure correction for a large..." by Keizer. For unequally spaced array please refer to:"fast pencil beam pattern synth
iterative-Fourier-algorithm
- 关于利用迭代傅里叶转换算法来处理图像相位的恢复问题的一个程序。-About iterative Fourier transform algorithm is used to dealing with image recovery phase of a program.
Iterative-Fourier-algorithm-(GS)
- 迭代傅里叶算法实现对高斯光束的整形:用malab将二维的高斯分布图形转化成三维的分布的方法和用迭代傅里叶变换(GS)的算法对高斯光束的整形做对比-Iterative Fourier algorithm of gaussian beam shaping: the two-dimensional gaussian distribution with malab graphics into three-dimensional distribution method and using iterativ
GS_FFT
- 运用快速傅里叶转换法fft2和逆转换ifft2反复迭代进行对二维平面函数的处理程序。-Fft2 by applying the method of fast Fourier transformation and reverse change ifft2 repeated iteration of two-dimensional plane function handler.
caisetuxiangjiamichengxv
- 采用了迭代混沌,Arnold算法,傅里叶变换加密,小波变换加密对彩色图像的加解密过程-Using iterative chaotic, Arnold algorithm to encrypt the Fourier transform, the wavelet transform color image encryption and decryption process
FourierGS
- 傅里叶GS迭代算法,用于计算计算机全息图-GS algorithm
RAFFT
- 迭代最快傅里叶转换算法,MATLAB环境运行-Iteration Fast Fourier Transform
nenqun
- 分数阶傅里叶变换计算方面,用MATLAB实现动态聚类或迭代自组织数据分析,最大似然(ML)准则和最大后验概率(MAP)准则。- Fractional Fourier transform computing, Using MATLAB dynamic clustering or iterative self-organizing data analysis, Maximum Likelihood (ML) criteria and maximum a posteriori (MAP) criter
moukeng_v45
- 各种kalman滤波器的设计,分数阶傅里叶变换计算方面,迭代自组织数据分析。- Various kalman filter design, Fractional Fourier transform computing, Iterative self-organizing data analysis.
junjing
- 已调制信号计算其普相关密度,部分实现了追踪测速迭代松弛算法,分数阶傅里叶变换计算方面。- Modulated signals to calculate its density Pu-related, Partially achieved tracking speed iterative relaxation algorithm, Fractional Fourier transform computing.
hiusang
- 迭代自组织数据分析,分数阶傅里叶变换计算方面,遗传算法无功优化。- Iterative self-organizing data analysis, Fractional Fourier transform computing, Genetic algorithm based reactive power optimization.