US3883726A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Redundant fast fourier transform data handling computer
Assignee: L3Harris Interstate Electronics Corp
•
Filing: 1973-05-18
•
Granted: 1975-05-13
•
Expires: 1993-05-18
Abstract
Abstract Special purpose data handling equipment is utilized with a fast Fourier transform algorithm computer. The equipment buffers input data such that each block of input data includes data from the immediately preceding and following data blocks. This input redundancy is useful when input data is processed through a data window which attenuates data at the beginning and end of the data block, since, when this data is transformed and subsequently inversely transformed, simple addition of the output data points removes the effect of the attenuating window.
Inventors
- 👤 Ralph Otto Schmidt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 19:39
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/141; G06F17/142
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
156 words
A system for transforming input time domain data samples, comprising: a buffer responsive to said input time domain samples for combining said input time domain samples into data sets, selected ones of said input time domain samples being combined into more than one data set; an attenuator responsive to said data sets produced in said buffer for attenuating certain of said input time domain samples of said data sets to produce attenuated output data sets; a first computer receiving said attenuated output data sets for performing calculations on said output data sets according to the Cooley-Tukey fast Fourier transform algorithm to produce frequency domain coefficients; a second computer coupled to said first computer for performing calculations on said frequency domain coefficients according to the reverse Cooley-Tukey fast Fourier transform algorithm to produce time domain coefficients; and means responsive to said second computer for combining said coefficients to remove from said coefficients the effects of said attenuator.
Claim 2
Independent Claim
156 words
A system for transforming input time domain data samples, comprising: a buffer responsive to said input time domain samples for combining said input time domain samples into data sets, selected ones of said input time domain samples being combined into more than one data set; an attenuator responsive to said data sets produced in said buffer for attenuating certain of said input time domain samples of said data sets to produce attenuated output data sets; a first computer receiving said attenuated output data sets for performing calculations on said output data sets according to the Cooley-Tukey fast Fourier transform algorithm to produce frequency domain coefficients; a second computer coupled to said first computer for performing calculations on said frequency domain coefficients according to the reverse Cooley-Tukey fast Fourier transform algorithm to produce time domain coefficients; and means responsive to said second computer for combining said coefficients to remove from said coefficients the effects of said attenuator.
Claim 3
Dependent Claim
49 words
A system for transforming input time domain data samples as defined in claim 1 wherein said means for removing the effects of said attenuator additionally comprises: means coupled to the output of said second computer for delaying a selected plurality of said time domain coefficients to produce delayed coefficients.
Claim 4
Dependent Claim
65 words
A system for transforming input time domain data samples as defined in claim 2 wherein said means for removing the effects of said attenuator additionally comprises: a plurality of adding means, each having an input from said delay means and an input from said second computer, said means adding selected ones of said time domain coefficients to selected ones of said delayed time domain coefficients.
Claim 5
Independent Claim
297 words
A method of handling the input and output data of a fast Fourier analysis computer, said computer capable of manipulating input time domain data in data sets to produce output frequency domain coefficients in data sets in accordance with a fast Fourier transform algorithm, and said computer capable of maNipulating input frequency domain coefficients in data sets to produce output time domain coefficients in data sets in accordance with an inverse fast Fourier transform algorithm, comprising: accessing a series of input time domain signal samples for said computer; delaying said series of input time domain signal samples into first data sets, each data set including the data for one fast Fourier transform, each data set including a plurality of input time domain signal samples which are also included in another of said data sets; attenuating said first data sets in accordance with a predetermined waveform to produce attenuated data sets; conducting said attenuating data sets to said computer after said attenuating step as said input time domain data in data sets, so that said computer will produce said output frequency domain coefficients in data sets in accordance with a fast Fourier transform algorithm; conducting said output frequency domain coefficients in data sets to said computer as said input frequency domain data in data sets, so that said computer will produce said output time domain coefficients in data sets in accordance with an inverse fast Fourier transform algorithm; delaying a portion of said output time domain coefficients in each of said time domain coefficient data sets resulting from said inverse transform; and combining selected output time domain coefficients and selected ones of said portion of said output time domain coefficients after said delaying step, said dividing and combining steps effecting a removal of the effects of said attenuation.
Claim 6
Independent Claim
297 words
A method of handling the input and output data of a fast Fourier analysis computer, said computer capable of manipulating input time domain data in data sets to produce output frequency domain coefficients in data sets in accordance with a fast Fourier transform algorithm, and said computer capable of maNipulating input frequency domain coefficients in data sets to produce output time domain coefficients in data sets in accordance with an inverse fast Fourier transform algorithm, comprising: accessing a series of input time domain signal samples for said computer; delaying said series of input time domain signal samples into first data sets, each data set including the data for one fast Fourier transform, each data set including a plurality of input time domain signal samples which are also included in another of said data sets; attenuating said first data sets in accordance with a predetermined waveform to produce attenuated data sets; conducting said attenuating data sets to said computer after said attenuating step as said input time domain data in data sets, so that said computer will produce said output frequency domain coefficients in data sets in accordance with a fast Fourier transform algorithm; conducting said output frequency domain coefficients in data sets to said computer as said input frequency domain data in data sets, so that said computer will produce said output time domain coefficients in data sets in accordance with an inverse fast Fourier transform algorithm; delaying a portion of said output time domain coefficients in each of said time domain coefficient data sets resulting from said inverse transform; and combining selected output time domain coefficients and selected ones of said portion of said output time domain coefficients after said delaying step, said dividing and combining steps effecting a removal of the effects of said attenuation.
Claim 7
Independent Claim
185 words
A method of handling a series of input time domain signal samples in a computer, comprising the steps of: A. selecting a set of N of said input time domain samples; B. superimposing an attenuation function on said set of N input time domain signal samples to produce attenuated signal samples; C. transforming said attenuated signal samples to produce frequency domain coefficients from said samples in accordance with a forward fast Fourier transform algorithm; D. transforming said frequency domain coefficients to produce time domain coefficients in accordance with an inverse fast Fourier transform algorithm; E. selecting an additional set of N of said input time domain samples, said additional set of N including a plurality of input time domain samples which are also included in said set of N input time domain samples selected in step (A); F. repeating steps ((B), (C) and (D), utilizing the set of N input time domain samples selected in step (E); and G. combining selected time domain coefficients produced in step (D) with selected time domain coefficients produced in step (F) to remove the effects of said attenuation function.
Claim 8
Independent Claim
185 words
A method of handling a series of input time domain signal samples in a computer, comprising the steps of: A. selecting a set of N of said input time domain samples; B. superimposing an attenuation function on said set of N input time domain signal samples to produce attenuated signal samples; C. transforming said attenuated signal samples to produce frequency domain coefficients from said samples in accordance with a forward fast Fourier transform algorithm; D. transforming said frequency domain coefficients to produce time domain coefficients in accordance with an inverse fast Fourier transform algorithm; E. selecting an additional set of N of said input time domain samples, said additional set of N including a plurality of input time domain samples which are also included in said set of N input time domain samples selected in step (A); F. repeating steps ((B), (C) and (D), utilizing the set of N input time domain samples selected in step (E); and G. combining selected time domain coefficients produced in step (D) with selected time domain coefficients produced in step (F) to remove the effects of said attenuation function.
Claim 9
Independent Claim
166 words
A system for calculating the discrete Fourier transform of a plurality of serial input time domain samples to produce output frequency domain coefficients (A(r)) and for calculating the inverse discrete Fourier transform comprising: a buffer responsive to said serial input time domain samples for storing said serial input time domain samples, said buffer outputting said serial input time domain samples in a series of data sets each comprising N input time domain samples, each successive data set of said series including a plurality of input time domain samples which are also included in the next succeeding data set in the data set series; an attenuator connected to receive the output sets of data from said buffer, said attenuator superimposing an attenuation waveform upon said sets of data from said buffer to produce a series of attenuated data sets having attenuated time domain samples (X(k)); a computer responsive to said attenuator for combining said data sets of N attenuated time domain samples in accordance with the equation
Claim 10
Independent Claim
166 words
A system for calculating the discrete Fourier transform of a plurality of serial input time domain samples to produce output frequency domain coefficients (A(r)) and for calculating the inverse discrete Fourier transform comprising: a buffer responsive to said serial input time domain samples for storing said serial input time domain samples, said buffer outputting said serial input time domain samples in a series of data sets each comprising N input time domain samples, each successive data set of said series including a plurality of input time domain samples which are also included in the next succeeding data set in the data set series; an attenuator connected to receive the output sets of data from said buffer, said attenuator superimposing an attenuation waveform upon said sets of data from said buffer to produce a series of attenuated data sets having attenuated time domain samples (X(k)); a computer responsive to said attenuator for combining said data sets of N attenuated time domain samples in accordance with the equation
Claim 11
Dependent Claim
39 words
A system as defined in claim 6 wherein said means for removing comprises means for combining certain coefficients of each of said series of sets of N coefficients (X''(k)) with certain coefficients to different sets of N coefficients (X''(k)).
Claim 12
Dependent Claim
113 words
A system as defined in claim 6 wherein said means for removing comprises: a second buffer responsive to said second computer for delaying selected ones of said time domain coefficients (X''(k)) to produce selected delayed time domain coefficients (X''''(k)) of each of said sets of N output time domain coefficients (X''(k)); and means responsive to said second computer and said second buffer for adding selected one of said delayed time coefficients (X''''(k)) of each of said sets of N output time domain coefficients (X''(k)) with selected ones of said output time domain coefficients (X''(k)) of the next succeeding set of N output time domain coefficients (X''(k)) to remove the effect of said attenuator.
References Cited (Backward Citations)
US3541458A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1978-05-12 | 1978-11-11 | 1979-05-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1982-05-12 | 1982-11-11 | 1983-05-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1986-05-12 | 1986-11-11 | 1987-05-13 | $7700.00 | Window Closed / Lapsed |