Prosecution Insights
Last updated: October 27, 2026
Application No. 18/887,552

MOBILE ORIGINATED DATA

Non-Final OA §102
Filed
Sep 17, 2024
Priority
Dec 01, 2023 — provisional 63/605,216
Examiner
KIM, CHONG G
Art Unit
2413
Tech Center
2400 — Computer Networks
Assignee
Qualcomm Incorporated
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
7m
Est. Remaining
87%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allowance Rate
379 granted / 455 resolved
+25.3% vs TC avg
Minimal +3% lift
Without
With
+3.4%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
23 currently pending
Career history
490
Total Applications
across all art units

Statute-Specific Performance

§101
6.7%
-33.3% vs TC avg
§103
44.8%
+4.8% vs TC avg
§102
40.9%
+0.9% vs TC avg
§112
5.5%
-34.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 455 resolved cases

Office Action

§102
DETAILED ACTION 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 . Claims 1-20 are subject to examination and rejected. Specification The title of the invention is not descriptive. A new title is required that is clearly indicative of the invention to which the claims are directed. 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. Claims 1-20 are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Wu (US PGPub 2022/0210816). Regarding claims 1 and 20, Wu teaches a user equipment (UE) (Wu, see paragraph 0048, a method for contention-based uplink data transmission, which is applied to a UE), comprising: one or more memories storing processor-executable code (Wu, see figure 6, a UE); and one or more processors coupled with the one or more memories and individually or collectively operable to execute the code to cause the UE (Wu, see figure 6, a UE) to: transmit, based at least in part on an idle mode of the UE (Wu, see paragraph 0067, the contention-based PUSCH resource dynamically scheduled by the base station are shared by all RRC idle mode UEs supporting contention-based PUSCH transmission, or shared by a group of RRC idle mode UEs supporting contention-based PUSCH transmission), an uplink message that contains user data at the UE, the uplink message comprising, via a set of bits, a first identifier associated with the UE (Wu, see paragraph 0054, transmitting data on the contention-based PUSCH resource, and reporting a first contention resolution UE identity (ID)); and receive a downlink control information message responsive to the uplink message, at least a portion of the downlink control information message scrambled according to a radio network temporary identifier (RNTI), wherein the RNTI is one of a plurality of RNTIs, the plurality of RNTIs including a first RNTI that is associated with contention resolution and the first identifier (Wu, see paragraph 0055, monitoring a second DCI scrambled with a second RNTI in a second physical downlink control channel search space based on the high layer configuration information, wherein the second DCI indicates the second contention resolution UE ID or schedules a retransmission of the PUSCH; or the second DCI schedules a physical downlink shared channel (PDSCH), wherein the PDSCH indicates the second contention resolution UE ID or schedules a retransmission of the PUSCH through media access control (MAC) layer signaling). Regarding claim 2, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: decode the downlink control information message based at least in part on the RNTI, wherein the RNTI is the first RNTI, and wherein the first RNTI is a UE-specific RNTI that comprises a first subset of the set of bits associated with the first identifier (Wu, see paragraph 0056, transmitting the retransmission of PUSCH, when a resource for retransmission of the PUSCH is detected; or transmitting an acknowledgement (ACK) when the second contention resolution UE ID is detected and it is the same as the first contention resolution UE ID, wherein the ACK is used to indicate that the UE contention is successful). Regarding claim 3, Wu teaches wherein a payload of the downlink control information message includes a second subset of the set of bits associated with the first identifier (Wu, see paragraph 0054, transmitting data on the contention-based PUSCH resource, and reporting a first contention resolution UE identity (ID)). Regarding claim 4, Wu teaches wherein resolving a contention between the UE and at least a second UE is based at least in part on at least one of the first RNTI and the payload of the downlink control information message (Wu, see paragraph 0055, monitoring a second DCI scrambled with a second RNTI in a second physical downlink control channel search space based on the high layer configuration information, wherein the second DCI indicates the second contention resolution UE ID or schedules a retransmission of the PUSCH; or the second DCI schedules a physical downlink shared channel (PDSCH), wherein the PDSCH indicates the second contention resolution UE ID or schedules a retransmission of the PUSCH through media access control (MAC) layer signaling). Regarding claim 5, Wu teaches wherein the uplink message is a contention-based shared preconfigured uplink resources (PUR) request message or an early data transmission (EDT) request message, and wherein the downlink control information message is at least in part for contention resolution (Wu, see paragraph 0115, if the contention resolution UE ID detected by the UE is different from the reported contention resolution UE ID, or no contention resolution UE ID is detected, the contention is unsuccessful and the UE may attempt to monitor the next DCI dynamically indicating contention-based PUSCH resource, or fall back to use other ways to transmit data. Optionally, the data is transmitted through the RACH process or Early Data Transmission (EDT) process). Regarding claim 6, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: decode the downlink control information message based at least in part on the RNTI, wherein the RNTI is a second RNTI of the plurality of RNTIs different from the first RNTI, wherein the downlink control information message is associated with an uplink transmission, a downlink data message, an indication for the UE to perform a random access procedure for transmission of the user data, or a combination thereof (Wu, see paragraph 0056, transmitting the retransmission of PUSCH, when a resource for retransmission of the PUSCH is detected; or transmitting an acknowledgement (ACK) when the second contention resolution UE ID is detected and it is the same as the first contention resolution UE ID, wherein the ACK is used to indicate that the UE contention is successful). Regarding claim 7, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: decode the downlink control information message by evaluating, in a search space, a first scrambling hypothesis associated with the first identifier and by evaluating, in the search space, a second scrambling hypothesis associated with the second RNTI (Wu, see paragraph 0056, transmitting the retransmission of PUSCH, when a resource for retransmission of the PUSCH is detected; or transmitting an acknowledgement (ACK) when the second contention resolution UE ID is detected and it is the same as the first contention resolution UE ID, wherein the ACK is used to indicate that the UE contention is successful). Regarding claim 8, Wu teaches wherein when the uplink message is a contention-based shared PUR request message, and wherein the second RNTI is based at least in part on time and frequency resources associated with the uplink message, a multiplexing signature associated with the UE, a demodulation reference signal sequence, or a combination thereof (Wu, see paragraph 0278, the high layer configuration information comprises at least one of the followings: the first physical downlink control channel search space for transmitting the first DCI, the second physical downlink control channel search space for transmitting the second DCI, the first RNTI for transmitting the first DCI, the second RNTI for transmitting the second DCI, a first control resource set (CORESET) for transmitting the first DCI, a second CORESET for transmitting the second DCI, power control parameters of the PUSCH, demodulation reference signal (DMRS) parameters of the PUSCH, a contention resolution window of the PUSCH, maximum times of retransmission of PUSCH, a transmission block size (TBS) or a maximum TBS of PUSCH, a first downlink bandwidth part (DL BWP) for transmitting the first DCI, and a second DL BWP for transmitting the second DCI, and the uplink bandwidth part (UL BWP) where the PUSCH is located). Regarding claim 9, Wu teaches wherein when the uplink message is an early data transmission (EDT) request message, and wherein the second RNTI is a temporary cell radio network temporary identifier associated with the UE (Wu, see paragraph 0115, if the contention resolution UE ID detected by the UE is different from the reported contention resolution UE ID, or no contention resolution UE ID is detected, the contention is unsuccessful and the UE may attempt to monitor the next DCI dynamically indicating contention-based PUSCH resource, or fall back to use other ways to transmit data. Optionally, the data is transmitted through the RACH process or Early Data Transmission (EDT) process). Regarding claim 10, Wu teaches wherein a size of the downlink control information message is different from a size of a second downlink control information message, wherein the downlink control information message is associated with a first downlink control information format that is different from a second downlink control information format associated with the second downlink control information message (Wu, see paragraph 0278, the high layer configuration information comprises at least one of the followings: the first physical downlink control channel search space for transmitting the first DCI, the second physical downlink control channel search space for transmitting the second DCI, the first RNTI for transmitting the first DCI, the second RNTI for transmitting the second DCI, a first control resource set (CORESET) for transmitting the first DCI, a second CORESET for transmitting the second DCI, power control parameters of the PUSCH, demodulation reference signal (DMRS) parameters of the PUSCH, a contention resolution window of the PUSCH, maximum times of retransmission of PUSCH, a transmission block size (TBS) or a maximum TBS of PUSCH, a first downlink bandwidth part (DL BWP) for transmitting the first DCI, and a second DL BWP for transmitting the second DCI, and the uplink bandwidth part (UL BWP) where the PUSCH is located). Regarding claim 11, Wu teaches wherein a scrambling procedure associated with coded bits of the downlink control information message is different from a scrambling procedure of a second downlink control information message, wherein the downlink control information message is associated with a first downlink control information format that is different from a second downlink control information format associated with the second downlink control information message (Wu, see paragraph 0278, the high layer configuration information comprises at least one of the followings: the first physical downlink control channel search space for transmitting the first DCI, the second physical downlink control channel search space for transmitting the second DCI, the first RNTI for transmitting the first DCI, the second RNTI for transmitting the second DCI, a first control resource set (CORESET) for transmitting the first DCI, a second CORESET for transmitting the second DCI, power control parameters of the PUSCH, demodulation reference signal (DMRS) parameters of the PUSCH, a contention resolution window of the PUSCH, maximum times of retransmission of PUSCH, a transmission block size (TBS) or a maximum TBS of PUSCH, a first downlink bandwidth part (DL BWP) for transmitting the first DCI, and a second DL BWP for transmitting the second DCI, and the uplink bandwidth part (UL BWP) where the PUSCH is located). Regarding claim 12, Wu teaches wherein the downlink control information message comprises one or more flag bits that indicate whether the downlink control information message is associated with a contention resolution procedure, whether the downlink control information message is scheduling an uplink message, whether the downlink control information message is scheduling a downlink data message, or a combination thereof (Wu, see paragraph 0055, monitoring a second DCI scrambled with a second RNTI in a second physical downlink control channel search space based on the high layer configuration information, wherein the second DCI indicates the second contention resolution UE ID or schedules a retransmission of the PUSCH; or the second DCI schedules a physical downlink shared channel (PDSCH), wherein the PDSCH indicates the second contention resolution UE ID or schedules a retransmission of the PUSCH through media access control (MAC) layer signaling). Regarding claim 13, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: receive a system information block message indicating a downlink control configuration, the downlink control configuration indicating at least one of a start occasion for a search space associated with the downlink control information message, a start offset for a search space associated with the downlink control information message, or a quantity of repetitions associated with the downlink control information message (Wu, see paragraph 0145, it reuses the existing cell common search space of the system, such as a cell common search space for scheduling system information block (SIB), remaining minimum system information (RMSI), and random access response (RAR) or Paging Occasion (PO)). Regarding claim 14, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: receive a system information block message indicating an uplink control configuration, the uplink control configuration indicating the UE to transmit an acknowledgment message in response to the downlink control information message or in response to a downlink data message scheduled by the downlink control information message (Wu, see paragraph 0145, it reuses the existing cell common search space of the system, such as a cell common search space for scheduling system information block (SIB), remaining minimum system information (RMSI), and random access response (RAR) or Paging Occasion (PO)). Regarding claim 15, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: receive a system information block message indicating a downlink data message configuration associated with a data message, wherein the downlink control information message schedules the data message (Wu, see paragraph 0145, it reuses the existing cell common search space of the system, such as a cell common search space for scheduling system information block (SIB), remaining minimum system information (RMSI), and random access response (RAR) or Paging Occasion (PO)). Regarding claim 16, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: determine a quantity of repetitions for transmission of the uplink message based at least in part on a downlink signal strength, a transmit power limit associated with the UE, or both (Wu, see paragraph 0047, All the embodiments related to contention-based PUSCH transmission proposed in this application may be applied to the LTE MTC and LTE NB-IOT systems, and may also be appropriately extended and applied to the 5G New Radio (NR) system. 5G concepts such as beam and carrier Bandwidth Part (BWP) may be used in all the embodiments). Regarding claim 17, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: receive a system information block message indicating a configuration associated with the downlink control information message, wherein the configuration is active for a first NB-IoT carrier associated with the UE (Wu, see paragraph 0145, it reuses the existing cell common search space of the system, such as a cell common search space for scheduling system information block (SIB), remaining minimum system information (RMSI), and random access response (RAR) or Paging Occasion (PO)). Regarding claim 18, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: receive a group-common downlink control information message comprising an indication of a backoff period, wherein the uplink message is transmitted via a time occasion selected from a set of time occasions in accordance with the backoff period (Wu, see paragraph 0065, the contention-based PUSCH resource are shared by all or a group of UEs supporting contention-based PUSCH transmission, wherein the contention-based PUSCH resource are shared by all or a group of UEs supporting contention-based PUSCH transmission including at least one of the followings). Regarding claim 19, Wu teaches wherein the one or more processors are individually or collectively further operable to execute the code to cause the UE to: receive a configuration indicating a limit transport block size (Wu, see paragraph 0274, A first processing module 401 is configured to receive high layer configuration information for a contention-based physical uplink shared channel (PUSCH) transmission); and select a transport block size from a set of candidate transport block sizes for transmission of the uplink message in accordance with the limit transport block size (Wu, see paragraph 0278, the high layer configuration information comprises at least one of the followings: .. a transmission block size (TBS) or a maximum TBS of PUSCH …). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to CHONG G KIM whose telephone number is (571)270-0619. The examiner can normally be reached Mon-Fri @ 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, Nicholas R. Taylor can be reached at 571-272-3889. 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. /CHONG G KIM/Examiner, Art Unit 2443 /NICHOLAS R TAYLOR/Supervisory Patent Examiner, Art Unit 2443
Read full office action

Prosecution Timeline

Sep 17, 2024
Application Filed
Sep 30, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12771608
NETWORK SLICING BASED ON SERVICE TYPE
3y 4m to grant Granted Oct 20, 2026
Patent 12772237
METHOD AND DEVICE FOR WIRELESS COMMUNICATION
2y 11m to grant Granted Oct 20, 2026
Patent 12770632
TRANSMISSION APPARATUS, TRANSMISSION METHOD, RECEPTION APPARATUS AND RECEPTION METHOD FOR TRANSMITTING A PLURALITY OF TYPES OF AUDIO DATA ITEMS
2y 10m to grant Granted Oct 20, 2026
Patent 12764596
SYSTEMS AND METHODS FOR SEAMLESSLY PROVIDING QUALITY OF SERVICE CONTINUITY IN A WIRELESS NETWORK
3y 0m to grant Granted Oct 13, 2026
Patent 12750914
COMMUNICATION METHOD OF COMMUNICATION TERMINAL AND ELECTRONIC DEVICE FOR COMMUNICATING SERVICE DATA OF AN APPLICATION
3y 10m to grant Granted Sep 29, 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
83%
Grant Probability
87%
With Interview (+3.4%)
2y 8m (~7m remaining)
Median Time to Grant
Low
PTA Risk
Based on 455 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