Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media

Brian J. Rautio, Vladimir I. Okhmatovski, Jay Kyoon Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Unified-FFT (UFFT) is a novel 3D-Planar Method of Moments (MoM) solver of the Electric Field Integral Equation (EFIE). UFFT is the resultant algorithm of combining the FFT-enhanced Matrix Solve Operations (MSO) currently utilized in Sonnet Suites with FFT-enhanced Matrix Fill Operations (MFO). It has been shown, in conjunction with iterative MSO based on GMRES, to solve matrix vector products scaling with O(NlogN) operations and O(N) memory for planar, single-plane geometries (B. J. Rautio, V. I. Okhmatovski, J.K. Lee, IMS 2013). Previous UFFT implementations have achieved O(NlogN) scaling through acceleration of iterative matrix-vector products within GMRES by separating near and far interactions and calculating far interactions implicitly as in PFFT. In this work, the same uniform grid used with MFO is extended for use with MSO, negating the need to treat near and far interactions independently and allowing the entire matrix to be stored implicitly with no significant loss of precision. The resulting algorithm, UFFT-Grid Totalizing (UFFT-GT), achieves O(NlogN) operations and O(N) memory scaling with minimal loss in precision vs. full matrix inverse beyond numerical noise.

Original languageEnglish (US)
Title of host publication2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages72
Number of pages1
ISBN (Print)9781479937462
DOIs
StatePublished - Nov 12 2014
Event2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Memphis, United States
Duration: Jul 6 2014Jul 11 2014

Other

Other2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014
CountryUnited States
CityMemphis
Period7/6/147/11/14

Fingerprint

Fast Fourier transforms
Networks (circuits)
Data storage equipment
Method of moments
Integral equations
Electric fields
Geometry

ASJC Scopus subject areas

  • Artificial Intelligence
  • Human-Computer Interaction
  • Electrical and Electronic Engineering

Cite this

Rautio, B. J., Okhmatovski, V. I., & Lee, J. K. (2014). Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media. In 2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings (pp. 72). [6955454] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/USNC-URSI.2014.6955454

Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media. / Rautio, Brian J.; Okhmatovski, Vladimir I.; Lee, Jay Kyoon.

2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. p. 72 6955454.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rautio, BJ, Okhmatovski, VI & Lee, JK 2014, Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media. in 2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings., 6955454, Institute of Electrical and Electronics Engineers Inc., pp. 72, 2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014, Memphis, United States, 7/6/14. https://doi.org/10.1109/USNC-URSI.2014.6955454
Rautio BJ, Okhmatovski VI, Lee JK. Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media. In 2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2014. p. 72. 6955454 https://doi.org/10.1109/USNC-URSI.2014.6955454
Rautio, Brian J. ; Okhmatovski, Vladimir I. ; Lee, Jay Kyoon. / Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media. 2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 72
@inproceedings{3c35716a5ce546c9bb2bac96d8718d41,
title = "Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media",
abstract = "Unified-FFT (UFFT) is a novel 3D-Planar Method of Moments (MoM) solver of the Electric Field Integral Equation (EFIE). UFFT is the resultant algorithm of combining the FFT-enhanced Matrix Solve Operations (MSO) currently utilized in Sonnet Suites with FFT-enhanced Matrix Fill Operations (MFO). It has been shown, in conjunction with iterative MSO based on GMRES, to solve matrix vector products scaling with O(NlogN) operations and O(N) memory for planar, single-plane geometries (B. J. Rautio, V. I. Okhmatovski, J.K. Lee, IMS 2013). Previous UFFT implementations have achieved O(NlogN) scaling through acceleration of iterative matrix-vector products within GMRES by separating near and far interactions and calculating far interactions implicitly as in PFFT. In this work, the same uniform grid used with MFO is extended for use with MSO, negating the need to treat near and far interactions independently and allowing the entire matrix to be stored implicitly with no significant loss of precision. The resulting algorithm, UFFT-Grid Totalizing (UFFT-GT), achieves O(NlogN) operations and O(N) memory scaling with minimal loss in precision vs. full matrix inverse beyond numerical noise.",
author = "Rautio, {Brian J.} and Okhmatovski, {Vladimir I.} and Lee, {Jay Kyoon}",
year = "2014",
month = "11",
day = "12",
doi = "10.1109/USNC-URSI.2014.6955454",
language = "English (US)",
isbn = "9781479937462",
pages = "72",
booktitle = "2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Novel high precision UFFT methodology for fast analysis of 3D Planar circuits embedded in shielded layered media

AU - Rautio, Brian J.

AU - Okhmatovski, Vladimir I.

AU - Lee, Jay Kyoon

PY - 2014/11/12

Y1 - 2014/11/12

N2 - Unified-FFT (UFFT) is a novel 3D-Planar Method of Moments (MoM) solver of the Electric Field Integral Equation (EFIE). UFFT is the resultant algorithm of combining the FFT-enhanced Matrix Solve Operations (MSO) currently utilized in Sonnet Suites with FFT-enhanced Matrix Fill Operations (MFO). It has been shown, in conjunction with iterative MSO based on GMRES, to solve matrix vector products scaling with O(NlogN) operations and O(N) memory for planar, single-plane geometries (B. J. Rautio, V. I. Okhmatovski, J.K. Lee, IMS 2013). Previous UFFT implementations have achieved O(NlogN) scaling through acceleration of iterative matrix-vector products within GMRES by separating near and far interactions and calculating far interactions implicitly as in PFFT. In this work, the same uniform grid used with MFO is extended for use with MSO, negating the need to treat near and far interactions independently and allowing the entire matrix to be stored implicitly with no significant loss of precision. The resulting algorithm, UFFT-Grid Totalizing (UFFT-GT), achieves O(NlogN) operations and O(N) memory scaling with minimal loss in precision vs. full matrix inverse beyond numerical noise.

AB - Unified-FFT (UFFT) is a novel 3D-Planar Method of Moments (MoM) solver of the Electric Field Integral Equation (EFIE). UFFT is the resultant algorithm of combining the FFT-enhanced Matrix Solve Operations (MSO) currently utilized in Sonnet Suites with FFT-enhanced Matrix Fill Operations (MFO). It has been shown, in conjunction with iterative MSO based on GMRES, to solve matrix vector products scaling with O(NlogN) operations and O(N) memory for planar, single-plane geometries (B. J. Rautio, V. I. Okhmatovski, J.K. Lee, IMS 2013). Previous UFFT implementations have achieved O(NlogN) scaling through acceleration of iterative matrix-vector products within GMRES by separating near and far interactions and calculating far interactions implicitly as in PFFT. In this work, the same uniform grid used with MFO is extended for use with MSO, negating the need to treat near and far interactions independently and allowing the entire matrix to be stored implicitly with no significant loss of precision. The resulting algorithm, UFFT-Grid Totalizing (UFFT-GT), achieves O(NlogN) operations and O(N) memory scaling with minimal loss in precision vs. full matrix inverse beyond numerical noise.

UR - http://www.scopus.com/inward/record.url?scp=84916205227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84916205227&partnerID=8YFLogxK

U2 - 10.1109/USNC-URSI.2014.6955454

DO - 10.1109/USNC-URSI.2014.6955454

M3 - Conference contribution

SN - 9781479937462

SP - 72

BT - 2014 USNC-URSI Radio Science Meeting (Joint with AP-S Symposium), USNC-URSI 2014 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -