This paper presents an improved diagonal tensor approximation (DTA) and its hybridization with the stabilized biconjugate-gradient fast Fourier transform (BCGS–FFT) algorithm to solve a volume integral equation for three-dimensional (3D) objects in layered media. The improvement in DTA is obtained for lossy media through a higher-order approximation. The interaction between the dyadic Green’s f...

Prime factor fast Fourier transform (FFT) algorithms have two important advantages: they can be simultaneously self-sorting and in-place, and they have a lower operation count than conventional FFT algorithms. The major disadvantage of the prime factor FFT has been that it was only applicable to a limited set of values of the transform length N. This paper presents a generalized prime factor FF...

Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this paper we present recursive formulation of a self sorting in-place FFT algorithm that adapts to the target architecture. For transform sizes where an in-place, in-order execution is not possible, we show how schedules can be c...

In this paper, we propose a high-performance parallel three-dimensional fast Fourier transform (FFT) algorithm on clusters of vector symmetric multiprocessor (SMP) nodes. The three-dimensional FFT algorithm can be altered into a multirow FFT algorithm to expand the innermost loop length. We use the multirow FFT algorithm to implement the parallel three-dimensional FFT algorithm. Performance res...

This paper presents a technique to develop a low power parallel-pipelined architecture for Fast Fourier Transform (FFT). A technique to design FFT architectures via folding transformation and register minimization techniques is proposed. Both complex valued FFT (CFFT) and real valued FFT (RFFT) architectures can be derived using the proposed approach. The proposed architecture for RFFT helps to...

In this paper, we introduce almost D-split sequences and establish an elementary but somewhat surprising connection between derived equivalences and Auslander-Reiten sequences via BB-tilting modules. In particular, we obtain derived equivalences from Auslander-Reiten sequences (or n-almost split sequences), and Auslander-Reiten triangles.

Interleaved Frequency Division Multiple Access (IFDMA) has the salient advantage of lower Peak-to-Average Power Ratio (PAPR) than its competitors like Orthogonal FDMA (OFDMA). A recent research effort ours put forth a new IFDMA transceiver design significantly less complex conventional transceivers. The reduces complexity by exploiting certain correspondence between signal processing and Cooley...

It is well recognized in the computer algebra theory and systems communities that the Fast Fourier Transform (FFT) can be used for multiplying polynomials. Theory predicts that it is fast for “large enough” polynomials. Even so, it appears that no major general-purpose computer algebra system uses the FFT as a general default technique for this purpose. Some provide (optional) access to FFT tec...