改进的算术傅立叶变换（AFT）算法

算术傅立叶变换（AFT）是一种非常重要的傅立叶分析技术。AFT的乘法量少（仅为O（N））,算法结构简单,非常适合VLSI设计,具有广泛的应用。但AFT的加法量很大,为O（N∧2）,因此减少AFT的加法运算是很重要的工作。本文通过分析AFT的采样特点,给出了奇函数和偶函数的AFT的改进算法。然后在此基础上给出了一般函数的AFT的改进算法。改进算法比原算法的加法运算量降低了一半,因此计算速度快了一倍。本文改进的偶函数和奇函数的AFT算法还分别可以用来计算离散余弦变换（DCT）和离散正弦变换（DST）。     

A multicarrier architecture based upon the affine Fourier transform

Recently, innovative multicarrier schemes have been proposed that exploit the transmission of chirp-shaped waves e/sup -j2/spl pi/ct2/ by optimally choosing the chirp parameter c on the basis of the channel characteristics and are more robust to time-varying channels than ordinary OFDM schemes. This concept was applied to continuous-time and to discrete-time systems. In the present paper, we aim at developing those ideas using the affine Fourier transform (AFT), which is a very general formulation of chirp transforms. We present a multicarrier modulation based upon the discrete form of the AFT that is therefore inherently discrete and strictly invertible. Moreover, it allows to define a circular prefix concept that is coherent with the chirp nature of the transmission. The system can be efficiently implemented by adding a simple phase-correction block to standard OFDM modulators/demodulators and can effectively combat interchannel interference when the propagation channel is made of few multipath components affected by independent frequency offsets. Our discrete-time multicarrier scheme is an improved version of Martone's approach (as we also show by simulation results), and exhibits analogous characteristics to Barbarossa's continuous-time system.     

A generalized Mobius transform and arithmetic Fourier transforms

A general approach to arithmetic Fourier transforms (AFT) is developed. The implementation is based on the concept of killer polynomials and the solution of an arithmetic deconvolution problem pertaining to a generalized Mobius transform. This results in an extension of the Bruns (1903) procedure, valid for all prime numbers, and in an AFT that extracts directly the sine coefficients from the Fourier series     

Closed-form discrete fractional and affine Fourier transforms

The discrete fractional Fourier transform (DFRFT) is the generalization of discrete Fourier transform. Many types of DFRFT have been derived and are useful for signal processing applications. We introduce a new type of DFRFT, which are unitary, reversible, and flexible; in addition, the closed-form analytic expression can be obtained. It works in performance similar to the continuous fractional Fourier transform (FRFT) and can be efficiently calculated by the FFT. Since the continuous FRFT can be generalized into the continuous affine Fourier transform (AFT) (the so-called canonical transform), we also extend the DFRFT into the discrete affine Fourier transform (DAFT). We derive two types of the DFRFT and DAFT. Type 1 is similar to the continuous FRFT and AFT and can be used for computing the continuous FRFT and AFT. Type 2 is the improved form of type 1 and can be used for other applications of digital signal processing. Meanwhile, many important properties continuous FRFT and AFT are kept in the closed-form DFRFT and DAFT, and some applications, such as filter design and pattern recognition, are also discussed. The closed-form DFRFT we introduce has the lowest complexity among all current DFRFTs that is still similar to the continuous FRFT     

A VLSI architecture for simplified arithmetic Fourier transformalgorithm

The arithmetic Fourier transform (AFT) is a number-theoretic approach to Fourier analysis which has been shown to perform competitively with the classical FFT in terms of accuracy, complexity, and speed. Theorems developed by I.S. Reed et al. (1990) for the AFT algorithm are used here to derive the original AFT algorithm which Bruns found in 1903. This is shown to yield an algorithm of less complexity and of improved performance over certain AFT algorithms. A VLSI architecture is suggested for this simplified AFT algorithm. This architecture uses a butterfly structure which reduces the number of additions by 25% of that used in the direct method     

离散余弦变换的改进的算术傅立叶变换算法

离散余弦变换(DCT)是数字图像处理等许多领域的重要数学工具.本文通过一种新的傅立叶分析技术——算术傅立叶变换(AFT)来计算DCT.本文对偶函数的AFT进行了改进.改进的AFT算法不但把AFT所需样本点数减少了一半,从而使所需加法计算量减少了一半,更重要的是它建立起AFT和DCT的直接联系,因而提供了适合用于计算DCT的AFT算法.本文推导了用改进的AFT计算DCT的算法并对算法进行了简要的分析.这种算法的乘法量仅为O(N),并且具有公式一致,结构简单,易于并行,适合VLSI设计等特点,为DCT的快速计算开辟了新的途径.     

Computation of the discrete cosine transform using the iterative arithmetic fourier transform

