IEEE Organizations related to Discrete Fourier Transform

Back to Top


Conferences related to Discrete Fourier Transform

Back to Top

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).



Periodicals related to Discrete Fourier Transform

Back to Top

Image Processing, IEEE Transactions on

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.


Proceedings of the IEEE

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 ...


Signal Processing Letters, IEEE

Rapid dissemination of new results in signal processing world-wide.


Signal Processing, IEEE Transactions on

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.



Most published Xplore authors for Discrete Fourier Transform

Back to Top

Xplore Articles related to Discrete Fourier Transform

Back to Top

Prime number DFT computation via parallel circular convolvers

K. J. Jones IEE Proceedings F - Radar and Signal Processing, 1990

A great deal of work has been carried out in recent years into the construction of computationally efficient small discrete Fourier transform (DFT) algorithms. Most small-DFT algorithms exploit the equivalence of prime number DFT computation with that of circular convolution, as well as Winograd's complexity theory results relating to the optimal computation of small circular convolutions, to achieve reduced-complexity solutions. ...


A Transient Harmonic Current Protection Scheme for HVDC Transmission Line

Zheng Zheng; Tai Tai; James S. Thorp; Yang Yang IEEE Transactions on Power Delivery, 2012

Based on the boundary characteristic of a dc transmission line, the response of transient harmonic current in the line-commutated converter HVDC transmission system is analyzed under various fault conditions in this paper. A new transient harmonic current protection scheme is proposed. The discrete Fourier transform is used to extract transient harmonic currents at both terminals of the dc transmission line ...


A bus-oriented multiprocessor fast Fourier transform

D. L. Jones; H. V. Sorensen IEEE Transactions on Signal Processing, 1991

A bus-oriented multiprocessor architecture specialized for computation of the discrete Fourier transform (DFT) of a length N =2M sequential data stream is developed. The architecture distributes computation and memory requirements evenly among the processors and allows flexibility in the number of processors and in the choice of a fast Fourier transform (FFT) algorithm. With three buses, the bus bandwidth equals ...


Frequency-time codes for OFDMA uplink applications

F. Mathieu; J. -Y. Chouinard Canadian Conference on Electrical and Computer Engineering, 2005., 2005

Orthogonal frequency division multiplexing (OFDM) is a multi-carrier block modulation scheme primarily used in high bit rate systems to mitigate inter- symbol interference (ISI) experienced in multipath wireless channels. The annoying effect of ISI is almost all removed by the insertion of a cyclic prefix (or postfix) extension. However, during the transmission, ISI may also provides a multipath diversity advantage ...


Generalized and Extended Subspace Algorithms for Error Correction with Quantized DFT Codes

Mojtaba Vaezi; Fabrice Labeau IEEE Transactions on Communications, 2014

Discrete Fourier transform (DFT) codes have been used to provide robustness against errors and erasures in various applications. This paper focuses on improving error localization of the Bose-Chaudhuri-Hocquenghem (BCH) DFT codes. First, we analyze how the subspace-based error localization outperforms the coding-theoretic one. Then, we propose an extension of the subspace-based error localization, based on additional syndrome, that improves the ...


More Xplore Articles

Educational Resources on Discrete Fourier Transform

Back to Top

eLearning

Prime number DFT computation via parallel circular convolvers

K. J. Jones IEE Proceedings F - Radar and Signal Processing, 1990

A great deal of work has been carried out in recent years into the construction of computationally efficient small discrete Fourier transform (DFT) algorithms. Most small-DFT algorithms exploit the equivalence of prime number DFT computation with that of circular convolution, as well as Winograd's complexity theory results relating to the optimal computation of small circular convolutions, to achieve reduced-complexity solutions. ...


A Transient Harmonic Current Protection Scheme for HVDC Transmission Line

Zheng Zheng; Tai Tai; James S. Thorp; Yang Yang IEEE Transactions on Power Delivery, 2012

Based on the boundary characteristic of a dc transmission line, the response of transient harmonic current in the line-commutated converter HVDC transmission system is analyzed under various fault conditions in this paper. A new transient harmonic current protection scheme is proposed. The discrete Fourier transform is used to extract transient harmonic currents at both terminals of the dc transmission line ...


A bus-oriented multiprocessor fast Fourier transform

D. L. Jones; H. V. Sorensen IEEE Transactions on Signal Processing, 1991

A bus-oriented multiprocessor architecture specialized for computation of the discrete Fourier transform (DFT) of a length N =2M sequential data stream is developed. The architecture distributes computation and memory requirements evenly among the processors and allows flexibility in the number of processors and in the choice of a fast Fourier transform (FFT) algorithm. With three buses, the bus bandwidth equals ...


Frequency-time codes for OFDMA uplink applications

F. Mathieu; J. -Y. Chouinard Canadian Conference on Electrical and Computer Engineering, 2005., 2005

Orthogonal frequency division multiplexing (OFDM) is a multi-carrier block modulation scheme primarily used in high bit rate systems to mitigate inter- symbol interference (ISI) experienced in multipath wireless channels. The annoying effect of ISI is almost all removed by the insertion of a cyclic prefix (or postfix) extension. However, during the transmission, ISI may also provides a multipath diversity advantage ...


Generalized and Extended Subspace Algorithms for Error Correction with Quantized DFT Codes

Mojtaba Vaezi; Fabrice Labeau IEEE Transactions on Communications, 2014

Discrete Fourier transform (DFT) codes have been used to provide robustness against errors and erasures in various applications. This paper focuses on improving error localization of the Bose-Chaudhuri-Hocquenghem (BCH) DFT codes. First, we analyze how the subspace-based error localization outperforms the coding-theoretic one. Then, we propose an extension of the subspace-based error localization, based on additional syndrome, that improves the ...


More eLearning Resources

IEEE-USA E-Books

  • Appendix B: Fourier Transform

    This chapter contains sections titled: Properties of the Fourier Transformation Spectrum of Example Time Domain Signals Transformation of Sampled Time Signals Short Time Fourier Transform of Continuous Signals Discrete Fourier Transform

  • More on One-Dimensional Simulation

    This chapter introduces some advanced concepts of one-dimensional electromagnetic (EM) FDTD simulation. First, it changes the formulation slightly and introduces the use of the flux density into the simulation. One of the most significant developments in the FDTD method is a means to simulate frequency-dependent dielectric materials. Then, the chapter introduces the use of the discrete Fourier transform in FDTD simulation. This is an extremely powerful method to quantify the output of the simulation. The chapter concludes with the simulation of human muscle tissue. Muscle tissue can be adequately simulated over a frequency range of about two decades with the Lorentz formulation.

  • POWER QUALITY ANALYSIS

    Modern power grid can have a large penetration of distributed generation (DG) at the distribution level. One of the most important standards related to the interconnection of DG into the electrical distribution system is the IEEE 1547. This chapter discusses simulation tools for modeling fundamentals of power quality performance assessment. Power quality indices concern the electrical interaction between the main network and their customers. It can be decoupled in two main issues addressed in the chapter: the voltage quality concerns the way in which the supply voltage affects equipment, and the current quality concerns the way in which the equipment current affects the system. Power quality variations are classified as either transient or steady???state disturbances. The power factor is strongly influenced by the harmonic content of the voltage and current. MATLAB has built???in functions to calculate the discrete Fourier transform (DFT) or fast Fourier transform (FFT) and the corresponding inverses.

  • Fourier Transform and Fourier Series

    The Fourier transform (FT) has been widely used in circuit analysis and synthesis, from filter design to signal processing, image reconstruction, and so on. Fourier transform is used for energy signal which contain finite energy. The discrete Fourier transform (DFT) and fast Fourier transform (FFT) are discrete tools to analyze time domain signals. One needs to know the problems caused by discretization and specify the parameters accordingly to avoid nonphysical and nonmathematical results. Mathematically, FT is defined for continuous time signals, and in order to go to frequency domain, the time signal must be observed from an infinite-extend time window. This chapter lists a simple MATLAB code for the Fourier series representation of a given function. The number of terms required in the Fourier series representation depends on the smoothness of the function and the specified accuracy.

  • The Discrete Fourier Transform

    This chapter contains sections titled: Introduction Common Uses of the DFT Equation and Block Diagram Properties Real Input Signals Strengths Weaknesses Conclusions

  • About the Author

    You can immediately have the power to perform electromagnetic simulation. If you have a fundamental understanding of electromagnetic theory and the knowledge of at least one high-level computer language, you can begin writing simple electromagnetic simulation programs after reading the first chapter of this book. Electromagnetic Simulation Using the FDTD Method describes the power and flexibility of the finite-difference time-domain method as a direct simulation of Maxwell's equations. The FDTD method takes advantage of today's advanced computing power because its computational requirements increase linearly with the size of the simulation problem. This book begins with a simple one-dimensional simulation and progresses to a three-dimensional simulation. Each chapter contains a concise explanation of an essential concept and instruction on its implementation into computer code. Projects that increase in complexity are included, ranging from simulations in free space to propagation in dispersive media. Peripheral topics that are pertinent to time-domain simulation, such as Z-transforms and the discrete Fourier transform, are also covered. Electromagnetic Simulation Using the FDTD Method is written for anyone who would like to learn electromagnetic simulation using the finite-difference time-domain method. Appropriate as both a textbook and for self-study, this tutorial-style book will provide all the background you will need to begin research or other practical work in electromagnetic simulation.

  • Generation and Analysis of Excitation Signals

    This chapter contains sections titled: Introduction The Discrete Fourier Transform (DFT) Generation and Analysis of Multisines and Other Periodic Signals Generation of Optimized Periodic Signals Generating Signals Using The Frequency Domain Identification Toolbox (Fdident) Generation of Random Signals Differentiation, Integration, Averaging, and Filtering of Periodic Signals

  • A Bound on the Output of a Circular Convolution with Application to Digital Filtering

    When implementing a digital filter, it is important to utilize in the design a bound or estimate of the largest output value which will be obtained. Such a bound is particularly useful when fixed point arithmetic is to be used since it assists in determining register lengths necessary to prevent overflow. In this paper we consider the class of digital filters which have an impulse response of finite duration and are implemented by means of circular convolutions performed using the discrete Fourier transform. A least upper bound is obtained for the maximum possible output of a circular convolution for the general case of complex input sequences. For the case of real input sequences, a lower bound on the least upper bound is obtained. The use of these results in the implementation of this class of digital filters is discussed.

  • SingleTone Parameter Estimation from DiscreteTime Observations

    Estimation of the parameters of a single-frequency complex tone from a finite number of noisy discrete-time observations is discussed. The appropriate Cramér-Rao bounds and maximum-likelihood (ML) estimation algorithms are derived. Some properties of the ML estimators are proved. The relationship of ML estimation to the discrete Fourier transform is exploited to obtain practical algorithms. The threshold effect of one algorithm is analyzed and compared to simulation results. Other simulation results verify other aspects of the analysis.

  • Sliding Spectrum Analysis

    This chapter contains sections titled: Goertzel Algorithm Sliding Discrete Fourier Transform (SDFT) SDFT Stability Time-Domain Windowing in the Frequency Domain Sliding Goertzel DFT Conclusions References Appendix



Standards related to Discrete Fourier Transform

Back to Top

No standards are currently tagged "Discrete Fourier Transform"


Jobs related to Discrete Fourier Transform

Back to Top