Prosecution Insights
Last updated: October 04, 2026
Application No. 18/932,142

OVERLAPPING IMAGE FIELD UPDATES IN A DISPLAY SYSTEM

Non-Final OA §103
Filed
Oct 30, 2024
Priority
Oct 31, 2023 — provisional 63/594,817
Examiner
ENGLISH, ALECIA DIANE
Art Unit
2625
Tech Center
2600 — Communications
Assignee
Google LLC
OA Round
3 (Non-Final)
42%
Grant Probability
Moderate
3-4
OA Rounds
1y 9m
Est. Remaining
52%
With Interview

Examiner Intelligence

Grants 42% of resolved cases
42%
Career Allowance Rate
195 granted / 464 resolved
-20.0% vs TC avg
Moderate +10% lift
Without
With
+9.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 8m
Avg Prosecution
31 currently pending
Career history
504
Total Applications
across all art units

Statute-Specific Performance

§101
1.2%
-38.8% vs TC avg
§103
67.2%
+27.2% vs TC avg
§102
19.2%
-20.8% vs TC avg
§112
10.2%
-29.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 464 resolved cases

Office Action

§103
DETAILED ACTION 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 Objections Claims 11-13 are objected to because of the following informalities: the claims are dependent upon a cancelled base claim 10. For purposes of rejection on the merits, the claims will be rejected as being dependent upon claim 1. Appropriate correction is required. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. 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. Claims 1-7, 11-16, 18-19, 21, and 23-24 are rejected under 35 U.S.C. 103 as being unpatentable over Hudson et al. (US Patent Publication No. 2017/0124935; hereinafter Hudson) in view of Park et al. (US Patent Publication No. 2024/0153435; hereinafter Park). With reference to claims 1, 14, and 18, Hudson discloses a display system (20), method, and non-transitory computer-readable medium storing instructions that, when executed, cause a frame controller (24) of the display system (20) to perform a process (see paragraphs 22, 73; Fig. 3) comprising: an array of pixels (105, 210) arranged on a display panel (100) with respect to display units (see paragraphs 67-68, 71, 76; Figs. 1, 4); and a frame controller (24) configured to cause the array of pixels to display an image frame by performing a series of successive field updates (see paragraphs 73, 79; Fig. 5A), the series of successive field updates including: a first update in which a first circuit tracks a first traversal (in teaching first write pointer (280); see paragraphs 76-77, 93; Figs. 4, 7-8), during a first period, across the array of pixels to update the array of pixels from a first subframe to a second subframe of a sequence (in teaching odd sequence of rows 1-N; see paragraphs 77-79, 91-93; Figs. 4-8), and a second update in which a second circuit tracks a second traversal (in teaching second write pointer (282); see paragraphs 76-77, 93; Figs. 4, 7-8), during a second period overlapping the first period, across the array of pixels to update the array of pixels from the second subframe to a third subframe of the sequence (in teaching even sequence of rows 1-N; see paragraphs 77-79, 91-93; Figs. 4-8); wherein the first update tracked by the first circuit and the second update tracked by the second circuit are interleaved and both include updating the display units in an update order (the row-writes do not proceed sequentially through the imager rows from top to bottom, wherein the two write pointers are alternating writing their respective rows; see paragraphs 93-94, 99; Figs. 7-8). While disclosing updating the display, wherein it may be possible to vary the write order (see paragraph 123), Hudson fails to specifically disclose a random or quasi random update order of micro-LEDs as recited. Park discloses a display system (100) comprising: an array of pixels (PX) implemented by micro light-emitting diodes (microLEDs) and arranged on a display panel (400) (see paragraph 28; Figs. 1, 3), and further discloses updating the display units in a same random or quasi random order (in teaching the timing controller (200) may control a time point at which image data is input to the display panel (400) by varying the time points (t1-t4) for activating the respective source driver circuits; see paragraph 75, 98; Fig. 8). Therefore it would have been obvious to one of ordinary skill in the art to allow the usage of a random or quasi random write order for a micro-LED display similar to that which is taught by Park to be carried out in a system similar to that which is taught by Hudson to thereby improve display quality. With reference to claim 2, Hudson and Park disclose method of claim 1, wherein Hudson further discloses wherein: a minimum panel update period is defined as a time period in which the frame controller uses a single circuit to track traversal across the array of pixels to update the array of pixels (see paragraphs 76-77, 81-89; Figs. 4-8); the first period and the second period are each at least twice the minimum panel update period (see paragraph 93; Figs. 4-8); the second subframe is displayed for a second duration shorter than the minimum panel update period (see paragraph 93; Figs. 4-8); and the third subframe is displayed for a third duration longer than the minimum panel update period, such that a sum of the second duration and the third duration is at least twice the minimum panel update period (in teaching having multiple write pointers active at the same time; see paragraphs 98-101; Figs. 7-8). With reference to claims 3, 15, and 19, Hudson and Park disclose method of claim 1, 14, or 18, wherein Hudson further discloses wherein: a minimum panel update period is defined as a time period in which the frame controller of the display system uses a single circuit to track traversal across the array of pixels to update the array of pixels (see paragraphs 76-77; Figs. 4A-B); the series of successive field updates further includes a third update in which a third circuit tracks a third traversal, during a third period, across the array of pixels to update the array of pixels from the third subframe to a fourth subframe of the image field sequence (see paragraphs 98-100; Figs. 8A-B); the first period, the second period, and the third period are each at least three times the minimum panel update period (in teaching having multiple write pointers active at the same time; see paragraphs 98-101; Figs. 7-8); the second subframe is displayed for a second duration shorter than the minimum panel update period; the third subframe is displayed for a third duration shorter than the minimum panel update period; and the fourth subframe is displayed for a fourth duration longer than the minimum panel update period, such that a sum of the second duration, the third duration, and the fourth duration is at least three times the minimum panel update period (see paragraphs 101-102, 104-105; Figs. 8A-B). With reference to claim 4, Hudson and Park disclose method of claim 1, wherein Hudson further discloses wherein the series of successive field updates is performed such that each subframe of the sequence is displayed for a unique duration distinct from other durations of other subframes of the sequence (see paragraph 106; Fig. 9). With reference to claim 5, Hudson and Park disclose method of claim 1, wherein Hudson further discloses wherein the first subframe of the sequence includes an array of binary values corresponding to the array of pixels (see paragraphs 10-11; 79; Figs. 5). With reference to claim 6, Hudson and Park disclose method of claim 1, wherein Hudson further discloses wherein the first subframe of the image field sequence includes an array of multi-bit values corresponding to the array of pixels (see paragraphs 10-11). With reference to claim 7 and 16, Hudson and Park disclose method of claim 1 and 14, wherein Hudson further discloses wherein: the image frame is displayed by using a binary pulse-width modulation (PWM) technique to apply, to the array of pixels (see paragraphs 10-11), an array of multi-bit brightness values that corresponds to the array of pixels for the image frame (see paragraphs 10-11); the first subframe of the sequence includes a first array of binary values forming a first bit plane of the array of multi-bit brightness values (see paragraphs 111-112; Figs. 6-8, 14-17); and the second subframe of the sequence includes a second array of binary values forming a second bit plane of the array of multi-bit brightness values (see paragraphs 111-112; Figs. 6-8, 14-17). With reference to claims 11 and 23, Hudson and Park disclose method of claim 1 or 14, wherein Hudson further discloses wherein the display units are implemented as single rows on the display panel (see paragraphs 77, 81, 89). With reference to claims 12 and 24, Hudson and Guo disclose method of claim 1 or 18, wherein Hudson further discloses wherein the display units are implemented as multi-row groups on the display panel (see paragraphs 91, 104; Figs. 4-8). With reference to claim 13, Hudson and Park disclose method of claim 1, wherein Hudson further discloses wherein the display units are implemented as partial rows on the display panel (see paragraphs 93, 100). With reference to claim 21, Hudson and Park disclose method of claim 14, wherein Guo further discloses wherein the display units are implements as multi-row groups on the display panel (100) (see paragraphs 18, 39; Figs. 1-4). Claims 22 and 25 are rejected under 35 U.S.C. 103 as being unpatentable over Hudson in view of Park as applied to claim 14 or 18 above, and further in view of Tanaka et al. (US Patent Publication No. 2009/0015591; hereinafter Tanaka). While disclosing all that is required as explained above, Hudson and Park fail to disclose partial rows as recited. Tanaka discloses an image generating apparatus which allows the display units to be implemented as partial rows on the display panel (in teaching partial updating of screen; see paragraphs 8-9; Figs. 4-5). Therefore it would have been obvious to one of ordinary skill in the art to allow partial row writes similar to that which is taught by Tanaka to be carried out in a system similar to that which is taught by Hudson and Park to thereby reduce power consumption and write times (see Tanaka; paragraphs 12-13). Response to Arguments With reference to claim 1, the applicant argues that Hudson and Gou fail to teach the first and second updates are interleaved and both include updating the display units in a same random or quasi random update order. The examiner finds that Hudson discloses wherein: the first update begins updating display units with a first display unit (1); and the second update interleaved with the first update begins immediately subsequent to the first display unit being updated (the display unit (2) is alternately written so that the sequence of row writing alternates between each of the write pointers that are active in the display; see paragraphs 97-98; Figs. 7-8). Additional arguments directed to the usage of Guo are moot, as the reference is no longer relied upon. For these reasons, Hudson has been maintained as applies to the current claims. Pertinent Prior Art The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. LO et al. (US2016/0077367) discloses a method of PWM which preform addressing display pixels with the usage of a first write pointer and a second write pointer (see paragraphs 134-172; Figs. 9-13). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ALECIA DIANE ENGLISH whose telephone number is (571)270-1595. The examiner can normally be reached Mon.-Fri. 7:00am-3:00am. 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, William Boddie can be reached at 571-272-0666. 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. /ADE/Examiner, Art Unit 2625 571-270-1595
Read full office action

