Improved Speech Denoising Algorithm Based on Discrete Fractional Fourier Transform

The speech signal and noise signal are the typical non-stationary signals,however the speech signa is short-stationary synchronously.Presently,the denoising methods are always executed in frequency domain due to the short-time stationarity of the speech signal.In this article,an improved speech denoising algorithm based on discrete fractional Fourier transform（DFRFT）is pre sented.This algorithm contains linear optimal filtering and median filtering.The simulation shows that it can easily eliminate the noise compared to Wiener filtering improve the signal to noise ratio（SNR）,and enhance the original speech signal.

Digital watermarking for still image based on discrete fractional fourier transform

Presents a digital watermarking technique based on discrete fractional Fourier transform (DFRFT), discusses the transformation of the original image by DFRFT, and the modification of DFRFT coefficients of the original image by the information of watermark, and concludes from experimental results that the proposed technique is robust to lossy compression attack.

Generalized Parseval’s Theorem on Fractional Fourier Transform for Discrete Signals and Filtering of LFM Signals

This paper investigates the generalized Parseval’s theorem of fractional Fourier transform (FRFT) for concentrated data. Also, in the framework of multiple FRFT domains, Parseval’s theorem reduces to an inequality with lower and upper bounds associated with FRFT parameters, named as generalized Parseval’s theorem by us. These results theoretically provide potential valuable applications in filtering, and examples of filtering for LFM signals in FRFT domains are demonstrated to support the derived conclusions.

Detection Algorithm for LFM Echo of Underwater Moving Targets Based on Discrete Fractional Fourier Transform

The mismatch between echo and replica caused by underwater moving target(UMT)'s radial velocity degrades the detection performance of the matched filter(MF)for the linear frequency modulation(LFM)signal.By using the focusing property of fractional Fourier transform(FRFT)to that signal,a detection algorithm for UMT's LFM echo based on the discrete fractional Fourier transform(DFRFT)is proposed.This algorithm is less affected by the target's radial velocity compared with the other MF detection algorithm utilizing zero radial velocity replica(ZRVR),and the mathematical relation between the output peak positions of these two algorithms exists in the case of existence of target echo.The algorithm can also estimate the target distance by using this relation.The simulation and experiment show that this algorithm'sdetection performance is better than or equivalent to that of the other MF algorithm utilizing ZRVR for the LFM echo of UMT with unknown radial velocity under reverberation noise background.

Peak-to-Average Power Ratio Performance Analysis for Orthogonal Chirp Division Multiplexing Multicarrier Systems Based on Discrete Fractional Cosine Transform

In doubly selective fading channels, the orthogonal frequency division multiplexing (OFDM) multicarrier system may fail. Chirp like basis (fractional Fourier transform-fractional cosine transform) may be used instead of complex exponential basis in this case to improve the system performance. However, in multicarrier transmission, the high peak to average power ratio (PAPR) of the transmitted signal is one of the difficult problems that face both the chirp and the exponential basis. In this paper, an evaluation for the PAPR performance of a multicarrier system based on the fractional cosine transform (FrCT) is introduced and then compared with DFrFT and FFT. Moreover, applying the SLAM technique over these systems is provided to understand the behaviour of these systems when applying SLAM. Simulations verify that this system obtains a better PAPR performance. Moreover, further PAPR reduction can be gained using the well-known PAPR reduction methods. Moreover, applying SLAM technique improves the performance of (dB) by 4 dB to 5 dB and all systems become as competitive to each other when SLAM is applied. Finally, BER performance comparison among OFDM, Discrete Cosine Transform MCM (DCT- MCM), Discrete Hartley Transform MCM (DHT-MCM), DFrFT-OCDM and DFrCT- OCDM MCM systems was done by means of simulation over 100,000 multicarrier blocks for each one and showed that our proposed scenario gave the best performance.

Fractal Surface Synthesis Based on Two Dimensional Discrete Fourier Transform

