IP Library › Granted Patent US 12,267,186
Granted Patent B2
US 12,267,186 · App. 18/471,589 · Granted Apr 1, 2025

Preamble matrix

Inventors: Aliye Kaya (Murray Hill, NJ); Luiz Fernando Medeiros (Espoo, FI)
Assignee: Nokia Solutions and Networks Oy
H04L25/0204H04L5/0048H04L25/0224
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,267,186
App. No.
18/471,589
Granted
Apr 1, 2025
Kind
B2
Abstract

Disclosed is a method comprising generating a preamble matrix comprising a plurality of entries, wherein at least a subset of the plurality of entries indicate random-access preambles; obtaining a sequence encoded with the preamble matrix; and transmitting the sequence to one or more user devices.

Claims (80)

1. An apparatus comprising at least one processor, and at least one memory storing instructions which, when executed by the at least one processor, cause the apparatus at least to:

receive a sequence from a network element of a radio access network, wherein the sequence is encoded with a preamble matrix comprising a plurality of entries, wherein at least a subset of the plurality of entries indicate random-access preambles, and the preamble matrix has been generated randomly or based on a plurality of network entities or user equipment;

decode the sequence, wherein the sequence is decoded by using a decoder that was trained by:

creating a first matrix comprising a plurality of random-access preamble sets;

selecting a sample batch from the first matrix;

inputting the sample batch to an encoder with at least one neural network layer;

receiving a sequence as an output from the encoder, wherein the sequence is encoded with the sample batch;

inputting the sequence to the decoder with at least one neural network layer;

receiving a second matrix as an output from the decoder;

determining a binary cross-entropy loss comparing the sample batch and the second matrix;

propagating the binary cross-entropy loss to the decoder and the encoder via an optimizer; and

repeating the selection of the sample batch, the inputting of the sample batch, the receiving of the sequence, the inputting of the sequence, the receiving of the second matrix, the determining, and the propagating until the binary cross-entropy loss is below a threshold;

generate a root sequence and a cyclic shift based at least partly on the decoding;

generate a random-access preamble based on the root sequence and the cyclic shift; and

transmit the random-access preamble to the network element.

2. The apparatus according to claim 1 , wherein rows of the preamble matrix indicate cyclic shifts of the random-access preambles and columns of the preamble matrix indicate root sequences of the random-access preambles, or the rows indicate the root sequences and the columns indicate the cyclic shifts.

3. The apparatus according to claim 1 , wherein the plurality of entries comprises at least two sets of values or symbols, and the subset comprises one set of values or symbols from the at least two sets of values or symbols.

4. The apparatus according to claim 1 , wherein the decoding comprises mapping the sequence to the preamble matrix,

wherein the apparatus is further caused to:

select an entry from the at least subset of the plurality of entries comprised in the preamble matrix,

wherein the root sequence and the cyclic shift are generated based on a column and a row of the entry in the preamble matrix.

5. The apparatus according to claim 1 , wherein the decoding comprises generating the root sequence and the cyclic shift from the sequence.

6. A method comprising:

receiving a sequence from a network element of a radio access network, wherein the sequence is encoded with a preamble matrix comprising a plurality of entries, wherein at least a subset of the plurality of entries indicate random-access preambles, and the preamble matrix has been generated randomly or based on a plurality of network entities or user equipment;

decoding the sequence, wherein the sequence is decoded by using a decoder that was trained by:

creating a first matrix comprising a plurality of random-access preamble sets;

selecting a sample batch from the first matrix;

inputting the sample batch to an encoder with at least one neural network layer;

receiving a sequence as an output from the encoder, wherein the sequence is encoded with the sample batch;

inputting the sequence to the decoder with at least one neural network layer;

receiving a second matrix as an output from the decoder;

determining a binary cross-entropy loss comparing the sample batch and the second matrix;

propagating the binary cross-entropy loss to the decoder and the encoder via an optimizer; and

repeating the selection of the sample batch, the inputting of the sample batch, the receiving of the sequence, the inputting of the sequence, the receiving of the second matrix, the determining, and the propagating until the binary cross-entropy loss is below a threshold;

