نتایج جستجو برای: generalized discrete fourier transform
تعداد نتایج: 438427 فیلتر نتایج به سال:
In this paper a pipelined realization of a Transform Domain adaptive beamformer, is presented. The sliding Discrete Fourier Transform is utilized for the data transformation. The adaptation process is performed by the Delayed Least Mean Squared, Gereralize Sidelobe Canceller. By proper retiming of the introduced delays, fully pipelined architectures are derived, suitable for parallel implementa...
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...
M. Lacey and C. Thiele proved in [26] (Annals of Math. (1997)) and [27] (Annals of Math. (1999)) that the bilinear Hilbert transform maps L1 × L2 → L boundedly when 1 p1 + 1 p2 = 1 p with 1 < p1, p2 ≤ ∞ and 2 3 < p < ∞. Whether the L estimates hold in the range p ∈ (1/2, 2/3] has remained an open problem since then. In this paper, we prove that the bilinear Hilbert transform does not satisfy an...
Realization of focus Speakers produced words differently in the two focus conditions Acoustic features indicate high word prominence Classification Experiments Discrimination of two focus classes with ~65% correct for individual features (acoustic or visual) Exception f0: 65-83% (depending on speaker) Exception nose features: at chance level Significant AV gain when combining energy and FFT or ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید