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 .
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)(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.
Claim(s) 1 - 20 is/are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Park, U.S. Patent Publication No. 2023/0353276.
Park teaches:
1. A method for wireless communication, comprising:
generating a physical uplink shared channel (PUSCH) (UE maps UCI to a PUSCH, called a UCI piggyback, [1112]) having at least one resource element (RE) for communicating uplink control information (UCI) (when performing UCI piggyback, the UE can concatenate coded data bits and coded UCI bits before modulating coded bits, which will be transmitted on the PUSCH, map signals obtained by modulating the concatenated coded bits to Res and then transmit the signals on the PUSCH, [0179]), wherein at least a portion of the UCI is encoded and mapped to a first subset of bits of the at least one RE, and wherein a portion of data is encoded and mapped to at least a second subset of bits of the at least one RE (UE can concatenate coded data bits and coded UCI bits before modulating coded bits, [0179], assuming that the amount of coded bits that can be transmitted on the PUSCH are N bits and the amount of coded UCI bits are M bits, the UE may concatenate the coded bits with the coded UCI bits, [0180], M-bit information may be sequentially punctured from the LSB to the MSB, [0183]); and
transmitting the PUSCH including the UCI and the data (UE transmits the mapped UCI on the PUSCH, [1124]).
2. The method of claim 1, wherein the first subset of bits comprises one or more most significant bits (MSBs) of the RE, and wherein the second subset of bits comprises one or more least significant bits (LSBs) of the RE (M-bit information may be sequentially punctured from the LSB to the MSB, [0183]).
3. The method of claim 1, wherein:
the PUSCH comprises multiple code blocks (CBs) of data, the at least one RE comprising one or more REs in each of the multiple CBs for communicating UCI; and
the portion of the data is evenly distributed among a subset of the multiple CBs and is to be encoded and mapped to the one or more REs of each of the subset of the multiple CBs (it is assumed the UCI has coded bits corresponding to 20 Res and coded bits corresponding to 10 Res are distributed over two CBs respectively, [0476], Fig. 25).
4. The method of claim 3, wherein: the multiple CBs comprise a last CB on the PUSCH having the one or more REs for communicating UCI (selection of a specific CB appears to be mainly a design choice and not given much patentable weight); and
the last CB of the multiple CBs includes at least one more RE for communicating UCI than the subset of the multiple CBs (it is assumed the UCI has coded bits corresponding to 20 Res and coded bits corresponding to 10 Res are distributed over two CBs respectively, [0476], Fig. 25).
5. The method of claim 3, wherein: the multiple CBs comprise a last CB on the PUSCH having the one or more REs for communicating UCI (selection of a specific CB appears to be mainly a design choice and not given much patentable weight); and
the last CB of the multiple CBs includes at least one less RE for communicating UCI than the subset of the multiple CBs (it is assumed the UCI has coded bits corresponding to 20 Res and coded bits corresponding to 10 Res are distributed over two CBs respectively, [0476], Fig. 25).
6. The method of claim 1, wherein bits corresponding to the UCI are assigned to the at least one RE in a frequency first, time second manner (time-first mapping, [0176]).
7. The method of claim 1, wherein: the PUSCH comprises multiple CBs, the at least one RE comprising one or more REs in each of the multiple CBs; and
the portion of the data is encoded on and mapped to the one or more REs for each of a subset of the multiple CBs (it is assumed the UCI has coded bits corresponding to 20 Res and coded bits corresponding to 10 Res are distributed over two CBs respectively, [0476], Fig. 25).
8. The method of claim 7, further comprising receiving an indication of the subset of the multiple CBs on which the portion of the data is to be encoded (selection of a specific CB appears to be mainly a design choice and not given much patentable weight).
9. The method of claim 7, wherein the subset of the multiple CBs comprises at least one CB of the PUSCH that is first in time (selection of a specific CB appears to be mainly a design choice and not given much patentable weight).
10. The method of claim 1, wherein the data is assigned to REs of the PUSCH in a time first, frequency second manner (time-first mapping, [0176]).
11. The method of claim 1, wherein generating the PUSCH comprises:
mapping bits corresponding to the data to REs of the PUSCH; and
after the mapping of the bits corresponding to the data, puncturing one or more of the bits corresponding to the data to encode the UCI (UE may create the coded data bits according to the N-bit length, puncture partial M bits among the coded data bits, and may then insert the coded UCI bits at the corresponding position, [0180], Fig. 11).
12. The method of claim 1, wherein:
the portion of the UCI comprises hybrid automatic repeat request (HARQ) information (UCI includes HARQ, [0087]); and
puncturing the one or more of the bits comprises puncturing one or more most significant bits (MSBs) of the PUSCH to encode the HARQ information (M-bit information may be sequentially punctured from the LSB to the MSB, [0183]).
13. The method of claim 12, wherein the HARQ information is assigned to the at least one RE that is next to a demodulation reference signal (DMRS) (UE performs RE mapping in a frequency-0first manner starting at the symbol next to a PUSCH DM-RS symbol, [0853]).
14. The method of claim 12, wherein:
the UCI comprises channel state information (CSI) (CSI is included in UCI, [0015]); and
puncturing the one or more of the bits comprises puncturing one or more least significant bits (LSBs) of the PUSCH to encode the CSI (M-bit information may be sequentially punctured from the LSB to the MSB, [0183]).
15. The method of claim 14, wherein the UCI comprises CSI encoded and mapped to REs of the PUSCH that are separated in a frequency domain (UE performs RE mapping in a frequency-first manner starting at the symbol next to a PUSCH DM-RS symbol, [0853]).
16. A method for wireless communication, comprising:
receiving a physical uplink shared channel (PUSCH) (UE maps UCI to a PUSCH, called a UCI piggyback, [1112]) having at least one resource element (RE) for communicating uplink control information (UCI) (when performing UCI piggyback, the UE can concatenate coded data bits and coded UCI bits before modulating coded bits, which will be transmitted on the PUSCH, map signals obtained by modulating the concatenated coded bits to Res and then transmit the signals on the PUSCH, [0179]), wherein at least a portion of the UCI is encoded and mapped to a first subset of bits of the at least one RE, and wherein a portion of data is encoded and mapped to a second subset of bits of the at least one RE (UE can concatenate coded data bits and coded UCI bits before modulating coded bits, [0179], assuming that the amount of coded bits that can be transmitted on the PUSCH are N bits and the amount of coded UCI bits are M bits, the UE may concatenate the coded bits with the coded UCI bits, [0180], M-bit information may be sequentially punctured from the LSB to the MSB, [0183]); and
decoding the PUSCH including the UCI and the data (UE transmits the mapped UCI on the PUSCH, [1124]).
17. The method of claim 16, wherein the first subset of bits comprises one or more most significant bits (MSBs) of the RE, and wherein the second subset of bits comprises one or more least significant bits (LSBs) of the RE (M-bit information may be sequentially punctured from the LSB to the MSB, [0183]).
18. The method of claim 16, wherein: the PUSCH comprises multiple code blocks (CBs) of data, the at least one RE comprising one or more REs in each of the multiple CBs for communicating UCI; and
the portion of the data is evenly distributed among a subset of the multiple CBs and is to be encoded and mapped to the one or more REs of each of the subset of the multiple CBs (it is assumed the UCI has coded bits corresponding to 20 Res and coded bits corresponding to 10 Res are distributed over two CBs respectively, [0476], Fig. 25).
19. An apparatus for wireless communication, comprising:
a memory (see Fig. 3); and
one or more processors coupled to the memory, wherein the one or more processors are configured to:
generate a physical uplink shared channel (PUSCH) (UE maps UCI to a PUSCH, called a UCI piggyback, [1112]) having at least one resource element (RE) for communicating uplink control information (UCI) (when performing UCI piggyback, the UE can concatenate coded data bits and coded UCI bits before modulating coded bits, which will be transmitted on the PUSCH, map signals obtained by modulating the concatenated coded bits to Res and then transmit the signals on the PUSCH, [0179]), wherein at least a portion of the UCI is encoded and mapped to a first subset of bits of the at least one RE, and wherein a portion of data is encoded and mapped to at least a second subset of bits of the at least one RE (UE can concatenate coded data bits and coded UCI bits before modulating coded bits, [0179], assuming that the amount of coded bits that can be transmitted on the PUSCH are N bits and the amount of coded UCI bits are M bits, the UE may concatenate the coded bits with the coded UCI bits, [0180], M-bit information may be sequentially punctured from the LSB to the MSB, [0183]); and
transmit the PUSCH including the UCI and the data (UE transmits the mapped UCI on the PUSCH, [1124]).
20. An apparatus for wireless communication, comprising:
a memory (see Fig. 3); and
one or more processors coupled to the memory, wherein the one or more processors are configured to:
receive a physical uplink shared channel (PUSCH) (UE maps UCI to a PUSCH, called a UCI piggyback, [1112]) having at least one resource element (RE) for communicating uplink control information (UCI) (when performing UCI piggyback, the UE can concatenate coded data bits and coded UCI bits before modulating coded bits, which will be transmitted on the PUSCH, map signals obtained by modulating the concatenated coded bits to Res and then transmit the signals on the PUSCH, [0179]), wherein at least a portion of the UCI is encoded and mapped to a first subset of bits of the at least one RE, and wherein a portion of data is encoded and mapped to a second subset of bits of the at least one RE (UE can concatenate coded data bits and coded UCI bits before modulating coded bits, [0179], assuming that the amount of coded bits that can be transmitted on the PUSCH are N bits and the amount of coded UCI bits are M bits, the UE may concatenate the coded bits with the coded UCI bits, [0180], M-bit information may be sequentially punctured from the LSB to the MSB, [0183]); and
decode the PUSCH including the UCI and the data (UE transmits the mapped UCI on the PUSCH, [1124]).
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to PETER G SOLINSKY whose telephone number is (571)270-7216. The examiner can normally be reached M - Th, 6:30 A - 5:00 P.
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, Asad Nawaz can be reached at 571-272-3988. 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.
PETER G. SOLINSKY
Examiner
Art Unit 2463
/Peter G Solinsky/Primary Examiner, Art Unit 2463