The discrete Fourier transform（DFT） is used for fractional Brownian motion（FBM） surface synthesis in tribology（i.e., contact, sliding, and sealing, etc）. However, the relationship between fractal parameters（fractal dimension and scale factor） and traditional parameters, the influence of fractal parameters on surface appearance, have not been deeply discussed yet. These lead to some kind of difficulty to ensure the synthesized surfaces with ideal fractal characteristic, required traditional parameters and geometric appearance. A quantitative relationship between fractal parameters and the root mean square deviation of surface （Sq） is derived based on the energy conservation property between the space and frequency domain of DFT. Under the stability assumption, the power spectrum of a FBM surface is composed of concentric circles strictly, a series of FBM surfaces with prescribed Sq could be synthesized with given fractal dimension, scale factor, and sampling numbers, but the ten-point height（Sz）, the skewness（Ssk） and the kurtosis（Sku） are still in random, where the probability distributions of Sz and Ssk are approximately normal distribution. Furthermore, by iterative searching, a surface with desired Abbott-Firestone curve could be obtained among those surfaces. An intuitive explanation for the influence of fractal dimension and scale factor on surface appearance is obtained by discussing the effects on the ratio of energy between high and low frequency components. Based on the relationship between Sq and surface energy, a filtering method of surface with controllable Sq is proposed. The proposed research ensures the synthesized surfaces possess ideal FBM properties with prescribed Sq, offers a method for selecting desired Abbott-Firestone curve of synthesized fractal surfaces, and makes it possible to control the Sq of surfaces after filtering.

Support-Limited Generalized Uncertainty Relations on Fractional Fourier Transform

This paper investigates the generalized uncertainty principles of fractional Fourier transform (FRFT) for concentrated data in limited supports. The continuous and discrete generalized uncertainty relations, whose bounds are related to FRFT parameters and signal lengths, were derived in theory. These uncertainty principles disclose that the data in FRFT domains may have?much higher concentration than that in traditional time-frequency domains, which will enrich the ensemble of generalized uncertainty principles.

分数阶Fourier变换的测不准原理

该文参考Fourier变换的性质研究了离散分数阶Fourier变换的测不准原理以及连续分数阶Fourier变换在Lebesgue测度下的测不准原理,使得分数阶Fourier变换的测不准原理性质更一般化.

Discrete Entropic Uncertainty Relations Associated with FRFT

Based on the definition and properties of discrete fractional Fourier transform (DFRFT), we introduced the discrete Hausdorff-Young inequality. Furthermore, the discrete Shannon entropic uncertainty relation and discrete Rényi entropic uncertainty relation were explored. Also, the condition of equality via Lagrange optimization was developed, as shows that if the two conjugate variables have constant amplitudes that are the inverse of the square root of numbers of non-zero elements, then the uncertainty relations reach their lowest bounds. In addition, the resolution analysis via the uncertainty is discussed as well.

多分量LFM干扰及动态环境下DBOC信号的捕获

针对双二进制偏移载波(double binary offset carrier,DBOC)信号在多分量线性调频(linear frequency modulation,LFM)干扰和动态环境下捕获算法缺乏的问题,提出布莱克曼窗预处理结合分数阶傅里叶变换(fractionalFouriertransform,FRFT)的干扰抑制算法以及离散多项式相位变换(discretepolynomial-phase transform,DPT)、部分匹配滤波器(partial matching filter,PMF)结合快速傅里叶变换(fast Fourier transform,FFT)加频谱校正的捕获算法。该算法首先对接收信号做布莱克曼窗预处理,抑制干扰谱线输出旁瓣,提高干扰汇聚的精确性;然后利用分级算法快速搜索信号的最优阶数,在保证精度量级的条件下减少了运算量;最后,在对应的最优阶数下做FRFT,结合干扰判断和轮询算法,逐个完成多分量LFM干扰的抑制。对干扰抑制后的信号首先利用定阶算法确定其动态阶数;然后通过DPT对动态信号做降阶处理,去除动态项;最后利用PMF-FFT加频谱校正完成DBOC信号的捕获。仿真结果表明,所提算法能够准确并完全地对三个LFM干扰分量进行逐个抑制,且抑制后的干扰分量不会对其他干扰分量的抑制造成影响。在检测概率达到1时,经过布莱克曼窗预处理后算法的信噪比比经过汉明窗预处理和经过凯塞窗预处理后算法的信噪比分别提升了4 dB和6.4 dB,比未经过预处理算法的信噪比提升了7.2 dB。此外,使用频谱校正可以突出捕获峰值,提高捕获精度。与未经频谱校正算法相比,经过频谱校正后算法的信噪比提升了1.6 dB,且能减少一定的捕获时间。

Research progress on discretization of fractional Fourier transform

As the fractional Fourier transform has attracted a considerable amount of attention in the area of optics and signal processing, the discretization of the fractional Fourier transform becomes vital for the application of the fractional Fourier transform. Since the discretization of the fractional Fourier transform cannot be obtained by directly sampling in time domain and the fractional Fourier domain, the discretization of the fractional Fourier transform has been investigated recently. A summary of discretizations of the fractional Fourier transform developed in the last nearly two decades is presented in this paper. The discretizations include sampling in the fractional Fourier domain, discrete-time fractional Fourier transform, fractional Fourier series, discrete fractional Fourier transform （including 3 main types： linear combination-type; sampling-type; and eigen decomposition-type）, and other discrete fractional signal transform. It is hoped to offer a doorstep for the readers who are interested in the fractional Fourier transform.

基于混沌调制DFRFT旋转因子的语音加密

将分数阶傅里叶变换(FRFT)和混沌密码学相结合,提出一种新的变换域加密算法——混沌密钥调制FRFT旋转因子,用于实现语音信号的实时加解密。采用特征分解型离散FRFT算法,使语音实时加密系统在语音信号解密过程中具备良好的还原特性。理论分析和测试结果表明,该算法安全性较高,优于单纯混沌加密或单纯分数阶傅里叶变换的加密方法。

基于DFRFT的脉压方法及与匹配滤波性能对比

针对线性调频体制雷达的目标检测与测距,提出采用离散分数阶Fourier变换实现脉压,推导基于采样型离散分数阶Fourier变换脉压方法的理论模型,对采用离散分数阶Fourier变换实现脉压时出现的时延模糊进行分析,提出用与谱峰相邻数据的相位差估计真实雷达目标的时延解决模糊问题。在雷达目标检测与测距中,基于离散分数阶Fourier变换与匹配滤波的脉压方法相比,距离分辨力相同,运算量降低近一半。

离散分数阶Fourier变换的LFM信号时延估计

根据Ozaktas的采样型离散分数阶Fourier变换算法,针对线性调频信号,结合分数阶Fourier变换对线性调频(LFM)信号的独特聚集性,研究了基于Ozaktas离散分数阶Fourier变换的含多普勒的LFM信号时延估计,给出了线性调频体制雷达分数阶Fourier域的目标检测与测距具体实现,并与经典数字脉压对雷达目标测距的分辨力、时延估计误差、运算量进行对比分析,结果验证了基于Ozaktas离散分数阶Fourier变换时延估计的可行性及有效性。

离散分数阶Fourier变换的阶数分解算法

分数阶Fourier变换在科学计算和工程中有广泛应用前景,但现有的离散分数阶Fourier变换(DFRFT)缺乏有效的快速算法。本文给出了一种采用阶数分解的DFRFT算法,由特定阶数DFRFT的加权和可得到任意分数阶域的DFRFT,权系数由DFTHermite本征值和附加零构成序列的离散Fourier反变换(IDFT)得到,且在搜索最佳分数阶域的过程中仅需计算一次IDFT,无需重新计算其所有变换核,从而可有效减少运算量,适合于应用在分数阶域的多分量信号检测和滤波处理中,仿真结果表明了该算法的有效性。

