Prosecution Insights
Last updated: April 19, 2026
Application No. 18/855,865

CHANNEL STATE INFORMATION PROCESSING METHODS AND APPARATUSES

Non-Final OA §101§102
Filed
Oct 10, 2024
Examiner
GUARINO, RAHEL
Art Unit
2633
Tech Center
2600 — Communications
Assignee
BEIJING XIAOMI MOBILE SOFTWARE CO., LTD.
OA Round
1 (Non-Final)
93%
Grant Probability
Favorable
1-2
OA Rounds
2y 3m
To Grant
98%
With Interview

Examiner Intelligence

Grants 93% — above average
93%
Career Allow Rate
781 granted / 838 resolved
+31.2% vs TC avg
Minimal +4% lift
Without
With
+4.5%
Interview Lift
resolved cases with interview
Typical timeline
2y 3m
Avg Prosecution
15 currently pending
Career history
853
Total Applications
across all art units

Statute-Specific Performance

§101
9.1%
-30.9% vs TC avg
§103
33.4%
-6.6% vs TC avg
§102
15.7%
-24.3% vs TC avg
§112
29.0%
-11.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 838 resolved cases

Office Action

§101 §102
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 . This office action is in response to preliminary amendments submitted on 5/20/2025. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 24, 26 are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter. The claim does not fall within at least one of the four categories of patent eligible subject matter (process, machine, manufacture or composition of matter) because: Claims 24, 26 recite “computer program" which covers forms of non-transitory tangible media and software per se in view of the ordinary and customary meaning of computer program distribution media. Claim Objections Claims 9,11,12,14, 26 are objected to because of the following informalities: Claim 9 recites “that information of a reference signal" should be “information of a reference signal". “that” should be removed. Claim 11 recites “that position information " should be “position information". “that” should be removed. Claim 12 recites “that time information " should be “time information". “that” should be removed. Claim 14 recites “in response to that the scenario information” should be “in response to the scenario information”. “that” should be removed. Claim 26 recites “A network device” should be “the network device”. Appropriate correction is required. Claim Rejections - 35 USC § 102 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 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. Claims 1,16, 24-26 are rejected under 35 U.S.C. 102 (a)1 as being anticipated by Kyung et al. US 2025/0015844 Reclaim 1 Kyung discloses a channel state information processing method (abstract), wherein the method is performed by a terminal device (UE;310), and the method comprises: determining a target compression algorithm (deep learning or machine learning) algorithm as determined target compression algorithm based on performance; para#54); compressing Channel State Information (CSI) using the target compression algorithm to obtain compressed CSI (para#54-55; obtaining CSI compression based the target compression algorithm of deep neural network or neural network); and sending the compressed CSI to a network device (para#55 transmitting the compressed CSI to base station;320). Reclaim 16 Kyung discloses a channel state information (CSI) processing method (abstract), wherein the method is performed by a network device (base station;320), and the method comprises: receiving compressed CSI sent by a terminal device (transmitting compressed CSI by UE;310; para#55); thereby base station receiving compressed CSI), wherein the compressed CSI is obtained by the terminal device through compression of CSI using a target compression algorithm ((deep learning or machine learning) algorithm as determined target compression algorithm based on performance of deep neural network or neural network; para#54, where UE performs the compressed CSI based on target compression algorithm (para#54-55; obtaining CSI compression). Reclaim 24 Kyung discloses a terminal device (UE;310), comprising a processor (520; para#73-74) and a memory (510; para#74-75), wherein a computer program is stored in the memory, and the processor executes the computer program stored in the memory to cause the terminal device (310) to: determine a target compression algorithm (deep learning or machine learning) algorithm as determined target compression algorithm based on performance; para#54); compress Channel State Information (CSI) using the target compression algorithm to obtain compressed CSI (para#54-55; obtaining CSI compression based the target compression algorithm of deep neural network or neural network); and send the compressed CSI to a network device (para#55 transmitting the compressed CSI to base station;320). Reclaim 25 Kyung discloses a non-transitory computer-readable storage medium storing instructions (para#74-75), wherein when the instructions are executed the method according to claim 1 is implemented (para#75,78). Reclaim 26 Kyung discloses a network device (BS;320; para#73), comprising a processor (510) and a memory (520), wherein a computer program is stored in the memory (para#74-75), and the processor executes the computer program stored in the memory to cause the network device (320) to perform the method according to claim 16 (para#78). Allowable Subject Matter Claims 2-15, 17 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. Reclaim 2-7 Prior art reference failed to teach or disclose sending first indication information to the network device, wherein the first indication information is used to indicate the target compression algorithm. Reclaim 8-13 Prior art reference failed to teach or disclose wherein determining the target compression algorithm comprises: determining scenario information of a scenario in which the terminal device is located; matching the scenario information against usage conditions of compression algorithms in an algorithm list; and in response to the scenario information satisfying a usage condition of a compression algorithm in the algorithm list, determining the compression algorithm to be the target compression algorithm. Reclaim 14 Prior art reference failed to teach or disclose wherein determining the target compression algorithm comprises: determining scenario information of a scenario in which the terminal device is located; matching the scenario information against usage conditions of compression algorithms in an algorithm list; and in response to that the scenario information satisfies usage conditions of multiple compression algorithms in the algorithm list, selecting one compression algorithm from the multiple compression algorithms to be the target compression algorithm. Reclaim 15 Prior art reference failed to teach or disclose in response to a change in a compression algorithm used by the terminal device, sending second indication information to the network device, wherein the second indication information is used to indicate a changed compression algorithm used by the terminal device. Reclaim 17 Prior art reference failed to teach or disclose receiving first indication information sent by the terminal device, wherein the first indication information is used to indicate the target compression algorithm; decompressing the compressed CSI according to the target compression algorithm to obtain the CSI before compression; and generating a precoding matrix according to a channel response matrix in the CSI before compression to perform encoding using the precoding matrix. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to RAHEL GUARINO whose telephone number is (571)270-1198. The examiner can normally be reached Monday-Friday 9AM-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, Chieh M Fan can be reached at 571-272-3042. 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. /RAHEL GUARINO/ Primary Examiner, Art Unit 2632
Read full office action

Prosecution Timeline

Oct 10, 2024
Application Filed
Jan 28, 2026
Non-Final Rejection — §101, §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12603804
Systems and Methods for Spectrum-controlled Waveform Multiplexing
2y 5m to grant Granted Apr 14, 2026
Patent 12603679
SIGNAL PROCESSING DEVICE AND DATA TRANSMISSION METHOD
2y 5m to grant Granted Apr 14, 2026
Patent 12597970
HYBRID MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO) PRECODER CODEBOOK BASED ON DISCRETE FOURIER TRANSFORM (DFT) AND NON-DFT PRECODERS
2y 5m to grant Granted Apr 07, 2026
Patent 12597964
TIMO: TIME INTERLEAVED MULTIPLE OUTPUTS FOR ENABLING MULTIPLEXING GAINS WITH A SINGLE RF CHAIN
2y 5m to grant Granted Apr 07, 2026
Patent 12587241
SIGNAL DETECTION CIRCUIT AND DETECTION METHOD USING THE SAME
2y 5m to grant Granted Mar 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

1-2
Expected OA Rounds
93%
Grant Probability
98%
With Interview (+4.5%)
2y 3m
Median Time to Grant
Low
PTA Risk
Based on 838 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