2013
DOI: 10.1109/jssc.2013.2279023
|View full text |Cite
|
Sign up to set email alerts
|

A Blind Baud-Rate ADC-Based CDR

Abstract: ADC-based receivers process the received data in the digital domain, eliminating the need for much of the analog front end. In addition, a feed-forward blind architecture [1,2] eliminates the feedback loop between digital and analog domains so that the ADC and digital CDR can be designed and simulated independently. Previous works [1,2] sampled the incoming data at 2 samples per UI and at 1.45 samples per UI to achieve 5Gb/s and 6.875Gb/s, respectively. To further increase the data rate to 10Gb/s, we sample at… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…The first term in (8) is the expression of the standard normal distribution, so (9) According to the Taylor expansion formula, we can know that exp(-y 2 /2)≈1-y 2 /2, so the second term in (8) can be obtained as: (10) Substituting ( 9) and ( 10) into (8), we can get (11) Similarly, we can have (12) Substituting ( 11) and ( 12) into (6), we can get In the simulation, we use pseudo random bit sequence (PRBS) code to simulate the real data streams, and the transformation probability of the data is equal. In other words, the transition density KTD of MMPD is 0.5, which is the same as BBPD.…”
Section: Linearization Of Mmpdmentioning
confidence: 99%
“…The first term in (8) is the expression of the standard normal distribution, so (9) According to the Taylor expansion formula, we can know that exp(-y 2 /2)≈1-y 2 /2, so the second term in (8) can be obtained as: (10) Substituting ( 9) and ( 10) into (8), we can get (11) Similarly, we can have (12) Substituting ( 11) and ( 12) into (6), we can get In the simulation, we use pseudo random bit sequence (PRBS) code to simulate the real data streams, and the transformation probability of the data is equal. In other words, the transition density KTD of MMPD is 0.5, which is the same as BBPD.…”
Section: Linearization Of Mmpdmentioning
confidence: 99%
“…priate, or the signal quality is good as a square wave [9,10]. Liu et al [11] pro model for a Mueller-Muller CDR circuit and used a drift bit width to ch influence of the reference Vref level, which showed the phase drift that occu Vref was not set properly through simulations.…”
Section: The Working Principles Of the Mmpdmentioning
confidence: 99%
“…The convergence goal of traditional Mueller-Muller clock and data recovery (MM-CDR) circuits is to make the size of the pre-cursor equal to the size of the post-cursor, which requires a reference Vref level to generate the up/down signal. However, MM-CDR circuits face the problem of unstable convergence when the Vref matching is not appropriate, or the signal quality is good as a square wave [9,10]. Liu et al [11] proposed a linear model for a Mueller-Muller CDR circuit and used a drift bit width to characterize the influence of the reference Vref level, which showed the phase drift that occurred when the Vref was not set properly through simulations.…”
Section: Introductionmentioning
confidence: 99%
“…The rapid growth of data rate makes the classical Bang-Bang phase detector (BBPD) no longer suitable for high-speed clock and data recovery (CDR). However, the advantage of the Mueller-Muller phase detector (MMPD) that requires only one sample per symbol alleviates the problem of BBPD timing tension and exponential growth of power consumption in high-speed situations, making Mueller-Muller baud-rate sampling widely used in the serial IO design [2][3][4][5][6].…”
Section: Introductionmentioning
confidence: 99%