US4825399A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for Fourier transform
Assignee: GE Healthcare Japan Corp
•
Filing: 1986-02-26
•
Granted: 1989-04-25
•
Expires: 2006-02-26
Abstract
Abstract An apparatus for Fourier Transform which achieves a spatial frequency multiplication without involving an increase in the operation time. The apparatus has a memory (MM) for storing data obtained by sampling. The Fourier transform of the data stored in this memory is undertaken by circuitry that performs Fourier transform functions (ADD, MUL, HM1, HM2, TBM) without adding 0's to the data, and is simultaneously written to a plurality of memories (M1, M2, M3, M4) at corresponding relative addresses. A series of addresses is specified through these memories (M1-M4).
Inventors
- 👤 Hideo Nagai
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 11:09
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/141
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
146 words
An apparatus for Fourier transform comprising a first memory (MM) for storing data which is obtained by sampling and is to be subjected to Fourier transform; and means for multiplying spatial frequencies by fast Fourier transform without increasing operational time by eliminating the insertion of zeros otherwise needed for increased spatial frequencies, said means for multiplying comprising a plurality of second memories (M1, M2, M3, M4), each comprising a series of addresses, and arranged to permit data to be written into any one of the plurality of second memories independently of each other, Fourier transform means (ADD, MUL, HM1, HM2, TBM) for computing discrete Fourier transform from the data stored in said first memory by fast Fourier transform, and control means (CTL) for causing data delivered from said Fourier transform means to be written simultaneously into said plurality of second memories at identical relative addresses therein.
Claim 2
Independent Claim
146 words
An apparatus for Fourier transform comprising a first memory (MM) for storing data which is obtained by sampling and is to be subjected to Fourier transform; and means for multiplying spatial frequencies by fast Fourier transform without increasing operational time by eliminating the insertion of zeros otherwise needed for increased spatial frequencies, said means for multiplying comprising a plurality of second memories (M1, M2, M3, M4), each comprising a series of addresses, and arranged to permit data to be written into any one of the plurality of second memories independently of each other, Fourier transform means (ADD, MUL, HM1, HM2, TBM) for computing discrete Fourier transform from the data stored in said first memory by fast Fourier transform, and control means (CTL) for causing data delivered from said Fourier transform means to be written simultaneously into said plurality of second memories at identical relative addresses therein.
Claim 3
Dependent Claim
85 words
The apparatus of claim 1, wherein said fast Fourier transform is performed by an equation A(k)=A.sub.R (k)+j.A.sub.I (k) and wherein data obtained from the Fourier transform in the range of k=0 to k=N-1 is stored in a first of said second memories, and data in the range of k=N to k=2N-1 is stored in a second of said second memories and data in the range of k=mN to k=m+1)N-1 is stored in the (m+1)th of the second memories, wherein both m and N are integers.
Claim 4
Independent Claim
149 words
An apparatus for Fourier transform, comprising a plurality of memories, each comprising a series of addresses, and arranged to permit data to be written into any on of said plurality of memories independently of the others, with one of said plurality of memories being used for storing data which is obtained by sampling and is to be subjected to Fourier transform; means for multiplying spatial frequencies by fast Fourier transform without increasing operational time by eliminating the insertion of zeros otherwise needed for increased spatial frequencies, said means for multiplying comprising others than said one of said plurality of memories, Fourier transform means for computing discrete Fourier transform from data stored in said one of said memories by fast Fourier transform, and control for causing data delivered from said Fourier transform means to be written simultaneously into said others of said plurality of memories at identical relative address therein.
Claim 5
Independent Claim
149 words
An apparatus for Fourier transform, comprising a plurality of memories, each comprising a series of addresses, and arranged to permit data to be written into any on of said plurality of memories independently of the others, with one of said plurality of memories being used for storing data which is obtained by sampling and is to be subjected to Fourier transform; means for multiplying spatial frequencies by fast Fourier transform without increasing operational time by eliminating the insertion of zeros otherwise needed for increased spatial frequencies, said means for multiplying comprising others than said one of said plurality of memories, Fourier transform means for computing discrete Fourier transform from data stored in said one of said memories by fast Fourier transform, and control for causing data delivered from said Fourier transform means to be written simultaneously into said others of said plurality of memories at identical relative address therein.
Claim 6
Dependent Claim
92 words
The apparatus of claim 2, wherein said fast fourier transform is performed by an equation A(k)=A.sub.R (k)+j.A.sub.I (k) and wherein data obtained from the Fourier transform is in the range of k=0 to k=N-1 is stored in a first of said others of said plurality of memories, and data in the range of k=N to k=2N--1 is stored in a second of said others of said plurality of memories, and data in the range of k=mN to k=(m+1)N-1 is stored in the (m+1)th of memories, wherein both m and N are integers.
References Cited (Backward Citations)
US3617720A
Cited
US3637399A
Cited
US4075630A
Cited
US4211926A
Cited
US4266279A
Cited
JPS5631741A
Cited
US4615027A
Cited
US4501149A
Cited
US4689762A
Cited
JPH05162635A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-04-24 | 1992-10-24 | 1993-04-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-04-24 | 1996-10-24 | 1997-04-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-04-24 | 2000-10-24 | 2001-04-25 | $7700.00 | Window Closed / Lapsed |