REAL TIME FAST FOURIER TRANSFORM PROCESSOR WITH SEQUENTIAL ACCESS MEMORY
N complex samples of an input signal are stored in a sequential access circulating memory, and then transmitted to a calculator which has a pair of shift registers, each of N words capacity; the shift registers have terminals spaces by a single bit position from a final terminal, and an intermediate...
Saved in:
Main Author | |
---|---|
Format | Patent |
Language | English |
Published |
05.12.1972
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | N complex samples of an input signal are stored in a sequential access circulating memory, and then transmitted to a calculator which has a pair of shift registers, each of N words capacity; the shift registers have terminals spaces by a single bit position from a final terminal, and an intermediate terminal, and are, alternatingly, stepped at shift rates of f and 2f respectively. An iterative method of fast Fourier transformation calculation is carried out by sequential access to the shift registers, alternatingly, and calculation of inputs (or outputs from) selected terminals of the shift registers, by means of selected interconnection from the specific shift registers to an adder, a subtraction circuit, and a multiplier which multiplies selected signals with a synthesized binary reference signal. The apparatus is useful for electrical signal spectral analysis. |
---|---|
Bibliography: | Application Number: USD3704826 |