Prosecution Insights
Last updated: April 19, 2026
Application No. 18/835,877

GROUP SPARSITY AND IMPLICIT REGULARIZATION FOR MIMO CHANNEL ESTIMATION

Final Rejection §103
Filed
Aug 05, 2024
Examiner
YU, LIHONG
Art Unit
2631
Tech Center
2600 — Communications
Assignee
InterDigital Patent Holdings, Inc.
OA Round
2 (Final)
82%
Grant Probability
Favorable
3-4
OA Rounds
2y 6m
To Grant
99%
With Interview

Examiner Intelligence

Grants 82% — above average
82%
Career Allow Rate
665 granted / 816 resolved
+19.5% vs TC avg
Strong +19% interview lift
Without
With
+19.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 6m
Avg Prosecution
22 currently pending
Career history
838
Total Applications
across all art units

Statute-Specific Performance

§101
2.0%
-38.0% vs TC avg
§103
64.6%
+24.6% vs TC avg
§102
17.5%
-22.5% vs TC avg
§112
7.4%
-32.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 816 resolved cases

Office Action

§103
DETAILED ACTION This office action is responsive to the Applicant’s reply filed on 02/06/2026. Response to Arguments Applicant's arguments, filed on 02/06/2026, with respect to claim rejections under 35 USC 103 have been fully considered but they are not persuasive. Applicant’s argument: “Although Ibrahim describes using a diagonal matrix and a Slepian sequence to determine the precoder matrix (See Ibrahim paragraph [0111] and Eq. 5), a precoder matrix itself is not a MF structure associated with the matrix. In other words, determining a precoder matrix itself cannot be said to be the same as determining a ‘matrix factorization (MF) structure associated with the matrix.” Examiner’s response: As mentioned above by the Applicant, in Equation (5), Ibrahim teaches that a precoding matrix P is decomposed into a diagonal matrix and a Slepian sequence. The diagonal matrix and the Slepian sequence are two matrix factors. Ibrahim teaches that the precoding matrix P is represented as a data structure which is a multiplication of the diagonal matrix and the Slepian sequence. 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. Claims 15, 22, 23 and 30 are rejected under 35 U.S.C. 103 as being unpatentable over Ibrahim et al. (US 2024/0380450 A1) in view of Yie et al. (US 2013/0070723 A1). Consider claims 15 and 23: Ibrahim discloses a wireless transmit/receive unit (WTRU) (see Fig. 7 and paragraph 0125, where Ibrahim describes a user equipment 115-b in a wireless communication; see Fig. 8 and paragraph 0136, where Ibrahim describes that the user equipment includes a transmitter 815 and a receiver 810) comprising: a processor (see Fig. 11 and paragraph 0162, where Ibrahim describes that the user equipment includes a processor 1140) configured to: receive configuration information from a base station (see Fig. 7 and paragraph 0127, step 710, where Ibrahim describes that the user equipment 115-b receives a configuration of a set of precoders from a base station 105-b), wherein the configuration information indicates matrix factors associated with a matrix (see paragraph 0111, where Ibrahim describes that the precoders are represented by a precoder matrix P which has two factors: a diagonal matrix (diag) and a Slepian sequence (dpss), as shown in Equation (5)), a first dimensionality associated with a first matrix factor in the matrix (see paragraphs 0111-0112, where Ibrahim describes that the first factor (diag) is a diagonal matrix with dimension defined by R and N) and a second dimensionality associated with a second matrix factor in the matrix (see paragraphs 0111-0112, where Ibrahim describes that the second factor (dpss) is a Slepian sequence with dimension defined by L), and wherein the matrix is associated with a downlink channel between the WTRU and the base station (see Fig. 7 and paragraph 0127, where Ibrahim describes that the set of precoders are associated with a communication channel between the user equipment 115-b and the base station 105-b); determine, based on the matrix factors, a matrix factorization (MF) structure associated with the matrix, wherein the MF structure is at least a first structure or a second structure (see paragraph 0111, where Ibrahim describes that the precoder matrix P is factorized into a diagonal matrix (diag) and a Slepian sequence (dpss) in a data structure shown in equation (5)); and send an indication to the base station that indicates the WTRU is configured to perform channel estimation based on the MF structure associated with the matrix (see Fig. 7 and paragraphs 0129-0131, step 735, where Ibrahim describes that the user equipment 115-b transmits, to the base station 105-b, a report indicating a selected precoder associated with the precoder matrix, and a channel estimation has been performed for the set of precoders to obtain the selected precoder). Ibrahim does not specifically disclose: a first initialization for the first matrix factor in the matrix and a second initialization for the second matrix factor in the matrix. Yie teaches: a first initialization for a first matrix factor in the matrix and a second initialization for a second matrix factor in the matrix (see paragraphs 0028-0029, where Yie describes a precoding matrix G(n) which is a product of two factors, and a precoding matrix initialization unit initializes the precoding matrix G(n)). Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention to include: a first initialization for the first matrix factor in the matrix and a second initialization for the second matrix factor in the matrix, as taught by Yie to modify the method of Ibrahim in order to adaptively update the precoding matrix, as discussed by Yie (see paragraph 0027). Consider claims 22 and 30: Ibrahim in view of Yie discloses the invention of claims 15 and 23 above. Ibrahim discloses: obtain channel information associated with the downlink channel between the WTRU and the base station (see Fig. 7 and paragraph 0128, step 720, where Ibrahim describes that the user equipment 115-b estimates the channel between the base station 105-b and the user equipment 115-b); determine to use MF based on the obtained channel information (see Fig. 7 and paragraph 0130, step 730, where Ibrahim describes that the user equipment 115-b selects a precoder based on the estimated channel; see paragraph 0111, where Ibrahim describes that the precoder is obtained from a precoder matrix P which has two factors: a diagonal matrix (diag) and a Slepian sequence (dpss), as shown in Equation (5)); and based on the determination to use MF, send an indication to the base station indicating the obtained channel information (see paragraph 0131, step 735, where Ibrahim describes that the user equipment 115-b transmits, to the base station 105-b, a report indicating the selected precoder that is selected based on the estimated channel)). Claims 21 and 29 are rejected under 35 U.S.C. 103 as being unpatentable over Ibrahim et al. (US 2024/0380450 A1) in view of Yie et al. (US 2013/0070723 A1), as applied to claims 15 and 23 above, and further in view of He et al. (US 2020/0074341 A1). Consider claims 21 and 29: Ibrahim in view of Yie discloses the invention of claims 15 and 23 above. Ibrahim does not specifically disclose: the first structure is a low rank structure, and the second structure is a group sparse structure. He teaches: a first structure is a low rank structure, and a second structure is a group sparse structure (see paragraph 0088, where He describes low-rank and group sparse structures). Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention to include: the first structure is a low rank structure, and the second structure is a group sparse structure, as taught by He to modify the method of Ibrahim in order to have a robust multi-task learning, as discussed by He (see paragraph 0088). Allowable Subject Matter Claims 16-20 and 24-28 are 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. Conclusion THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to LIHONG YU whose telephone number is (571)270-5147. The examiner can normally be reached 10:00 am-6:00 pm EST Monday-Friday. 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, Hannah S. Wang can be reached at (571)272-9018. 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. /LIHONG YU/Primary Examiner, Art Unit 2631
Read full office action

