In this paper, we present the scalability analysis of parallel Fast Fourier Transform algorithm on mesh and hypercube connected multicomputers using the isoefficiency metric. The isoefficiency function of an algorithm architecture combination is defined as the rate at which the problem size should grow with the number of processors to maintain a fixed efficiency. On the hypercube architecture, ...

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...

In this work, some solutions such as Mori-Tanaka approximation (MTA), Differential approximations (DA), and Fast Fourier transformation method (FFT) were applied to estimate the elastic bulk shear modulus of three-phase composites in 2D. which two different sizes circular inclusions are arranged randomly non-overlapping a continuous matrix. The numerical using FFT analysis compared with DA, MTA...

The CCD analog transversal filter Is a tremendously cost-effective component In terms of its simplicity compared to equivalent diqltal hardware. In view of this, the chirp z-transform (CZT) algorithm for performing spectral analysis is ideally suited to ccn implementation because, in this algorithm, the bulk of the computation Is performed in a transversal filter. The CCD CZT has some performan...

ABSTRACT Fast Fourier Transform (FFT) is one of the important signal processing algorithms because of its applications in digital filtering, communication, image processing, spectral analysis and estimation etc. Butterfly computation is the basic operation in the FFT algorithm. In this work, a novel approach is thought of and used in implementing the butterfly element. Distributed Arithmetic Al...

This paper presents a study to identify the type and location of yarn periodical errors applying three different signal processing approaches based on FFT – Fast Fourier Transform, FWHT-Fast Walsh-Hadamard Transform and FDFI – Fast Impulse Frequency Determination. The errors determination is applied for the mass measurement of yarn using a capacitive sensor and for the measurement of yarn diame...

In this paper, I propose the use of fast Fourier transform (FFT) as a convenienttool for combining forecast densities of vector autoregressive models in a hybrid Bayesianmanner. While a vast amount of papers comprises combinations based on normal approxi-mations, Monte Carlo methods were fully utilized here, which made the analysis computa-tionally demanding. For the sake of min...

Fast Fourier Transforms (FFTs) are often used in Molecular Dynamics (MD) simulations to calculate force fields of interacting atoms and molecules. A performance analysis shows that the computation time and the communication time of the FFT in MD is not insignificant. Exponential speedup of FFTs, with a quantum computation platform, has been described. Until recently the ability to send classica...