A. R. V arkonyi-K oczy, "A recursive fast Fourier transformation algorithm, " IEEE Trans. Circuits Syst.---II: Analog and Digital Signal Processing, vol. 42, pp. 614--616, Sept. 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

No context found.

A. R. V arkonyi-K oczy, "A recursive fast Fourier transformation algorithm, " IEEE Trans. Circuits Syst.---II: Analog and Digital Signal Processing, vol. 42, pp. 614--616, Sept. 1995.

....decimated one, or any other in between. These techniques are not fast algorithms, however, produce less delay as those block oriented algorithms which start working only after the arrival of the complete input data block. Very recently a fast polyphase filter bank family has been reported [5] which if maximally decimated has the same computational complexity as the fast transforms and additionally provides a uniform processing load along time. 3 2 1 0 1 2 3 60 50 40 30 20 10 0 relative angular frequency 3 2 1 0 1 2 3 60 50 40 30 20 10 0 relative ....

A. R. V'arkonyi-K'oczy, "A Recursive Fast Fourier Transformation Algorithm", IEEE Trans. on Circuits and Systems II: Analog and Digital Signal Processing, Vol. 42, No. 9, pp. 614-616, Sept. 1995.

....the generated signal. In this paper the concept of a new synthesizer and analyzer pair for the practical implementation of multi sine measurements is introduced. The novelty of this approach is signal generation and analysis via fast signal transformation pairs operated as polyphase filter banks [2]. A typical example can be Discrete Fourier Transformation (DFT) and its inverse, but other transformations may also be considered. For an N point DFT the signal generation is performed by an N input single output inverse DFT filter bank (see Fig. 1. The signal to be generated is coded in an ....

....added to the signal generator part and similarly an A D conversion is needed at the entrance of the analyzer. In Section IV this complete setup is investigated. The last part of the paper introduces the idea of multiple parallel A D converters within the polyphase analyzer structure proposed in [2]. With this approach the parallel branches of the polyphase analyzer can have their own A D converters producing the corresponding samples from the very same input signal. Since the branches operate at lower rate higher accuracy and or overall operating speed can be achieved. II. Fast DFT ....

[Article contains additional citation context not shown here]

A.R. V'arkonyi-K'oczy, "A Recursive Fast Fourier Transformation Algorithm", IEEE Trans. on Circuits and Systems II: Analog and Digital Signal Processing, Vol. 42, No. 9, pp. 614616, Sept. 1995.

....considers transformations as a single operation to be performed on data sequences (block oriented approach) while the other emphasizes the role of multirate analyzer and synthesizer filter banks. In this paper, using some very recent results concerning fast sliding transformation algorithms ([3], 4] a link is developed which helps to identify the common elements of the two approaches. The fast sliding transformers perform exact transformations, however, operate as polyphase filter banks. These features together may offer further advantages in real time applications, especially when ....

....IDFT IDFT IDFT 8 point l=0 l=1 l=0 l=1 2 point 2 point 2 point 2 point IDFT IDFT IDFT IDFT Figure 3. Polyphase DFT synthesizer for N = 8 2. FAST SLIDING TRANSFORMATIONS Recently a fast implementation of the recursive Discrete Fourier Transformation (DFT) has been proposed [3] which combines the idea of polyphase filtering and the Fast Fourier Transformation (FFT) algorithm. Figs. 2 and 3 show the analyzer and the synthesizer DFT filters, respectively. The operation can be easily understood if we observe that e.g. the analyzer at its input follows the ....

[Article contains additional citation context not shown here]

A. R. V'arkonyi-K'oczy, "A Recursive Fast Fourier Transformation Algorithm", IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, Vol. 42, No.9, pp. 614-616, Sept. 1995.

....of the input frequency and measuring channel centerfrequency mismatch problem typical in the conventional discrete Fourier analysis. Theoretically both the picket fence and the frequency leakage effects can be totally eliminated. Recently an efficient polyphase filter bank pair has been suggested [2] which is completely suitable for this purpose if the relative frequencies of the signal components coincide 1 This work was supported by the Hungarian Fund for Scientific Research (OTKA) under contract T 017448. with those of the standard Discrete Fourier Transformation (DFT) The first filter ....

....the synchronized analyzer. These measurements can be used for compensations while optimizing the overall performance. There are several alternatives to implement the synthesizer analyzer pairs. As a result of some recent investigations a special polyphase filter bank pair can also be considered [2], 5] The computational complexity of these filter banks is in direct correspondence to that of the fast transformation algorithms, but further advantages can also be mentioned. Using fast transformations typically a block oriented way of thinking is applied where the transformation is ....

A.R. V'arkonyi-K'oczy, "A Recursive Fast Fourier Transformation Algorithm", IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Vol. 42, No. 9, pp. 614-616, Sept. 1995.

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