IP Library › Granted Patent US 12,500,802
Granted Patent B2
US 12,500,802 · App. 17/765,910 · Granted Dec 16, 2025

Random access for integrated access and backhaul nodes

Inventors: Boris Dortschy (Hägersten, SE); Erik Dahlman (Stockholm, SE)
Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
H04L27/2605H04W74/0833H04W74/0891
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,500,802
App. No.
17/765,910
Granted
Dec 16, 2025
Kind
B2
Abstract

There is disclosed a method of operating a radio node ( 10, 100, 200 ) in a wireless communication network, the method comprising receiving signaling indicating at least two sets of random access preambles available to access the same cell and/or communication connection; transmitting a random access preamble from one of the sets of random access preambles. The disclosure also pertains to related methods and devices.

Claims (23)

1 . Method of operating a radio node in a wireless communication network, the method comprising

receiving signaling indicating at least two sets of random access preambles available to access the same cell and/or communication connection, wherein the at least two sets correspond to sets with different preamble format, wherein each of the at least two sets of random access preambles is available to use by the radio node, wherein the signaling indicating the at least two sets comprises a synchronization signaling, wherein a first set of the at least two sets correspond to preambles with a shorter format than the preambles of a second set of the at least two sets; and

transmitting a random access preamble from one of the sets of random access preambles.

2 . Non-transitory program product comprising instructions adapted for causing processing circuitry to control and/or perform a method according claim 1 .

3 . Non-transitory carrier medium arrangement carrying and/or storing a program product according to claim 2 .

4 . Radio node for a wireless communication network, the radio node being adapted for receiving signaling indicating at least two sets of random access preambles available to access the same cell and/or communication connection, wherein the at least two sets correspond to sets with different preamble format, wherein each of the at least two sets of random access preambles is available to use by the radio node, wherein the signaling indicating the at least two sets comprises a synchronization signaling, wherein a first set of the at least two sets correspond to preambles with a shorter format than the preambles of a second set of the at least two sets; and

the radio node further being adapted for transmitting a random access preamble from one of the sets of random access preambles.

5 . The radio node according to claim 4 , wherein the at least two sets correspond to sets with different preamble size.

6 . The radio node according to claim 4 , wherein the signaling indicating the at least two sets correspond to broadcast signaling.

7 . The radio node according to claim 4 , wherein the set is selected based on a signal strength of the received signaling.

8 . The radio node according to claim 4 , wherein a random access preamble is based on a Zadoff-Chu sequence.

9 . The radio node according to claim 4 , wherein the transmitted random access preamble is based on a cyclic shift randomly selected.

10 . The radio node according to claim 4 , wherein a first set of the at least two sets correspond to preambles with a smaller size than the preambles of a second set of the at least two sets.

11 . The radio node according to claim 4 , wherein a first set of the at least two sets correspond to preambles with a lower power requirement than the preambles of a second set of the at least two sets.

12 . The radio node according to claim 4 , wherein a first set of the at least two sets correspond to preambles with a lower aggregation level than the preambles of a second set of the at least two sets.

13 . The radio node according to claim 4 , wherein the set is selected based on a signal quality of the received signaling.

14 . The radio node according to claim 4 , wherein a random access preamble is based on a cyclic shift thereof.

15 . Method of operating a network node in a wireless communication network, the method comprising

transmitting signaling indicating at least two sets of random access preambles available to access a cell or communication connection provided by the network node, wherein each of the at least two sets of random access preambles is available to use by the radio node, wherein the signaling indicating the at least two sets comprises a synchronization signaling, wherein a first set of the at least two sets correspond to preambles with a shorter format than the preambles of a second set of the at least two sets; and

transmitting a random access response to a radio node in response to a random access preamble from one of the at least two sets received from and selected by the radio node.

16 . Network node for a wireless communication network, the network node being adapted for

transmitting signaling indicating at least two sets of random access preambles available to access a cell or communication connection provided by the network node, wherein each of the at least two sets of random access preambles is available to use by a radio node, wherein the signaling indicating the at least two sets comprises a synchronization signaling, wherein a first set of the at least two sets correspond to preambles with a shorter format than the preambles of a second set of the at least two sets; and

the network node further being adapted for transmitting a random access response to the radio node in response to a random access preamble from one of the at least two sets received from and selected by the radio node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 1, 2022
From: DAHLMAN, ERIK; DORTSCHY, BORIS
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 059469/0713 →
Continuity (1)
Related Publication 20220377802A1 · Nov 24, 2022
References Cited (32)
US 12267869B2 · Zhang · 2025 [cited by examiner]
US 20080267161A1 · Bertrand · 2008 [cited by examiner]
US 20090156214A1 · Lee · 2009 [cited by examiner]
US 20120170570A1 · Chang · 2012 [cited by examiner]
US 20130208668A1 · Ramos · 2013 [cited by examiner]
US 20130242730A1 · Pelletier · 2013 [cited by examiner]
US 20130258958A1 · Dinan · 2013 [cited by applicant]
US 20140098761A1 · Lee · 2014 [cited by examiner]
US 20160164657A1 · Fan · 2016 [cited by examiner]
US 20160192401A1 · Park et al. · 2016 [cited by applicant]
US 20170094686A1 · Ramamurthi · 2017 [cited by examiner]
US 20170231012A1 · Sung · 2017 [cited by examiner]
US 20180097590A1 · Ly · 2018 [cited by examiner]
US 20180160382A1 · Hou · 2018 [cited by examiner]
US 20180220450A1 · Aiba · 2018 [cited by examiner]
US 20180248668A1 · Hwang · 2018 [cited by examiner]
US 20180324864A1 · Jung · 2018 [cited by examiner]
US 20190253949A1 · Park · 2019 [cited by examiner]
US 20190261425A1 · Park · 2019 [cited by examiner]
US 20200221508A1 · Huang · 2020 [cited by examiner]
US 20200329502A1 · Beale · 2020 [cited by examiner]
US 20200343938A1 · Medina Acosta · 2020 [cited by examiner]
US 20210084690A1 · Ye · 2021 [cited by examiner]
US 20220201647A1 · Choe · 2022 [cited by examiner]
US 20220217781A1 · Decarreau · 2022 [cited by examiner]
US 20240089931A1 · Pan · 2024 [cited by examiner]
US 20240129775A1 · Jung · 2024 [cited by examiner]
EP 2943037A1 · 2015 [cited by applicant]
WO WO2010002303A1 · 2010 [cited by applicant]
PCT International Search Report issued for International application No. PCT/SE2019/050966—Jun. 8, 2020. [cited by applicant]
PCT Written Opinion of the International Searching Authority issued for International application No. PCT/SE2019/050966—Jun. 8, 2020. [cited by applicant]
EPO Communication Pursuant To Article 94(3) EPC issued for Application No. 19 789 793.7-1215—Jun. 18, 2024. [cited by applicant]