IP Library Granted Patent US 12,382,504
Granted Patent B2
US 12,382,504 · App. 17/931,545 · Granted Aug 5, 2025

RACH response preamble reduction

Inventor: Ido Shaked (Alfei Menashe, IL)
Assignee: Parallel Wireless, Inc.
H04W74/0833
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,382,504
App. No.
17/931,545
Granted
Aug 5, 2025
Kind
B2
Abstract

A method is disclosed for reducing processor utilization at a cellular base station, comprising: sending a number of random access preambles in a System Information Block (SIB) that may be less than 64; subtracting the number of random access preambles from 64 to obtain a ceiling of dedicated preambles; and using root sequences to generate a number of dedicated preambles less than or equal to the number of random access preambles, thereby reducing processor utilization relative to generating 64 preambles.

Claims (18)

1. A method for reducing processor utilization at a cellular base station, comprising:

sending a number of random access preambles in a System Information Block (SIB) that is less than 64;

subtracting the number of random access preambles from 64 to obtain a ceiling of dedicated preambles; and

using root sequences to generate a number of dedicated preambles less than or equal to the number of random access preambles,

thereby reducing processor utilization relative to generating 64 preambles.

2. The method of claim 1 , wherein the cellular base station is a Long Term Evolution (LTE) eNodeB, the SIB is SIB 2 , and the number of random access preambles is numberOfRA−Preambles.

3. The method of claim 1 , further comprising configuring, by an operator, a number of random access preambles based on a deployment use case.

4. The method of claim 1 , further comprising computing a desired number of random access preambles based on a deployment use case.

5. The method of claim 1 , further comprising computing a desired number of random access preambles based on a desired cell range.

6. A non-transitory computer-readable medium containing instructions for reducing processor utilization at a cellular base station, which, when executed, cause the cellular base station to perform steps comprising:

sending a number of random access preambles in a System Information Block (SIB) that is less than 64;

subtracting the number of random access preambles from 64 to obtain a ceiling of dedicated preambles; and

using root sequences to generate a number of dedicated preambles less than or equal to the number of random access preambles,

thereby reducing processor utilization relative to generating 64 preambles.

7. The non-transitory computer-readable medium of claim 6 , wherein the cellular base station is a Long Term Evolution (LTE) eNodeB, the SIB is SIB2, and the number of random access preambles is numberOfRA−Preambles.

8. The non-transitory computer-readable medium of claim 6 , further comprising instructions for configuring, by an operator, a number of random access preambles based on a deployment use case.

9. The non-transitory computer-readable medium of claim 6 , further comprising instructions for computing a desired number of random access preambles based on a deployment use case.

10. The non-transitory computer-readable medium of claim 6 , further comprising instructions for computing a desired number of random access preambles based on a desired cell range.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 25, 2025
From: SHAKED, IDO
To: PARALLEL WIRELESS, INC.
Reel/Frame 070625/0901 →
Continuity (3)
Continuation In Part 17845952 · Jun 21, 2022
Provisional Application 63242522 · Sep 10, 2021
Related Publication 20230084936A1 · Mar 16, 2023
References Cited (15)
US 9420582B2 · Hooli et al. · 2016 [cited by applicant]
US 9924542B2 · Eriksson et al. · 2018 [cited by applicant]
US 20130286958A1 · Liang · 2013 [cited by examiner]
US 20150156760A1 · Yu · 2015 [cited by examiner]
US 20160119887A1 · Charipadi · 2016 [cited by examiner]
US 20160174261A1 · Yang et al. · 2016 [cited by applicant]
US 20170078933A1 · Li et al. · 2017 [cited by applicant]
US 20190075593A1 · Mauritz · 2019 [cited by examiner]
US 20190327764A1 · Yoo · 2019 [cited by examiner]
US 20200288503A1 · Sahlin · 2020 [cited by examiner]
US 20200351853A1 · Xiong et al. · 2020 [cited by applicant]
US 20220408496A1 · Abramovsky · 2022 [cited by examiner]
US 20230292378A1 · Xu · 2023 [cited by examiner]
US 20230389084A1 · Belleschi · 2023 [cited by examiner]
Mashud et al.: “Zadoff-Chu sequence design for random access initial uplink synchronization”, Apr. 6, 2016. [cited by applicant]