Prosecution Insights
Last updated: May 29, 2026
Application No. 18/891,510

RANGE OF MINIMUM CODING BLOCK SIZE

Final Rejection §102§OTHER
Filed
Sep 20, 2024
Priority
Oct 30, 2019 — provisional 62/928,150 +2 more
Examiner
BECK, LERON
Art Unit
2487
Tech Center
2400 — Computer Networks
Assignee
Tencent America LLC
OA Round
2 (Final)
80%
Grant Probability
Favorable
3-4
OA Rounds
11m
Est. Remaining
91%
With Interview

Examiner Intelligence

Grants 80% — above average
80%
Career Allowance Rate
683 granted / 859 resolved
+21.5% vs TC avg
Moderate +12% lift
Without
With
+11.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
36 currently pending
Career history
910
Total Applications
across all art units

Statute-Specific Performance

§101
1.4%
-38.6% vs TC avg
§103
84.7%
+44.7% vs TC avg
§102
2.6%
-37.4% vs TC avg
§112
1.5%
-38.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 859 resolved cases

Office Action

§102 §OTHER
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 . Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claims 2-7 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 21-24, 26 of U.S. Patent No. 12120338 (17854800). Although the claims at issue are not identical, they are not patentably distinct from each other because the difference between the claims of this application and the patented claims is the mere difference in terminology. It would have been obvious to one of ordinary skill in the art at the time the invention was made to add some limitations because one of ordinary skill in the art would have realized that adding some limitations in the claims is an obvious expedient since the remaining elements perform the same functions as before. In re Karlson, 136 USPQ 184 (CCPA 1963). Claims 2-7 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 3, 7, 11, 13, 17, and 20 of U.S. Patent No. 11399195 (17078302). Although the claims at issue are not identical, they are not patentably distinct from each other because the difference between the claims of this application and the patented claims is the mere difference in terminology. 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)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claim(s) 2-7 are rejected under 35 U.S.C. 102A2 as being anticipated by US 20210076074 A1-Chang et al (Hereinafter referred to as “Chang”). Regarding claim 2, Chang discloses a method of video encoding (Fig. 5), the method comprising: when a minimum luma coding block size is within a range of allowable minimum luma coding block sizes, encoding a picture in a bitstream of a coded video based on the minimum luma coding block size ([0033], encoding a bitstream based on a minimum size), and encoding a first syntax element in the bitstream of the coded video, the first syntax element specifying the minimum luma coding block size and indicating a binary logarithm value of the minimum luma coding block size minus 2 (Table 1), wherein a bitstream conformance requirement of the bitstream specifies that the minimum luma coding block size is within the range of allowable minimum luma coding block sizes having an upper limit smaller than a maximum allowable coding tree unit (CTU) size (Table 1), and the binary logarithm value of the minimum luma coding block size minus 2 is in a range of 0 to Min(N, log2_ctu_size_minus5+3), inclusive ([0126], wherein log2_min_luma_coding_block_size_minus2 to be in the range of zero to log2_ctu_size_minus5+three, inclusive), N is 4 ([0128], wherein a numerical range of 0 to min(4, log2_ctu_size_minus5+3), and log2_ ctu_size_minus5+5 represents a binary logarithm value of a CTU size of the coded video (Table 5, log2_ctu_size_minus5 plus 5 specifies the luma coding tree block size of each CTU). Regarding claim 3, Chang discloses the method of claim 2, further comprising: encoding a second syntax element in the bitstream of the coded video, the second syntax element specifying the CTU size (Table 1-5). Regarding claim 4, analyses are analogous to those presented for claim 2 and are applicable for claim 4 (decoder performs the opposite of decoding). Regarding claim 5, analyses are analogous to those presented for claim 3 and are applicable for claim 5. Regarding claim 6, analyses are analogous to those presented for claim 4 and are applicable for claim 6. Regarding claim 7, analyses are analogous to those presented for claim 3 and are applicable for claim 7. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to LERON BECK whose telephone number is (571)270-1175. The examiner can normally be reached M-F 8 am-5pm. 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, David Czekaj can be reached at (571) 272-7327. 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. LERON . BECK Examiner Art Unit 2487 /LERON BECK/ Primary Examiner, Art Unit 2487
Read full office action

Prosecution Timeline

Sep 20, 2024
Application Filed
Jan 29, 2025
Response after Non-Final Action
Aug 13, 2025
Non-Final Rejection mailed — §102, §OTHER
Feb 05, 2026
Interview Requested
Feb 12, 2026
Applicant Interview (Telephonic)
Feb 12, 2026
Examiner Interview Summary
Feb 13, 2026
Response Filed
May 26, 2026
Final Rejection mailed — §102, §OTHER (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12634466
WEIGHTED SAMPLE PREDICTION FOR GEOMETRIC PARTITIONING MODE
1y 7m to grant Granted May 19, 2026
Patent 12621461
CODING AFFINE MOTION MODELS FOR VIDEO CODING
2y 1m to grant Granted May 05, 2026
Patent 12615366
LOW FREQUENCY NON-SEPARABLE TRANSFORM SIGNALING IN VIDEO CODING
2y 5m to grant Granted Apr 28, 2026
Patent 12610090
METHOD OF PARTITIONING VIDEO DATA, DEVICE FOR DECODING VIDEO DATA, AND DEVICE FOR ENCODING VIDEO DATA
1y 4m to grant Granted Apr 21, 2026
Patent 12610047
CODING METHOD AND DECODER
1y 4m to grant Granted Apr 21, 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
80%
Grant Probability
91%
With Interview (+11.7%)
2y 7m (~11m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 859 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