Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer
CA 2437036 A1 · Owner: Giampapa, Mark E. · Inventors: Vranas, Pavlos M.; Giampapa, Mark E.; Bhanot, Gyan V.
Overview
Its claims, description and drawings are in the Canadian Patents Database.
Open the CIPO recordAbstract From the Canadian patent
The present invention is directed to a method system and program storage , device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system(100) comprising a plurality of nodes(Q11-Q33) in communication over a network comprising distributing the , plurali ty of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first onedimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the …
Read the whole patent
Listed from its CIPO record in Patent Yard's archive of Canadian patents past their term. Its claims, description and drawings are in the CIPO record and on Google Patents, and the Claude kit works from them.
Why it's free to use
- Filed February 25, 2002. No grant is recorded for it in Canada; had it been granted, its 20-year term would have ended February 25, 2022.
- A certificate of supplementary protection adds at most two years for a drug, so even that would have ended by February 25, 2024.
- We check Canadian rights only. A patent in its family in another country could still be in force: check its family on Google Patents.
Timeline
Timeline From CIPO dates
Sources & verification
Official CIPO records
Everything on this page comes from the CIPO record linked above. Contains information licensed under the Open Government Licence – Canada.