Introduction to statistical signal processing with applications
Introduction to statistical signal processing with applications
ITC '02 Proceedings of the 2002 IEEE International Test Conference
A New Method for Jitter Decomposition Through Its Distribution Tail Fitting
ITC '99 Proceedings of the 1999 IEEE International Test Conference
Random Jitter Extraction Technique in a Multi-Gigahertz Signal
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Jitter Decomposition by Time Lag Correlation
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
Jitter Decomposition in High-Speed Communication Systems
ETS '08 Proceedings of the 2008 13th European Test Symposium
A kurtosis-based dynamic approach to Gaussian mixture modeling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Jitter is roughly defined as the timing shaking of the square waveforms output from phase locked loops. It consists of two parts: deterministic jitter and random jitter. Separating and identifying each jitter component are important in understanding the root cause of jitter and further in improving on phase locked loop design. A popular method for jitter separation is so-called Tail-fitting Algorithm. A better method than Tail-fitting Algorithm for separating deterministic jitter (DJ) and random jitter (RJ) from total jitter (TJ) is presented in this Letter. The new method targets directly on the original total jitter series, instead of the histogram. Histogram is dependent on bin number and is uncertain, but is inappropriately selected as the starting point of Tail-Fitting algorithm. Our method is based on Gaussian mixture model (GMM). The mathematical relationship between this model and the quantities of DJ and RJ is established. The concept of kurtosis is used to determine the order of GMM, thereby rendering our method fully automatic, highly efficient. Our method circumvents the most cumbersome difficulty in tail identification of Tail-Fitting Algorithm, because tails and peaks of the histogram, even after being filtered, are fundamentally ambiguously defined, both theoretically and practically. Our method also bypasses the problem of initial value selection.