Prosecution Insights
Last updated: July 17, 2026
Application No. 18/769,761

METHOD AND DEVICE FOR LEARNING-BASED JOINT FRAMEWORK FOR CHANNEL STATE INFORMATION (CSI) COMPRESSION AND PREDICTION

Non-Final OA §102§103
Filed
Jul 11, 2024
Priority
Feb 14, 2024 — provisional 63/553,338
Examiner
CHOWDHURY, FAHMIDA S
Art Unit
Tech Center
Assignee
Samsung Electronics Co., Ltd.
OA Round
1 (Non-Final)
93%
Grant Probability
Favorable
1-2
OA Rounds
1m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 93% — above average
93%
Career Allowance Rate
584 granted / 628 resolved
+33.0% vs TC avg
Moderate +6% lift
Without
With
+6.1%
Interview Lift
resolved cases with interview
Fast prosecutor
2y 1m
Avg Prosecution
16 currently pending
Career history
648
Total Applications
across all art units

Statute-Specific Performance

§101
0.5%
-39.5% vs TC avg
§103
52.6%
+12.6% vs TC avg
§102
33.6%
-6.4% vs TC avg
§112
4.0%
-36.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 628 resolved cases

Office Action

§102 §103
CTNF 18/769,761 CTNF 88911 Notice of Pre-AIA or AIA Status 07-03-aia AIA 15-10-aia The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA. DETAILED ACTION This action is in response to the application filed on 07/11/2024. Claims 1-20 have been examined. Claim Rejections - 35 USC § 102 07-07-aia AIA 07-07 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 – 07-12-aia AIA (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. 07-15-03-aia AIA Claim s 1-8, 11-17, and 20 are rejected under 35 U.S.C. 102(a) (2) as being anticipated by PARK et al. (US 2024/0267183) . As of claim 1 , PARK discloses a method comprising: compressing, by an encoder of a user equipment (UE), channel vectors of a channel state information (CSI) matrix to generate respective compressed vectors (para [0058] discloses discussing AI/ML-based CSI compression methods for compressing channel information and AI/ML-based CSI prediction methods for predicting future channel information. Para [0084] [0085] discloses the encoder receive channel information for M resource regions as input, and compress them into latent vectors (=compressed vectors); generating, by a processor of the UE, a predicted channel vector by performing machine learning (ML)-based CSI prediction on the compressed vectors (para [0058] discloses discussing AI/ML-based CSI compression methods for compressing channel information and AI/ML-based CSI prediction methods for predicting future channel information, para [0143] the encoder compress channel information measured with CSI-RS resources in the past M slots, and the decoder predict channel information for the N future slots); and report, by the UE, a predicted CSI to a base station (BS) based on the predicted channel vector (para [0184] discloses the terminal feedback the predicted CSI to the base station). As of claim 11 , PARK discloses a user equipment (UE) comprising : an encoder configured to compress channel vectors of a channel state information (CSI) matrix to generate respective compressed vectors (para [0095] he encoder be located in the terminal, [0058] discloses discussing AI/ML-based CSI compression methods for compressing channel information and AI/ML-based CSI prediction methods for predicting future channel information. Para [0084] [0085] discloses the encoder receive channel information for M resource regions as input, and compress them into latent vectors (=compressed vectors); and a processor configured to generate a predicted channel vector by performing machine learning (ML)-based CSI prediction on the compressed vectors (para [0058] discloses discussing AI/ML-based CSI compression methods for compressing channel information and AI/ML-based CSI prediction methods for predicting future channel information, para [0143] the encoder compress channel information measured with CSI-RS resources in the past M slots, and the decoder predict channel information for the N future slots), and report a predicted CSI to a base station (BS) based on the predicted channel vector (para [0184] discloses the terminal feedback the predicted CSI to the base station). As of claim 20 , PARK discloses a user equipment (UE) comprising : a processor; and a non-transitory computer readable storage medium storing instruction that, when executed (para [0023] [0049] discloses a terminal comprise a processor), cause the processor to: compress channel vectors of a channel state information (CSI) matrix to generate respective compressed vectors ; (para [0058] discloses discussing AI/ML-based CSI compression methods for compressing channel information and AI/ML-based CSI prediction methods for predicting future channel information. Para [0084] [0085] discloses the encoder receive channel information for M resource regions as input, and compress them into latent vectors (=compressed vectors); generate a predicted channel vector by performing machine learning (ML)-based CSI prediction on the compressed vectors (para [0058] discloses discussing AI/ML-based CSI compression methods for compressing channel information and AI/ML-based CSI prediction methods for predicting future channel information, para [0143] discloses the encoder compress channel information measured with CSI-RS resources in the past M slots, and the decoder predict channel information for the N future slots); and report a predicted CSI to a base station (BS) based on the predicted channel vector (para [0184] discloses the terminal feedback the predicted CSI to the base station). As of claims 2 and 12 , rejection of claims 1 and 11 cited above incorporated herein, in addition PARK discloses the encoder comprises an auto-encoder of the UE (para [0066] discloses the CSI feedback device include the encoder and decoder which form an autoencoder). As of claims 3 and 13 , rejection of claims 1 and 11 cited above incorporated herein, in addition PARK discloses each compressed vector has a smaller number of dimensions than a corresponding channel vector (para [0077]- [0079] discloses the autoencoder perform data compression (or dimensionality reduction(=smaller number of dimensions), the encoder receive channel information as input, and compress them into latent vectors (=compressed vectors) and partition the entire latent vectors by the number of resource region which corresponds to compressed vector has a smaller number of dimensions than a corresponding channel vector). As of claim 4 , rejection of claim 1 cited above incorporated herein, in addition PARK discloses the CSI matrix is partitioned into the channel vectors (para [0077]- [0079] discloses the encoder receive channel information as input, and compress them into latent vectors (=compressed vectors) and partition the entire latent vectors by the number of resource region). As of claims 5 and 14 , rejection of claims 1 and 11 cited above incorporated herein, in addition PARK discloses storing the compressed vectors in a buffer of the UE (para [0049] discloses the processor execute a program stored in at least one of the memories and the storage device). As of claims 6 and 15 , rejection of claims 5 and 14 cited above incorporated herein, in addition PARK discloses the compressed vectors are stored in the buffer over multiple time stamps (para [0098] channel information is collected over several slots in the time domain resource regions correspond to time periods (slots (=multiple time stamps). The type 1 latent vector mean CSI for time periods (slots), and the type 2 latent vector mean CSI for each time period (slot). As of claims 7 and 16 , rejection of claims 1 and 11 cited above incorporated herein, in addition PARK discloses generating the predicted channel vector comprises : performing, by the processor, ML-based CSI prediction using the compressed vectors to generate a latent representation of the predicted channel vector (para [0059] [0086] discloses AI/ML-based CSI compression to compress channel information into CSI, so that the CSI corresponds to latent variables (or codes) in a latent space, the encoder receive channel information for M (e.g. M=5) CSI- reference signal (CSI-RS) resource regions (or time resources) of a past time point as input, and compresses them into latent vectors); and decompressing, by a decoder of the UE, the latent representation to generate the predicted channel vector (para [0086] disclose the decoder receives a portion or all of the latent vectors as input, and reconstruct channel information for CSI-RS resource regions (or time resources) of a future time point). As of claims 8 and 17 , rejection of claims 1 and 11 cited above incorporated herein, in addition PARK discloses generating the predicted channel vector comprises: performing, by the processor, ML-based CSI prediction and decoding on the compressed vectors to generate the predicted channel vector (para [0086] discloses the decoder receive a portion or all of the latent vectors as input, and reconstruct per-resource region channel information CSI-RS resource regions (or time resources) of a future time point) . Claim Rejections - 35 USC § 103 07-20-aia AIA 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 of this title, 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 9-10 and 18-19 are rejected under AIA 35 U.S.C 103 as being unpatentable over PARK et al. (US 2024/0267183) in view of JUNG et al. (US 2026/0082257). As of claims 9 and 18 , rejection of claims 8, and 17 cited above incorporated herein, in addition PARK does not explicitly disclose but JUNG teaches compressing the channel vectors comprises selecting a first ML model from a first set of ML models for encoding and decoding (JUNG, para [0128] discloses the ML-aided/based measurement be related to compressing the measurement results in size, so as to reduce reporting overhead, auto-encoder/DNN/CNN based machine learning can be used to enable compressed CSI reporting by generating compressed CSI information at UE side wherein in para [0148] discloses the UE determine a set of ML models for measurement reporting among the plurality of ML models (= first set of ML models ) configured for the UE), performing ML-based CSI prediction comprises selecting a second ML model from a second set of ML models for CSI prediction (JUNG, para [0140] discloses UE perform ML task such as predictions of measurements based on the configured/trained ML model (=second ML model). Therefore it would have been obvious for a person of ordinary skill in the art before the effective filing date of the claimed invention to combine the teaching of PARK with the teaching of JUNG in order for better performance and low power consumption as taught by JUNG in para [0016]. As of claims 10 and 19 , rejection of claims 1 and 11 cited above incorporated herein, in addition PARK does not explicitly disclose but JUNG teaches compressing the channel vectors and performing ML-based CSI prediction are performed with task-dependent ML models (JUNG, para [0140] discloses UE perform ML task such as predictions of measurements based on the configured/trained ML model). Therefore it would have been obvious for a person of ordinary skill in the art before the effective filing date of the claimed invention to combine the teaching of PARK with the teaching of JUNG in order for better performance and low power consumption as taught by JUNG in para [0016]. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to FAHMIDA S CHOWDHURY whose telephone number is (571)272-2547. The examiner can normally be reached M-F 8am to 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, Sujoy K Kundu can be reached at 571-272-8586. 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. /FAHMIDA S CHOWDHURY/ Primary Examiner, Art Unit 2471 Application/Control Number: 18/769,761 Page 2 Art Unit: 2471 Application/Control Number: 18/769,761 Page 3 Art Unit: 2471 Application/Control Number: 18/769,761 Page 4 Art Unit: 2471 Application/Control Number: 18/769,761 Page 5 Art Unit: 2471 Application/Control Number: 18/769,761 Page 6 Art Unit: 2471 Application/Control Number: 18/769,761 Page 7 Art Unit: 2471 Application/Control Number: 18/769,761 Page 8 Art Unit: 2471 Application/Control Number: 18/769,761 Page 9 Art Unit: 2471 Application/Control Number: 18/769,761 Page 10 Art Unit: 2471
Read full office action

Prosecution Timeline

Jul 11, 2024
Application Filed
Jun 16, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12641446
SYSTEMS AND METHODS FOR ADJUSTING TRANSMISSION POWER FOR A MOBILE DEVICE
3y 5m to grant Granted May 26, 2026
Patent 12640792
JOINT DESIGN OF USER ASSOCIATION AND HYBRID BEAMFORMING METHOD AND SYSTEM FOR SUB-THz UDN USING MULTI-AGENT DEEP REINFORCEMENT LEARNING
2y 11m to grant Granted May 26, 2026
Patent 12635023
COMMUNICATION SYSTEM, CONTROL DEVICE, AND CONTROL METHOD FOR COMMUNICATION SYSTEM
2y 9m to grant Granted May 19, 2026
Patent 12627348
RELAY SELECTION FOR MULTI-RELAY COMMUNICATIONS
2y 10m to grant Granted May 12, 2026
Patent 12628232
METHODS AND SYSTEMS FOR BEAM MANAGEMENT IN WIRELESS NETWORKS
2y 7m to grant Granted May 12, 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
93%
Grant Probability
99%
With Interview (+6.1%)
2y 1m (~1m remaining)
Median Time to Grant
Low
PTA Risk
Based on 628 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