نتایج جستجو برای: goertzel
تعداد نتایج: 85 فیلتر نتایج به سال:
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm.
Organizing/Program Committee: Alexei Samsonovich (chair), Antonio Chella, Ben Goertzel, Richard H. Granger, Laurent Itti, Deepak Khosla, Shane T. Mueller, David C. Noelle, Murray Shanahan, Samuel Adams, James Albus, Jerry Ball, Alan Bond, Michael Cox, Son Dao, Stanley Franklin, John Gero, Elkhonon Goldberg, Andreas Herzog, Eva Hudlicka, Neil Jacobstein, Christian Lebiere, Evguenia Malaia, Howar...
We evaluate MUSIC, LMS, and the Goertzel algorithms for dual-tone multiple-frequency estimation. We rate their computational requirements,estimation errors, and their compliance with the CCITT Q.23 and Q.24 standards through MATLAB simulations and real-time implementations on the ADSP-2101 and Motorola 56001 processors.
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. Al...
Dual-tone Multi-frequency (DTMF) Signals are used in touch-tone telephones as well as many other areas. Since analog devices are rapidly changing with digital devices, digital DTMF decoders become important. There are many DTMF decoding algorithms, but most of them cannot comply with the related International Telecommunications Union (ITU) and Bell Communications Research, Inc. (Bellcore) recom...
The Horner and Goertzel algorithms are frequently used in polynomial evaluation. Each of them can be less expensive than the other special cases. In this paper, we present a new compensated algorithm to improve accuracy by using error-free transformations. We derive forward round-off error bound for our algorithm, which implies that yields full precision polynomials not too ill-conditioned. A d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید