Windowed linear canonical transform and its applications

In this paper, we generalize the windowed Fourier transform to the windowed linear canonical transform by substituting the Fourier transform kernel with the linear canonical transform kernel in the windowed Fourier transform definition. It offers local contents, enjoys high resolution, and eliminates cross terms. Some useful properties of the windowed linear canonical transform are derived. Those include covariance property, orthogonality property and inversion formulas. As applications analogues of the Poisson summation formula, sampling formulas and series expansions are given.     

About sampling for band-limited linear canonical transform

The linear canonical transform (LCT) is more adapted to many physical problems than the Fourier transform which is a particular case of LCT. The sampling of functions which are band-limited according to some LCT is the topic of many recent papers. This paper shows that classical results can be adapted to obtain errorless reconstruction formulas. The results are provided for usual periodic sampling as well as for periodic nonuniform sampling (PNS) or for irregular sampling.     

Sampling of compact signals in offset linear canonical transform domains

The offset linear canonical transform (OLCT) is the name of a parameterized continuum of transforms which include, as particular cases, the most widely used linear transforms in engineering such as the Fourier transform (FT), fractional Fourier transform (FRFT), Fresnel transform (FRST), frequency modulation, time shifting, time scaling, chirping and others. Therefore the OLCT provides a unified framework for studying the behavior of many practical transforms and system responses. In this paper the sampling theorem for OLCT is considered. The sampling theorem for OLCT signals presented here serves as a unification and generalization of previously developed sampling theorems.     

基于自适应方法的离散线性正则变换计算

线性正则变换(LCT)描述了光学变换上的平方相位系统的影响。提出了一种基于自适应最小均方(LMS)的离散线性正则变换(LCT)算法。文中导出了基于块和基于流的离散LCT算法,同时考虑了基于自适应滤波器的实现架构。提出的计算方法具有天生的并行结构,这使它适用于有效的超大规模集成电路(VLSI),并且对于传输过程中可能的计算误差呈现鲁棒性。     

Nonuniform sampling theorems for random signals in the linear canonical transform domain

Nonuniform sampling can be encountered in various practical processes because of random events or poor timebase. The analysis and applications of the nonuniform sampling for deterministic signals related to the linear canonical transform (LCT) have been well considered and researched, but up to now no papers have been published regarding the various nonuniform sampling theorems for random signals related to the LCT. The aim of this article is to explore the nonuniform sampling and reconstruction of random signals associated with the LCT. First, some special nonuniform sampling models are briefly introduced. Second, based on these models, some reconstruction theorems for random signals from various nonuniform samples associated with the LCT have been derived. Finally, the simulation results are made to prove the accuracy of the sampling theorems. In addition, the latent real practices of the nonuniform sampling for random signals have been also discussed.     

一种新的gyrator变换的快速算法

为了研究gyrator变换在光学信息处理中的应用,提出了一种采用两次快速傅里叶变换实现快速计算gyrator变换的新算法.在量纲归一化条件下,研究了gyrator变换离散化过程,获得了空域、傅里叶变换域和gyrator变换域的采样间隔,形成了一种能避免尺度变换的算法.采用该算法进行了数值模拟实验,实验结果与相关文献中报道的计算结果一致.结果表明,该算法可以应用于gyrator变换的研究中.     

周期为N=n2v的序列线性复杂度的快速算法