二维离散分数阶Fourier变换的双混沌图像加密算法

针对现今分数阶Fourier变换和传统混沌加密的不足,提出了一种基于二维离散分数阶Fourier变换的双混沌图像加密算法。该算法首先借助明文图像信息生成辅助密钥矩阵与输入密钥相结合得到混沌序列,再将生成的中间密文作为二维离散分数阶Fourier变换输入,最后进行置乱操作,使得明文信息得到很好的隐藏。通过实验仿真表明,该算法不仅能有效抵抗统计特征攻击、差分攻击,而且大大改善经传统分数阶Fourier变换后直方图像不平滑的缺点,达到很好的加密效果。

基于新型DFrFT的LFM信号参数估计算法

针对传统算法对高调频率线性调频(linear frequency modulation,LFM)信号进行参数估计时误差较大的问题,提出了一种基于新型离散分数阶傅里叶变换(discrete fractional Fourier transform,DFrFT)的LFM信号参数估计算法。新型DFrFT在传统离散算法的基础上引入一种新型尺度变换型量纲归一化方法,其归一化因子可随变换阶次的改变自适应变化。基于该新型DFrFT,本文建立了LFM信号参数估计算法的数学模型。首先,通过新型量纲归一化方法对待估计LFM信号进行预处理,将信号由时频域转换至两个无量纲域,再对信号进行DFrFT;然后,利用新型量纲归一化方法的尺度变换特性提升高调频率段的调频率参数估计分辨率,并理论推导了该参数估计算法相较于传统算法调频率的优势区间;最后,在不同调频率与信噪比条件下,对所提算法的有效性进行了仿真验证,并与传统算法进行对比分析。仿真实验结果表明:当待估计LFM信号的调频率较高时,相较于传统算法,新型尺度变换型量纲归一化方法的引入有效提升了本文算法对调频率的估计精度,且在信噪比较高的环境中,其参数估计性能提升更为明显。

分数傅里叶变换离散化(DFRFT)算法和应用研究

分数傅里叶变换是传统傅里叶变换的发展和推广,在信息处理中有非常广泛的应用。文章对已发展的四种分数傅里叶变换离散化算法进行了系统的归纳和总结,重点比较了几种算法的优缺点,指出了适用范围,并对其中三种主要方法给出了计算机模拟结果;在此基础上,用解啁秋法对chirp信号进行了检测和滤波,并给出了仿真结果。

基于离散分数阶Fourier变换本征矢量分解的图像加密算法

针对目前采用分数阶傅里叶变换对图像进行加密的算法中,其主要存在密钥敏感性较差等不足,提出一种将离散分数阶Fourier变换与指数随机相位掩膜、Logistic混沌映射结合起来进行加密的新算法。该算法在加密过程采用离散分数阶Fourier变换本征矢量分解的方法进行运算,显著提高了加密系统的安全性能。首先,对原始图像进行Logistic映射混沌置乱处理,接着与第一个指数随机矩阵A相乘,之后再经α阶离散的分数阶Fourier变换;其次,与第二个指数随机矩阵B相乘,再经β阶离散的分数阶Fourier变换;最后,利用Logistic映射对图像再次进行置乱处理来获得最终的密文图像。仿真结果表明:与其他类似加密机制相比,该加密系统兼顾了更强的密钥敏感性以及更高的安全性。

特征分解型离散分数阶Fourier变换

分数阶Fourier变换作为Fourier变换的广义形式,广泛应用于科学计算和研究,离散分数阶Fourier变换是其得以应用的关键。特征分解算法是由可交换对角矩阵得到近似连续Hermite-Gaussian函数的特征向量,再对Hermite-Gaussian函数进行加权和运算。对一种基于数特征分解的方法进行了改进,并进行计算机仿真。仿真结果表明所得的Hermite-Gaussian函数与连续函数的近似度更为优异,从而提高了离散分数阶Fourier变换的近似度。