The Chebyshev expansion based passive model for distributed interconnect networks

A new Chebyshev expansion based model for distributed interconnect networks is presented in this paper. Unlike the moment methods, this new model is optimal and it does not require the knowledge of expansion points. An automatic order selection scheme is also included in the new model. By using the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:1999 IEEE/ACM International Conference on Computer-Aided Design : digest of technical papers : November 7-11, 1999, San Jose, California S. 370 - 375
Hauptverfasser: Wang, Janet M., Kuh, Ernest S., Yu, Qingjian
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Piscataway, NJ, USA IEEE Press 07.11.1999
Schriftenreihe:ACM Conferences
Schlagworte:
Applied computing > Physical sciences and engineering > Engineering
Computer systems organization > Architectures > Parallel architectures > Interconnection architectures
Computer systems organization > Dependable and fault-tolerant systems and networks
General and reference > Cross-computing tools and techniques > Performance
Hardware > Integrated circuits > Interconnect
Hardware > Robustness
Mathematics of computing > Mathematical analysis > Nonlinear equations
Mathematics of computing > Mathematical analysis > Numerical analysis > Computations on polynomials
Networks > Network performance evaluation
ISBN:9780780358324, 0780358325
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A new Chebyshev expansion based model for distributed interconnect networks is presented in this paper. Unlike the moment methods, this new model is optimal and it does not require the knowledge of expansion points. An automatic order selection scheme is also included in the new model. By using the integrated congruence transform, we guarantee the passivity of the new model for distributed interconnect networks. Because of the orthogonality of Chebyshev polynomials, the Modified Gram-Schmidt algorithm can be simplified. In the experimental examples, the new model is found to be accurate and efficient.
Bibliographie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780780358324
0780358325
DOI:10.5555/339492.340042