Prosecution Insights
Last updated: October 22, 2026
Application No. 19/103,380

CLOCK DISTRIBUTION WITH CLOCK OFFSETS

Non-Final OA §102§103
Filed
Feb 12, 2025
Priority
Aug 19, 2022 — provisional 63/373,024 +1 more
Examiner
PANDEY, KESHAB R
Art Unit
Tech Center
Assignee
Tesla Inc.
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
8m
Est. Remaining
96%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allowance Rate
338 granted / 384 resolved
+28.0% vs TC avg
Moderate +8% lift
Without
With
+8.0%
Interview Lift
resolved cases with interview
Typical timeline
2y 4m
Avg Prosecution
7 currently pending
Career history
394
Total Applications
across all art units

Statute-Specific Performance

§101
7.5%
-32.5% vs TC avg
§103
52.3%
+12.3% vs TC avg
§102
16.6%
-23.4% vs TC avg
§112
15.5%
-24.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 384 resolved cases

Office Action

§102 §103
Detailed Action Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 1-2, 7 and 19 is/are rejected under 35 U.S.C. 102(a) (1) as being anticipated by Rezzi [7888973]. As to claim 1, Strap [7888973] teaches an integrated circuit with a clock distribution network for a computational node array, comprising: a node array comprising a plurality of nodes, the plurality of nodes comprising a first node and a second node that abuts the first node [col. 11, line 10-13“The matrix memory 950 may be described as a set of comparators that can store the result of a comparison. For example, matrix memory 950 may include multiple comparators, latches, flip-flops, and the like.”- matrix is formed of array], wherein the first node comprises clock distribution circuitry configured [ summary: col. 1: line 48-52: “time to digital converter (TDC). The time to digital converter can include a reference ingress that receives a reference signal and passes the reference signal through multiple delay elements, a clock signal ingress that receives a clock signal and passes the clock signal through another set of delay elements, and multiple comparators, which are fewer in number than the total number of delay elements. The multiple comparator 1) receive the delayed reference and delayed clock signals and 2) output a set of comparison results for comparisons of pairs of delayed references and delayed clock signals. ”-receiving and passing the refence and clock is equivalent to clock distributor] to: receive a clock signal, provide the clock signal to computing circuitry of the first node [ col. 3, line 36-38: “The ADPLL 100 can generate an oscillatory output signal, denoted OUTPUT, at a desired frequency in response to a reference signal from an external source (not shown).”], and provide the clock signal to the second node, wherein the clock signal is delayed by a unit of delay in the second node relative to the first node [ col 5, line 35-40: The second TDC 207 can receive the reference signal and the divided feedback signal, OUT.sub.DIV, which may also be described as a clock signal, from the feedback divider 225. The second TDC 207 and can generate a phase transient signal, .PHI..sub.ERR.sub.-- ” and col. 8, line 56-58: “TDC comparison matrices in FIGS. 6A-C, one can refer to Table 1 below. Table 1 shows, in normalized delay units, an example of the sampling instants of a reference signal due to the combination of delays from the two delay lines in a 20-state TDC. In this example, when the reference signal is delayed by more than the number of units in a given entry of the delay matrix in Table 1, the time difference between the reference signal and the clock signal may be represented by a ONE in a corresponding entry in the TDC comparison matrix of FIGS. 6A-C. The number of delay units can range from zero up to one less than the number of quantization intervals in TDC. Table 2 shows an example of the sampling instants for a 15-state TDC. ”- it can be delaying unit]. As to claim 2, Rezzi teaches the first node is configured to: receive the clock signal from two upstream nodes and provide the clock signal to two downstream nodes with the unit of delay [summary: time to digital converter (TDC). The time to digital converter can include a reference ingress that receives a reference signal and passes the reference signal through multiple delay elements, a clock signal ingress that receives a clock signal and passes the clock signal through another set of delay elements, and multiple comparators, which are fewer in number than the total number of delay elements. The multiple comparator 1) receive the delayed reference and delayed clock signals and 2) output a set of comparison results for comparisons of pairs of delayed references and delayed clock signals.”] As to claim 7, Rezzi teaches the node array comprises a plurality of compute nodes and a plurality of globals nodes [summary: “he multiple comparator 1) receive the delayed reference and delayed clock signals and 2) output a set of comparison results for comparisons of pairs of delayed references and delayed clock signals.”] As to claim 19, Rezzi teaches this claim according to the reasoning set forth in claim 1 supra. Furthermore, teaches providing the clock signal to a neighboring node of the node array [ summary: “time to digital converter (TDC). The time to digital converter can include a reference ingress that receives a reference signal and passes the reference signal through multiple delay elements, a clock signal ingress that receives a clock signal and passes the clock signal through another set of delay elements”- passes to another element, which is neighboring element ] Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claim(s) 10 is/are rejected under 35 U.S.C. 103 as being unpatentable over Rezzi [7888973], in view of Forbes [20070046385] As to claim 10, Rezzi teaches array but does not explicitly teach node array has a strapped H-tree clock distribution topology. However Forbes [20070046385] teaches node array has a strapped H-tree clock distribution topology.[0051: “a clock system with a time delay oscillator, in which the clock distribution includes taps along the transmission line. Since the input impedance to CMOS transistors is high, they present only a small capacitive load. Thus, as shown in FIG. 14, the low impedance transmission line can be tapped at various locations as the line runs around an integrated circuit. This will provide timing signals with a well-controlled frequency at remote locations on an integrated circuit and can be used as a clock distribution system rather than a conventional clock tree or "H" tree distribution system ”] It would have been obvious to person of ordinary skill in the art before the effective filing date of the claimed invention to combine teaching of Rezzi and Forbes because both are directed toward clock distribution. Furthermore, Forbes improves upon Rezzi by being able to distribute clock in H-tree distribution such that it can efficiently provide clock to each geometric symmetry. Allowable Subject Matter Claim 4-6, 8-9, 20 objected to as being dependent upon a rejected base claim but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Claim 11-18 allowed. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to KESHAB R PANDEY whose telephone number is (571)270-0176. The examiner can normally be reached Monday-Friday 9:00-5:00(ET). Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Jaweed Abbaszadeh can be reached at (571) 270-1640. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /KESHAB R PANDEY/ Primary Examiner, Art Unit 2176
Read full office action

Prosecution Timeline

Feb 12, 2025
Application Filed
Oct 05, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12764887
POWER AND TEMPERATURE MANAGEMENT OF DEVICES
4y 0m to grant Granted Oct 13, 2026
Patent 12761717
Network Identification of Portable Electronic Devices While Changing Power States
2y 3m to grant Granted Oct 13, 2026
Patent 12737194
GENERATING AN APPLICATION PROGRAMMING INTERFACE REQUEST USING SETS OF INTERACTION DATA
2y 2m to grant Granted Sep 15, 2026
Patent 12737028
COMPUTER SYSTEM HAVING A DEEP SLEEP MODE
2y 1m to grant Granted Sep 15, 2026
Patent 12724474
HYBRID CORE ARCHITECTURE
3y 6m to grant Granted Sep 01, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
88%
Grant Probability
96%
With Interview (+8.0%)
2y 4m (~8m remaining)
Median Time to Grant
Low
PTA Risk
Based on 384 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month