A method of computing the discrete cosine transform using the iterative arithmetic Fourier transform is presented. It overcomes the difficulty of dense, Farey-fraction sampling in the time domain or space domain when using the original arithmetic Fourier transform (AFT) algorithm. Also, dense transform-domain samples are obtained without any interpolation or zero-padding. These dense samples can be advantageously used for accurate parameter estimation or determination of a few principal components. The inverse discrete cosine transform can be efficiently computed from these dense, Farey-fraction transform-domain samples using the original AFT. The resulting structure is suitable for VLSI implementation.     

Efficient algorithm for 2-D arithmetic Fourier transform

This article presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry out the on-axis Fourier coefficients. A parallel VLSI architecture is developed for the new algorithm     

Inverse Z-transform by Mobius inversion and the error bounds ofaliasing in sampling

A general algorithm based on two special Mobius inversion formulae is developed to compute the inverse Z-transform. This approach to Fourier analysis uses what is called the arithmetic Fourier transform (AFT). With the new AFT algorithm. One can compute the inverse Z-transform of an infinite two-sided sequence. It is compared with the conventional DFT approach. Both methods have aliasing errors due to sampling. The error bounds of the aliasing effects in the DFT and the new proposed method are established and compared. In general, the AFT algorithm is not so vulnerable to the aliasing errors in the high-frequency components as the DFT approach     

一种基于分数阶傅里叶变换的OFDM系统及其均衡算法

在快速时变信道环境下,由于子载波间干扰(ICI)的影响,传统OFDM系统性能有较大下降.本文提出了一种基于分数阶傅里叶变换的OFDM系统,它用分数阶傅里叶变换代替傅里叶变换进行子载波调制与解调;同时,文中给出了最优分数阶傅里叶变换阶次的选取方法,并根据最小均方误差(MMSE)准则设计了分数阶傅里叶域乘性滤波器在接收端进行均衡.分析和数值仿真结果表明,最优分数阶傅里叶域的乘性滤波算法较频域方法有更好的均衡效果.     

分数阶傅立叶变换OFDM系统自适应均衡算法

由于子载波间干扰(ICI)的影响,传统OFDM系统均衡方法在快速衰落的信道环境下性能有较大下降.本文提出了一种基于分数阶傅立叶变换的OFDM系统自适应均衡方法,它用分数阶傅立叶变换代替傅立叶变换进行子载波调制与解调,同时在分数阶傅立叶域对接收信号进行自适应均衡.文中给出了最优分数阶傅立叶变换阶次的选取方法,和分数阶傅立叶域最小均方算法的步骤.分析和数值仿真结果表明,最优分数阶傅立叶域的自适应均衡算法较传统频域方法有更好的均衡效果,并且复杂度不高.     

A Radon-Multiwavelet Based OFDM System Design and Simulation Under Different Channel Conditions

Finite Radon transform (FRAT) mapper has the ability to increase orthogonality of sub-carriers, it is non sensitive to channel parameters variations, and has a small constellation energy compared with conventional fast Fourier transform (FFT) based orthogonal frequency division multiplexing (OFDM). It is also able to work as a good interleaver which significantly reduces the bit error rate (BER). Due to its good orthogonality, discrete Multiwavelet transform (DMWT) is attractive for implementation in OFDM systems which reduces inter-symbol interference (ISI) and inter-carrier interference (ICI) and eliminates the need for cyclic prefix and increases the spectral efficiency of the design. In this paper both FRAT and DMWT are implemented in a new design for OFDM. The new structure was tested and compared with conventional FFT-based OFDM, Radon-based OFDM, and DMWT-based OFDM for additive white Gaussian noise channel, flat fading channel, and multi-path selective fading channel. Simulation tests were generated for different channels parameters values. The obtained results showed that proposed system has increased spectral efficiency, reduced ISI and ICI, and improved BER performance compared with other systems.     

Discrete multiple tone modulation with coset coding for thespectrally shaped channel

A discrete approach to multiple tone modulation is developed for digital communication channels with arbitrary intersymbol interference (ISI) and additive Gaussian noise. Multiple tone modulation is achieved through the concatenation of a finite block length modulator based on discrete Fourier transform (DFT) code vectors, and high gain coset or trellis codes. Symbol blocks from an inverse DFT (IDFT) are cyclically extended to generate ISI-free channel-output symbols that decompose the channel into a group of orthogonal and independent parallel subchannels. Asymptotic performance of this system is derived, and examples of asymptotic and finite block length coding gain performance for several channels are evaluated at different values of bits per sample. This discrete multiple tone technique is linear in both the modulation and the demodulation, and is free from the effects of error propagation that often afflict systems employing bandwidth-optimized decision feedback plus coset codes     

Modular VLSI architectures for computing the arithmetic Fouriertransform

