Dual Image Cryptosystem Using Henon Map and Discrete Fourier Transform

This paper introduces an efficient image cryptography system.The pro-posed image cryptography system is based on employing the two-dimensional(2D)chaotic henon map(CHM)in the Discrete Fourier Transform(DFT).The proposed DFT-based CHM image cryptography has two procedures which are the encryption and decryption procedures.In the proposed DFT-based CHM image cryptography,the confusion is employed using the CHM while the diffu-sion is realized using the DFT.So,the proposed DFT-based CHM image crypto-graphy achieves both confusion and diffusion characteristics.The encryption procedure starts by applying the DFT on the image then the DFT transformed image is scrambled using the CHM and the inverse DFT is applied to get the final-ly encrypted image.The decryption procedure follows the inverse procedure of encryption.The proposed DFT-based CHM image cryptography system is exam-ined using a set of security tests like statistical tests,entropy tests,differential tests,and sensitivity tests.The obtained results confirm and ensure the superiority of the proposed DFT-based CHM image cryptography system.These outcomes encourage the employment of the proposed DFT-based CHM image cryptography system in real-time image and video applications.

基于DFT的频率敏感双分支Transformer多变量长时间序列预测方法

在进行多变量长时间序列预测时,仅利用时域分析通常无法充分捕捉长时间序列依赖,而这会导致信息利用率不足、预测精度不够高。因此,结合频域时域分析,提出一种基于离散傅里叶变换(DFT)的频率敏感双分支多变量长时间序列预测(FSDformer)方法。首先,通过DFT实现时间和频率的相互转换,从而将复杂的时间序列数据分解为结构简单的低频趋势项、中频季节项和高频余项3个分量;其次,采用双分支结构,针对中高频分量预测,应用Encoder-Decoder结构,设计了周期性增强注意力机制;针对低频趋势分量预测,采用多层感知机(MLP)结构;最后将中高频分量与低频分量预测结果相加,得到多变量长时间序列的最终预测结果。在2个数据集上把FSDformer与其他5个经典算法进行了对比分析,在Electricity数据集上,当历史序列长度为96,预测序列长度为336时,相较于Autoformer等对比算法,FSDformer的平均绝对误差(MAE)下降了11.5%~29.1%,均方误差(MSE)下降了20.9%~43.7%,达到了最优预测精度。实验结果表明,FSDformer能有效捕捉长时间序列的相关依赖,在提升预测精度和计算效率的同时,增强了模型预测的稳定性。

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.

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.

Theory and algorithms for two-dimensional warped discrete Fourier transform

In this paper, the two-dimensional Warped Discrete Fourier Transform （2-D WDFT） is developed based on the concept of the 1-D WDFT. An exact computation algorithm is developed for 2-D WDFT based on matrix factorizing with special structure. A fast algorithm is then proposed to reduce greatly the computational complexity of the inverse 2-D WDFT. Finally, numerical examples are given to show the efficiency of the proposed approach.

A Matrix Formulation of Discrete Chirp Fourier Transform Algorithms

This work presents a computational matrix framework in terms of tensor signal algebra for the formulation of discrete chirp Fourier transform algorithms. These algorithms are used in this work to estimate the point target functions （impulse response functions） of multiple-input multiple-output （MIMO） synthetic aperture radar （SAR） systems. This estimation technique is being studied as an alternative to the estimation of point target functions using the discrete cross-ambiguity function for certain types of environmental surveillance applications. The tensor signal algebra is presented as a mathematics environment composed of signal spaces, finite dimensional linear operators, and special matrices where algebraic methods are used to generate these signal transforms as computational estimators. Also, the tensor signal algebra contributes to analysis, design, and implementation of parallel algorithms. An instantiation of the framework was performed by using the MATLAB Parallel Computing Toolbox, where all the algorithms presented in this paper were implemented.

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.

A WEIGHTED GENERAL DISCRETE FOURIER TRANSFORM FOR THE FREQUENCY-DOMAIN BLIND SOURCE SEPARATION OF CONVOLUTIVE MIXTURES

This letter deals with the frequency domain Blind Source Separation of Convolutive Mixtures (CMBSS). From the frequency representation of the "overlap and save", a Weighted General Discrete Fourier Transform (WGDFT) is derived to replace the traditional Discrete Fourier Transform (DFT). The mixing matrix on each frequency bin could be estimated more precisely from WGDFT coefficients than from DFT coefficients, which improves separation performance. Simulation results verify the validity of WGDFT for frequency domain blind source separation of convolutive mixtures.

Authentication and Secret Message Transmission Technique Using Discrete Fourier Transformation

In this paper a novel technique, Authentication and Secret Message Transmission using Discrete Fourier Transformation (ASMTDFT) has been proposed to authenticate an image and also some secret message or image can be transmitted over the network. Instead of direct embedding a message or image within the source image, choosing a window of size 2 x 2 of the source image in sliding window manner and then con-vert it from spatial domain to frequency domain using Discrete Fourier Transform (DFT). The bits of the authenticating message or image are then embedded at LSB within the real part of the transformed image. Inverse DFT is performed for the transformation from frequency domain to spatial domain as final step of encoding. Decoding is done through the reverse procedure. The experimental results have been discussed and compared with the existing steganography algorithm S-Tools. Histogram analysis and Chi-Square test of source image with embedded image shows the better results in comparison with the S-Tools.

