magnetotelluric (mt) method is an important passive surface geophysical method which uses the earth’s natural electromagnetic fields to investigate the electrical resistivity structure of the subsurface. the depth of investigation of mt is much higher than that of other electromagnetic (em) methods (vozoff, 1991). for a general conductivity distribution in the earth, the horizontal electric fie...

In this study, an interference detection and mitigation method is proposed for frequency-modulated continuous-wave radar systems based on time-domain signal reconstruction. The uses the difference in one-dimensional fast Fourier transform (1D-FFT) results between targets interferences. 1D-FFT results, target appears as a peak at same frequency point all chirps within one frame, whereas absence ...

In this paper a module consisting of a Fast Least Mean Square (FLMS) filter is modeled and verified to eliminate acoustic echo, which is a problem for hands free communication. However the acoustic echo cancellation (AEC) is modeled using digital signal processing technique especially Simulink Blocksets. The needed algorithm code is generated in Matlab Simulink programming. At the simulation le...

This paper is part 6 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on correlation. The correlation is performed in the time domain (slow correlation) and in the frequency domain using a Short-Time Fourier Transform (STFT). When the Fourier transform is an FFT, the correlation is said to be a " fast ...

In this article, we develop a novel algorithm for Doppler acquisition in fast Fourier transform (FFT)-based Global Navigation Satellite System (GNSS) receivers. The Doppler estimation is carried out in FFT domain by finding the frequency shift which maximizes the energy of the correlation vector. Subsequently, energy detection is used for preliminary decision about the presence of the target co...

The Fast Fourier Transform (FFT) reduces the number of computations required for the straightforward calculation of the discrete Fourier transform. For a one-dimensional signal of length N , this provides a reduction in complexity from O(N) to O(N log2 N) operations. Recently, fast algorithms have been introduced for discrete Fourier transforms on nonequispaced data sets (NDFT). These algorithm...

The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n logn) instead of O(n) arithmetic operations. Graph Signal Processing (GSP) is a recent research domain that generalizes classical signal processing tools, such as the Fourier transform, to situations where the signal domain is given by any arbitrary gr...

Last years, Wavelet Packet Modulation (WPM) or Wavelet Packet Transform based Orthogonal Frequency Division Multiplexing (WPT-OFDM) have been introduced to wired and wireless communication fields as efficient Multicarrier Modulation (MCM) techniques. The wavelets have interesting features such as flexibility, compatibility and localization in both time and frequency domains with no need to use ...

Acoustic noise canceller (ANC) is currently the technology emergent in the field of communications system. However quality of voice communications is one of the major aspects of communications system due to the concurrence in this field. In this paper we designed, developed and implemented on a fixed point DSP C6713 of a low cost adaptive acoustic noise canceller for improving the quality of th...

Fast Fourier Transform (FFT) is one of the most important tools in digital signal processing. FFT costs O(N logN) for transforming a signal of length N . Recently, researchers at MIT have proposed Sparse Fast Fourier Transform (sFFT) [1][2] as a breakthrough with computational complexity O(K logN) and O(K logN log N K ) for exactly K-sparse signal (with only K non-zero frequency grids) and gene...