generating a root sequence and a cyclic shift based at least partly on the decoding;

generating a random-access preamble based on the root sequence and the cyclic shift; and

transmitting the random-access preamble to the network element.

7. The method according to claim 6 , wherein rows of the preamble matrix indicate cyclic shifts of the random-access preambles and columns of the preamble matrix indicate root sequences of the random-access preambles, or the rows indicate the root sequences and the columns indicate the cyclic shifts.

8. The method according to claim 6 , wherein the plurality of entries comprises at least two sets of values or symbols, and the subset comprises one set of values or symbols from the at least two sets of values or symbols.

9. The method according to claim 6 , wherein the decoding comprises mapping the sequence to the preamble matrix,

wherein the method further comprises:

selecting an entry from the at least subset of the plurality of entries comprised in the preamble matrix,

wherein the root sequence and the cyclic shift are generated based on a column and a row of the entry in the preamble matrix.

10. The method according to claim 6 , wherein the decoding comprises generating the root sequence and the cyclic shift from the sequence.

11. A non-transitory computer readable medium comprising program instructions which, when executed by an apparatus, cause the apparatus to perform at least the following:

receiving a sequence from a network element of a radio access network, wherein the sequence is encoded with a preamble matrix comprising a plurality of entries, wherein at least a subset of the plurality of entries indicate random-access preambles, wherein the preamble matrix has been generated randomly or based on a plurality of network entities or user equipment;

decoding the sequence, wherein the sequence is decoded by using a decoder that was trained by:

creating a first matrix comprising a plurality of random-access preamble sets;

selecting a sample batch from the first matrix;

inputting the sample batch to an encoder with at least one neural network layer;

receiving a sequence as an output from the encoder, wherein the sequence is encoded with the sample batch;

inputting the sequence to the decoder with at least one neural network layer;

receiving a second matrix as an output from the decoder;

determining a binary cross-entropy loss comparing the sample batch and the second matrix;

propagating the binary cross-entropy loss to the decoder and the encoder via an optimizer; and

repeating the selection of the sample batch, the inputting of the sample batch, the receiving of the sequence, the inputting of the sequence, the receiving of the second matrix, the determining, and the propagating until the binary cross-entropy loss is below a threshold;

generating a root sequence and a cyclic shift based at least partly on the decoding;

generating a random-access preamble based on the root sequence and the cyclic shift; and

transmitting the random-access preamble to the network element.

12. The non-transitory computer readable medium according to claim 11 , wherein rows of the preamble matrix indicate cyclic shifts of the random-access preambles and columns of the preamble matrix indicate root sequences of the random-access preambles, or the rows indicate the root sequences and the columns indicate the cyclic shifts.

13. A system comprising at least one or more user devices and a network element of a radio access network;

wherein the network element is configured to:

generate a preamble matrix comprising a plurality of entries, wherein at least a subset of the plurality of entries indicate random-access preambles, and the preamble matrix is generated randomly or based on a plurality of network entities or user equipment;

obtain a sequence encoded with the preamble matrix; and

transmit the sequence to the one or more user devices;

wherein the one or more user devices are configured to:

receive the sequence from the network element;

decode the sequence, wherein the sequence is decoded by using a decoder that was trained by:

creating a first matrix comprising a plurality of random-access preamble sets;

selecting a sample batch from the first matrix;

inputting the sample batch to an encoder with at least one neural network layer;

receiving a sequence as an output from the encoder, wherein the sequence is encoded with the sample batch;

inputting the sequence to the decoder with at least one neural network layer;

receiving a second matrix as an output from the decoder;

determining a binary cross-entropy loss comparing the sample batch and the second matrix;

propagating the binary cross-entropy loss to the decoder and the encoder via an optimizer; and

repeating the selection of the sample batch, the inputting of the sample batch, the receiving of the sequence, the inputting of the sequence, the receiving of the second matrix, the determining, and the propagating until the binary cross-entropy loss is below a threshold;

generate a root sequence and a cyclic shift based at least partly on the decoding;

