×

REAL-TIME DIGITAL SPECTRUM ANALYZER UTILIZING THE FAST FOURIER TRANSFORM

  • US 3,573,446 A
  • Filed: 06/06/1967
  • Issued: 04/06/1971
  • Est. Priority Date: 06/06/1967
  • Status: Expired due to Term
First Claim
Patent Images

1. A digital spectrum analyzer for computing the finite discrete Fourier transform coefficients from a number (N) of digitized samples, represented by A(k), of an input signal comprising:

  • an array of delay registers forming a matrix having r1 columns and r2 rows;

    row shift means for transferring the contents of said delay registers in a row shift mode wherein the contents of a delay register are transferred to the adjacent register in a higher order column along the same row, the contents of the delay register in the highest order columns being transferred to the delay register in the next higher order row and of the lowest order column;

    means operative independently of said row shift means for transferring the contents of said delay registers in a column shift mode wherein the contents of said delay registers are transferred along the same column to an adjacent delay register of higher order row, the contents of the delay registers in the highest order row being transferred to the delay register in the next higher order column and lowest order row, the output of the delay register in the highest order column and highest order row defining the output of said array;

    multiplier means receiving said input signals for multiplying said signal by a predetermined value of a weighting factor;

    adder means for adding the output of said array and for storing the resultant in the delay register of lowest order column and lowest order row; and

    control means for operating on each of said A(k) input signals, said operation including transferring said input signal to said multiplier means wherein it is multiplied by said weighting factor signal, shifting the contents of said array in said row shift mode, transferring the output of said multiplier means and the output of said array to said adder means wherein they are added, and storing the output of said adder means in the first delay register of said array, said control means operating on each of said A(k) input signals a total of r1 times, whereby intermediate estimates of said Fourier coefficients are stored in said delay registers.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×