Patent US4092723A successfully refreshed from Google Patents.
US4092723A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer for computing a discrete fourier transform
Assignee: Thales SA
•
Filing: 1976-10-01
•
Granted: 1978-05-30
•
Expires: 1996-10-01
Abstract
Abstract The invention relates to machines by which it is possible to compute the discrete Fourier transform of a collection of N numbers in the case where N = 2 n . The invention consists in using the properties of Pease's decomposition, according to which ##EQU1## and in constructing a computer comprising n identical modules except for the coefficients memorized therein, these modules each effecting the application of a term C×E m ×P.
Inventors
- 👤 Jean-Edgar Picquendar
- 👤 Boris Sokoloff
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 10:25
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/141; G06F17/142
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
220 words
An apparatus for performing upon an incoming digital signal comprising a succession of N = 2 n elementary incoming digital signals and represented by a vector f j , a discrete Fourier transform represented by a matrix [W], delivering an output digital signal comprising N elementary output signals and represented by a vector g j = (1/N) [W]f j , said matrix being able to be decomposed in accordance with the equation ##EQU14## said apparatus comprising a succession of n modules connected in series, each of said modules corresponding to the calculation of one term C×E m ×P, the first of said modules receiving said incoming digital signal, the last of said modules delivering a non-standardized succession of N output digital signals represented by a vector ##EQU15## each of said modules comprising: memory means for receiving from the preceding module N intermediate digital signals in succession in accordance with a first order, and further delivering pairs of said intermediate digital signals in succession in accordance with a second order defined by the matrix P; and calculating means connected to said memory means for receiving said pairs of intermediate digital signals, performing upon said pairs of intermediate digital signals the calculations corresponding to the matrix product C×E m , and delivering to the next module successively N next intermediate digital signals.
Claim 2
Independent Claim
220 words
An apparatus for performing upon an incoming digital signal comprising a succession of N = 2 n elementary incoming digital signals and represented by a vector f j , a discrete Fourier transform represented by a matrix [W], delivering an output digital signal comprising N elementary output signals and represented by a vector g j = (1/N) [W]f j , said matrix being able to be decomposed in accordance with the equation ##EQU14## said apparatus comprising a succession of n modules connected in series, each of said modules corresponding to the calculation of one term C×E m ×P, the first of said modules receiving said incoming digital signal, the last of said modules delivering a non-standardized succession of N output digital signals represented by a vector ##EQU15## each of said modules comprising: memory means for receiving from the preceding module N intermediate digital signals in succession in accordance with a first order, and further delivering pairs of said intermediate digital signals in succession in accordance with a second order defined by the matrix P; and calculating means connected to said memory means for receiving said pairs of intermediate digital signals, performing upon said pairs of intermediate digital signals the calculations corresponding to the matrix product C×E m , and delivering to the next module successively N next intermediate digital signals.
Claim 3
Dependent Claim
75 words
An apparatus as claimed in claim 1 further comprising: a plurality of digital gates for simultaneously receiving the succession of said output digital signals; means for opening at said first rhythm successively said gates in a natural order; each of said gates delivering one of said output digital signals; and a plurality of memories connected respectively to said digital gates for simultaneously and permanently delivering said output digital signals onto a plurality of output connections.
Claim 4
Dependent Claim
67 words
An apparatus as claimed in claim 1, wherein said memory means comprise two identical memories and commutation means for interchanging said two identical memories when said calculations corresponding to the matrix product C×E m are performed; one of said memories being connected to said preceding module via said commutation means while the other one of said memories is connected to said calculation means via said commutation means.
Claim 5
Dependent Claim
118 words
An apparatus as claimed in claim 3 wherein said identical memories comprise respectively N words numbered from 0 to N-1, and said memory means further comprise: means for loading with said intermediate digital signals said one memory in a series from said word N-1 at a rhythm marking the arrival of said intermediate digital signals from said preceding module; means for shifting the content of each of said words of said other one memory in the next low numbered word, at a second rhythm half of said first rhythm; and means for simultaneously reading the content of the words 0 and N/2 of said other one memory, delivering said pairs of intermediate digital signals to said calculating means.
Claim 6
Dependent Claim
157 words
An apparatus as claimed in claim 4, wherein said calculating means comprise: a third memory for memorizing a set of coefficients forming the matrix E m ; means for successively reading into said third memory said coefficients at said second rhythm; means for receiving one signal of one of said pairs of intermediate digital signals and one coefficient read into said third memory, multiplying said one signal with said one coefficient, and delivering a product signal; means for receiving the other one signal of said one pair of intermediate digital signals and said product signal, adding said other one signal and said product signal, and delivering a sum signal; means for receiving the other one signal of said one pair of intermediate digital signals and said product signal, subtracting said product signal from said other one signal, and delivering a difference signal; and means for multiplexing said sum and difference signals, providing said next intermediate digital signals.
Claim 7
Dependent Claim
16 words
An apparatus as claimed in claim 5, wherein said third memory is a read only memory.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-05-29 | 1981-11-28 | 1982-05-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-05-29 | 1985-11-28 | 1986-05-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-05-29 | 1989-11-28 | 1990-05-30 | $7700.00 | Window Closed / Lapsed |