文中利用广义离散傅里叶变换对GF（2）上周期为N＝n2^v（gcd(n,2）＝1）序列进行了研究，给出了求周期为N＝n2^v的序列线性复杂度的快速算法，并得到了关于GF（2）上多项式的Hasse导数的一些新结果。     

Sampling theorems for bandlimited random signals in the offset linear canonical transform domain

Sampling theorems for deterministic signals in the offset linear canonical transform (OLCT) domain have been widely proposed in the literature. In this paper, we consider the sampling and reconstruction schemes for random signals in the OLCT domain. We first define the power spectral density and correlation function for random signals in the OLCT domain. By utilizing the definitions, the power spectral density relations for the OLCT filter are derived. Subsequently, the multichannel sampling theorem for bandlimited random signals in the OLCT domain is derived. In addition, some sampling theorems for bandlimited random signals associated with the OLCT are also presented by designing different OLCT filters. Finally, the simulation results are presented to show the advantage and effectiveness of the theorems.     

A blind watermarking algorithm based on fractional Fourier transform and visual cryptography

This paper presents a robust copyright protection scheme based on fractional Fourier transform (FrFT) and visual cryptography (VC). Unlike the traditional schemes, in our scheme, the original image is not modified by embedding the watermark into the original image. We use the visual secret sharing scheme to construct two shares, namely, master share and ownership share. Features of the original image are extracted using SVD, and are used to generate the master share. Ownership share is generated with the help of secret image (watermark) and the master share, using VC technique. The two shares separately give no information about the secret image, but for ownership identification, the secret image can be revealed by stacking the master share and the ownership share. In order to achieve the robustness and security, the properties of VC, FrFT and SVD are used in our scheme. The experimental results show that the proposed scheme is strong enough to resist various signal processing operations.     

基于离散Hartley变换的OFDM实现模型

本文研究离散Hartley变换在OFDM系统中的应用,提出一种基于离散Hartley变换的OFDM实现模型.分析了新模型在加性高斯白噪声信道下的传输性能和算法复杂度.新模型与基于离散傅立叶变换(DFT)的OFDM系统具有相同的传输性能,但计算复杂度降低,时效性提高,且调制与解调算法一致.     

A new algorithm to compute the discrete inverse radon transform

The aim of this paper is to compute the discrete inverse Radon transform over ⁿ . The Radon transform is a function with domainS ^n–1×. It is shown that under different measure this function can be defined with domain ⁿ . In this case one can compute the discrete inverse Radon transform in the Cartesian coordinate system without interpolating from polar to Cartesian coordinates or using the backprojection operator.     

A fast algorithm for discrete hartley transform of arbitrary length

DHT of length p~lq(p is odd and q is arbitrary) is turned into p~l DHTs of length qand some additional operations, while the additional operations only involves the computation ofcos-DFT and sin-DFT with length p. If the length of a DHT is p_1~(l_1)…P_N~(l_N)2~l(P_1…,P_N are oddprimes), a fast algorithm is obtained by the similar recursive technique. Therefore, the algorithmcan compute DHT of arbitrary length. The paper also Proves that operations for computingDHT of length N by the algorithm are no more than O(Nlog_2N), when the length is N=p~l,operations of the algorithm are fewer than that of other known algorithms.     

一种基于Fourier变换的人脸识别算法

针对现有的多数人脸识别算法在单训练样本时识 别性能并不理想这一问题,提出一种基于Fourier-Mellin变换的频域不 变性以及时域不变性的特征提取算法。首先,采用图像亮度作为原始特征,将对图像亮度标 准化以改善光照变化,通过应用2D小波变换降维来管理频域不变量的复杂度;然后,为进一 步改进识别性能,根据分析的Fourier-Mellien变换(AFMT) 以及正交Fourier-Mellin矩(OFMM)法不变量的特征,将两种算法混合,进行特征提取; 最后,利用分值标准化度量频域不变量与时域不变量,并存储到一个特征向量中用于分类。 通过最近邻分类器(NNC)和相关性系 数法(CCM)进行分类和融合。通过在YALE与ORL人脸数据库上进行了大量实验的结果表明, 本文提出方法的性能要优于传统的人脸识别算法。     

快速傅里叶变换中逆序数计算的一种快速算法

提出一种基-2快速傅里叶变换中逆序数计算的新算法,该算法较大多数文献上列出的"逢二退一"法及其改进算法,以及生成法均显著减少了运算量,是一种逆序数计算的快速实现方法,从而提高快速傅里叶变换的整体速度。     

一种基于分数傅立叶变换的图像加密技术

本文基于分数傅立叶变换的多样性,通过不同级次的分数傅立叶变换与谱变换相结合,提出了一种新的光学图像加密算法。经计算机模拟验证,此算法确实可行可靠。     

128-point memory-based architecture for a fast Fourier transform

In this article, we take advantage of the merits of a one-sixteenth circle storage technique, radix-2 and radix-2/4/8 algorithms to implement a 128-point memory-based architecture for a fast Fourier transform processor. The one-sixteenth circle storage technique results in reducing 50% of the size of a look-up table (LUT) for storing the twiddle factors. The combination of radix-2 and radix-2/4/8 algorithms results in reducing the number of twiddle factors and allowing the processor to possess a regular architecture which is suitable for hardware implementation. This design has been synthesised by Altera Quartus II 6.0. The experimental results indicate that this design needs only 65,169 ALUTs for LUT. The operating frequency is 59.76?MHz. The signal-to-noise ratios for the real and imaginary parts of the output signal are 67.72?dB and 68.55?dB, respectively.     

Flexibility in the length of convolutions computed using Fourier-like fast transform algorithms

An efficient method of achieving flexibility in the length of discrete convolutions, computed using Fourier and Fourier-like fast transform algorithms, is described. Then this method is extended to discrete multidimensional convolutions computed using polynomial transforms.     

运用遗传算法结合FFT进行多单元失效阵列校准

提出了利用遗传算法（GA）结合快速傅立叶变换（FFT）方法来进行阵列失效的校准,通过引入傅立叶变换的变换域和角域的映射,在变换域中利用FFT计算个体阵列的阵因子,减少了GA评估个体的时间,从而大大提高了失效校准的速度。以一个-35分贝副瓣电平的32单元阵列为例,校准一单元失效和二单元失效的时间都减少了至少一个数量级,算法也可应用于两个以上单元失效的情况。     

一种新的极高精度的T_IIN频率估计内插算法

针对多普勒条件下接收端复信号的频率估计难的问题,研究了一种基于离散傅里叶变换与迭代频率估计的内插综合算法.区别于经典的内插算法,新算法在迭代频率内插算法基础上充分利用复数快速傅里叶变换结果的实虚部值,并通过最大峰值频谱和相邻两侧谱线以极高精度内插估计出复信号的频率参数.仿真结果分析表明,在二次迭代条件下信噪比为-10 dB时,该算法估计均方根误差仍能逼近克拉美-罗限的1.0021倍.该算法在同等条件下比经典的Rife、Quinn和IIN算法具有更高的准确性、稳定性和可靠性.     

Generalized fast mixed-radix algorithm for the computation of forward and inverse MDCTs

This paper presents a generalized mixed-radix decimation-in-time (DIT) fast algorithm for computing the modified discrete cosine transform (MDCT) of the composite lengths N=2×q^m, m≥2, where q is an odd positive integer. The proposed algorithm not only has the merits of parallelism and numerical stability, but also needs less multiplications than that of type-IV discrete cosine transform (DCT-IV) and type-II discrete cosine transform (DCT-II) based MDCT algorithms due to the optimized efficient length-(N/q) modules. The computation of MDCT for composite lengths N=q^m×2ⁿ, m≥2, n≥2, can then be realized by combining the proposed algorithm with fast radix-2 MDCT algorithm developed for N=2ⁿ. The combined algorithm can be used for the computation of length-12/36 MDCT used in MPEG-1/-2 layer III audio coding as well as the recently established wideband speech and audio coding standards such as G.729.1, where length-640 MDCT is used. The realization of the inverse MDCT (IMDCT) can be obtained by transposing the signal flow graph of the MDCT.