IP Library › Granted Patent US 12,369,185
Granted Patent B2
US 12,369,185 · App. 18/540,088 · Granted Jul 22, 2025

Random access method and apparatus, device, and storage medium

Inventors: Chuili Kong (Hangzhou, CN); Gongzheng Zhang (Hangzhou, CN); Yunfei Qiao (Hangzhou, CN); Hejia Luo (Hangzhou, CN)
Assignee: HUAWEI TECHNOLOGIES CO., LTD.
H04W74/002H04L1/0061H04W56/0045H04W56/009H04W74/0833H04W76/11
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,369,185
App. No.
18/540,088
Granted
Jul 22, 2025
Kind
B2
Abstract

A random access method includes sending a random access preamble to a base station on a first time domain resource, obtaining an index value of the first time domain resource, obtaining an index difference between the first time domain resource and a second time domain resource, obtaining an index value of the second time domain resource by adding the index value of the first time domain resource and the index difference, obtaining a random access radio network temporary identifier (RA-RNTI) based on the index value of the second time domain resource, receiving a random access response (RAR) from the base station, and descrambling a cyclic redundancy check (CRC) code of the RAR using the RA-RNTI.

Claims (33)

1. A method, comprising:

receiving, from a base station, broadcast information, wherein the broadcast information is used for determining an index of a first time domain resource;

sending, to the base station, on a second time domain resource, a random-access preamble, wherein the second time domain resource is determined based on the index of the first time domain resource and an offset, wherein the offset is used for obtaining an index difference between the first time domain resource and the second time domain resource, and wherein the offset is carried in a system information block (SIB) from the base station;

obtaining a random access radio network temporary identifier (RA-RNTI) based on the index of the second time domain resource;

receiving, from the base station, a random-access response (RAR); and

descrambling a cyclic redundancy check (CRC) code of the RAR by using the RA-RNTI.

2. The method of claim 1 , wherein the offset is based on a rounding operation on a quotient of dividing a minimum round trip delay (RTD) by a duration, wherein the minimum RTD is based on a shortest distance between the base station and a target cell, and wherein the target cell serves a communication apparatus.

3. The method of claim 2 , wherein the RAR comprises a processed timing advance (TA), wherein the method further comprises calculating, based on the processed TA using a formula, an unprocessed TA when the CRC code of the RAR is successfully descrambled, wherein the formula comprises: TA=TA new +p, wherein TA is the unprocessed TA, wherein TA new is the processed TA, and wherein p is the offset.

4. The method of claim 1 , wherein the RAR comprises a processed timing advance (TA), wherein the method further comprises calculating, based on the processed TA using a formula, an unprocessed TA when the CRC code of the RAR is successfully descrambled, wherein the formula comprises: TA=TA new +RTD rough , wherein TA is the unprocessed TA, wherein TA new is the processed TA, and wherein RTD rough is a rough round trip delay (RTD).

5. The method of claim 1 , wherein the first time domain resource is a first slot of a first physical random-access channel (PRACH).

6. An apparatus, comprising:

a non-transitory memory configured to store instructions; and

one or more processors coupled to the non-transitory memory, wherein the instructions cause the one or more processors to:

receive, from a base station, broadcast information, wherein the broadcast information is used for determining an index of a first time domain resource;

send, to the base station, on a second time domain resource, a random-access preamble, wherein the second time domain resource is determined based on the index of the first time domain resource and an offset, wherein the offset is used for obtaining an index difference between the first time domain resource and the second time domain resource, and wherein the offset is carried in a system information block (SIB) from the base station;

obtain a random access radio network temporary identifier (RA-RNTI) based on the index of the second time domain resource;

receive, from the base station, a random-access response (RAR); and

descramble a cyclic redundancy check (CRC) code of the RAR by using the RA-RNTI.

7. The apparatus of claim 6 , wherein the offset is based on a rounding operation on a quotient of dividing a minimum round trip delay (RTD) by a duration, wherein the minimum RTD is based on a shortest distance between the base station and a target cell, and wherein the target cell serves the apparatus.