Prosecution Timeline

Show 2 earlier events
Apr 06, 2026
Interview Requested
Apr 09, 2026
Applicant Interview (Telephonic)
Apr 09, 2026
Examiner Interview Summary
Apr 17, 2026
Response Filed
Jul 08, 2026
Final Rejection mailed — §103
Sep 04, 2026
Request for Continued Examination
Sep 08, 2026
Response after Non-Final Action
Sep 22, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12748467
BASE ASSEMBLIES FOR KNOB ON DISPLAY DEVICES AND RELATED SYSTEMS, METHODS, AND DEVICES
1y 6m to grant Granted Sep 29, 2026
Patent 12743161
Device Connection Establishment Method and Terminal Device
2y 3m to grant Granted Sep 22, 2026
Patent 12724505
DISPLAY DEVICE
1y 1m to grant Granted Sep 01, 2026
Patent 12711899
PIXEL AND DISPLAY APPARATUS HAVING THE SAME
2y 2m to grant Granted Aug 18, 2026
Patent 12706019
DISPLAY SYSTEM AND DISPLAY DEVICE
2y 9m to grant Granted Aug 11, 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

3-4
Expected OA Rounds
42%
Grant Probability
52%
With Interview (+9.7%)
3y 8m (~1y 9m remaining)
Median Time to Grant
High
PTA Risk
Based on 464 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