The master equation described by Badri Krishnan et al. [1] for the time-frequency pattern using the F-statistic is studied in context of the Chebyshev polynomial modified spindown parameters for the case of gravitational wave (GW) pulsar signals. The Chebyshev polynomial method enables an analytic and numeric evaluation of the Fourier transform (FT) for both the non-demodulated and F-statistic ...

Because of mass assignment onto grid points in the measurement of the power spectrum using the Fast Fourier Transform (FFT), the raw power spectrum |δ f (k)| 2 estimated with FFT is not the same as the true power spectrum P (k). In this paper, we derive the formula which relates |δ

We present a survey on the current status of the constructions of polyphase sequences with low correlation, discrete Fourier transform (DFT), and ambiguity in both time and phase domain, including some new insights and results. Firstly, we systematically introduce the concepts of phase-shift operators and ambiguity functions of sequences, and give a new construction of polyphase sequences from ...

In this study we describe the design, synthesis, and antibacterial activity of novel pleuromutilin analogs. A series of new compounds containing piperazine and alkylamino or arylamino groups was synthesized. The new compounds were characterized via (1)H-NMR, (13)C-NMR, Fourier transform (FT)-IR and MS, and were further evaluated for their in vitro activity against seven Gram-positive, and one G...

| Some applications of the Discrete Fourier Transform (DFT) in coding and in cryptography are described. The DFT over general commutative rings is introduced and the condition for its existence given. Blahut's Theorem, which relates the DFT to linear complexity, is shown to hold unchanged in general commutative rings. I. The (Usual) Discrete Fourier Transform Let be a primitive N th root of uni...

In this paper we consider optimal estimators for speech enhancement in the Discrete Fourier Transform (DFT) domain. We derive an analytical solution for estimating complex DFT coefficients in the MMSE sense when the clean speech DFT coefficients are Laplacian distributed and the DFT coefficients of the noise are Gaussian or Laplacian distributed. We show that these estimators have a number of i...

FFTW is an implementation of the discrete Fourier transform (DFT) that adapts to the hardware in order to maximize performance. This paper shows that such an approach can yield an implementation that is competitive with handoptimized libraries, and describes the software structure that makes our current FFTW3 version flexible and adaptive. We further discuss a new algorithm for real-data DFTs o...

This research paper describes an image change detection method based upon the Discrete Fractional Fourier transform (DFrFT) along with intensity normalization and thresholding. DFrFT is used as it provides extra degree of freedom to detect accurate changed regions. The use of intensity normalization and thresholding ensure that change is based on appearance or disappearance of objects only, wit...

The Spectral decomposition of seismic data was incepted earlier in the second half of the 19th century, howeverlimited research work has been done in this filed because of lack of availability of advancetools/ techniques for analysis of transient signal like earthquake time historyrecords. Although, there are several conventional techniques like Fourier Transform (FT),Fourier Series (FS)that ar...

Reflected differential interference contrast microscopy and attenuated total reflection Fourier transform infrared spectroscopy were used to obtain complementary data on the structural and chemical properties of a biofilm. This information was obtained nondestructively, quasisimultaneously, and in real time, thereby permitting the verification of time-dependent relationships between the biofilm...