Prosecution Timeline

Aug 05, 2024
Application Filed
Nov 03, 2025
Non-Final Rejection — §103
Feb 06, 2026
Response Filed
Feb 21, 2026
Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12603667
METHOD AND APPARATUS FOR DETECTING AND CORRECTING PASSIVE INTERMODULATION (PIM)
2y 5m to grant Granted Apr 14, 2026
Patent 12597937
REDUCE DCO FREQUENCY OVERLAP-INDUCED LIMIT CYCLE IN HYBRID AND DIGITAL PLLS
2y 5m to grant Granted Apr 07, 2026
Patent 12574130
IMPROVEMENT OF LINEAR BEAM SWEEPING IN HIGH SPEED SCENARIOS
2y 5m to grant Granted Mar 10, 2026
Patent 12567893
Baseband Unit, Radio Unit and Methods in a Wireless Communications Networks
2y 5m to grant Granted Mar 03, 2026
Patent 12562855
TECHNIQUES FOR MONITORING AND CONTROL OF HIGH SPEED SERIAL COMMUNICATION LINK
2y 5m to grant Granted Feb 24, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

3-4
Expected OA Rounds
82%
Grant Probability
99%
With Interview (+19.2%)
2y 6m
Median Time to Grant
Moderate
PTA Risk
Based on 816 resolved cases by this examiner. Grant probability derived from career allow 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