Discrete Fourier Transform
4,145 resources related to Discrete Fourier Transform
- Topics related to Discrete Fourier Transform
- IEEE Organizations related to Discrete Fourier Transform
- Conferences related to Discrete Fourier Transform
- Periodicals related to Discrete Fourier Transform
- Most published Xplore authors for Discrete Fourier Transform
2012 International Conference on Digital Image Computing: Techniques and Applications (DICTA)
he International Conference on Digital Image Computing: Techniques and Applications (DICTA) is the main Australian Conference on computer vision, image processing, pattern recognition, and related areas. DICTA was established as a biannual conference in 1991 and became an annual event in 2007. It is the premiere conference of the Australian Pattern Recognition Society (APRS).
Signal-processing aspects of image processing, imaging systems, and image scanning, display, and printing. Includes theory, algorithms, and architectures for image coding, filtering, enhancement, restoration, segmentation, and motion estimation; image formation in tomography, radar, sonar, geophysics, astronomy, microscopy, and crystallography; image scanning, digital half-toning and display, andcolor reproduction.
The most highly-cited general interest journal in electrical engineering and computer science, the Proceedings is the best way to stay informed on an exemplary range of topics. This journal also holds the distinction of having the longest useful archival life of any EE or computer related journal in the world! Since 1913, the Proceedings of the IEEE has been the ...
Rapid dissemination of new results in signal processing world-wide.
The technology of transmission, recording, reproduction, processing, and measurement of speech; other audio-frequency waves and other signals by digital, electronic, electrical, acoustic, mechanical, and optical means; the components and systems to accomplish these and related aims; and the environmental, psychological, and physiological factors of thesetechnologies.
Chan, L.W.; Chen, M.Y. Acoustics, Speech and Signal Processing, IEEE Transactions on, 1988
An approach for realizing the N-point discrete Fourier transform (DFT) of an input sequence is presented. It is then combined with H.T. King's (1981) approach to construct a two-dimensional array for computing the two- dimensional DFT. This mixed model takes stream input and produces stream output. In addition, no extra I/O time delay is required before performing the row (column) ...
Jian Zhao; Ellis, Andrew D. Optical Communication (ECOC), 2010 36th European Conference and Exhibition on, 2010
We propose a novel DFT-based implementation for optical fast OFDM (FOFDM), by which 4-ASK single-side-band FOFDM avoids the use of Hilbert transform, which is required in DCT-based FOFDM, and exhibits similar complexity, performance, and spectral efficiency as conventional 16-QAM OFDM.
Villasenor, J.D. Data Compression Conference, 1993. DCC '93., 1993
The unacceptability of block artifacts in medical image data compression has led to systems employing full-frame discrete cosine transform (DCT) compression. Although the DCT is the optimum fast transform when block coding is used, it is outperformed by the discrete Fourier transform (DFT) and discrete Hartley transform for images obtained using positron emission tomography and magnetic resonance imaging. Such images ...
Wen-Liang Hsue; Soo-Chang Pei Circuits and Systems (ISCAS), 2013 IEEE International Symposium on, 2013
Properties of eigenvectors and eigenvalues for discrete Fourier transform (DFT) are important for defining and understanding the discrete fractional Fourier transform (DFRFT). In this paper, we first propose a closed-form formula to construct an eigenvector of N-point DFT by down-sampling and then folding any eigenvector of (4N)-point DFT. The result is then generalized to derive eigenvectors of N-point DFT from ...
Alecu, A.; Salagean, A. Information Theory, 2008. ISIT 2008. IEEE International Symposium on, 2008
The k-error linear complexity of a periodic sequence s over a field K and with period N is the minimum linear complexity that s can have after changing at most k of its terms in each period. This concept can be used as a measure of cryptographic strength for sequences. We introduce a generalisation of the notion of k-error linear ...
Behzad, Arya Wireless-LAN Radio Design, 2005
As one of the few rising stars of the semiconductor industry, WLAN design is engaging more and more engineers and companies. Essential to the overall system design, is the radio design. This tutorial will introduce the various flavors of the 802.11 WLAN PHY standards (A/B/G) and describe their specifications and impact on the radio design. The possible choices for the ...
O'Donnell, Robert Review of Signal Systems and Digital Signal Processing, 2012
The Radar Systems Engineering Series consists of seventeen lectures; each lecture is offered as an individual tutorial. The goal of this series is to provide an advanced introduction to radar systems subsystem issues for first year graduate students, advanced senior undergraduates or professionals new to the field. The material will be most accessible to university graduates with a Bachelor of ...
No standards are currently tagged "Discrete Fourier Transform"