# US 2016/0241383 A1 · At-rate serdes clock data recovery with controllable offset

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0241383 A1
- Document ID: US20160241383A1
- Status: Published application
- Kind: A1
- Application number: 15/000,028
- Filed: 2016-01-18
- Published: 2016-08-18
- Earliest claimed: 2014-01-02
- Assignees: Oracle International Corporation
- Applicants: Oracle International Corporation
- Inventors: JIANGHUI SU
- Web page: https://patentgrep.com/patent/US20160241383A1

## CPC

- H04L 7/0087: {Preprocessing of received signal for synchronisation, e.g. by code conversion, pulse generation or edge detection}
- H04L 7/0033: {Correction by delay}
- H04L 7/02: Speed or phase control by the received code signals, the signals containing no special synchronisation information {(H04L7/0075 takes precedence)}
- H04L 7/0334: {Processing of samples having at least three levels, e.g. soft decisions}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Embodiments include systems and methods for applying a controllable early/late offset to an at-rate clock data recovery (CDR) system. Some embodiments operate in context of a CDR circuit of a serializer/deserializer (SERDES). For example, slope asymmetry around the first precursor of the channel pulse response for the SERDES can tend to skew at-rate CDR determinations of whether to advance or retard clocking. Accordingly, embodiments use asymmetric voting thresholds for generating each of the advance and retard signals in an attempt to de-skew the voting results and effectively tune the CDR to a position either earlier or later than the first precursor zero crossing (i.e., h(−1)=0) position. This can improve link margin and data recovery, particularly for long data channels and/or at higher data rates.

## Claims

### Claim 1

A system for at-rate clock data recovery comprising:
an offset circuit that operates to store an advance threshold and a retard threshold, wherein one of the advance threshold or the retard threshold is negative; and
a voting circuit in communication with the offset circuit that operates to:
generate a plurality of votes each by measuring a pulse signal at a predetermined sample location and comparing the measurement to a reference level to generate an early vote when the measured pulse signal at the predetermined sample location compared to the reference level indicates that the sample location precedes a reference-level crossing associated with the predetermined sample location, and to generate a late vote when the measured pulse signal at the predetermined sample location compared to the reference level indicates that the reference-level crossing associated with the predetermined sample location precedes the sample location;
generate an advance signal when the generated late votes exceeds the generated early votes by at least the advance threshold; and
generate a retard signal when the generated early votes exceeds the generated late votes by at least the retard threshold.

### Claim 2 (depends on 1)

The system of claim 1, wherein one of the advance threshold or the retard threshold is negative N, and the other of the advance threshold or the retard threshold is at least positive (N−1).

### Claim 3 (depends on 1)

The system of claim 1, wherein:
the voting circuit operates to generate the advance signal only when the generated late votes exceeds the generated early votes by at least the advance threshold, while the generated early votes does not exceed the generated late votes by at least the retard threshold;
the voting circuit operates to generate the retard signal only when the generated early votes exceeds the generated late votes by at least the retard threshold, while the generated late votes does not exceed the generated early votes by at least the advance threshold; and
the voting circuit further operates to generate no signal when the generated late votes exceeds the generated early votes by at least the advance threshold, while the generated early votes also exceeds the generated late votes by at least the retard threshold.

### Claim 4 (depends on 1)

The system of claim 1, wherein the voting circuit further operates to:
receive the pulse signal corresponding to a channel pulse response of a clock data recovery circuit of a serializer/deserializer (SERDES).

### Claim 5 (depends on 4)

The system of claim 4, wherein:
the voting circuit further operates to receive a clocking signal corresponding to SERDES clocking information recovered by the clock data recovery circuit; and
the predetermined sample location corresponds to the clocking signal.

### Claim 6 (depends on 1)

The system of claim 1, wherein the reference level is zero.

### Claim 7 (depends on 1)

The system of claim 1, wherein the plurality of votes is a number of votes defined by a voting window.

### Claim 8 (depends on 1)

The system of claim 1, wherein the offset circuit is programmable to permit programming of the advance threshold and the retard threshold.

### Claim 9 (depends on 1)

The system of claim 1, further comprising:
an integrated circuit having at least the offset circuit and the voting circuit integrated thereon.

### Claim 10

A method for at-rate clock data recovery, the method comprising:
generating a plurality of votes each by measuring a pulse signal at a predetermined sample location and comparing the measurement to a reference level,
wherein each vote generated as an early vote when the measured pulse signal at the predetermined sample location compared to the reference level indicates that the sample location precedes a reference-level crossing associated with the predetermined sample location, and
wherein each vote generated as a late vote when the measured pulse signal at the predetermined sample location compared to the reference level indicates that the reference-level crossing associated with the predetermined sample location precedes the sample location;
generating an advance signal when the generated late votes exceeds the generated early votes by at least a predetermined advance threshold; and
generating a retard signal when the generated early votes exceeds the generated late votes by at least a predetermined retard threshold,
wherein at least one of the advance threshold or the retard threshold is negative.

### Claim 11 (depends on 10)

The method of claim 10, wherein one of the advance threshold or the retard threshold is negative N, and the other of the advance threshold or the retard threshold is at least positive (N−1).

### Claim 12 (depends on 10)

The method of claim 10, further comprising:
generating no signal when the generated late votes exceeds the generated early votes by at least the advance threshold while the generated early votes also exceeds the generated late votes by at least the retard threshold,
wherein generating the advance signal is performed only when the generated late votes exceeds the generated early votes by at least the advance threshold while the generated early votes does not exceed the generated late votes by at least the retard threshold, and
wherein generating the retard signal is performed only when the generated early votes exceeds the generated late votes by at least the retard threshold while the generated late votes does not exceed the generated early votes by at least the advance threshold.

### Claim 13 (depends on 10)

The method of claim 10, further comprising:
receiving the pulse signal corresponding to a channel pulse response of a clock data recovery circuit of a serializer/deserializer (SERDES).

### Claim 14 (depends on 13)

The method of claim 13, further comprising:
receiving a clocking signal corresponding to SERDES clocking information recovered by the clock data recovery circuit,
wherein the predetermined sample location is determined according to the clocking signal.

### Claim 15 (depends on 10)

The method of claim 10, wherein the reference level is zero.

### Claim 16 (depends on 10)

The method of claim 10, wherein generating the plurality of votes comprises accumulating a number of votes according to a predetermined voting window.
