• DocumentCode
    1079852
  • Title

    The chirp z-transform algorithm

  • Author

    Rabiner, L.R. ; Schafer, R.W. ; Rader, C.M.

  • Author_Institution
    Bell Telephone Laboratories, Inc. Murray Hill, N.J.
  • Volume
    17
  • Issue
    2
  • fYear
    1969
  • fDate
    6/1/1969 12:00:00 AM
  • Firstpage
    86
  • Lastpage
    92
  • Abstract
    A computational algorithm for numerically evaluating the z -transform of a sequence of N samples is discussed. This algorithm has been named the chirp z -transform (CZT) algorithm. Using the CZT algorithm one can efficiently evaluate the z -transform at M points in the z -plane which lie on circular or spiral contours beginning at any arbitrary point in the z -plane. The angular spacing of the points is an arbitrary constant, and M and N are arbitrary integers. The algorithm is based on the fact that the values of the z -transform on a circular or spiral contour can be expressed as a discrete convolution. Thus one can use well-known high-speed convolution techniques to evaluate the transform efficiently. For M and N moderately large, the computation time is roughly proportional to (N+M) \\log _{2}(N+M) as opposed to being proportional to N . M for direct evaluation of the z -transform at M points.
  • Keywords
    Chirp; Convolution; Discrete transforms; Fast Fourier transforms; Laboratories; Laplace equations; Military computing; Spirals; Strips; Telephony;
  • fLanguage
    English
  • Journal_Title
    Audio and Electroacoustics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9278
  • Type

    jour

  • DOI
    10.1109/TAU.1969.1162034
  • Filename
    1162034