research-article

An adaptive parallel flow for power distribution network simulation using discrete Fourier transform

Authors:

Xiang Hu,

Wenbo Zhao,

Peng Du,

Amirali Shayan,

Chung-Kuan ChengAuthors Info & Claims

ASPDAC '10: Proceedings of the 2010 Asia and South Pacific Design Automation Conference

Pages 125 - 130

Published: 18 January 2010 Publication History

Get Access

Abstract

A frequency-time-domain co-simulation flow using discrete Fourier transform (DFT) is introduced in this paper to analyze large power distribution networks (PDN's). The flow not only allows designers to gain an insight to the frequency-domain characteristics of the PDN but also to obtain accurate time-domain voltage responses according to different load current profiles. An adaptive method achieves accurate results within even shorter time compared to the basic DFT flow. In addition, parallel processing is incorporated which leads to a significant reduction in simulation time. Error bounds of the DFT flow are derived to assure the accuracy of simulation results. Experimental results show that the proposed flow has a relative error of 0.093% and a speedup of 10x compared to SPICE transient simulation with a single processor.

References

[1]

FWGrid project. In http://fwgrid.ucsd.edu/.

Google Scholar

[2]

W. L. Briggs and V. E. Henson. The DFT: An Owner's Manual for the Discrete Fourier Transform. Society for Industrial and Applied Mathematics, Philadelphia, 1995.

Crossref

Google Scholar

[3]

D. Deshrijver and T. Dhaene. Broadband macromodelling of passive components using orthonormal vector fitting. Electronic Letters, 41:1160--1161, Oct. 2005.

Crossref

Google Scholar

[4]

W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, New York, 1988.

Digital Library

Google Scholar

[5]

A. Shayan, X. Hu, H. Peng, W. Zhang, C. K. Cheng, M. Popovich, and X. Chen. 3D Power Distribution Network Co-design for Nanoscale Stacked Silicon IC. In IEEE Electrical Performance of Electronic Packaging, Oct. 2008.

Crossref

Google Scholar

[6]

W. Zhang, L. Zhang, R. Shi, H. Peng, Z. Zhu, L. Chua-Eoan, R. Murgai, T. Shibuya, N. Ito, and C. K. Cheng. Fast Power Network Analysis with Multiple Clock Domains. In IEEE International Conference on Computer Design, pages 456--463, Oct. 2007.

Google Scholar

Cited By

View all

Wang JXiong XHenkel J(2013)Scalable power grid transient analysis via MOR-assisted time-domain simulationsProceedings of the International Conference on Computer-Aided Design10.5555/2561828.2561934(548-552)Online publication date: 18-Nov-2013
https://dl.acm.org/doi/10.5555/2561828.2561934
Hu XDu PBuckwalter JCheng C(2013)Modeling and analysis of power distribution networks in 3-D ICsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2012.218390421:2(354-366)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1109/TVLSI.2012.2183904
Wang JHu A(2012)Deterministic random walk preconditioning for power grid analysisProceedings of the International Conference on Computer-Aided Design10.1145/2429384.2429467(392-398)Online publication date: 5-Nov-2012
https://dl.acm.org/doi/10.1145/2429384.2429467
Show More Cited By

Recommendations

Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

Fast Fourier transform (FFT)-based computations can be far more accurate than the slow transforms suggest. Discrete Fourier transforms computed through the FFT are far more accurate than slow transforms, and convolutions computed via FFT are far more ...
Parallel computation of multidimensional discrete orthogonal transforms reducible to a discrete Fourier transform

Algorithms of parallel computation of multidimensional discrete orthogonal transforms that rely on a previously developed approach to paralleling discrete Fourier transforms and methods of reducing different discrete orthogonal transforms (discrete ...
A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform

In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplisbed by performing the cyclic convolution, required by Winograd's method, with the ...

Comments

Information & Contributors

Information

Published In

ASPDAC '10: Proceedings of the 2010 Asia and South Pacific Design Automation Conference

January 2010

920 pages

ISBN:9781605588377

General Chair:
Youn-Long Lin
National Tsing Hua University

Publisher

IEEE Press

Publication History

Published: 18 January 2010

Check for updates

Qualifiers

Research-article

Conference

ASPDAC '10

Sponsor:

TICD
SIGDA

ASPDAC '10: Asia and South Pacific Design Automation Conference

January 18 - 21, 2010

Taipei, Taiwan

Acceptance Rates

Overall Acceptance Rate 466 of 1,454 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
57
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang JXiong XHenkel J(2013)Scalable power grid transient analysis via MOR-assisted time-domain simulationsProceedings of the International Conference on Computer-Aided Design10.5555/2561828.2561934(548-552)Online publication date: 18-Nov-2013
https://dl.acm.org/doi/10.5555/2561828.2561934
Hu XDu PBuckwalter JCheng C(2013)Modeling and analysis of power distribution networks in 3-D ICsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2012.218390421:2(354-366)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1109/TVLSI.2012.2183904
Wang JHu A(2012)Deterministic random walk preconditioning for power grid analysisProceedings of the International Conference on Computer-Aided Design10.1145/2429384.2429467(392-398)Online publication date: 5-Nov-2012
https://dl.acm.org/doi/10.1145/2429384.2429467
Xiong XWang JPhillips JHu AGraeb H(2011)Vectorless verification of RLC power grids with transient current constraintsProceedings of the International Conference on Computer-Aided Design10.5555/2132325.2132452(548-554)Online publication date: 7-Nov-2011
https://dl.acm.org/doi/10.5555/2132325.2132452

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

Parallel computation of multidimensional discrete orthogonal transforms reducible to a discrete Fourier transform

A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations