Browsing by Subject "Discrete fourier transform"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Extension of forward-backward method with DFT-based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries
    (John Wiley & Sons, 2005) Civi, Ö. A.; Ertürk, V. B.; Chou, H.-T.
    An extension of the discrete Fourier transform (DFT)-based forward-backward algorithm is developed using the virtual-element approach to provide a fast and accurate analysis of electromagnetic radiation/scattering from electrically large, planar, periodic, finite (phased) arrays with arbitrary boundaries. Both the computational complexity and storage requirements of this approach are O(Ntot) (Ntot is the total number of unknowns). The numerical results for both printed and freestanding dipole arrays with circular and/or elliptical boundaries are presented to validate the efficiency and accuracy of this approach.
  • Thumbnail Image
    ItemOpen Access
    Fractional fourier transform
    (Wolfram Research, 2003) Özaktaş, Haldun M.; Weisstein, E. W.
  • Thumbnail Image
    ItemOpen Access
    Sampling and discrete linear canonical transforms
    (Springer, 2016) Healy, J. J.; Özaktaş, Haldun M.; Healy, J. J.; Kutay, M. A.; Özaktaş, Haldun M.; Sheridan, J. T.
    A discrete linear canonical transform would facilitate numerical calculations in many applications in signal processing, scalar wave optics, and nuclear physics. The question is how to define a discrete transform so that it not only approximates the continuous transform well, but also constitutes a discrete transform in its own right, being complete, unitary, etc. The key idea is that the LCT of a discrete signal consists of modulated replicas. Based on that result, it is possible to define a discrete transform that has many desirable properties. This discrete transform is compatible with certain algorithms more than others.