1995
DOI: 10.1109/26.380232
|View full text |Cite
|
Sign up to set email alerts
|

Synchronous techniques for timing recovery in BISDN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2000
2000
2013
2013

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(20 citation statements)
references
References 8 publications
0
20
0
Order By: Relevance
“…This is commonly done using a phase-locked loop (PLL) that slaves the receiver clock to a transmitter clock (Figure 1). The PLL is able to process transmitted clock samples encoded within the data stream [5,6], or process data arrival patterns [7][8][9][10] to generate timing signal for the receiver. The purpose of the PLL is to estimate and compensate for the frequency drift occurring between the oscillators of the transmitter clock and the receiver clock.…”
Section: Clock Recovery Based On Packet Inter-arrival Time Averagingmentioning
confidence: 99%
“…This is commonly done using a phase-locked loop (PLL) that slaves the receiver clock to a transmitter clock (Figure 1). The PLL is able to process transmitted clock samples encoded within the data stream [5,6], or process data arrival patterns [7][8][9][10] to generate timing signal for the receiver. The purpose of the PLL is to estimate and compensate for the frequency drift occurring between the oscillators of the transmitter clock and the receiver clock.…”
Section: Clock Recovery Based On Packet Inter-arrival Time Averagingmentioning
confidence: 99%
“…An example of such an approach is used in the transfer of timing information for CBR transmission over asynchronous transfer mode (ATM) Adaptation Layer 1 (AAL1) by the synchronous residual time stamp (SRTS) method [1]. It has been shown that such timing-transfer techniques are similar to rate adaptation by bit stuffing [2] and pointer adjustment [3], and the jitter generated is similar to waiting-time jitter [1], [3], [4]. Waiting-time jitter is deterministic jitter, and can accumulate significantly from repeater to repeater [5], whereas jitter accumulation in synchronous networks is prevented by limiting the number of allowed pointer adjustments [3].…”
Section: Introductionmentioning
confidence: 99%
“…As the exact number of reference clock cycles in is usually not an integer, the result is a quantized representation of the service clock with interpulse intervals , where takes on one of two possible values: or , such that the long-term average period is [6]. The resulting jitter on the quantized clock, , is also the jitter present on the recovered timing signal at the destination, and is given by (1) The spectrum of this jitter can be expressed as (2) Paper approved by C. In previous analyses, it has been assumed that the clocks are ideal, whereas in real systems, the assumption of ideal clocks does not hold. In [2] and [7], consideration was given to the effect of jitter on the service clock.…”
Section: Introductionmentioning
confidence: 99%
“…Equation (3) has been studied in the context of communication systems [17] and the solution is given by:…”
Section: Coherent Clocksmentioning
confidence: 99%