Abstract

In this article, a discontinuous Galerkin time-domain (DGTD) method hybridized with Robin transmission condition (RTC-DGTD) is proposed for the transient thermal analysis of 3-D integrated circuits (ICs). As a kind of domain decomposition method (DDM), the DGTD method employs a term named numerical flux for the information exchange of solutions between neighboring subdomains. The numerical flux is a function of both temperature <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$T$ </tex-math></inline-formula> and heat flux q, and thus for the heat equation, apart from <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$T$ </tex-math></inline-formula> , the variable q has to be solved as well. To reach this, the traditional DGTD method decomposes the second-order partial-differential thermal equation into two first-order ones, which results that both <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$T$ </tex-math></inline-formula> and q need to be solved in the whole computational domain, thereby the computational cost is extremely expensive. In this work, to get this trouble-treated, the proposed DGTD method is directly applied to discretize the second-order heat equation. An RTC is established at the interfaces of subdomains, which serves as the second governing equation and meanwhile bridges another connection of solutions in adjacent subdomains. In this way, the new variable q is now only present at the interfaces of subdomains. Consequently, the total number of unknowns is significantly reduced compared with that in the traditional DGTD method. To further speed up the time-marching scheme, an adaptive time-stepping method in terms of the proportional–integral–derivative (PID) control algorithm is employed. Besides, by introducing a restriction operator, the globally coupled matrix equation is torn into a number of small matrix equations pertinent to each subdomain, which is later solved via a finite-element tearing and interconnecting (FETI)-like method. To validate and verify the accuracy and efficiency of the proposed algorithm, several representative examples are studied and compared with COMSOL simulations.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.