http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2001514771-A
Outgoing Links
| Predicate | Object |
|---|---|
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F17-142 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-14 |
| filingDate | 1998-01-02-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationDate | 2001-09-11-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | JP-2001514771-A |
| titleOfInvention | Dimensionless fast Fourier transform method and apparatus |
| abstract | (57) [Summary] A method and apparatus for calculating a fast Fourier transform FFT are disclosed. The FFT of a predetermined size is formalized using the principle of tensor product, and is realized by an apparatus or software. Thus, similar reconfigurable hardware or software can perform FFT calculations in any dimension for a selected FFT size. The FFT is factored and provided to a first permutation block (10), and then a first computation block (12, 14, 16, 18) for calculating a tensor product and a twiddle factor of a relatively small size dimensionless Fourier transform. , The second permutation block (20), the second calculation block (22, 24, 26, 28), and finally to the third permutation block (30). The basic building blocks of the circuit (10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30) are reconfigurable and can be applied to the maximum in hardware or software. |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2008506191-A |
| priorityDate | 1997-01-06-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 14.