Under many research works, it has been observed that the multiple input multiple output (MIMO) system can be considered an efficient solution for the high-speed wireless communication. However, the delay spreads in non-flat fading channels abrupt the functioning of MIMO system. In orthogonal frequency division multiplexing (OFDM), the channel impulse response is flat in each sub carrier. Hence,...

Fast Fourier transforms (FFT) and Inverse Fast Fourier Transform (IFFT) processing is one of the key procedures in popular orthogonal frequency division multiplexing (OFDM) communication systems. This paper presents the study of an efficiency of the fast Fourier transform may be increased by removing operations of input values which are zero, and of output values which are not required; this pr...

This paper presents a novel high-speed, low-complexity two-parallel 128-point radix-24 FFT/IFFT processor for MB-OFDM ultrawideband (UWB) systems. The proposed high-speed, low-complexity FFT architecture can provide a higher throughput rate and low hardware complexity by using a two-parallel data-path scheme and a single-path delayfeedback (SDF) structure. The radix-24 FFT algorithm is also rea...

EXTENT stands for an EXpert system for TENsor product formula Translation. In this paper, we describe the development of programs for fast Fourier transforms (FFT) for vector multiprocessors and distributed-memory machines using the EXTENT system for formula translation. Several forms of the FFT have been presented in the literature. Each form has diierent characteristics and is best suited for...

An important procedure in the mathematics of phylogenetic analysis is to associate, to any collection of weighted splits, the metric given by the corresponding linear combination of split metrics. In this note, we study necessary and sufficient conditions for a collection of splits of a given finite set X to give rise to a linearly independent collection of split metrics. In addition, we study ...

A large family of signal processing techniques consist of Fourier-transforming a signal, manipulating the Fourier-transformed data in a simple way, and reversing the transformation. We widely use Fourier frequency analysis in equalization of audio recordings, X-ray crystallography, artefact removal in Neurological signal and image processing, Voice Activity Detection in Brain stem speech evoked...

To process high-rate streaming data, throughput is one of the key performance metrics for FFT design. However, high throughput FFT architectures consume large amount of power due to complex routing or excessive memory access. In this paper, we propose a Cooley-Turkey algorithm based, high throughput energy-efficient multi-FFT architecture. In the proposed architecture, we use multiple time-mult...

DOI: 10.5281/zenodo.55536 ABSTRACT Discrete Fourier Transform is a principal mathematical method for the frequency analysis and has wide applications in Engineering and Sciences. Because the DFT is so ubiquitous, fast methods for computing DFT have been studied extensively, and continuous to be an active research. The way of splitting the DFT gives out various fast algorithms. In this paper, we...