نتایج جستجو برای: پردازنده fft
تعداد نتایج: 6618 فیلتر نتایج به سال:
This paper describes in detail the design of a custom CMOS Fast Fourier Transform(FFT) processor for computing 256-point complex FFT. The FFT is well suited for real-time spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor consists of one parallel-parallel multiplier and two adders. It is capable of computing one butterfly computation every 100ns thus ...
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...
افزایش تعداد هستههای پردازنده به افزایش توان محاسباتی و به موجب آن، افزایش دمای پردازنده منجر میشود. کنترل و مدیریت دما در این پردازندهها اهمیت زیادی دارد. مدیریت دما به دو رویکرد واکنشی و فعال تقسیم میشود. برخلاف رویکرد واکنشی، در روشهای فعال، دما پیش از رسیدن به حد آستانه با استفاده از مدل دمایی، پیشبینی و کنترل میشود. در این مقاله، برای پیشبینی دما، مدلی براساس SVR پیشنهاد شد...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید