IP Library › Granted Patent US 12,446,078
Granted Patent B2
US 12,446,078 · App. 18/649,991 · Granted Oct 14, 2025

PUSCH and PRACH enhancements

Inventors: Jung Hyun Bae (San Diego, CA); Mohammed Karmoose (San Diego, CA)
Assignee: Samsung Electronics Co., Ltd.
H04W74/0841H04W72/0446H04W72/1268H04W74/002
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,446,078
App. No.
18/649,991
Granted
Oct 14, 2025
Kind
B2
Abstract

A method for PUSCH repetition or PRACH aggregation. In some embodiments, the method includes transmitting, by a User Equipment (UE), in a first slot, a first Physical Uplink Shared Channel (PUSCH) transmission including a set of coded bits selected from a circular buffer of the UE based on a first redundancy version (RV); determining, by the UE, that a second slot is available for an earliest repetition of the first PUSCH transmission, the second slot being later than the slot immediately following the first slot; determining, by the UE, based on the second slot, a second redundancy version; and transmitting, by the UE, in the second slot, a second PUSCH transmission including a set of coded bits selected from the circular buffer of the UE based on the second redundancy version, the second PUSCH transmission being a repetition of the first PUSCH transmission.

Claims (64)

1. A method, comprising:

transmitting, by a User Equipment (UE), in a first slot, a first Physical Uplink Shared Channel (PUSCH) transmission comprising a first set of coded bits selected based on a first redundancy version (RV), the first set of coded bits encoding first data;

determining, by the UE, that a second slot is available for a repetition of the first PUSCH transmission;

determining, by the UE, a second redundancy version based on the first redundancy version and based on a number of actual PUSCH transmissions corresponding to the first PUSCH transmission, the second redundancy version being different from the first redundancy version; and

transmitting, by the UE, in the second slot, the repetition of the first PUSCH transmission as a second PUSCH transmission based on the second redundancy version, such that the second PUSCH transmission comprises a second set of coded bits encoding all of the first data, the first slot and the second slot being separated by at least one downlink slot.

2. The method of claim 1 , wherein the second set of coded bits is selected based on the second redundancy version.

3. The method of claim 1 , wherein the number of PUSCH transmissions corresponding to the first PUSCH transmission is k, k being an integer greater than zero.

4. The method of claim 1 , wherein:

the repetition of the first PUSCH transmission is an earliest repetition; and

the second slot is later than the slot immediately following the first slot.

5. The method of claim 1 , wherein the second PUSCH transmission is a Type A repetition of the first PUSCH transmission.

6. The method of claim 1 , wherein the determining that the second slot is available for a repetition of the first PUSCH transmission comprises:

receiving a slot format indicator (SFI); and

determining that the second slot is a slot identified, by the SFI, as an uplink slot.

7. The method of claim 1 , wherein the determining that the second slot is available for a repetition of the first PUSCH transmission comprises:

missing a slot format indicator (SFI) having a region of applicability having a beginning and an end and comprising a plurality of slots; and

determining that the second slot occurs later than the end of the region of applicability.

8. The method of claim 1 , further comprising:

determining that no slots are available after a last scheduled PUSCH repetition and before an end of a maximum PUSCH transmission duration interval, and

not transmitting a PUSCH repetition after the last scheduled PUSCH repetition.

9. The method of claim 1 , further comprising:

receiving an indication from a network node (gNB) that a third slot is available for a PUSCH repetition;

receiving an indication from the gNB that the third slot is not available for a PUSCH repetition; and

determining that the third slot is not available for a PUSCH repetition.

10. The method of claim 1 , wherein:

the transmitting, by the UE, of the first PUSCH transmission comprises transmitting the first PUSCH transmission as a non-codebook based transmission using a first precoding matrix; and

the transmitting, by the UE, of the second PUSCH transmission comprises transmitting the second PUSCH transmission as a non-codebook based transmission using a second precoding matrix, different from the first precoding matrix.

11. The method of claim 10 , further comprising:

indicating, by the UE, using a first non-codebook based Sounding Reference Signal (SRS) instance, the first precoding matrix; and

indicating, by the UE, using a second non-codebook based Sounding Reference Signal instance, the second precoding matrix.

12. The method of claim 1 , further comprising:

sending a Physical Random Access Channel (PRACH) preamble in a first Random Access Channel (RACH) Occasion (RO); and

sending the PRACH preamble in a second RO.

13. The method of claim 12 , wherein the UE does not initiate a Random Access Response (RAR) monitoring window after sending the PRACH preamble in the first RO and before sending the PRACH preamble in the second RO.

14. A User Equipment (UE), comprising:

a processing circuit; and

a radio,

the processing circuit being configured to:

transmit, in a first slot, a first Physical Uplink Shared Channel (PUSCH) transmission comprising a first set of coded bits selected based on a first redundancy version (RV), the first set of coded bits encoding first data;

determine that a second slot is available for a repetition of the first PUSCH transmission;

determine, a second redundancy version based on the first redundancy version and based on a number of actual PUSCH transmissions corresponding to the first PUSCH transmission, the second redundancy version being different from the first redundancy version; and

transmit, in the second slot, the repetition of the first PUSCH transmission as a second PUSCH transmission based on the second redundancy version, such that the second PUSCH transmission comprises a second set of coded bits encoding all of the first data, the first slot and the second slot being separated by at least one downlink slot.

15. The UE of claim 14 , wherein the second PUSCH transmission is a Type A repetition of the first PUSCH transmission.

16. The UE of claim 14 , wherein the determining that the second slot is available for a repetition of the first PUSCH transmission comprises:

receiving a slot format indicator (SFI); and

determining that the second slot is a slot identified, by the SFI, as an uplink slot.

17. The UE of claim 14 , wherein the determining that the second slot is available for a repetition of the first PUSCH transmission comprises:

missing a slot format indicator (SFI) having a region of applicability having a beginning and an end and comprising a plurality of slots; and

determining that the second slot occurs later than the end of the region of applicability.

18. The UE of claim 14 , wherein the processing circuit is further configured to:

determine that no slots are available after a last scheduled PUSCH repetition and before an end of a maximum PUSCH transmission duration interval, and

not transmit a PUSCH repetition after the last scheduled PUSCH repetition.

19. The UE of claim 14 , wherein the processing circuit is further configured to:

receive an indication from a network node (gNB) that a third slot is available for a PUSCH repetition;

receive an indication from the gNB that the third slot is not available for a PUSCH repetition; and

determine that the third slot is not available for a PUSCH repetition.

20. A User Equipment (UE), comprising:

means for processing; and

a radio,

the means for processing being configured to:

transmit, in a first slot, a first Physical Uplink Shared Channel (PUSCH) transmission comprising a first set of coded bits selected based on a first redundancy version (RV), the first set of coded bits encoding first data;

determine that a second slot is available for a repetition of the first PUSCH transmission;

determine, a second redundancy version based on the first redundancy version and based on a number of actual PUSCH transmissions corresponding to the first PUSCH transmission, the second redundancy version being different from the first redundancy version; and

transmit, in the second slot, the repetition of the first PUSCH transmission as a second PUSCH transmission based on the second redundancy version, such that the second PUSCH transmission comprises a second set of coded bits encoding all of the first data, the first slot and the second slot being separated by at least one downlink slot.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 30, 2025
From: BAE, JUNG HYUN; KARMOOSE, MOHAMMED
To: SAMSUNG ELECTRONICS CO., LTD.
Reel/Frame 070067/0351 →
Continuity (6)
Continuation 17476415 · Sep 15, 2021
Provisional Application 63182688 · Apr 30, 2021
Provisional Application 63164347 · Mar 22, 2021
Provisional Application 63161225 · Mar 15, 2021
Provisional Application 63092882 · Oct 16, 2020
Related Publication 20240357669A1 · Oct 24, 2024
References Cited (31)
US 10009931B2 · Tabet et al. · 2018 [cited by applicant]
US 10778288B2 · Tsai · 2020 [cited by applicant]
US 11974331B2 · Bae · 2024 [cited by examiner]
US 20140064207A1 · Ramos et al. · 2014 [cited by applicant]
US 20190268947A1 · Zhang et al. · 2019 [cited by applicant]
US 20200052827A1 · Vilaipornsawai · 2020 [cited by examiner]
US 20200052828A1 · Wang · 2020 [cited by examiner]
US 20200267773A1 · Islam · 2020 [cited by examiner]
US 20200336264A1 · Faxér · 2020 [cited by examiner]
US 20210007087A1 · Wei · 2021 [cited by examiner]
US 20210058971A1 · Molavianjazi et al. · 2021 [cited by applicant]
US 20220022208A1 · Nakamura · 2022 [cited by applicant]
US 20220052832A1 · Ersbo · 2022 [cited by applicant]
US 20220053528A1 · Li · 2022 [cited by examiner]
US 20220132533A1 · Taherzadeh Boroujeni · 2022 [cited by examiner]
US 20220132555A1 · Blankenship · 2022 [cited by examiner]
US 20220225389A1 · Go · 2022 [cited by examiner]
US 20220231789A1 · Ying · 2022 [cited by examiner]
US 20220312483A1 · Bae · 2022 [cited by applicant]
US 20230231690A1 · Li · 2023 [cited by applicant]
US 20230291515A1 · Dai · 2023 [cited by applicant]
US 20230328723A1 · Dai · 2023 [cited by examiner]
US 20240032024A1 · Dai · 2024 [cited by examiner]
TW I707558B · 2020 [cited by applicant]
EPO Extended European Search Report dated Mar. 1, 2022, issued in corresponding European U.S. Appl. No. 21/197,708. 7 (12 pages). [cited by applicant]
Ericsson, “PUSCH Enhancements for NR URLLC,” 3GPP ; R1-1908123 PUSCH Enhancements for NR URLLC, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cede… [cited by applicant]
Huawei et al., “PUSCH enhancements for URLLC,” 3GPP ; R1-1910068, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. RAN WG1, No. C… [cited by applicant]
Huawei et al., “PUSCH enhancements for URLLC,” 3GPP ; R1-1911892, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. RAN WG1, No. R… [cited by applicant]
EPO Extended European Search Report dated Mar. 1, 2022, issued in corresponding European Patent Application No. 21197708. 7 (12 pages). [cited by applicant]
CATT: “Remaining issues on multi-TRP/panel transmission,” 3GPP, R1-1912176, 3rd Generation Partnership Project (3GPP), Nov. 2019, 21 pages, Retrieved from the Internet: URL: https://www.3gpp.org/ftp/tsg_ran/WG1_RL1/TSGR… [cited by applicant]
Taiwanese Office Action dated Dec. 10, 2024, issued in corresponding Taiwanese Patent Application No. 110138139 (10 pages). [cited by applicant]