Mina A. Farhan

Mina A. Farhan

Auto-generated profile, based on publicly available information

Mina A. Farhan

Department of Electronics, Carleton University, Ottawa, ON, Canada

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 May 2012 in IEEE Transactions on Components, Packaging and Manufacturing Technology
Verified
Journal Article
Closed access
MFMina A. Farhan
Mina A. Farhan
NNNatalie M. Nakhla
Natalie M. Nakhla
MNMichel S. Nakhla
Michel S. Nakhla
RARamachandra Achar
Ramachandra Achar
ARAlbert E. Ruehli
Albert E. Ruehli
The large number of interconnects in high-speed circuits is a major bottleneck for fast simulation of such circuits. Recently, waveform relaxation methods based on transverse partitioning (WR-TP) were proposed to address this issue. It was shown that the complexity of WR-TP grows only linearly with the number of lines. However, as the coupling between the lines becomes stronger, the WR-TP algorithm either fails to converge or the number of iterations required for convergence increases. In this paper, an overlapping partitioning method for WR-TP is presented, which overcomes the effect of strong coupling between the lines. Numerical examples are presented which demonstrate the accuracy and efficiency of the proposed method for tightly coupled lines.

18 July 2014 in IEEE Transactions on Components, Packaging and Manufacturing Technology
Verified
Journal Article
Closed access
MFMina A. Farhan
Mina A. Farhan
NNNatalie M. Nakhla
Natalie M. Nakhla
MNMichel S. Nakhla
Michel S. Nakhla
RARamachandra Achar
Ramachandra Achar
The presence of a large number of interconnects in high-speed circuits is a major bottleneck for the fast simulation of such circuits. Iterative approaches, such as waveform relaxation (WR) methods, were proposed to allow fast analysis of highspeed interconnects. In the case of strong coupling between the lines, overlapping partitioning (OP) techniques were proposed to speedup the convergence rate of WR methods, wherein the methods, the Multi Transimission Lines are partitioned such that the strongly coupled lines are in the same subcircuit. However, in the case of increasing the number of overlapping lines, the simulation efficiency can suffer due to the increasing size of each subcircuit. In this paper, an accelerated OP method is proposed. The proposed method uses model-order reduction techniques (MOR) to obtain a reduced model for the partitioned subcircuits allowing for fast simulation in each iteration, thus providing a speedup in the overall simulation time. Also, a new method is presented for efficient updating of relaxation sources while using MOR.

21 November 2012 in IEEE Transactions on Microwave Theory and Techniques
Verified
Journal Article
Closed access
MFMina A. Farhan
Mina A. Farhan
EGEmad Gad
Emad Gad
MNMichel S. Nakhla
Michel S. Nakhla
RARamachandra Achar
Ramachandra Achar
This paper describes a new method for transient simulation, using high-order stable methods, of microwave structures modeled using a large number of lumped components. The target of the proposed technique is circuit-based simulation of the large linear circuits that arise from full-wave modeling of distributed structures, such as transmission lines and microstrip elements, along with the terminating nonlinear devices. In this case, the cost of the solution of the linear system typically dominates the computational effort. The proposed method takes advantage of the special structure of the block matrices in these applications to reduce the computational cost significantly. The core of the proposed algorithm is based on the idea of “node tearing” to separate the large linear sub-circuits from the nonlinear devices. This idea faciliates handling the linear sub-circuits using a better matrix factorization technique, resulting in faster simulations compared to classical techniques.

12 November 2014 in IEEE Transactions on Microwave Theory and Techniques
Verified
Journal Article
Closed access
PDF file
MFMina A. Farhan
Mina A. Farhan
EGEmad Gad
Emad Gad
MNMichel S. Nakhla
Michel S. Nakhla
RARamachandra Achar
Ramachandra Achar
A new enveloped following (EF) method based on high-order Obreshkov integration formula is presented. The new method is suitable for transient analysis of highly oscillatory circuits with widely separated time-scales. In addition, the proposed algorithm is capable of producing high-order numerically stable approximation of the transient response. The use of high-order formulas leads to a significant reduction in the computational time compared to low-order EF methods because it allows taking large steps in time while keeping the same accuracy.

27 May 2016 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
MFMina A. Farhan
Mina A. Farhan
MNMichel S. Nakhla
Michel S. Nakhla
EGEmad Gad
Emad Gad
RARamachandra Achar
Ramachandra Achar
In this paper, a parallel high-order envelope-following (EF) method is presented. The proposed method exploits the high-order and A-stable Obreshkov formula (ObF) to provide superior accuracy and speedup for the EF technique. Utilizing ObF provides accurate and faster analysis while keeping the same accuracy as the conventional low-order integration methods. In addition, a parallel method that is based on multiple-shooting (MS) techniques is used. Using MS allows partitioning and solving the sensitivity equations in parallel. It is also shown that with proper partitioning scheme, high CPU scalability can be achieved.

3 July 2018 in IEEE Transactions on Components, Packaging and Manufacturing Technology
Verified
Journal Article
Closed access
MFMina A. Farhan
Mina A. Farhan
MNMichel S. Nakhla
Michel S. Nakhla
A parameterized model-order reduction algorithm for nonuniform high-speed interconnect with varying design parameters is presented. The constructed reduced-order model (ROM) has a direct time-domain representation, and thus, discretization techniques are not required. The key idea of the new algorithm is to find a common-projection matrix using the integrated-congruence transform (ICT) method that can be used to construct an ROM for any value of the varying parameters. However, the calculated projection matrices using the ICT method are functions of the position along the lines, and thus, finding a common-projection matrix using regular singular-value decomposition (SVD) is not applicable. To address this issue, a Hilbert-space-based SVD is proposed to extract the common-projection matrix.