The Fourier volume rendering technique operates in the frequency domain and creates line integral projections of a 3D scalar field. These projections can be efficiently generated in ) log O( 2 N N time by utilizing the Fourier Slice-Projection theorem. However, until now, the mathematical difficulty of the Fast Fourier Transform prevented acceleration by graphics hardware and therefore limited ...

In digital signal processing applications, we usually use DFT (discrete Fourier transform) to transfer signal from time-domain to frequency-domain. In past decades, there were many papers discussing and exploiting FFT (fast Fourier transform) architectures for hardware implementation. In this paper, we proposed a novel VLSI FFT processor based on parallel-pipelined constant geometry algorithm (...

Recently, overlap frequency-domain equalization (FDE) based on minimum mean square error (MMSE) criterion which requires no guard interval (GI) insertion was proposed for signal transmission using multi-code direct sequence code division multiple access (DS-CDMA) in a frequency-selective fading channel. Another promising equalization technique is time-domain sliding-window chip equalization (SW...

Over the last decade, the development of IEEE 802.11a which referred to as Local Area Network (LAN) standard is rapidly advancing. This is due to the limitation and what Orthogonal Frequency Division Multiplexing (OFDM), which is used in the heart of LAN standard, susceptible to like carrier frequency offset and hence higher Bits Error Rate (BER). In this paper, the performance of IEEE 802.11a ...

A wavelet approach to the analysis of nonuniform high-speed interconnects with frequency dependent parameters is presented in this paper. The nonuniform interconnects are modeled by the use of nonuniform multiconductor transmission line equations in the frequency domain. Two different methods are proposed here (differential and integral formulation): in both of them the space variable is expand...

This paper presents a fast algorithm for FIR filters with small coefficient alphabet in time domain. Our method outperforms conventional time domain filtering several times in arithmetic complexity in practical applications. It is also competitive with transform domain techniques based on Fast Fourier Transform (FFT). Unlike FFT based methods our approach is accurate and is not using rounding a...

The Fast Fourier Transform (FFT) technique has long been used for spectral analysis but it has not been fully exploited for data compression purposes. This paper presents the concept for compressing telemetry data using the FFT in such a manner that the time domain waveform can be recovered. The sampled time-domain data is transformed into the frequency-domain data and only the significant comp...

Integrated circuits to support digital communication standards are commonly based on a Fast Fourier Transform (FFT) of some length. Flexible length makes the design more usable for configurable algorithm-specific circuits. The proposed project discusses the functional aspects of a FFT design. As the transform length increases the amount of arithmetic involved becomes excessive. This makes Fast ...

A method of optimal beamforming for Rayleigh-faded time-frequency selective channels using fractional Fourier transform (FRFT) is considered in this paper. The conventional minimum mean squared error (MMSE) beamforming in the frequency domain or spatial domain becomes a special case of optimal beamforming with FRFT. The method is especially useful in moving source problems, where Doppler effect...

As the channel frequency selectivity becomes severer, the bit error rate (BER) performance of direct sequence spread spectrum (DSSS) signal transmission with rake combining degrades due to an increasing inter-path interference (IPI). Frequency-domain equalization (FDE) can replace rake combining with much improved BER performance in a severe frequency-selective fading channel. For FDE, accurate...