Skip to content Skip to navigation

Connexions

You are here: Home » Content » Program 1: Goertzel Algorithm

Navigation

Content Actions
  • Download module PDF
  • Add to ...
    Add the module to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is 'My Favorites'?)
      'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.
    • A lens (What is a lens?)

      Definition of a lens

      Lenses

      A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

      What is in a lens?

      Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

      Who can create a lens?

      Any individual Connexions member, a community, or a respected organization.

    • External bookmarks
  • E-mail the author

Recently Viewed

This feature requires Javascript to be enabled.

Program 1: Goertzel Algorithm

Module by: C. Sidney Burrus

Summary: Goertzel Algorithm

Goertzel Algorithm

A FORTRAN implementation of the first-order Goertzel algorithm with in-order input as given in ((Reference)) and Entry 1 is given below.

Figure 1: First Order Goertzel Algorithm
C----------------------------------------------
C   GOERTZEL'S  DFT  ALGORITHM
C   First order, input inorder
C   C. S. BURRUS,   SEPT 1983
C---------------------------------------------
    SUBROUTINE DFT(X,Y,A,B,N)
    REAL X(260), Y(260), A(260), B(260)
    Q = 6.283185307179586/N
    DO 20 J=1, N
       C  = COS(Q*(J-1))
       S  = SIN(Q*(J-1))
       AT = X(1)
       BT = Y(1)
       DO 30 I = 2, N
          T  = C*AT - S*BT + X(I)
          BT = C*BT + S*AT + Y(I)
          AT = T
30     CONTINUE
       A(J) = C*AT - S*BT
       B(J) = C*BT + S*AT
20  CONTINUE
    RETURN
    END

References

  1. Burrus, C. S. and Parks, T. W. (1985). DFT/FFT and Convolution Algorithms. New York: John Wiley & Sons.

Comments, questions, feedback, criticisms?

Send feedback