A method of random access preamble format
By employing time-domain and frequency-domain cyclic shifts, the method enhances the flexibility and performance of preamble sequences, addressing inefficiencies in existing wireless communication systems.
Patent Information
- Application Number
- PCT/CN2025/093908
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2025-05-09
- Publication Date
- 2026-11-12
AI Technical Summary
Existing preamble sequence generation methods in wireless communication systems are inefficient and lack flexibility, impacting synchronization and channel estimation performance.
The method involves generating preamble sequences through time-domain and frequency-domain cyclic shifts, optimizing sequence properties across both domains to enhance synchronization and channel estimation.
This approach improves the efficiency and reliability of preamble sequences, making them suitable for various communication environments by tailoring them to specific requirements.
Smart Images

Figure CN2025093908_12112026_PF_FP_ABST
Abstract
Description
A METHOD OF RANDOM ACCESS PREAMBLE FORMATFIELD
[0001] The invention discussed below relates generally to wireless communication, and more particularly, to methods of preamble design for random access.BACKGROUND
[0002] In the realm of wireless communication, the generation of preamble sequences is a critical aspect that significantly impacts the performance of various communication protocols. Preamble sequences are used for synchronization, channel estimation, and other essential functions in communication systems. This document outlines several innovative methods for generating preamble sequences, leveraging both time-domain (TD) and frequency-domain (FD) cyclic shifts. These methods aim to enhance the efficiency and reliability of preamble sequences in different communication scenarios.SUMMARY
[0003] The following presents a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated aspects, and is intended to neither identify key or critical elements of all aspects nor delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a preclude to the more detailed description that is presented later.
[0004] In one aspect, the document presents a method for generating preamble sequences based on time-domain (TD) sequences with time-domain cyclic shifts. This approach focuses on enhancing the sequence properties within the time domain to improve synchronization and channel estimation in wireless communication systems.
[0005] In another aspect, the document introduces a method that combines time-domain sequences with both time-domain and frequency-domain (FD) cyclic shifts. This dual-domain manipulation allows for more flexible and robust preamble sequence generation, optimizing the sequences for various communication environments.
[0006] In yet another aspect, the document describes a method for generating preamble sequences based on frequency-domain sequences with time-domain cyclic shifts. This approach leverages the spectral characteristics of frequency-domain sequences and enhances them through time-domain adjustments, making them suitable for scenarios where frequency-domain properties are crucial.
[0007] In a further aspect, the document outlines a comprehensive method that combines frequency-domain sequences with both time-domain and frequency-domain cyclic shifts. This method ensures maximum flexibility and performance by optimizing the sequences across both domains, tailoring them to meet specific requirements of different communication protocols.
[0008] To the accomplishment of the foregoing and related ends, the one or more aspects comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed figures set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects may be employed, and this description is intended to include all such aspects and their equivalents.BRIEF DESCRIPTION OF THE DRAWINGS
[0009] FIG. 1 illustrates an exemplary diagram of preamble generation order Option 1.DETAILED DESCRIPTION
[0010] The detailed description set forth below in connection with the appended drawings is intended as a description of various configurations and is not intended to represent the only configurations in which the concepts described herein may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details. In some instances, well known structures and components are shown in block diagram form in order to avoid obscuring such concepts.
[0011] Several aspects of telecommunication systems will now be presented with reference to various apparatus and methods. These apparatus and methods will be described in the following detailed description and illustrated in the accompanying drawings by various blocks, components, circuits, processes, algorithms, etc. (collectively referred to as “elements” ) . These elements may be implemented using electronic hardware, computer software, or any combination thereof. Whether such elements are implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system.
[0012] Before this disclosure, it should be noted that the base sequence used for preamble generation is at least one of the following: M (max length) sequence, Gold sequence, Z4 sequence, ZC sequence, sequence generated via Golomb ruler, a pseudo random sequence, and etc..
[0013] In one aspect of the disclosure, the method of preamble sequence generation method based on TD sequence is proposed. More specifically, we propose to consider the following alternative:
[0014] Proposal #1: preamble sequence generation method based on TD sequence Option 1: With sequence cyclic shift in TD
[0015] The set of random-access preambles xu, tv (n) shall be generated according to xu, tv (n) =xu ( (n+Ctv) mod LRA) , n=0, 1, 2, …, LRA-1 xu (i) =seq (i) , i=0, 1, 2, …, LRA-1
[0016] where the sequence seq of length LRA is a sequence of good cross-correlation and / or auto-correlation property, the Ctv is the cyclic shift value in time domain.
[0017] The cyclic shift value Ctv is given by
[0018] The value of Ntcs is given by a predefined table or calculated via certain formular (s) . The frequency domain representation shall be generated according to
[0019] Where LRA is the sequence length, depending on the pre-defined or pre-configured PRACH preamble format.
[0020] Option 2: With sequence cyclic shift in FD
[0021] The set of random-access preambles xu, fv (n) shall be generated according to xu (i) =seq (i) , i=0, 1, 2, …, LRA-1
[0022] where the sequence seq of length LRA is a sequence of good cross-correlation and / or auto-correlation property, the Cfv is the cyclic shift value in frequency domain.
[0023] The cyclic shift value Cfv is given by
[0024] The value of Nfcs is given by a predefined table or calculated via certain formular (s) . The frequency domain representation shall be generated according to
[0025] Where LRA is the sequence length, depending on the pre-defined or pre-configured PRACH preamble format.
[0026] Option 3: With sequence cyclic shift in TD and FD
[0027] The set of random-access preambles xu, tv, fv (n) shall be generated according to xu (i) =seq (i) , i=0, 1, 2, …, LRA-1
[0028] where the sequence seq of length LRA is a sequence of good cross-correlation and / or auto-correlation property, the Ctv is the cyclic shift value in time domain, the Cfv is the cyclic shift value in frequency domain.
[0029] The cyclic shift value Ctv is given by
[0030] The cyclic shift value Cfv is given by
[0031] The value of Ntcs and Nfcs are given by a predefined table or calculated via certain formular (s) . The frequency domain representation shall be generated according to
[0032] Where LRA is the sequence length, depending on the pre-defined or pre-configured PRACH preamble format.
[0033] In another aspect of the disclosure, the method of preamble sequence generation method based on FD sequence is proposed. More specifically, we propose to consider the following alternative:
[0034] Proposal #2: preamble sequence generation method based on FD sequence Option 1: With sequence cyclic shift in TD
[0035] The set of random-access preambles xu, tv (n) shall be generated according to xu (i) =seq (i) , i=0, 1, 2, …, LRA-1
[0036] where the sequence seq of length LRA is a sequence of good cross-correlation and / or auto-correlation property, the Ctv is the cyclic shift value in time domain.
[0037] The cyclic shift value Ctv is given by
[0038] The value of Ntcs is given by a predefined table or calculated via certain formular (s) . The frequency domain representation shall be generated according to yu, tv (n) =xu, tv (n)
[0039] Where LRA is the sequence length, depending on the pre-defined or pre-configured PRACH preamble format.
[0040] Option 2: With sequence cyclic shift in FD
[0041] The set of random-access preambles xu, fv (n) shall be generated according to xu, fv (n) =xu ( (n+Cfv) mod LRA) , , n=0, 1, 2, …, LRA-1 xu(i) =seq (i) , i=0, 1, 2, …, LRA-1
[0042] where the sequence seq of length LRA is a sequence of good cross-correlation and / or auto-correlation property, the Cfv is the cyclic shift value in frequency domain.
[0043] The cyclic shift value Cfv is given by
[0044] The value of Nfcs is given by a predefined table or calculated via certain formular (s) . The frequency domain representation shall be generated according to yu, fv (n) =xu, fv (n)
[0045] Where LRA is the sequence length, depending on the pre-defined or pre-configured PRACH preamble format.
[0046] Option 3: With sequence cyclic shift in TD and FD
[0047] The set of random-access preambles xu, tv, fv (n) shall be generated according to xu (i) =seq (i) , i=0, 1, 2, …, LRA-1
[0048] where the sequence seq of length LRA is a sequence of good cross-correlation and / or auto-correlation property, the Ctv is the cyclic shift value in time domain, the Cfv is the cyclic shift value in frequency domain.
[0049] The cyclic shift value Ctv is given by
[0050] The cyclic shift value Cfv is given by
[0051] The value of Ntcs and Nfcs are given by a predefined table or calculated via certain formular (s) . The frequency domain representation shall be generated according to yu, tv, fv (n) =xu, tv, fv (n)
[0052] Where LRA is the sequence length, depending on the pre-defined or pre-configured PRACH preamble format.
[0053] In another aspect of the disclosure, the method of preamble sequence generation order is proposed. More specifically, we propose to consider the following alternative:
[0054] Proposal #3: preamble sequence generation order
[0055] For preamble sequence generation method with sequence cyclic shift in TD
[0056] Option 1: 1st TD cyclic shift of a logical root, 2nd logical root sequence index
[0057] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing cyclic shift Ctv of a logical root, and then in increasing order of the logical root sequence index. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence, are obtained from the root sequences with the consecutive logical indexes until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0058] Option 2: 1st logical root sequence index, 2nd TD cyclic shift of a logical root
[0059] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing the logical root sequence index, and then in increasing order of cyclic shift Ctv of the logical roots. The preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single cyclic shift Ctv, are obtained from the consecutive cyclic shift Ctv value until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured. For preamble sequence generation method with sequence cyclic shift in FD Option 1: 1st FD cyclic shift of a logical root, 2nd logical root sequence index
[0060] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing cyclic shift Cfv of a logical root, and then in increasing order of the logical root sequence index. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence, are obtained from the root sequences with the consecutive logical indexes until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0061] Option 2: 1st logical root sequence index, 2nd FD cyclic shift of a logical root
[0062] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing the logical root sequence index, and then in increasing order of cyclic shift Cfv of the logical roots. The preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single cyclic shift Cfv, are obtained from the consecutive cyclic shift Cfv value until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0063] For preamble sequence generation method with sequence cyclic shift in TD and FD
[0064] Option 1: 1st TD cyclic shift of a logical root, 2nd FD cyclic shift of a logical root, and 3rd logical root sequence index
[0065] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing cyclic shift Ctv of a logical root with a cyclic shift Cfv, second in increasing order of cyclic shift Cfv of a logical root, and then in increasing order of the logical root sequence index. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence, are obtained from the root sequences with the consecutive logical indexes until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0066] Option 2: 1st FD cyclic shift of a logical root, 2nd TD cyclic shift of a logical root, and 3rd logical root sequence index
[0067] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing cyclic shift Cfv of a logical root with a cyclic shift Ctv, second in increasing order of cyclic shift Ctv of a logical root, and then in increasing order of the logical root sequence index. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence, are obtained from the root sequences with the consecutive logical indexes until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0068] Option 3: 1st TD cyclic shift of a logical root, 2nd logical root sequence index, and 3rd FD cyclic shift of a logical root
[0069] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing cyclic shift Ctv of a logical root with cyclic shift Cfv, second in increasing order of logical root sequence index with cyclic shift Cfv, and then in increasing order of the cyclic shift Cfv of the logical roots. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence and a single cyclic shift Cfv, are obtained from the root sequences with the consecutive logical indexes and consecutive cyclic shift Cfv until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0070] Option 4: 1st FD cyclic shift of a logical root, 2nd logical root sequence index, and 3rd TD cyclic shift of a logical root
[0071] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing cyclic shift Cfv of a logical root with cyclic shift Ctv, second in increasing order of logical root sequence index with cyclic shift Ctv, and then in increasing order of the cyclic shift Ctv of the logical roots. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence and a single cyclic shift Ctv, are obtained from the root sequences with the consecutive logical indexes and consecutive cyclic shift Ctv until all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0072] Option 5: 1st logical root sequence index, 2nd TD cyclic shift of a logical root, and 3rd FD cyclic shift of a logical root
[0073] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing logical root sequence index with cyclic shift Ctv and Cfv, second in increasing order of cyclic shift Ctv of a logical root with cyclic shift Cfv, and then in increasing order of the cyclic shift Cfv of the logical roots. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence and a single cyclic shift Ctv or Cfv, are obtained from the root sequences with the consecutive logical indexes and consecutive cyclic shift Ctv or Cfvuntil all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0074] Option 6: 1st logical root sequence index, 2nd FD cyclic shift of a logical root, and 3rd TD cyclic shift of a logical root
[0075] · The preambles defined in each time-frequency occasion, enumerated in increasing order of first increasing logical root sequence index with cyclic shift Ctv and Cfv, second in increasing order of cyclic shift Cfv of a logical root with cyclic shift Ctv, and then in increasing order of the cyclic shift Ctv of the logical roots. Additional preamble sequences, in case M (apre-defined or pre-configured value of the number of total preamble indexes) preambles cannot be generated from a single root sequence and a single cyclic shift Ctv or Cfv, are obtained from the root sequences with the consecutive logical indexes and consecutive cyclic shift Ctv or Cfvuntil all the M sequences are found. The logical root sequence order is cyclic; the logical index 0 is consecutive to the max logical index. The mapping rule of the logical root sequence index to initial root sequence index is obtained from a predefined table or pre-configured.
[0076] Example of the preamble generation order Option 1 (1st TD cyclic shift of a logical root, 2nd FD cyclic shift of a logical root, and 3rd logical root sequence index) can be descripted as figure 1.For the case of Ntcs=10, Nfcs=15, total preamble sequence root number = 33 (u=0~32) , M = 64, LRA=31, logical root index starts from 0:
[0077] Other aspects:
[0078] · It should be noted that TD sequence represents for a sequence located in time domain, which is similar with a sequence resource mapped in frequency domain (e.g., sequence xu, tv etc. ) and using modulation method of DFT-s-OFDM.
[0079] · It should be noted that FD sequence represents for a sequence located in frequency domain, which is similar with a sequence resource mapped in frequency domain (e.g., sequence xu, tv etc. ) and using modulation method of OFDM.
[0080] · The sequence or root sequence mentioned in this disclosure is a sequence of good cross-correlation and / or auto-correlation property, is but not limited to M sequences, Gold sequences, Z4 sequences (a4-phase sequence) , ZC sequences, Costas sequences, pseudo random sequences, , sequence generated via Golomb ruler, etc.
[0081] · The Ntcs and Nfcs is configured by network, RRC, MAC CE, DCI or SIB (s) . The Ntcs and Nfcs is chosen from a predefined table or calculated via certain pre-defined formular (s) .
[0082] · A preamble may include one or multiple times of preamble sequence (s) .
[0083] The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but is to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more. ” The word “exemplary” is used herein to mean “serving as an example, instance, or illustration. ” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects. Unless specifically stated otherwise, the term “some” refers to one or more. Combinations such as “at least one of A, B, or C, ” “one or more of A, B, or C, ” “at least one of A, B, and C, ” “one or more of A, B, and C, ” and “A, B, C, or any combination thereof” include any combination of A, B, and / or C, and may include multiples of A, multiples of B, or multiples of C. Specifically, combinations such as “at least one of A, B, or C, ” “one or more of A, B, or C, ” “at least one of A, B, and C, ” “one or more of A, B, and C, ” and “A, B, C, or any combination thereof” may be A only, B only, C only, A and B, A and C, B and C, or A and B and C, where any such combinations may contain one or more member or members of A, B, or C. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. The words “module, ” “mechanism, ” “element, ” “UE, ” and the like may not be a substitute for the word “means. ” As such, no claim element is to be construed as a means plus function unless the element is expressly recited using the phrase “means for. ”
[0084] While aspects of the present disclosure have been described in conjunction with the specific embodiments thereof that are proposed as examples, alternatives, modifications, and variations to the examples may be made. Accordingly, embodiments as set forth herein are intended to be illustrative and not limiting. There are changes that may be made without departing from the scope of the claims set forth below.
Claims
1.A method of random access preamble format design.2.The method of claim 1, wherein the preamble is generated based on a TD or FD sequence.3.The method of claim 2, wherein the preamble is generated based on cyclic shift in TD.4.The method of claim 2, wherein the preamble is generated based on cyclic shift in FD.5.The method of claim 2, wherein the preamble is generated based on cyclic shift in TD and FD.6.The method of claim 1, wherein the preamble generation order.7.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD the preamble generation order is in increasing order of 1st TD cyclic shift of a logical root, 2nd logical root sequence index.8.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD the preamble generation order is in increasing order of 1st logical root sequence index, 2nd TD cyclic shift of a logical root.9.The method of claim 6 wherein for the case of the preamble is with cyclic shift in FD the preamble generation order is in increasing order of 1st FD cyclic shift of a logical root, 2nd logical root sequence index.10.The method of claim 6, wherein for the case of the preamble is with cyclic shift in FD the preamble generation order is in increasing order of 1st logical root sequence index, 2nd FD cyclic shift of a logical root.11.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD and FD the preamble generation order is in increasing order of 1st TD cyclic shift of a logical root, 2nd FD cyclic shift of a logical root, and 3rd logical root sequence index.12.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD and FD the preamble generation order is in increasing order of 1st FD cyclic shift of a logical root, 2nd TD cyclic shift of a logical root, and 3rd logical root sequence index.13.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD and FD the preamble generation order is in increasing order of 1st TD cyclic shift of a logical root, 2nd logical root sequence index, and 3rd FD cyclic shift of a logical root.14.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD and FD the preamble generation order is in increasing order of 1st FD cyclic shift of a logical root, 2nd logical root sequence index, and 3rd TD cyclic shift of a logical root.15.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD and FD the preamble generation order is in increasing order of 1st logical root sequence index, 2nd TD cyclic shift of a logical root, and 3rd FD cyclic shift of a logical root.16.The method of claim 6, wherein for the case of the preamble is with cyclic shift in TD and FD the preamble generation order is in increasing order of 1st logical root sequence index, 2nd FD cyclic shift of a logical root, and 3rd TD cyclic shift of a logical root.17.The method of claim 1, wherein the sequence or root sequence mentioned in this disclosure is a sequence of good cross-correlation and / or auto-correlation property, is but not limited to M sequences, Gold sequences, Z4 sequences (a 4-phase sequence) , ZC sequences, Costas sequences, pseudo random sequences, sequence generated via Golomb ruler, etc.18.The method of claim 1, wherein the The Ntcs and Nfcs is configured by network, RRC, MAC CE, DCI or SIB (s) . The Ntcs and Nfcs is chosen from a predefined table or calculated via certain pre-defined formular (s) .
