By Topic

Nonuniform fast cosine transform and the Chebyshev PSTD algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bo Tian ; Klipsch Sch. of Electr. & Comput. Eng., New Mexico State Univ., Las Cruces, NM, USA ; Qing Huo Liu

Fast cosine transform (FCT) has many applications in signal processing and computational electromagnetics. Many efforts have been made in developing the efficient FCT algorithm. However, to use the regular FCT algorithm, the input data have to be uniformly distributed. This is a major limitation of the Chebyshev pseudospectral time domain (PSTD) method. We developed two different fast algorithms for forward nonuniform discrete cosine transform (NUFCT) by using the regular Fourier matrices. These algorithms have the complexity of O(Nlog/sub 2/N) where N is the number of data points. Unlike the uniform fast cosine transform which is identical to its inverse, the inverse nonuniform FCT cannot share the same algorithm. We use the conjugate-gradient fast Fourier transform (CG-FFT) methods for the fast inverse cosine transform (NU-IFCT).

Published in:

Antennas and Propagation Society International Symposium, 1999. IEEE  (Volume:4 )

Date of Conference:

11-16 July 1999