8. The apparatus of claim 7 , wherein the RAR comprises a processed timing advance (TA), wherein the one or more processors are further configured to execute the instructions to calculate, based on the processed TA using a formula, an unprocessed TA when the CRC code of the RAR is successfully descrambled, wherein the formula comprises: TA=TA new +p, wherein TA is the unprocessed TA, wherein TA new is the processed TA, and wherein p is the offset.

9. The apparatus of claim 7 , wherein the RAR comprises a processed timing advance (TA), wherein the one or more processors are further configured to execute the instructions to calculate, based on the processed TA using a formula, an unprocessed TA when the CRC of the RAR is successfully descrambled, wherein the formula comprises: TA=TA new +p+1, wherein TA is the unprocessed TA, wherein TA new is the processed TA, and wherein p is the offset.

10. The apparatus of claim 6 , wherein the RAR comprises a processed timing advance (TA), wherein the one or more processors are further configured to execute the instructions to calculate, based on the processed TA using a formula, an unprocessed TA when the CRC code of the RAR is successfully descrambled, wherein the formula comprises: TA=TA new +RTD rough , wherein TA is the unprocessed TA, wherein TA new is the processed TA, and wherein RTD rough is a rough round trip delay (RTD).

11. The apparatus of claim 6 , wherein the first time domain resource is a first slot of a first physical random-access channel (PRACH).

12. A computer program product comprising instructions that are stored on a non-transitory computer-readable storage medium and that, when executed by one or more processors, cause an apparatus to:

receive, from a base station, broadcast information, wherein the broadcast information is used for determining an index of a first time domain resource;

send, to the base station, on a second time domain resource, a random-access preamble, wherein the second time domain resource is determined based on the index of the first time domain resource and an offset, wherein the offset is used for obtaining an index difference between the first time domain resource and the second time domain resource, and wherein the offset is carried in a system information block (SIB) from the base station;

obtain a random access radio network temporary identifier (RA-RNTI) based on the index of the second time domain resource;

receive, from the base station, a random-access response (RAR); and

descramble a cyclic redundancy check (CRC) code of the RAR by using the RA-RNTI.

13. The computer program product of claim 12 , wherein the offset is based on a rounding operation on a quotient of dividing a minimum round trip delay (RTD) by a duration, wherein the minimum RTD is based on a shortest distance between the base station and a target cell, and wherein the target cell serves a communication apparatus.

14. The computer program product of claim 13 , wherein the RAR comprises a processed timing advance (TA), wherein the one or more processors are further configured to execute the instructions to cause the apparatus to calculate, based on the processed TA using a formula, an unprocessed TA when the CRC code of the RAR is successfully descrambled, wherein the formula comprises: TA=TA new +p, wherein TA is the unprocessed TA, wherein TA new is the processed TA, and wherein p is the offset.

15. The computer program product of claim 12 , wherein the RAR comprises a processed timing advance (TA), wherein the one or more processors are further configured to execute the instructions to cause the apparatus to calculate, based on the processed TA using a formula, an unprocessed TA when the CRC code of the RAR is successfully descrambled, wherein the formula comprises: TA=TA new +RTD rough , wherein TA is the unprocessed TA, wherein TA new is the processed TA, and wherein RTD rough is a rough round trip delay (RTD).

