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

Testing the reliability of threshing unit is difficult and thus often neglected before harvesting season, which can result in breakdown maintenance during peak time difficult-to-access areas for sensor mounting. In this paper, vibration analysis condition combine harvester was performed by introducing bracket inaccessible locations. The Adash A4900 Vibrio M analyzer (Adash spol. s.r.o., Ostrava...

The specific dynamic elastic modulus, acoustic radiation, logarithmic decrement, sound transmission parameter, and conversion efficiency of spruce wood (Picea jezoensis var. microsperma (Lindl.) W.C.Cheng & L.K.Fu) were improved by extraction treatment with deionized water, dichloromethane, benzyl alcohol, ethanol. A larger improvement was achieved after benzoyl alcohol dichloromethane than usi...

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

The first part of this article series discusses commonly known definitions most crucial for high-speed data converters (in this case analog-to-digital converter or short ADCs) used in communications, instrumentation and data acquisition applications. The purpose of this article is to help the reader gain a better understanding of common parameters such as signal-to-noise ratio (SNR), signal-to-...