Numerical Approximation of Real Finite Nonnegative Function by the Modulus of Discrete Fourier Transform

The numerical algorithms for finding the lines of branching and branching-off solutions of nonlinear problem on mean-square approximation of a real finite nonnegative function with respect to two variables by the modulus of double discrete Fourier transform dependent on two parameters, are constructed and justified.

Quantum Discrete Fourier Transform in an Ion Trap System

We propose two schemes for the implementation of quantum discrete Fourier transform in the ion trap systern. In each scheme we design a tunable two-qubit phase gate as the main ingredient. The experimental implementation of the schemes would be an important step toward complex quantum computation in the ion trap system.

CONCURRENT SPEECHES SEPARATION USING WRAPPED DISCRETE FOURIER TRANSFORM

This letter proposes a new method for concurrent voiced speech separation. Firstly the Wrapped Discrete Fourier Transform (WDFT) is used to decompose the harmonic spectra of the mixed speeches. Then the individual speech is reconstructed by using the sinusoidal speech model. By taking advantage of the non-uniform frequency resolution of WDFT, harmonic spectra parameters can be estimated and separated accurately. Experimental results on mixed vowels separation show that the proposed method can recover the original speeches effectively.

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.

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.

基于DFT与ECA的滚动轴承故障诊断

针对滚动轴承故障诊断中传统卷积神经网络(convolutional neural networks,简称CNN)提取特征的感受野受限于卷积核大小的问题,提出了一种结合离散傅里叶变换(discrete Fourier transform,简称DFT)和高效通道注意力(efficient channel attention,简称ECA)的卷积神经网络模型(convolutional neural network combining discrete Fourier transform and efficient channel attention,简称DFT-ECANet)。首先,将原始振动信号通过DFT变换到频域,在频域上经卷积和离散傅里叶逆变换(inverse discrete Fourier transform,简称IDFT)转换到时域,使信号在时域上具有全局的感受野;其次,将该信号与经过卷积的数据在通道维度上进行拼接,通过ECA为各通道数据分配权重,并关注诊断性能高的特征;最后,通过多个卷积-池化层进一步提取模型深层特征,结合池化层和全连接层诊断轴承故障。实验结果表明:DFT-ECANet在原始振动数据集上具有较高的诊断精度和较好的泛化性能,通过T分布随机近邻嵌入(T-distributed stochastic neighbor embedding,简称T-SNE)可降维可视化模型的诊断过程;在强噪声干扰下仍能保持较高的精度,具备较强的鲁棒性和抗噪性能。

基于DFT的旋转变压器信号偏差矫正方法研究

解码芯片在对旋转变压器输出的位置信号做处理的过程中,芯片在采样时容易产生各种非理想偏差,这会造成转子位置估算精度的急剧下降。针对该问题,分析了电压信号中的幅值偏差和正交偏差会对旋转变压器解码的输出角度叠加一个2倍频的波动,直流偏差会叠加一个同频波动的问题,提出了一种基于离散傅里叶变换(DFT)的输入矫正法用于实现旋转变压器输出信号的偏差矫正,同时有效降低一次二次波动。该方法首先离散采样信号,通过DFT公式提取旋转变压器输出信号的直流信号和基频信号;然后基于直流信号和基频信号先后计算直流偏差、幅值偏差和正交偏差,通过控制器实现偏差值矫正。最后,仿真和试验结果表明,在芯片采样产生偏差时,所提出的偏差提取方法有效,试验中相应的正余弦输出信号指定阶次的波动更小。

Walsh Hadamard Transform Based Transceiver Design for SC-FDMA with Discrete Wavelet Transform

This article proposes a new transceiver design for Single carrier frequency division multiple access(SCFDMA)system based on discrete wavelet transform(DWT). SCFDMA offers almost same structure as Orthogonal frequency division multiple access(OFDMA)with extra advantage of low Peak to Average Power Ratio(PAPR). Moreover,this article also suggests the application of Walsh Hadamard transform(WHT)for linear precoding(LP)to improve the PAPR performance of the system. Supremacy of the proposed transceiver over conventional Fast Fourier transform(FFT)based SCFDMA is shown through simulated results in terms of PAPR,spectral efficiency(SE)and bit error rate(BER).

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.

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

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

Performance Enhancement of Discrete Multi-Tone Systems with a Trigonometric Transform

The sine transform can be used as a tool to conquer the problems of discrete multi-tone (DMT) systems to increase the bit rate. In the proposed discrete sine transform based discrete multi-tone (DST-DMT) system, we make use of the energy compaction property of the DST to reduce the channel effects on the transmitted signals. The mathematical model of the proposed DST system is presented in the paper. Simulation experiments have been carried out to test the effect of the proposed DST-DMT system. The results of these experiments show that the performance of the DST-DMT system is better than that of the traditional FFT-DMT system. The results also show that employing the proposed TEQ in the DST-DMT system can increase the bit rate by about 2.57 Mbps.