16. The computer program product of claim 12 , wherein the first time domain resource is a first slot of a first physical random-access channel (PRACH).

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 14, 2023
From: KONG, CHUILI; ZHANG, GONGZHENG; QIAO, YUNFEI; LUO, HEJIA
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 065873/0347 →
Priority Claims (1)
CN 201811285504.7 · Oct 31, 2018 · national
Continuity (3)
Continuation 17244487 · Apr 29, 2021
Continuation PCTCN2019109579 · Sep 30, 2019
Related Publication 20240205962A1 · Jun 20, 2024
References Cited (45)
US 11140695B1 · Eyuboglu · 2021 [cited by applicant]
US 11206549B1 · Eyuboglu · 2021 [cited by applicant]
US 20090154429A1 · Vaidya et al. · 2009 [cited by applicant]
US 20090316621A1 · Lane et al. · 2009 [cited by applicant]
US 20170013643A1 · Nan et al. · 2017 [cited by applicant]
US 20170150523A1 · Patel · 2017 [cited by examiner]
US 20170374689A1 · Liu et al. · 2017 [cited by applicant]
US 20180092150A1 · Tenny et al. · 2018 [cited by applicant]
US 20180098235A1 · Bagheri et al. · 2018 [cited by applicant]
US 20180124822A1 · Wang et al. · 2018 [cited by applicant]
US 20180184461A1 · Zhang et al. · 2018 [cited by applicant]
US 20180192436A1 · Yi et al. · 2018 [cited by applicant]
US 20180220466A1 · Park et al. · 2018 [cited by applicant]
US 20180234935A1 · Uchiyama · 2018 [cited by applicant]
US 20180263053A1 · Moon · 2018 [cited by applicant]
US 20190098667A1 · Lai et al. · 2019 [cited by applicant]
US 20190260452A1 · Zhang et al. · 2019 [cited by applicant]
US 20200021470A1 · Sun et al. · 2020 [cited by applicant]
US 20200022144A1 · Papasakellariou · 2020 [cited by examiner]
US 20200068597A1 · Ohara et al. · 2020 [cited by applicant]
US 20200092913A1 · Xu · 2020 [cited by examiner]
US 20200236670A1 · Xiong · 2020 [cited by examiner]
US 20200245361A1 · Xiong et al. · 2020 [cited by applicant]
US 20200260495A1 · Kim et al. · 2020 [cited by applicant]
US 20240030975A1 · Cao · 2024 [cited by examiner]
CN 101263671A · 2008 [cited by applicant]
CN 101897229A · 2010 [cited by applicant]
CN 102938931A · 2013 [cited by applicant]
CN 105992383A · 2016 [cited by applicant]
CN 107734514A · 2018 [cited by applicant]
CN 108260108A · 2018 [cited by applicant]
CN 108352979A · 2018 [cited by applicant]
CN 108353430A · 2018 [cited by applicant]
CN 108632179A · 2018 [cited by applicant]
CN 108633102A · 2018 [cited by applicant]
CN 108668361A · 2018 [cited by applicant]
KR 20170037505A · 2017 [cited by applicant]
WO 2018106067A1 · 2018 [cited by applicant]
WO 2018176038A1 · 2018 [cited by applicant]
R1-1811329, Ericsson, On adapting random access procedures for NTN, 3GPP TSG-RAN WG1 Meeting #94bis, Chengdu, China, Oct. 8-12, 2018, 4 pages. [cited by applicant]
R1-1806768, Nokia et al, Considerations on Timing Advance and Random Access for NTN, 3GPP TSG RAN WG1 Meeting #93, Busan, Korea, May 21-25, 2018, 4 pages. [cited by applicant]
3GPP TS 38.321 V15.3.0 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Medium Access Control (MAC) protocol specification(Release 15), Sep. 2018, 76 pages. [cited by applicant]
Andres Laya et al, Efficient Contention Resolution in Highly Dense LTE Networks for Machine Type Communications, 2015 IEEE Global Communications Conference (GLOBECOM), Dec. 6-10, 2015, 7 pages. [cited by applicant]
Chen Kun-shan et al, Random access method for GEO satellite communication system-oriented LTE, Journal of Terahertz Science and Electronic Information Technology, Vo1.11,No. 5, Oct. 2013, 5 pages. [cited by applicant]
Nomor Resarch GMBH, et al., “Considerations on MAC Control Loops and Timings in Non-Terrestrial Networks (NTN),” 3GPP Draft; R2-1813615, Oct. 8-12, 2018, 6 pages. [cited by applicant]