generate a random-access preamble based on the root sequence and the cyclic shift; and

transmit the random-access preamble to the network element.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 2, 2024
From: KAYA, ALIYE
To: NOKIA OF AMERICA CORPORATION
Reel/Frame 065990/0258 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 2, 2024
From: FERNANDO MEDEIROS, LUIZ
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 065990/0261 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 2, 2024
From: NOKIA OF AMERICA CORPORATION
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 065990/0264 →
Priority Claims (1)
FI 20225823 · Sep 22, 2022 · national
Continuity (1)
Related Publication 20240106682A1 · Mar 28, 2024
References Cited (29)
US 20050249319A1 · Suh · 2005 [cited by examiner]
US 20080235314A1 · Lee · 2008 [cited by examiner]
US 20120294185A1 · Queseth et al. · 2012 [cited by applicant]
US 20180070381A1 · Lei · 2018 [cited by examiner]
US 20200229244A1 · Yan et al. · 2020 [cited by applicant]
US 20200396774A1 · Thota et al. · 2020 [cited by applicant]
US 20220046713A1 · Park et al. · 2022 [cited by applicant]
US 20220094413A1 · Park et al. · 2022 [cited by applicant]
US 20220104230A1 · Yoshimura et al. · 2022 [cited by applicant]
US 20240008098A1 · Fan · 2024 [cited by examiner]
CN 101873712B · 2013 [cited by applicant]
CN 111447160A · 2020 [cited by applicant]
CN 111629445A · 2020 [cited by applicant]
CN 113348721A · 2021 [cited by applicant]
CN 113972939A · 2022 [cited by applicant]
CN 114467358A · 2022 [cited by applicant]
WO 2018201966A1 · 2018 [cited by applicant]
WO 2020173282A1 · 2020 [cited by applicant]
Pitaval et al., “Overcoming 5G PRACH Capacity Shortfall by Combining Zadoff-Chu and M-Sequences”, IEEE International Conference on Communications (ICC), May 20-24, 2018, 6 pages. [cited by applicant]
Vural et al., “Dynamic Preamble Subset Allocation for RAN Slicing in 5G Networks”, IEEE Access, vol. 6, Jan. 31, 2018, pp. 13015-13032. [cited by applicant]
Hwang et al., “Dynamic RACH Preamble Allocation Scheme”, International Conference on Information and Communication Technology Convergence (ICTC), Oct. 28-30, 2015, pp. 770-772. [cited by applicant]
Gedikli, “Artificial Intelligence Based Flexible Preamble Allocation for Radio Access Network Slicing in 5G Networks”, Thesis, Graduate School of Science and Engineering of Hacettepe University, Jun. 2021, 126 pages. [cited by applicant]
Office Action received for corresponding Finnish Patent Application No. 20225823, dated Feb. 16, 2023, 15 pages. [cited by applicant]
Mostafa et al., “Aggregate Preamble Sequence Design and Detection for Massive IoT With Deep Learning”, IEEE Transactions on Vehicular Technology, vol. 70, No. 4, Apr. 2021, pp. 3800-3816. [cited by applicant]
Office Action received for corresponding Finnish Patent Application No. 20225823, dated Aug. 15, 2023, 12 pages. [cited by applicant]
Extended European Search Report for corresponding EP Application No. 23198455.0, dated Feb. 26, 2024. [cited by applicant]
Panasonic, et al., “RACH sequence allocation and indication to the cell”, 3GPP TSG RAN WG1 Meeting #49bis, Orlando, FL, USA, Jun. 25-29, 2007, R1-072800, 9 pages. [cited by applicant]
Texas Instruments, “Random Access Preamble L1 Parameters in E-UTRA”, 3GPP TSG RAN WG1 #49bis, Orlando, FL, USA, Jun. 25-29, 2007, R1-072838, 5 pages. [cited by applicant]
Office action received for corresponding Chinese Patent Application No. 202311226683.8, dated Nov. 20, 2024, 9 pages of office action and 4 pages of translation/summary available. [cited by applicant]