Detail The Sliding DFT   Oleh:  Jacobsen, E. ; Lyons, R. Jenis: Article from Bulletin/Magazine Dalam koleksi: IEEE Signal Processing Magazine vol. 20 no. 2 (2003), page 74-82. Topik: SLIDE; sliding; DFT Ketersediaan Perpustakaan Pusat (Semanggi) Nomor Panggil: SS26.7 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada     Lihat Detail Induk Isi artikel The sliding DFT process for spectrum analysis was presented and shown to be more efficient than the popular Goertzel (1958) algorithm for sample - by - sample DFT bin computations. The sliding DFT provides computational advantages over the traditional DFT or FFT for many applications requiring successive output calculations, especially when only a subset of the DFT output bins are required. Methods for output stabilization as well as time - domain data windowing by means of frequency - domain convolution were also discussed. A modified sliding DFT algorithm, called the sliding Goertzel DFT, was proposed to further reduce the computational workload. We start our sliding DFT discussion by providing a review of the Goertzel algorithm and use its behavior as a yardstick to evaluate the performance of the sliding DFT technique. We examine stability issues regarding the sliding DFT implementation as well as review the process of frequency - domain convolution to accomplish time - domain windowing. Finally, a modified sliding DFT structure is proposed that provides improved computational efficiency. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Kembali

Copyright © 2006, 2007 Unika Atma Jaya, all rights reserved