G. Goertzel, An Algorithm for the Evaluation of Finite Trigonometric Series, vol. 65, pp. 34--35. American Math. Monthly, 1958.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a function of supply voltage. Figure lb ,shows a plot of experimentally derived normalized delay vs. Van. Once again, the delay dependence on supply voltage was verified to be relatively independent of various logic functions and logic styles [1] 1.00 0.90 0.811 0.711 o.611 0.50 0.411 0. 311 0.20 O. 1C o.oCl.oo i I I I 2.00 3.00 4.00 5.00 Vdd Figure 1: Plot of normalized energy vs.Vad (la) and delay vs. Vad (lb) It is clear that operating at the lowest possible voltage is most desirable, however, this comes at the cost of increased delays and thus reduced throughput. ....

....a plot of experimentally derived normalized delay vs. Van. Once again, the delay dependence on supply voltage was verified to be relatively independent of various logic functions and logic styles [1] 1.00 0.90 0.811 0.711 o.611 0.50 0.411 0.311 0.20 O. 1C o.oCl.oo i I I I 2. 00 3.00 4.00 5.00 Vdd Figure 1: Plot of normalized energy vs.Vad (la) and delay vs. Vad (lb) It is clear that operating at the lowest possible voltage is most desirable, however, this comes at the cost of increased delays and thus reduced throughput. However, by modifying the architecture through a ....

[Article contains additional citation context not shown here]

G. Goertzel, "An algorithm for the Evaluation of Finite Trigonometric Series", Amer. Math. Monthly, Vol. 65, No. 1, pp. 34-35, 1968.

....reproduction across an ATM network 2 Performance issues at the network layer 2. 1 Scenario A: signal distortion DTMF digit recognition is not instantaneous since a frequency scan must take place across a window of incoming samples before a result can be obtained (current scheme uses 102 samples [5]) This means that a certain portion of data which failed to be detected at the beginning of the incoming DTMF burst will be packetised as G.729 speech. See Figure 2.1. Figure 2.1 Network effects from DTMF detection processing delay 2.1.1 G.729 leakage The portion arriving at the far end as ....

G.Goertzel, An Algorithm for the Evaluation of Finite Trigonometric Series, American Math Monthly, Vol.65, Jan. 1958, pp 34-35.

....d concurrent exchange communication steps. The proposed algorithms achieve these nice features by using a simple yet efficient mapping scheme and a restructuring for the FFT algorithm which enables overlapping communication with computation. Different strategies exist for the computation of FFT [5, 7, 8, 14]. The FFT scheme chosen for parallelization is radix 2, Cooley Tukey scheme using the decimation in time decomposition [5] Section 2 presents and discusses the computational structure of this FFT scheme. Parallelization of the chosen FFT scheme is discussed in Section 3. The mapping scheme ....

G. Goertzel, "An Algorithm for the evaluation of Finite Trigonometric Series", Amer. Math. Monthly, 65, pp.34-35, 1968.

....the system s goal may then switch to determining quickly whether the infant is crying or choking while ignoring telephone rings. Such a goal might be accomplished by temporarily monitoring only a few low frequency spectral regions with a specialized, low cost SPA such as Goertzel s algorithm [16] 2 . The traditional perceptual system design could implement such SPA switching within its fixed frontend framework by applying each available SPA (both specialized and general) to the signal data and selectively examining the SPA output streams when necessary. The traditional paradigm s view ....

G. Goertzel, "An Algorithm for the Evaluation of Finite Trigonometric Series," American Mathematics Monthly, Vol. 65, pp. 34--35, Jan 1958.

....techniques have been previously considered. The most well known are the pruning type approaches which obtain computational efficiency by excluding some subset of input and or output points. Techniques of this type include the FFT pruning algorithms [63] 64] 65] Goertzel s algorithm [66], and others [67] 68] Advantages of pruning techniques include the possibility of using the efficient FFT structure and the ease with which the error introduced through the approximation may be quantified. In contrast to pruning approaches, one may consider sacrificing the precision with which ....

G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," Amer. Math. Monthly, vol. 65, pp. 34--35, Jan. 1958.

....Many different approximate DFT algorithms have been proposed. The most well known are the pruning type algorithms which obtain computational efficiency by excluding some subset of input and or output points. Algorithms of this type include the FFT pruning algorithms [2] 4] Goertzel s algorithm [5], and others [6] 7] Advantages of pruning algorithms include the possibility of using the efficient FFT structure and the ease with which the error introduced through the approximation may be quantified. In contrast to pruning approaches, one may consider sacrificing the precision with which the ....

G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," Amer. Math. Monthly, vol. 65, pp. 34--35, Jan. 1958.

....approximate DFT algorithms have been proposed. The most well known are the pruning type algorithms which obtain computational efficiency by excluding some subset of input and or output points. Algorithms of this type include the FFT pruning algorithms [40] 41] 42] Goertzel s algorithm [43], and others [44] 45] Advantages of pruning algorithms include the possibility of using the efficient FFT structure and the ease with which the error introduced through the approximation may be quantified. In contrast to pruning approaches, one may consider sacrificing the precision with which ....

G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," Amer. Math. Monthly, vol. 65, pp. 34--35, Jan. 1958.

....consider evaluating second and third order polynomials. Computation of polynomials is very common in digital signal processing, and Horner s scheme (the final structure in our examples) is often suggested in filter design and FFT calculations when very few frequency components are needed [23]. First we will analyze the second order polynomial X 2 AX B. The left side of Figure 4a shows the straightforward implementation which requires two multiplications and two additions and has a critical path of 3 (assuming that each operation takes one control cycle) On the right side of ....

G. Goertzel, "An algorithm for the Evaluation of Finite Trigonometric Series", Amer. Math. Monthly, Vol. 65, No. 1, pp. 34-35, 1968.

....processor (DSP) capable of performing the DTMF decoding in S W. The latter implementation is cost effective because it reduces the overall component count (by eliminating the DTMF decoder IC) The detector presented in this paper implements a methodology based on the wellknown Goertzel algorithm[3], providing an e#cient way to implement a DTMF detector and decoder. Other implementations are also possible (e.g. DFT [4] NDFT[5] but an implementation of the Goertzel algorithm with suitably modified filter coe#cients has been tested and turned out to perform well in such applications, still ....

G. Goertzel, "An Algorithm for the evaluation of finite trigonometric Series", Amer. Math. Monthly, Vol.65, Jan. 1958, pp. 34-35

No context found.

G. Goertzel, An Algorithm for the Evaluation of Finite Trigonometric Series, vol. 65, pp. 34--35. American Math. Monthly, 1958.

No context found.

G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," Amer. Math. Monthly, vol. 65, pp. 34--35, 1958.

No context found.

G. Goertzel, An Algorithm for the Evaluation of Finite Trigonometric Series, vol. 65, pp. 34--35. American Math. Monthly, 1958.

No context found.

G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," American Math. Monthly, vol. 65, pp. 34--35, 1958.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC