Use of Interlaced Grid to Parallelize the AIM CFIE Solver for Execution on Distributed Parallel Computer Cluster
Summary :
In this paper, we present the interlaced fast Fourier transform (FFT) method to parallelize the adaptive integral method (AIM) algorithm for the radar cross-section (RCS) computation of large scattering objects in free space. It is noted that the function obtained after convolution is smoother as compared to the original functions. Utilizing this concept, it is possible to interlace the grid current and charge sources in AIM and compute the potentials on each set of interlaced grid independently using FFT. Since the potentials on each interlaced grid are smooth functions in space, we can then interpolate the potentials to every other nodes on the original grid. The final solution of the potentials on the original grid is obtained by summing the total contributions of all the computed and interpolated potentials from every individual interlaced grid. Since the potentials of each interlaced grid can be computed independently without much communication overheads between the processes, such an algorithm is suitable for parallelizing the AIM solver to run on distributed parallel computer clusters. It is shown that the overall computation complexity of the newly proposed interlaced FFT scheme is still of O(N log N).
- Publication
- IEICE TRANSACTIONS on Electronics Vol.E87-C No.9 pp.1568-1577
- Publication Date
- 2004/09/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Wave Technologies for Wireless and Optical Communications)
- Category
- Basic Electromagnetic Analysis
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Banleong OOI, Tionghuat NG, Pangshyan KOOI, "Use of Interlaced Grid to Parallelize the AIM CFIE Solver for Execution on Distributed Parallel Computer Cluster" in IEICE TRANSACTIONS on Electronics,
vol. E87-C, no. 9, pp. 1568-1577, September 2004, doi: .
Abstract: In this paper, we present the interlaced fast Fourier transform (FFT) method to parallelize the adaptive integral method (AIM) algorithm for the radar cross-section (RCS) computation of large scattering objects in free space. It is noted that the function obtained after convolution is smoother as compared to the original functions. Utilizing this concept, it is possible to interlace the grid current and charge sources in AIM and compute the potentials on each set of interlaced grid independently using FFT. Since the potentials on each interlaced grid are smooth functions in space, we can then interpolate the potentials to every other nodes on the original grid. The final solution of the potentials on the original grid is obtained by summing the total contributions of all the computed and interpolated potentials from every individual interlaced grid. Since the potentials of each interlaced grid can be computed independently without much communication overheads between the processes, such an algorithm is suitable for parallelizing the AIM solver to run on distributed parallel computer clusters. It is shown that the overall computation complexity of the newly proposed interlaced FFT scheme is still of O(N log N).
URL: https://global.ieice.org/en_transactions/electronics/10.1587/e87-c_9_1568/_p
Copy
@ARTICLE{e87-c_9_1568,
author={Banleong OOI, Tionghuat NG, Pangshyan KOOI, },
journal={IEICE TRANSACTIONS on Electronics},
title={Use of Interlaced Grid to Parallelize the AIM CFIE Solver for Execution on Distributed Parallel Computer Cluster},
year={2004},
volume={E87-C},
number={9},
pages={1568-1577},
abstract={In this paper, we present the interlaced fast Fourier transform (FFT) method to parallelize the adaptive integral method (AIM) algorithm for the radar cross-section (RCS) computation of large scattering objects in free space. It is noted that the function obtained after convolution is smoother as compared to the original functions. Utilizing this concept, it is possible to interlace the grid current and charge sources in AIM and compute the potentials on each set of interlaced grid independently using FFT. Since the potentials on each interlaced grid are smooth functions in space, we can then interpolate the potentials to every other nodes on the original grid. The final solution of the potentials on the original grid is obtained by summing the total contributions of all the computed and interpolated potentials from every individual interlaced grid. Since the potentials of each interlaced grid can be computed independently without much communication overheads between the processes, such an algorithm is suitable for parallelizing the AIM solver to run on distributed parallel computer clusters. It is shown that the overall computation complexity of the newly proposed interlaced FFT scheme is still of O(N log N).},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Use of Interlaced Grid to Parallelize the AIM CFIE Solver for Execution on Distributed Parallel Computer Cluster
T2 - IEICE TRANSACTIONS on Electronics
SP - 1568
EP - 1577
AU - Banleong OOI
AU - Tionghuat NG
AU - Pangshyan KOOI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Electronics
SN -
VL - E87-C
IS - 9
JA - IEICE TRANSACTIONS on Electronics
Y1 - September 2004
AB - In this paper, we present the interlaced fast Fourier transform (FFT) method to parallelize the adaptive integral method (AIM) algorithm for the radar cross-section (RCS) computation of large scattering objects in free space. It is noted that the function obtained after convolution is smoother as compared to the original functions. Utilizing this concept, it is possible to interlace the grid current and charge sources in AIM and compute the potentials on each set of interlaced grid independently using FFT. Since the potentials on each interlaced grid are smooth functions in space, we can then interpolate the potentials to every other nodes on the original grid. The final solution of the potentials on the original grid is obtained by summing the total contributions of all the computed and interpolated potentials from every individual interlaced grid. Since the potentials of each interlaced grid can be computed independently without much communication overheads between the processes, such an algorithm is suitable for parallelizing the AIM solver to run on distributed parallel computer clusters. It is shown that the overall computation complexity of the newly proposed interlaced FFT scheme is still of O(N log N).
ER -
English
