Hardware implementation of the pseudo-spectral time-domain method
First Claim
1. A system for performing the pseudo-spectral time-domain (PSTD) method on data, comprising:
- a forward fast Fourier transform (FFT) unit calculating a forward fast Fourier transform (FFT) from the data;
a complex multiplication unit receiving the FFT-processed data and calculating a spatial derivative in the frequency domain from the FFT-processed data;
an inverse fast Fourier transform (IFFT) unit converting the spatial derivative in the frequency domain from the complex multiplication unit into the time domain;
a computation engine solving a PSTD equation based upon the spatial derivative in the time domain received from the IFFT unit; and
a memory subsystem that provides input values to the FFT unit and receives output results from the computation engine,wherein input values for the FFT unit are stored in increasing-x, increasing-y and increasing-z patterns in the memory subsystem that allows a burst read of the memory subsystem to maximize throughput.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer hardware configuration for performing the pseudo-spectral time-domain (PSTD) method on data. The hardware configuration includes a forward fast Fourier transform (FFT) unit that calculates a forward fast Fourier transform (FFT) from the data, and a complex multiplication unit that receives the FFT-processed data and calculates a spatial derivative in the frequency domain from the FFT-processed data. The hardware configuration further includes an inverse fast Fourier transform (IFFT) unit that converts the spatial derivative in the frequency domain from the complex multiplication unit into the time domain, and a computation engine that solves a PSTD equation based upon the spatial derivative in the time domain received from the IFFT unit.
-
Citations
20 Claims
-
1. A system for performing the pseudo-spectral time-domain (PSTD) method on data, comprising:
-
a forward fast Fourier transform (FFT) unit calculating a forward fast Fourier transform (FFT) from the data; a complex multiplication unit receiving the FFT-processed data and calculating a spatial derivative in the frequency domain from the FFT-processed data; an inverse fast Fourier transform (IFFT) unit converting the spatial derivative in the frequency domain from the complex multiplication unit into the time domain; a computation engine solving a PSTD equation based upon the spatial derivative in the time domain received from the IFFT unit; and a memory subsystem that provides input values to the FFT unit and receives output results from the computation engine, wherein input values for the FFT unit are stored in increasing-x, increasing-y and increasing-z patterns in the memory subsystem that allows a burst read of the memory subsystem to maximize throughput. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system for performing the pseudo-spectral time-domain (PSTD) method on data, comprising:
-
a plurality of forward fast Fourier transform (FFT) units, each FFT unit calculating a forward fast Fourier transform (FFT) from the data; a plurality of complex multiplication units, each complex multiplication unit receiving the FFT-processed data from a corresponding FFT unit and calculating a spatial derivative in the frequency domain from the FFT-processed data; a plurality of inverse fast Fourier transform (IFFT) units, each IFFT unit converting the spatial derivative in the frequency domain from a corresponding complex multiplication unit into the time domain; a plurality of computation engines, each computation engine solving a PSTD equation based upon the spatial derivative in the time domain received from a corresponding IFFT unit; and a memory subsystem that provides input values to the FFT unit and receives output results from the computation engine, wherein the input values for the FFT unit are stored in increasing-x, increasing-y and increasing-z patterns in the memory subsystem that allows a burst read of the memory subsystem to maximize throughput. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A computer hardware configuration for performing the pseudo-spectral time-domain (PSTD) method on data, comprising:
-
a forward fast Fourier transform (FFT) unit calculating a forward fast Fourier transform (FFT) from the data; a complex multiplication unit receiving the FFT-processed data and calculating a spatial derivative in the frequency domain from the FFT-processed data; an inverse fast Fourier transform (IFFT) unit converting the spatial derivative in the frequency domain from the complex multiplication unit into the time domain; a computation engine solving a PSTD equation based upon the spatial derivative in the time domain received from the IFFT unit; and a memory subsystem that provides input values to the FFT unit and receives output results from the computation engine, wherein the input values for the FFT unit are stored in increasing-x, increasing-y and increasing-z patterns in the memory subsystem that allows a burst read of the memory subsystem to maximize throughput. - View Dependent Claims (12, 13, 14, 15)
-
-
16. A computer hardware configuration for performing the pseudo-spectral time-domain (PSTD) method on data, comprising:
-
a plurality of forward fast Fourier transform (FFT) units, each FFT unit calculating a forward fast Fourier transform (FFT) from the data; a plurality of complex multiplication units, each complex multiplication unit receiving the FFT-processed data from a corresponding FFT unit and calculating a spatial derivative in the frequency domain from the FFT-processed data; a plurality of inverse fast Fourier transform (IFFT) units, each IFFT unit converting the spatial derivative in the frequency domain from a corresponding complex multiplication unit into the time domain; a plurality of computation engines, each computation engine solving a PSTD equation based upon the spatial derivative in the time domain received from a corresponding IFFT unit; and a memory subsystem that provides input values to the FFT unit and receives output results from the computation engine, wherein values for the FFT unit are stored in increasing-x, increasing-y and increasing-z patterns in the memory subsystem that allows a burst read of the memory subsystem to maximize throughput. - View Dependent Claims (17, 18, 19, 20)
-
Specification