Modular, area-efficient VLSI architectures for computing the arithmetic Fourier transform (AFT) are proposed. By suitable design of PEs and I/O sequencing, nonuniform data dependencies in the AFT computation which require nonequidistant inputs and assignment of Mobius function values are resolved. The proposed design employs 2N+1 PEs to compute 2N+1 Fourier coefficients. Each PE has an adder and a fixed amount of local storage, and one PE has a multiplier. I/O with the host is performed using a fixed number of channels. This results in simple PE organization, compared with those needed in known DFT/FFT architectures. The design achieves O(N) speedup. It uses significantly fewer PEs than designs in the literature and supports real-time applications by allowing continuous sequential input. It can be extended to achieve linear speedup in a fixed size array with 2p+1 PEs, 1⩽p⩽N     

On implementing the arithmetic Fourier transform

The arithmetic Fourier transform (AFT), a method for computing the Fourier coefficients of a complex-valued periodic function, is based on a formula which has the advantage of eliminating many of the multiplications usually associated with computing discrete Fourier coefficients, but has the disadvantage of requiring samples of the signal at nonuniformly spaced time values. A method for computing the Fourier coefficients which allows uniform sampling at arbitrarily chosen sampling rates is developed. The technique still requires few multiplications, albeit at the expense of a limited amount of linear interpolation of the sample values. Efficient hardware implementations of this algorithm are presented     

Feedback strategies for white Gaussian interference networks

A white Gaussian interference network is a channel with T transmitters and R receivers where the received symbols are linear combinations of the transmitted symbols and white Gaussian noise. This paper considers the case where K messages are transmitted through the network in a point-to-point manner, i.e., each message is encoded by exactly one transmitter and is destined for exactly one receiver. It is further assumed that feedback is available so that each transmitter sees the outputs of the receivers to which it is sending messages. Communication strategies based on the discrete Fourier transform (DFT) are developed that perform well for such networks. For multiple-access channels (K=T, R=1) with equal transmitter powers the strategies achieve the feedback sum-rate capacity if the powers are beyond some threshold. For the same channels with fixed transmitter powers and large K, the achievable sum-rate is approximately (log log K)/2 larger than the sum-rate capacity without feedback. For broadcast channels (T=1, K=R) with strong symmetries, the strategies achieve a monotonically increasing sum-rate with K. For interference channels (K=T=R) with strong interference, the strategies significantly enlarge the no-feedback capacity region by "correlation routing."     

算术傅里叶变换的实际实现方法

算术傅里叶变换(AFT)结构简单,乘法量少,具有广阔的应用。但在AFT在具体实现中往往需要过采样来满足实际应用中的精度要求。过采样问题是AFT的一个重要缺陷且限制了它的应用范围。该文利用AFT的线性插值实现技术精度很高的特点,在线性插值实现技术和过采样技术的基础上提出了一个新的实现策略,可以达到接近过采样的精度。从而解决了AFT的过采样问题。     

Channel quality-to-interference ratio quantization criterion for limited feedback beamforming in MIMO systems

The discrete Fourier transform (DFT)-based codebook is employed in this paper to quantize channel state information so that the amount of feedback can be reduced in the multiple input multiple output (MIMO) downlink of long term evolution (LTE) system. And a novel beamforming (BF) scheme based on the proposed channel quality-to-interference (QIR) quantizing criteria is developed, which uses only the index of the optimal codebook for the beamforming at the base station (BS), and dramatically reduces the amount of feedback. The proposed BF scheme jointly considers the influences of the quality of the quantized channels and the mutual interference among the sub-channels. The extensive simulation results verify that throughput of the proposed BF scheme is better than that of the random BF with a little feedback, and that of the eigen-beamforming even under low signal noise ratio (SNR) scenario.     

傅里叶变换光谱仪动镜驱动控制技术

动镜驱动控制技术是傅里叶变换光谱仪的重要组成部分.本文从干涉成像光谱技术原理出发,介绍了迈克尔逊型傅里叶变换光谱仪动镜驱动技术的进展及其应用情况.提出了新型摆扫式干涉机构动镜驱动系统的方案.基于模糊PID控制策略,给出了此驱动系统的闭环控制实现方法.     

基于FPGA的傅里叶变换光谱仪光谱复原技术

为了实时获取化学战剂、大气污染物等待测物的光谱信息,设计了一种基于现场可编程门阵列实现单边干涉图光谱复原的高速数据处理系统。该系统采用将去直流、切趾,快速傅里叶变换、相位校正等光谱复原处理集成在一块现场可编程门阵列芯片内实现的方法,具有集成度高、速度快、成本低等优点。在ISE10.1开发平台上设计了数据处理系统硬件电路,通过WQF-520型傅里叶变换红外光谱仪采集干涉数据传给现场可编程门阵列进行处理,实验结果与MATLAB仿真结果比较,相对误差在1.2%以内。结果表明,该系统可正确复原光谱,适用于时间调制和空间调制的干涉式光谱仪系统。