We propose two families of scalable hash functions for collision–resistant hashing that are highly parallel and based on the generalized fast Fourier transform (FFT). FFT–hashing is based on multipermutations. This is a basic cryptographic primitive for perfect generation of diffusion and confusion which generalizes the boxes of the classic FFT. The slower FFT–hash functions iterate a compressi...

In present scenario every process should be efficient and simple. Fast Fourier Transform (FFT) is an efficient algorithm to compute the N point DFT. The main focus of this paper is to design FFT using ALU which is used in receiver blocks of OFDM system. It has greater applications in signal and image processing, communication and instrumentation. But the design of FFT requires large number of a...

This paper describes the design and implementation of a fully pipelined 64-point Fast Fourier Transform (FFT) in programmable logic. The FFT takes 20-bit fixed point complex numbers as input and after a known pipeline latency produces 20-bit complex values representing the FFT of the input. It is designed to allow continuous input of samples and is therefore suitable for use in real-time system...

As the generation grown up, designing of the wireless communication system towards providing best performance by the services such as high speed of data delivery, high capacity and high bit rate. MC-CDMA (Multi CarrierCode Division Multiple Access) is a desired technique for such cases, MC-CDMA gives best results by the combination of OFDM (Orthogonal Frequency Division Multiplexing) and CDMA (...

Background: Multiple chemical sensitivity (MCS) is a chronic multisystem condition characterized by low levels of multiple chemical susceptibility inducing a spectrum of central nervous system symptoms, including dizziness. Thus, considering (i) the overlapping psychogenic and organic burdens shared in MCS development and in vestibular disorders; (ii) the number of previous studies describing c...

PURPOSE No method has been established to evaluate the dissociation between subjective and objective vertical positions with respect to the self-awareness of postural deformity in patients with Parkinson's disease (PD). The purpose of this study was to demonstrate, from the relationship between an assessment of the dissociation of subjective and objective vertical positions of PD patients and a...

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