Proceedings of the Conference on Design, Automation and Test in Europe 2000
DOI: 10.1145/343647.343793
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic modeling and performance evaluation for digital clock and data recovery circuits

Abstract: Clock and data recovery circuits are essential components in communication systems. They directly influence the bit-error-rate performance of communication links. It is desirable to predict the rate of occasional detection errors and the loss of synchronization due to the non-ideal operation of such circuits. In high-speed data networks, the bit-error-rate specification on the system can be very stringent, i.e., 10¢ 14 . It is not feasible to predict such error rates with straightforward, simulation based, app… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Nevertheless, the coarse problems retain enough characteristics of the fine problem so as to help accelerate the convergence. We implemented such a multi-level algorithm in [6], where the lumping and expanding steps are interleaved with simple Gauss-Jacobi iterations and the coarsest problem is solved exactly with a direct method. In this implementation [6], we use flat sparse storage for both the fine and the coarse problems and this severely limits the size of the problem that can be handled.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Nevertheless, the coarse problems retain enough characteristics of the fine problem so as to help accelerate the convergence. We implemented such a multi-level algorithm in [6], where the lumping and expanding steps are interleaved with simple Gauss-Jacobi iterations and the coarsest problem is solved exactly with a direct method. In this implementation [6], we use flat sparse storage for both the fine and the coarse problems and this severely limits the size of the problem that can be handled.…”
Section: Methodsmentioning
confidence: 99%
“…We implemented such a multi-level algorithm in [6], where the lumping and expanding steps are interleaved with simple Gauss-Jacobi iterations and the coarsest problem is solved exactly with a direct method. In this implementation [6], we use flat sparse storage for both the fine and the coarse problems and this severely limits the size of the problem that can be handled. In order to overcome this limitation, we introduce a novel, graph based, data structure capable of modeling systems with state spaces larger by about two orders of magnitude.…”
Section: Methodsmentioning
confidence: 99%