# US 2024/0256749 A1 · Retiming sequential elements having initital states

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

- Number: US 2024/0256749 A1
- Document ID: US20240256749A1
- Status: Published application
- Kind: A1
- Application number: 18/102,490
- Filed: 2023-01-27
- Published: 2024-08-01
- Earliest claimed: 2023-01-27
- Assignees: Xilinx, Inc.
- Applicants: Xilinx, Inc.
- Inventors: Chaithanya Dudha; Ruibing Lu; Shangzhi Sun; Nithin Kumar Guggilla
- Web page: https://patentgrep.com/patent/US20240256749A1

## CPC

- G06F 30/3312: Timing analysis
- G06F 30/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 30/34: for reconfigurable circuits, e.g. field programmable gate arrays [FPGA] or programmable logic devices [PLD]
- G06F 30/392: Floor-planning or layout, e.g. partitioning or placement
- G06F 30/394: Routing (G06F30/396 takes precedence)
- G06F 2119/12: Timing analysis or timing optimisation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Retiming a circuit design can include determining whether or not an initial value specified for a candidate register can be removed based on an input logic cone to the candidate register and an output logic cone from the candidate register. The candidate register is a register in a critical path in the circuit design. The candidate register can be retimed into a retimed register in response to determining that the initial value specified for the candidate register can be removed. A new initial value for the retimed register can be derived based on initial values of registers in a logic cone of the retimed register, and the new initial value can be assigned to the retimed register.

## Claims

### Claim 1

A method comprising:
determining by a design tool whether or not an initial value specified for a candidate register can be removed based on an input logic cone to the candidate register and an output logic cone from the candidate register, wherein the candidate register is a register in a critical path in a circuit design;
retiming the candidate register into a retimed register by the design tool in response to determining that the initial value specified for the candidate register can be removed;
deriving a new initial value for the retimed register by the design tool based on initial values of registers in a logic cone of the retimed register; and
assigning the new initial value to the retimed register by the design tool.

### Claim 2 (depends on 1)

The method of claim 1, wherein the retiming includes backward retiming the candidate register.

### Claim 3 (depends on 2)

The method of claim 2, wherein the deriving the new initial value includes deriving the new initial value based on initial values of starting points of the input logic cone.

### Claim 4 (depends on 1)

The method of claim 1, wherein the retiming includes forward retiming the candidate register.

### Claim 5 (depends on 4)

The method of claim 4, wherein the deriving the new initial value includes deriving the new initial value based on initial values of reachable endpoints of the output logic cone.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
setting each starting point that is a register to an initial value of the register in response to the register having a clock enable pin coupled to a signal that is known to be in an enabled state at initialization; and
setting each starting point that is a register to an unknown value in response to the register having a clock enable pin coupled to a signal having an unknown state at initialization.

### Claim 7 (depends on 1)

The method of claim 1, wherein the deriving the new initial value includes:
determining whether or not a known logic value is output from combinational logic connected to an output of the candidate register, independent of an initial value of the retimed register; and
indicating that the new initial value can be either logic 0 or logic 1 in response to determining that the known logic value is output.

### Claim 8 (depends on 1)

The method of claim 1, wherein the determining whether or not the initial value specified for the candidate register can be removed includes:
performing a first simulation with the candidate register having an initial value logic 0;
performing a second simulation with the candidate register having an initial value logic 1; and
indicating that the initial value specified for the candidate register can be removed in response to values of reachable endpoints of the output logic cone at completion of the first simulation being equal to values of the reachable endpoints at completion of the second simulation.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
evaluating the circuit design to determine whether or not a timing constraint is satisfied after retiming the candidate register; and
restoring the candidate register to and deleting the retimed register from the circuit design in response to determining that the timing constraint is not satisfied.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
placing and routing the circuit design; and
generating configuration data after the placing and routing for implementing an integrated circuit.

### Claim 11

A system comprising:
one or more computer processors configured to execute program code; and
a memory arrangement coupled to the one or more computer processors, wherein the memory arrangement is configured with instructions of a design tool that when executed by the one or more computer processors cause the one or more computer processors to perform operations including:
determining whether or not an initial value specified for a candidate register can be removed based on an input logic cone to the candidate register and an output logic cone from the candidate register, wherein the candidate register is a register in a critical path in a circuit design;
retiming the candidate register into a retimed register in response to determining that the initial value specified for the candidate register can be removed;
deriving a new initial value for the retimed register based on initial values of registers in a logic cone of the retimed register; and
assigning the new initial value to the retimed register.

### Claim 12 (depends on 11)

The system of claim 11, wherein the instructions for retiming include instructions for backward retiming the candidate register.

### Claim 13 (depends on 12)

The system of claim 12, wherein the instructions for deriving the new initial value include instructions for deriving the new initial value based on initial values of starting points of the input logic cone.

### Claim 14 (depends on 11)

The system of claim 11, wherein the instructions for retiming include instructions for forward retiming the candidate register.

### Claim 15 (depends on 14)

The system of claim 14, wherein the instructions for deriving the new initial value include instructions for deriving the new initial value based on initial values of reachable endpoints of the output logic cone.

### Claim 16 (depends on 15)

The system of claim 15, wherein the memory arrangement is configured with instructions of the design tool that when executed by the one or more computer processors cause the one or more computer processors to perform operations including:
setting each starting point that is a register to an initial value of the register in response to the register having a clock enable pin coupled to a signal that is known to be in an enabled state at initialization; and
setting each starting point that is a register to an unknown value in response to the register having a clock enable pin coupled to a signal having an unknown state at initialization.

### Claim 17 (depends on 11)

The system of claim 11, wherein the instructions for deriving the new initial value include instructions for:
determining whether or not a known logic value is output from combinational logic connected to output of the candidate register, independent of an initial value of the retimed register; and
indicating that the new initial value can be either logic 0 or logic 1 in response to determining that the known logic value is output.

### Claim 18 (depends on 11)

The system of claim 11, wherein the instructions for determining whether or not the initial value specified for the candidate register can be removed include instructions for:
performing a first simulation with the candidate register having an initial value logic 0;
performing a second simulation with the candidate register having an initial value logic 1; and
indicating that the initial value specified for the candidate register can be removed in response to values of reachable endpoints of the output logic cone at completion of the first simulation being equal to values of the reachable endpoints at completion of the second simulation.

### Claim 19 (depends on 11)

The system of claim 11, wherein the memory arrangement is configured with instructions of the design tool that when executed by the one or more computer processors cause the one or more computer processors to perform operations including:
evaluating the circuit design to determine whether or not a timing constraint is satisfied after retiming the candidate register; and
restoring the candidate register to and deleting the retimed register from the circuit design in response to determining that the timing constraint is not satisfied.

### Claim 20 (depends on 11)

The system of claim 11, wherein the memory arrangement is configured with instructions of the design tool that when executed by the one or more computer processors cause the one or more computer processors to perform operations including:
placing and routing the circuit design; and
generating configuration data after the placing and routing for implementing an integrated circuit.
