Fast Fourier Transform (FFT) plays an important role in the field of digital signal processing. High performance FFT processors are widely used in different application, such as speech processing, image processing, and communication system. In this paper, we proposed a novel register array based low power FFT processor for Mel Frequency Cepstral Coefficient (MFCC). Compared with [9-12], this no...

This paper focus on the development of the fast Fourier transform (FFT), based on Decimation-In-Time (DIT) domain by using Mixed-Radix algorithm (Radix-4 and Radix-8).Fast Fourier transforms, popularly known as FFTs, have become an integral part of any type of digital communication system and a wide variety of approaches have been tried in order to optimize the algorithm for a variety of parame...

Calculation of the cross-correlation can be carried out in both the spatial and Fourier domain. The relative efficiency of the two techniques is dependent on the search area and target area sizes. The Fourier Transform method becomes more efficient as the target area size approaches the search area and with larger search and target areas. This paper outlines techniques which have been investiga...

Due to their fast operation, Fast Fourier Transform (FFT)-based coarse signal synchronization methods are an attractive option for Global Navigation Satellite System (GNSS) receiver baseband signal processing. However, there are several reasons why the utility of FFT-based methods is dependent on understanding the trade-off between synchronization speed and the required processing power. Firstl...

The FFT(Fast Fourier Transform) processing is one of the key procedure in the popular orthogonal frequency division multiplexing(OFDM) based communication system such as Digital Audio Broadcasting(DAB),Digital Video Broadcasting Terrestrial(DVB-T),Asymmetric Digital Subscriber Loop(ADSL) etc.These application domain require performing FFT in various size from 64 to 8192 point. Implementing each...

This paper describes a spread-spectrum downlink RAKE receiver that computes a data detection in the frequency domain. We assume a pilot signal is transmitted with data signals for channel sounding. The pilot signal does not degrade the receiver bit error rate (BER) performance because the receiver estimates the pilot signal and subtracts the estimated pilot signal from the received signal befor...

Problem statement: In order to bring speech into the mainstream of business process an efficient digital signal processor is necessary. The Fast Fourier Transform (FFT) and the butter fly structure symmetry will enable the harwaring easier. With the DSP and software proposed, togetherly established by means of a system, named here as “Speech Abiding System (SAS)”, a software agent, which involv...

Orthogonal Frequency Division Multiplexing (OFDM) is gaining popularity for high data rate communication systems. We propose the use of adaptive beamforming for interference rejection in OFDM systems, due to its advantages over equalization. An adaptive beamformer uses the concept of spatial filtering to direct the antenna beam towards the desired signal/transmitter and place a null towards the...

The time-domain uniform asymptotic solution (TD-UAS) for the transient scattered field excited by the high-frequency (HF) pulse wave incident on a cylindrically curved open surface with a varying radius of curvature is presented in this paper. The TD-UAS, effective in the transition regions including the geometrical boundaries RB and SB, is constructed by the geometrical rays, the surface diffr...

In the present article an attempt is made to compare multi-carrier and single carrier modulation schemes for wireless communication systems with the utilization of fast Fourier transform (FFT) and its inverse in both cases. With the assumption that in OFDM (orthogonal frequency division multiplexing), the inverse FFT transforms the complex amplitudes of the individual sub-carriers at the transm...