The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Fast Fourier Transform (FFT) is an important algorithm in the fields of science and engineering, where it is used in diverse areas such as communications, signal processing, instrumentation, image and video analysis, etc. The algorithm is essentially a fast implementation of the Discrete Fourier Transform which allows it to reduce the asymptotic complexity of the latter from O(n2) to the former's...
The Fast Fourier Transform (FFT) is a widely used algorithm for spectral analysis of signals and is widely used in applications of communications, biomedical signal processing, industrial process control, etc. Its wide usage and application has resulted in the implementation of a number of FFT algorithms for inputs of various sizes, dimensions, and platform types such as desktop computers, graphic...
A hardware architecture for the single iteration algorithm is proposed in this paper. Single iteration algorithm enables reconstruction of the full signal when small number of signal samples is available. The algorithm is based on the threshold calculation, and allows distinguishing between signal components and noise that appears as a consequence of missing samples. The proposed system for hardware...
The Fast Fourier Transform is one of the most widely used digital signal processing algorithms. It is used to compute the Discrete Fourier Transform and its inverse. As a result, these are widely used for many applications in engineering, science, and mathematics which include areas such as: communications, signal processing, instrumentation, biomedical engineering, numerical methods, sonics and acoustics,...
This paper describes the arithmetic principle and discipline of FFT, analyzes rotation factor and data address of the node. It adopts flexible Verilog HDL to design and realize the data address unit of FFT implementation which is 64-point by radix-2. It uses Alter a company's PLD software Quartus II 8.0 (32-Bit) to compile and form top-level entity.
This paper presents a hardware scheme based on FPGA to implement the 3780 points FFT. The simulation result shows that this design can satisfy the requirement of the DTTB transmitter and can acquire the better performance than typical schemes.
Smart hand prosthesis control, based on myoelectric signals, strongly depends on signal processing algorithms. This kind of application field forces specific requirements on computational complexity (for dexterity of prosthesis), processing speed (for fast reaction) and size (for portability). The paper presents a concept of reduction of DFT information extracted from EMG signals. Signals are acquisited...
In this paper, we examine several algorithms suitable for the hardware implementation of the discrete Fourier transform (DFT) with non-power-of two problem size. We incorporate these algorithms into Spiral, a tool capable of automatically generating corresponding hardware implementations. We discuss how each algorithm can be used to generate different types of hardware structures, and we demonstrate...
In this study, we present a low-cost, low-power, and compact hardware platform for real-time ultrasonic detection applications. In order to cope with the computational complexity of the inherent signal processing algorithms, recursive IIR filter architectures are proposed for realizing the frequency diverse transforms; discrete Fourier transform (DFT) and discrete cosine transform (DCT), which provide...
Digital signal processing (DSP) algorithms exhibit an increasing need for the efficient implementation of trigonometric functions, coordinate transformations or rotations of complex valued phasors. Popular application examples are algorithms used in digital communication technology and in adaptive signal processing. The trigonometric functions like cosine and sine form the building block of certain...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.