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 .
Priority
Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55.
Should applicant desire to obtain the benefit of foreign priority under 35 U.S.C. 119(a)-(d) prior to declaration of an interference, a certified English translation of the foreign application must be submitted in reply to this action. 37 CFR 41.154(b) and 41.202(e).
Failure to provide a certified translation may result in no benefit being accorded for the non-English application.
Response to Arguments
Applicant’s arguments, see Remarks, filed on 10/30/2025, with respect to the 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, rejection of claim 5 have been fully considered and are persuasive in view of the amendment filed on 10/30/2025. The 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, rejection of claim 5 has been withdrawn.
Applicant's arguments filed on 10/30/2025 with respect to Sridharan reference have been fully considered but they are not persuasive.
Regarding Sridharan reference, the Applicant argued that “…Sridharan fails to teach, disclose, or suggest all the features recited in amended claim 4, including, at least, the above-recited features. For example, Sridharan does not disclose, teach, or suggest, at least, "determine, for each transmission instance, a number G representing available bits for a transmission of an uplink shared channel (UL-SCH) in the PUSCH, and perform a circular buffer management per transmission instance based on the number G," as recited in amended claim 4.
As such, amended independent claim 4 is patentably novel and distinguishable over Sridharan for at least the same reasons as presented above.
In addition, independent claims 5 and 6 are amended to recite, at least, features similar to those recited in amended independent claim 4. Therefore, amended independent claims 5 and 6 are also patentably novel and distinguishable over Sridharan for at least the same reasons as presented above with regards to amended independent claim 4.
Withdrawal of the pending rejection is therefore respectfully requested” (emphasis added) (Remarks, pages 5-6).
In response to applicant’s argument, the Examiner respectfully disagrees with the argument above. Sridharan teaches on paragraphs [66, 81-83] as follows:
[0066] In some aspects, a repeated transmission (sometimes referred to as a retransmission) may include the exact same encoded bits (e.g., information bits and parity bits) as the initial transmission and/or as another repeated transmission (e.g., where a same redundancy version is used across repetitions). Alternatively, a repeated transmission may include different encoded bits (e.g., a different combination of information bits and/or parity bits) than the initial transmission and/or another repeated transmission (e.g., where different redundancy versions are used across repetitions).
[0081] “Redundancy version” (RV) of a PUSCH repetition refers to a set of encoded bits that are transmitted for that PUSCH repetition. Using RV cycling, the UE 120 transmits a different set of encoded bits in different PUSCH repetitions. For example, the UE 120 may store bits for an uplink transmission in a circular buffer 505 (e.g., stored in memory of the UE 120). The circular buffer 505 stores information bits 510 and parity bits 515 (sometimes called parity-check bits). The information bits 510 may include the data to be transmitted, and the parity bits 515 may include linear combinations of the data (e.g., of the information bits 510). The UE 120 may encode information bits 510, parity bits 515, or a combination of information bits 510 and parity bits 515 into a set of encoded bits, and may transmit the set of encoded bits. The particular bits that are selected to be included in the set of encoded bits for a PUSCH repetition depend on (or are defined by) the RV of that PUSCH repetition.
[0082] For example, for a PUSCH repetition having RV0, the UE 120 transmits a sequence of encoded bits (e.g., a particular number of encoded bits) starting at a first location 520 in the circular buffer 505 (e.g., bit 0, or a first information bit). Similarly, the UE 120 transmits a sequence of encoded bits starting at a second location 525 in the circular buffer 505 for a PUSCH repetition having RV1, the UE 120 transmits a sequence of encoded bits starting at a third location 530 in the circular buffer 505 for a PUSCH repetition having RV2, and the UE 120 transmits a sequence of encoded bits starting at a fourth location 535 in the circular buffer 505 for a PUSCH repetition having RV3.
[0083] As an example, the starting bit locations may be defined by a table 540, such as for NR hybrid automatic repeat request (HARQ) using low-density parity-check (LDPC) code. The table 540 defines starting bit locations in the circular buffer 505 for a first base graph (BG1) and a second base graph (BG2). A base graph is a parameter for determining parity bits 515 for a transmission based at least in part on a transport block (TB) size and a code rate (with BG1 being intended for TBs with a larger TB size, and BG2 being intended for TBs with a smaller TB size). Referring to the table, N.sub.cb represents the length of the circular buffer 505 (e.g., the number of bits included in the circular buffer 505), and Z.sub.c represents a lifting size, which is based at least in part on the number of information bits 510 and the number of BG columns corresponding to information bits 510.
Therefore, clearly Sridharan has taught determining, for each repetition, a number of bits available for transmission, such as based on number of bits in the initial transmission, based on RV of the PUSCH repetition and/or TB size and a code rate, and storing these bits, in a corresponding transmission occasion spot in the circular buffer for transmission.
Accordingly, Sridharan has taught each and every limitation of amended claims 4-6.
Claim Interpretation
The following is a quotation of 35 U.S.C. 112(f):
(f) Element in Claim for a Combination. – An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof.
The following is a quotation of pre-AIA 35 U.S.C. 112, sixth paragraph:
An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof.
The claims in this application are given their broadest reasonable interpretation using the plain meaning of the claim language in light of the specification as it would be understood by one of ordinary skill in the art. The broadest reasonable interpretation of a claim element (also commonly referred to as a claim limitation) is limited by the description in the specification when 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is invoked.
As explained in MPEP § 2181, subsection I, claim limitations that meet the following three-prong test will be interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph:
(A) the claim limitation uses the term “means” or “step” or a term used as a substitute for “means” that is a generic placeholder (also called a nonce term or a non-structural term having no specific structural meaning) for performing the claimed function;
(B) the term “means” or “step” or the generic placeholder is modified by functional language, typically, but not always linked by the transition word “for” (e.g., “means for”) or another linking word or phrase, such as “configured to” or “so that”; and
(C) the term “means” or “step” or the generic placeholder is not modified by sufficient structure, material, or acts for performing the claimed function.
Use of the word “means” (or “step”) in a claim with functional language creates a rebuttable presumption that the claim limitation is to be treated in accordance with 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. The presumption that the claim limitation is interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is rebutted when the claim limitation recites sufficient structure, material, or acts to entirely perform the recited function.
Absence of the word “means” (or “step”) in a claim creates a rebuttable presumption that the claim limitation is not to be treated in accordance with 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. The presumption that the claim limitation is not interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is rebutted when the claim limitation recites function without reciting sufficient structure, material or acts to entirely perform the recited function.
Claim limitations in this application that use the word “means” (or “step”) are being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, except as otherwise indicated in an Office action. Conversely, claim limitations in this application that do not use the word “means” (or “step”) are not being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, except as otherwise indicated in an Office action.
This application includes one or more claim limitations that use the word “means” or “step” but are nonetheless not being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph because the claim limitation(s) recite(s) sufficient structure, materials, or acts to entirely perform the recited function. Such claim limitation(s) is/are: “reception circuitry” and “transmision circuitry” in claims 4 and 5.
Because this/these claim limitation(s) is/are not being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, it/they is/are not being interpreted to cover only the corresponding structure, material, or acts described in the specification as performing the claimed function, and equivalents thereof.
If applicant intends to have this/these limitation(s) interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, applicant may: (1) amend the claim limitation(s) to remove the structure, materials, or acts that performs the claimed function; or (2) present a sufficient showing that the claim limitation(s) does/do not recite sufficient structure, materials, or acts to perform the claimed function.
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 4-6 are rejected under 35 U.S.C. 102(a)(2) as being anticipated by US 2022/0256531 A1 to Sridharan et al. (hereafter refers as Sridharan).
Regarding claims 4 and 6, Sridharan teaches a terminal device and a method performed by a terminal device (a UE configured to perform a method of transmitting PUSCH, paragraphs [76-78, 80-82] and Fig. 2-6, 10, provisional 63/146,304, Fig. 2-6, and paragraphs [67-69, 72-76]), comprising:
reception circuitry (reception circuitry, paragraphs [16, 48, 51, 267], provisional 63/146,304, paragraphs [9, 10, 40, 43, 146] ) configured to receive a configuration for determining a plurality of slots for a physical uplink shared channel (PUSCH) (to receive configuration/indication specifying a number of repetitions, a number of slots and/or type of slots configuration, for PUSCH, paragraphs [76-78, 136, 137], provisional 63/146,304, paragraphs [68, 111, 143, 189]), and
transmission circuitry (transmission circuitry including a processor, paragraphs [51, 267], provisional 63/146,304, paragraphs [43, 146]) configured to:
generate one or more groups of slots from the plurality of slots (to generate at least one group of slots from the plurality of slots for transmissions, based on the indication via the configuration/DCI, paragraphs [67, 74-77, 90-93, 136, 137], provisional 63/146,304, paragraphs [46, 59-61, 80-82], and appendix, pages 2-3),
generate a transmission instance for each group of slots (generating a transmission occasion for each group of slots, which including at least one repetition of an initial transmission, paragraph [67], provisional 63/146,304, paragraph [59]), and
determine, for each transmission instance, a number G representing available bits for a transmission of an uplink shared channel (UL-SCH) in the PUSCH (determines, for each transmission occasion of a repetition, a number of bits available for a transmission of PUSCH, such as based on a RV of that PUSCH repetition and/or based on TB seize and code rate, paragraphs [81-83], provisional 63/146,304, paragraphs [73-75]),
perform a circular buffer management per transmission instance based on the number G (stores the number of bits per transmission occasion of repetition in a circular buffer, Fig. 5 and provisional 63/146,304, Fig. 5, and performs transmission(s) per each transmission occasion, by extracting a number of bits corresponded to the transmission occasion in the circular buffer, paragraphs [80-85], provisional 63/146,304, paragraphs [73-76], appendix, pages 2-3).
Regarding claim 5, Sridharan teaches a base station device (a base station configured to perform a method of PUSCH, paragraphs [76-78, 80-82] and Fig. 2-6, 10, provisional 63/146,304, Fig. 2-6, and paragraphs [67-69, 72-76]) comprising:
transmission circuitry (the base station includes a transmission circuitry, paragraphs [9, 11, 47, 52, 267], provisional 63/146,304, paragraphs [8, 10, 44, 45, 146]) configured to transmit a configuration for determining a plurality of slots for a physical uplink shared channel (PUSCH) (to transmit configuration/indication specifying a number of repetitions, a number of slots and/or type of slots configuration, for PUSCH, paragraphs [76-78, 136, 137], provisional 63/146,304, paragraphs [68, 111, 143, 189]); and
reception circuitry (the base station includes a reception circuitry including a processor, paragraphs [52, 267], provisional 63/146,304, paragraphs [44, 146]) configured to:
generate one or more groups of slots from the plurality of slots (to generate at least one group of slots from the plurality of slots for transmissions, based on the indication via the configuration/DCI, paragraphs [67, 74-77, 90-93, 136, 137], provisional 63/146,304, paragraphs [46, 59-61, 80-82], and appendix, pages 2-3),
generate a transmission instance for each group of slots (wherein each group including at least one repetition of an initial transmission is identified as a transmission instance/occasion, paragraph [67], provisional 63/146,304, paragraph [59]),
determine, for each transmission instance, a number G representing available bits for a transmission of an uplink shared channel (UL-SCH) in the PUSCH (determines, for each transmission occasion of a repetition, a number of bits available for a transmission of PUSCH, such as based on a RV of that PUSCH repetition and/or based on TB seize and code rate, paragraphs [81-83], provisional 63/146,304, paragraphs [73-75]), and
perform a circular buffer management per transmission instance based on the number G (for each transmission occasion, performing receiving of number of bits corresponded to each transmission occasion, extracted from a circular buffer, paragraphs [80-85], provisional 63/146,304, paragraphs [73-76], appendix, pages 2-3).
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
US 2022/0123865 A1 discloses an occasion includes a plurality of slots for transmission of PUSCH (Fig. 4) and performing circular buffer management for each occasion (paragraphs [300, 301]).
US 2021/0006315 A1 discloses an N repetition transmission of the CSI report and performs circular buffer managing of the repetition (paragraph [47]).
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 DUNG B. HUYNH whose telephone number is (571)270-7642. The examiner can normally be reached M-F 9:00 AM - 6:00 PM.
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, Ian N. Moore can be reached at 571-272-3085. 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.
/DUNG B HUYNH/Primary Examiner, Art Unit 2469 January 27, 2026