In this paper, an approach based on Kekre’s fast code book Generation (KFCG) Algorithm in the transform domain has been proposed. KFCG is used for feature extraction in both the training and testing phases. Three methods for codebook generation have been used. In the 1st method, codebooks are generated from the speech samples by using Discrete Fourier Transform (DFT). In the 2nd method, the cod...

In this paper, transform domain adaptive filters are studied and reviewed based on previous researches. In transform domain adaptive filters orthogonality properties of transformation such as discrete cosine transform (DCT), discrete sine transform (DST), wavelet transform and discrete fourier transform (DFT) are used to achieve an improved convergence rate as compared to the time domain analys...

Conventional Fourier analysis has many schemes for different types of signals. They are Fourier transform (FT), Fourier series (FS), discrete-time Fourier transform (DTFT), and discrete Fourier transform (DFT). The goal of this correspondence is to develop two absent schemes of fractional Fourier analysis methods. The proposed methods are fractional Fourier series (FRFS) and discrete-time fract...

Fractional transforms are useful tools for processing of non-stationary signals. The methods of implementing sliding discrete fractional Fourier transform (SDFRFT), sliding discrete fractional cosine transform (SDFRCT) and sliding discrete fractional sine transform (SDFRST) for real time processing of signals are presented. The performances of these sliding transforms, with regard to computatio...

Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...

Let GH(n; G) denote a generalised Hadamard matrix of order n over the group G, and let EA( q) denote the elementary abelian group of prime power order q. We use a computer to investigate the applicability of a recently discovered general construction for GH (4tq; E A( q)) in the case t = 2. In particular, we prove that G H (8p; Zp) exist for all primes p > 19, and obtain GH(8q; EA(q)) for all p...

The discrete Hilbert transform (DHT) has a variety of applications in signal representation and processing [2-4]. The transform comes in a variety of forms based on assumptions on how the signal is derived from a corresponding periodic signal. The form presented by Kak [1] takes the signal to be non-periodic. Several versions of the transform for periodic signals are also known [5], [6], [7], [...

If at each point of a set of positive Lebesgue measure, every rearrangement of a multiple trigonometric series square converges to a finite value, then that series is the Fourier series of a function to which it converges uniformly. If there is at least one point at which every rearrangement of a multiple Walsh series square converges to a finite value, then that series is the Walsh-Fourier ser...

In this paper, a transform based methodology is presented for compression of electrocardiogram (ECG) signal. The methodology employs different transforms such as Discrete Wavelet Transform (DWT), Fast Fourier Transform (FFT) and Discrete Cosine Transform (DCT). A comparative study of performance of different transforms for ECG signal is made in terms of Compression ratio (CR), Percent root mean...

Abstract. The modified discrete cosine transform (MDCT) and modified discrete sine transform (MDST) both for the evenly and oddly stacked systems are perfect reconstruction cosine/sine–modulated filter banks based on time domain aliasing cancellation (TDAC) employed in the current international audio coding standards and commercial audio compression products. Based on the matrix representation ...