Preamble transmission method and apparatus, device, and medium

Abstract

The present application relates to the field of communications, and discloses a preamble transmission method and apparatus, a device, and a medium. The method is executed by a terminal device. The method comprises: sending a preamble sequence, the preamble sequence being one of first sequences, wherein the types of the first sequences include at least one of the following: m sequences; Gold sequences; and Walsh sequences. By means of a low-complexity preamble sequence, random access, uplink synchronization and frequency offset estimation that have low power consumption are implemented, thereby providing the possibility of preamble transmission for some communication scenarios in which OFDM waveforms are difficult to be used.

Description

Preamble code transmission method, device, equipment and medium Technical Field

[0001] The present application relates to the field of communications, and in particular to a method, apparatus, device, and medium for transmitting a preamble code. Background Art

[0002] Some communication devices, due to their low complexity, struggle to transmit common Orthogonal Frequency-Division Multiplexing (OFDM) signals. The commonly used ZC sequence used to generate OFDM signals is no longer suitable. Furthermore, for some communication devices, transmitting OFDM signals is not an optimal option due to operating frequency band limitations.

[0003] For these communication devices that are not suitable for OFDM signals, the need to send a preamble still exists. However, there is currently no feasible solution for designing a preamble with a non-OFDM waveform for communication devices that are not suitable for OFDM signals.

[0004] Summary of the Invention

[0005] The present application provides a method, apparatus, device, and medium for transmitting a preamble, which at least includes:

[0006] According to one aspect of an embodiment of the present application, a preamble transmission method is provided, the method being performed by a terminal device, the method comprising:

[0007] A preamble sequence is sent, where the preamble sequence is one of first sequences; wherein a type of the first sequence includes at least one of the following: an m sequence; a Gold sequence; or a Walsh sequence.

[0008] According to another aspect of an embodiment of the present application, a preamble transmission method is provided, the method being performed by a network device, the method comprising:

[0009] A preamble sequence is received, where the preamble sequence is one of first sequences; wherein a type of the first sequence includes at least one of the following: an m-sequence; a Gold sequence; or a Walsh sequence.

[0010] According to another aspect of an embodiment of the present application, a preamble code transmission device is provided, the device including:

[0011] The sending module is used to send a preamble code sequence, where the preamble code sequence is one of the first sequences; wherein the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[0012] According to another aspect of an embodiment of the present application, a preamble code transmission device is provided, the device including:

[0013] The receiving module is configured to receive a preamble sequence, where the preamble sequence is one of the first sequences; wherein the type of the first sequence includes at least one of the following: an m sequence; a Gold sequence; or a Walsh sequence.

[0014] According to one aspect of an embodiment of the present application, a communication device is provided, the communication device including:

[0015] a processor; a receiver and / or a transmitter connected to the processor; a memory for storing executable instructions for the processor;

[0016] Wherein, the communication device is used to implement the preamble code transmission method as described above.

[0017] According to another aspect of an embodiment of the present application, a communication device is provided, the communication device comprising: a receiver and / or a transmitter;

[0018] Wherein, the communication device is used to implement the preamble code transmission method as described above.

[0019] According to one aspect of the present application, a computer-readable storage medium is provided, in which executable instructions are stored. The executable instructions are loaded and executed by the processor to implement the preamble code transmission method as described in the above aspect.

[0020] According to one aspect of the present application, a computer program product is provided, which includes computer instructions, the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes to implement the preamble code transmission method as described in the above aspect.

[0021] According to one aspect of the present application, a chip is provided, which includes a programmable logic circuit and / or program instructions, and when the chip is running, is used to implement the preamble code transmission method as described in the above aspects.

[0022] According to one aspect of the present application, a computer program is provided, which includes computer instructions. A processor of a computer device executes the computer instructions, so that the computer device executes the preamble code transmission method as described in the above aspect.

[0023] The technical solutions provided by the embodiments of the present application may have the following beneficial effects:

[0024] Since the first sequence is of the type of m-sequence, gold sequence or Walsh sequence, and is composed of "0" and "1", it is very easy to combine with non-OFDM waveforms such as OOK waveform, PSK waveform, FSK waveform, etc., which provides the possibility of transmitting preamble codes for some communication scenarios where OFDM waveforms are difficult to use. For some low-power devices, if a preamble code sequence belonging to the first sequence is sent, uplink synchronization, random access and time-frequency offset estimation can be achieved while maintaining the good characteristics of low complexity and low power consumption. For terminal devices operating in the millimeter wave frequency band, the first sequence has the advantages of simple generation, easy implementation, and power saving. Combined with the characteristics of high reliability and narrow beam of millimeter wave transmission, the preamble code sequence belonging to the first sequence can meet the needs of uplink synchronization, random access, time-frequency offset estimation, etc. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0026] FIG1 shows a schematic diagram of a wireless communication system provided by an exemplary embodiment of the present application;

[0027] FIG2 shows a schematic diagram of a communication system provided by an exemplary embodiment of the present application;

[0028] FIG3 shows a schematic diagram of radio frequency energy harvesting provided by an exemplary embodiment of the present application;

[0029] FIG4 is a schematic diagram showing a backscatter communication process provided by an exemplary embodiment of the present application;

[0030] FIG5 shows a schematic diagram of resistive load modulation provided by an exemplary embodiment of the present application;

[0031] FIG6 shows a schematic diagram of an encoding method provided by an exemplary embodiment of the present application;

[0032] FIG7 shows a schematic diagram of generating an m-sequence provided by an exemplary embodiment of the present application;

[0033] FIG8 shows a schematic diagram of generating an m-sequence provided by an exemplary embodiment of the present application;

[0034] FIG9 shows a schematic diagram of a process of transmitting a preamble provided by an exemplary embodiment of the present application;

[0035] FIG10 shows a schematic diagram of a process of transmitting a preamble provided by an exemplary embodiment of the present application;

[0036] FIG11 shows a schematic diagram of cyclic shift provided by an exemplary embodiment of the present application;

[0037] FIG12 shows a schematic diagram of preamble transmission provided by an exemplary embodiment of the present application;

[0038] FIG13 is a schematic diagram showing a flow chart of a preamble transmission method provided by an exemplary embodiment of the present application;

[0039] FIG14 shows a schematic diagram of a simulation of preamble transmission provided by an exemplary embodiment of the present application;

[0040] FIG15 is a schematic diagram showing a flow chart of a preamble transmission method provided by an exemplary embodiment of the present application;

[0041] FIG16 is a schematic diagram showing a flow chart of a method for transmitting a preamble provided by an exemplary embodiment of the present application;

[0042] FIG17 is a schematic diagram showing a preamble transmission method provided by an exemplary embodiment of the present application;

[0043] FIG18 shows a structural block diagram of a preamble transmission device provided by an exemplary embodiment of the present application;

[0044] FIG19 shows a structural block diagram of a preamble transmission device provided by an exemplary embodiment of the present application;

[0045] FIG20 shows a schematic structural diagram of a communication device provided by an exemplary embodiment of the present application;

[0046] FIG21 shows a schematic structural diagram of a communication device provided by an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0047] To make the objectives, technical solutions, and advantages of the present application more clear, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings. Exemplary embodiments will be described in detail herein, with examples shown in the accompanying drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Instead, they are merely examples of devices and methods consistent with certain aspects of the present application, as detailed in the appended claims.

[0048] The terms used in this application are for the purpose of describing specific embodiments only and are not intended to limit this application. As used in this application and the appended claims, the singular forms "a," "an," "the," and "the" are intended to include the plural forms, unless the context clearly indicates otherwise. It should also be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.

[0049] It should be understood that although the terms first, second, third, etc. may be used in this application to describe various information, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from each other. For example, without departing from the scope of this application, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Depending on the context, the word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

[0050] 1 shows a schematic diagram of a wireless communication system provided by an exemplary embodiment of the present application. The wireless communication system includes a network device 110 and a terminal device 120, and / or a terminal device 120 and a terminal device 130, which are not limited in the present application.

[0051] The network device 110 in the present application provides wireless communication functions, and the network device 110 includes but is not limited to: Evolved Node B (eNB), Radio Network Controller (RNC), Node B (NB), Base Station Controller (BSC), Base Transceiver Station (BTS), Home Base Station (e.g., Home Evolved Node B, or Home Node B, HNB), Baseband Unit (BBU), Access Point (AP) in Wireless Fidelity (Wi-Fi) system, Wireless Relay Node, Wireless Backhaul Node, Transmission Point (TP) or Transmission and Reception Point (TRP), etc., and can also be the Next Generation Node B (NGNB) in the 5th Generation (5G) mobile communication system. B, gNB) or transmission point (TRP or TP), or one or a group of (including multiple antenna panels) antenna panels of a base station in a 5G system, or it can also be a network node constituting a gNB or transmission point, such as a baseband unit (BBU) or distributed unit (DU), or a base station in a Beyond Fifth Generation (B5G) mobile communication system or a sixth generation (6G) mobile communication system, or a core network (CN), fronthaul, backhaul, radio access network (RAN), network slice, etc., or a reader / writer of a radio frequency identification (RFID) system.

[0052] The terminal device 120 and / or terminal device 130 in this application are also called user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, and user device. The terminals include, but are not limited to, handheld devices, wearable devices, vehicle-mounted devices, and Internet of Things devices, such as electronic tags, controllers, mobile phones, tablet computers, e-book readers, laptop computers, desktop computers, televisions, game consoles, mobile Internet devices (MIDs), augmented reality (AR) terminals, virtual reality (VR) terminals, and mixed reality (MR) terminals, wearable devices, handles, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, wireless terminals in remote medical surgery, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loops (WLANs), and wireless terminals in industrial control. Loop (WLL) stations, personal digital assistants (PDA), TV set-top boxes (STB), customer premises equipment (CPE), etc.

[0053] In some embodiments, the network device 110 and the terminal device 120 communicate with each other via some air interface technology, such as a Uu interface.

[0054] In some embodiments, there are two communication scenarios between the network device 110 and the terminal device 120: uplink communication scenario and downlink communication scenario. Uplink communication refers to sending signals to the network device 110; downlink communication refers to sending signals to the terminal device 120.

[0055] In some embodiments, the terminal device 120 and the terminal device 130 communicate with each other via some direct communication interface, such as a PC5 interface.

[0056] In some embodiments, there are two communication scenarios between terminal device 120 and terminal device 130: a first sideline communication scenario and a second sideline communication scenario. The first sideline communication refers to sending signals to terminal device 130, while the second sideline communication refers to sending signals to terminal device 120.

[0057] In some embodiments, terminal device 120 and terminal device 130 are both within the network coverage and located in the same cell, or terminal device 120 and terminal device 130 are both within the network coverage but located in different cells, or terminal device 120 is within the network coverage but terminal device 130 is outside the network coverage.

[0058] The technical solutions provided in the embodiments of the present application can be applied to various communication systems, such as: Global System of Mobile communication (GSM) system, Code Division Multiple Access (CDMA) system, Wideband Code Division Multiple Access (WCDMA) system, General Packet Radio Service (GPRS), Long Term Evolution (LTE) system, LTE Frequency Division Duplex (FDD) system, LTE Time Division Duplex (TDD) system, Advanced Long Term Evolution (LTE-A) system, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication system, 5G mobile communication system, New Radio (NR) system, NR system evolution system, LTE on unlicensed spectrum (LTE-U) system, NR on unlicensed spectrum (NR-based access to unlicensed spectrum) system. Unlicensed spectrum, NR-U) system, terrestrial communication network (Terrestrial Networks, TN) system, non-terrestrial communication network (Non-Terrestrial Networks, NTN) system, wireless local area network (Wireless Local Area Networks, WLAN), wireless fidelity (Wireless Fidelity, Wi-Fi), cellular Internet of Things system, cellular passive Internet of Things system, ambient power Internet of Things (Ambient Power Enabled Internet of Things, Ambient IoT / A-IoT) system, zero power Internet of Things system, can also be applied to the subsequent evolution system of the 5G NR system, and can also be applied to B5G, 6G and subsequent evolution systems. In some embodiments of the present application, "NR" may also be referred to as a 5G NR system or a 5G system.Among them, the 5G mobile communication system may include non-standalone networking (NSA) and / or standalone networking (SA).

[0059] The technical solutions provided in the embodiments of the present application can also be applied to machine type communication (MTC), long term evolution technology for machine-to-machine communication (LTE-M), device-to-device (D2D) network, machine-to-machine (M2M) network, Internet of Things (IoT) network or other networks. Among them, the IoT network can include, for example, the Internet of Vehicles. Among them, the communication mode in the Internet of Vehicles system is collectively referred to as vehicle to other devices (Vehicle to X, V2X, X can represent anything), for example, the V2X can include: vehicle to vehicle (V2V) communication, vehicle to infrastructure (V2I) communication, vehicle to pedestrian communication (V2P) or vehicle to network (V2N) communication, etc.

[0060] The wireless communication system provided in this embodiment can be applied to, but is not limited to, at least one of the following communication scenarios: an uplink communication scenario, a downlink communication scenario, and a sidelink communication scenario.

[0061] Low-power devices:

[0062] In some embodiments, the terminal device 120 shown in FIG. 1 is implemented as a low-power device.

[0063] A low-power device may also be referred to as at least one of the following: an ultra-low-power device, a zero-power device, a Passive IoT device, or an Ambient Power Enabled Internet of Things (Ambient IoT / A-IoT) device.

[0064] The communication technology implemented by low-power devices can also be called at least one of the following: zero-power communication technology, ultra-low-power communication technology, low-power communication technology, ambient energy Internet of Things (Ambient IoT / A-IoT) technology, passive Internet of Things technology, and zero-power Internet of Things technology.

[0065] Low-power devices can harvest energy from the environment (such as radio frequency energy, solar energy, light energy, thermal energy, mechanical energy, kinetic energy, etc.) to obtain energy for communication. Generally speaking, based on the energy source and usage method, low-power devices can be divided into the following three types:

[0066] (1) Passive devices; Passive devices do not require built-in batteries. When a passive device approaches a network device (such as the reader of an RFID system), the passive device is within the near field formed by the radiation of the network device antenna. Therefore, the passive device antenna generates an induced current through electromagnetic induction, and the induced current drives the low-power chip circuit of the passive device. This realizes the demodulation of the forward link signal and the modulation of the backward link signal. For the backscatter link, the passive device can use backscatter or extremely low-power active transmission to transmit the signal. Passive devices do not require built-in batteries to drive either the forward link or the reverse link. Therefore, passive devices can be considered as zero-power devices.

[0067] In addition to not requiring batteries, the RF circuits and baseband circuits of passive devices are also very simple. For example, they do not require components such as LNA, power amplifier (PA), crystal oscillator, analog to digital converter (ADC), etc., which makes passive devices have many advantages such as small size, light weight, very low price, and long service life.

[0068] Passive devices can also support other energy harvesting methods by harvesting energy from the environment (such as solar energy, light energy, thermal energy, kinetic energy, mechanical energy, etc.) to obtain energy for driving circuits, thereby achieving communication.

[0069] (2) Semi-passive devices: Semi-passive devices do not have conventional batteries installed on them. They can use radio frequency energy harvesting modules to harvest radio wave energy, or use energy harvesting modules to harvest energy from the environment (such as solar energy, light energy, thermal energy, kinetic energy, mechanical energy, etc.), and store the harvested energy in an energy storage unit (such as a capacitor). After the energy storage unit obtains energy, it can drive the low-power chip circuit of the semi-passive device. It can realize the demodulation of the forward link signal and the modulation of the backward link signal. For the backscatter link, the semi-passive device can use backscattering to transmit the signal. The semi-passive device can also have the ability to actively transmit, that is, in addition to communicating through backscattering, the backward link can also use active transmission to communicate.

[0070] Semi-passive devices do not require built-in batteries to drive either the forward link or the reverse link. Although they use energy stored in capacitors, this energy comes from radio energy or ambient energy collected by the energy harvesting module. Therefore, semi-passive devices can be considered zero-power devices.

[0071] Semi-passive devices inherit many advantages of passive devices, such as small size, light weight, very low price, long service life, etc.

[0072] (3) Active devices: Active devices can have built-in batteries. The battery is used to drive the low-power chip circuit of the active device to realize the demodulation of the forward link signal and the modulation of the reverse link signal. The reverse link signal transmission of the active device does not need to consume the active device's own power, and the reverse link transmission is realized by backscattering, thereby achieving the effect of zero power consumption. The active device can also have the ability to actively transmit, that is, in addition to communicating by backscattering, the reverse link can also use active transmission to communicate.

[0073] Despite having built-in batteries, these active devices have extremely low power consumption and complexity, allowing the battery capacity to be set within a narrow range, resulting in lower cost and size. The built-in battery in the active device can also serve as an energy storage unit, storing ambient energy collected by the energy harvesting module. This reduces the maintenance cycle of the active device, or even makes it maintenance-free.

[0074] Active devices use built-in batteries to increase their communication range, for example, by increasing the read / write distance of electronic tags, thereby improving communication reliability. Therefore, active devices are used in scenarios where communication distance and read latency are relatively high.

[0075] In terms of communication methods, low-power devices can support backscatter and / or active transmission communication methods. Generally speaking, based on the transmitter type, low-power devices can be divided into the following three types:

[0076] (1) Low-power devices based on backscattering: These devices use the backscattering method described above for uplink data transmission. These devices do not have an active transmitter for active transmission, but only a backscattering transmitter. Therefore, when these devices transmit uplink data, they need network equipment to provide a carrier. These devices use backscattering based on the carrier to achieve uplink data transmission.

[0077] (2) Low-power devices based on active transmitters: These devices use active transmitters with active transmission capabilities for uplink data transmission. Therefore, when sending uplink data, these devices can use their own active transmitters to send uplink data without the need for network equipment to provide a carrier. Active transmitters suitable for this type of device can be, for example, ultra-low-power ASK transmitters and ultra-low-power FSK transmitters. Based on current implementations, when transmitting a 100-microwatt signal, the overall power consumption of these transmitters can be reduced to 400-600 microwatts.

[0078] (3) Low-power devices with both backscatter and active transmitters: These devices can support both backscatter and active transmitters. They can determine whether to use backscatter or active transmitters based on different situations (such as different power levels, different available environmental energy levels), or based on the scheduling of network devices.

[0079] Fig. 2 shows a communication system 200 provided by an exemplary embodiment of the present application. The communication system 200 includes a network device 110 and a terminal device 120 that is a low-power device.

[0080] The terminal device 120, which is a low-power device, includes an energy harvesting module 321. Optionally, in addition to the energy harvesting module 321, the terminal device 120 also includes a backscatter communication module 322. Optionally, in addition to the energy harvesting module 321, the terminal device 120 also includes a logic processing module 323. Exemplarily, the logic processing module 323 includes a low-power computing module. Optionally, in addition to the energy harvesting module 321, the terminal device 120 also includes a sensor module 324. Optionally, in addition to the energy harvesting module 321, the terminal device 120 also includes a memory (not shown in the figure). Optionally, in addition to the energy harvesting module 321, the terminal device 120 also includes one or more of a backscatter communication module 322, a logic processing module 323, a sensor module 324 and a memory.

[0081] Exemplarily, the energy collection module 321 can collect energy carried by radio waves in space, or light energy, or kinetic energy, or mechanical energy, or solar energy, etc., to provide energy for driving the various modules of the terminal device 120. After the terminal device 120 obtains energy, it can receive a signal from the network device 110 through a receiver, or reflect a signal to the network device 110 through the backscatter communication module 322, or transmit a signal to the network device 110 through a transmitter (not shown in the figure). The data reflected or transmitted by the terminal device 120 can be data stored by itself (such as an identity or pre-written information, such as the production date, brand, manufacturer, etc. of the product). The sensor module 324 can include various sensors, and the terminal device 120 can report the data collected by various sensors based on a low-power mechanism. The memory is used to store some basic information (such as item identification, etc.) or obtain sensor data such as ambient temperature and ambient humidity.

[0082] The terminal device 120 can use the logic processing module 323 to implement simple signal demodulation, decoding or encoding, modulation and other simple computing tasks, and the hardware design can be very simple, making the terminal device 120 very low in cost and small in size.

[0083] It should be understood that the modules included in the terminal device 120 shown in FIG2 are merely examples and not limiting.

[0084] Figure 3 shows a schematic diagram of radio frequency power harvesting (RFP) performed by energy harvesting module 321. RF energy harvesting is based on the principle of electromagnetic induction. The RF module (RF) uses electromagnetic induction, connected in parallel with a capacitor (C) and a load resistor (RL), to harvest electromagnetic wave energy from space. This energy is used to power low-power devices, such as demodulators, modulators, sensors, and memory readers. This allows low-power devices to be powered without traditional batteries.

[0085] Figure 4 shows a schematic diagram of backscatter communication module 322 performing backscatter communication. Terminal device 120 receives wireless signal carrier 131 transmitted by network device 110's transmitter (TX) module 111 using amplifier (AMP) 112. Terminal device 120 modulates wireless signal carrier 131, loads the information to be transmitted using logic processing module 323, and harvests radio frequency energy using energy harvesting module 321. Terminal device 120 radiates modulated reflected signal 132 using antenna 316. This information transmission process is called backscatter communication. Network device 110's receiver (RX) module 113 receives modulated reflected signal 132 using low-noise amplifier (LNA) 114. Backscatter and load modulation are closely related. Load modulation achieves modulation by adjusting and controlling the circuit parameters of the terminal device 120's oscillator circuit according to the data stream's rhythm, causing parameters such as the impedance of the terminal device 120 to change accordingly.

[0086] Load modulation technology mainly includes resistive load modulation and capacitive load modulation. Figure 5 shows a schematic diagram of resistive load modulation. In resistive load modulation, the load resistor RL is connected in parallel with the third resistor R3, and the switch S based on binary code control is turned on or off. The on and off of the third resistor R3 will cause the voltage on the circuit to change. The load resistor RL maintains a parallel connection relationship with the first capacitor C1, the load resistor RL maintains a series connection relationship with the second resistor R2, and the second resistor R2 maintains a series connection relationship with the first inductor L1. The first inductor L1 is coupled with the second inductor L2, and the second inductor L2 maintains a series connection relationship with the second capacitor C2. For example, amplitude shift keying (ASK) can be implemented, that is, the amplitude of the backscattered signal of the terminal device is adjusted to achieve signal modulation and transmission. Similarly, in capacitive load modulation, the resonant frequency of the circuit can be changed by turning the capacitor on and off, realizing frequency shift keying (FSK), that is, the operating frequency of the backscattered signal of the terminal device is adjusted to achieve signal modulation and transmission.

[0087] The terminal device 120 can perform information modulation on the incoming signal by means of load modulation, thereby realizing the backscatter communication process.

[0088] Therefore, low-power devices have the following significant advantages: (1) They do not need to actively transmit signals, so they do not require complex RF links such as PAs and RF filters; (2) They do not need to actively generate high-frequency signals, so they do not need high-frequency crystal oscillators; (3) With the help of backscatter communication, signal transmission does not require its own energy consumption.

[0089] Figure 6 is a schematic diagram of the encoding method used by the wireless communication system shown in Figure 1 or the communication system shown in Figure 2. Data transmitted in the wireless communication system shown in Figure 1 or the communication system shown in Figure 2 can use different forms of codes to represent binary "1" and "0", that is, use different pulse signals to represent "0" and "1". The following encoding methods are introduced here:

[0090] · Non-Return to Zero (NRZ) encoding: Non-Return to Zero encoding uses a high level to represent a binary "1" and a low level to represent a binary "0". Figure 6 shows a level diagram of binary data 101100101001011 encoded using the NRZ method.

[0091] Manchester encoding: Manchester encoding is also known as split-phase coding. In Manchester encoding, a binary value is represented by a change in level (rising or falling) during half a bit period within the bit length. A negative transition during half a bit period represents a binary "1," and a positive transition during half a bit period represents a binary "0." Manchester encoding is often used for data transmission from low-power devices to network devices when using carrier load modulation or backscatter modulation, as it facilitates detection of data transmission errors. This is because Manchester encoding does not allow for a "no change" state within the bit length. When multiple low-power devices simultaneously transmit data bits with different values, the received rising and falling edges cancel each other, resulting in an uninterrupted carrier signal throughout the entire bit length. Since this state is not allowed, network devices can use this error to determine the specific location of the collision. Figure 6 shows a schematic diagram of the levels of the binary data 101100101001011 encoded using the Manchester method.

[0092] Unipolar Return to Zero (URZ) encoding: In URZ encoding, a high level in the first half of a bit period represents a binary "1," while a low level signal throughout the entire bit period represents a binary "1." Figure 6 shows a level diagram of binary data 101100101001011 encoded using the URZ method.

[0093] Differential Binary Phase (DBP) encoding: In DBP encoding, any edge within half a bit period represents a binary "0," while the absence of an edge represents a binary "1." Furthermore, the voltage level is inverted at the beginning of each bit period. This makes it easier for the receiver to reconstruct the bit clock. Figure 6 shows a voltage level diagram for the binary data 101100101001011 encoded using the DBP method.

[0094] Miller encoding: In Miller encoding, any edge within half a bit period represents a binary "1," while a constant level throughout the next bit period represents a binary "0." The level transition at the beginning of a bit period makes it easier for the receiver to reconstruct the bit clock. Figure 6 shows a schematic diagram of the levels of the binary data 101100101001011 encoded using the Miller method.

[0095] Differential encoding: In differential encoding, each binary "1" to be transmitted causes a change in the signal level, while for binary "0", the signal level remains unchanged.

[0096] It should be noted that the above encoding methods are examples of encoding methods that can be adopted by the wireless communication system shown in FIG. 1 or the communication system shown in FIG. 2 , but are not limiting.

[0097] Due to its significant advantages such as extremely low cost, extremely low power consumption, and small size, the communication system shown in Figure 2 can be widely used in various industries, such as logistics for vertical industries, smart warehousing, smart agriculture, energy and electricity, industrial Internet, etc.; it can also be applied to personal applications such as smart wearables and smart homes.

[0098] For example, it is applied to at least the following four scenarios: (1) object recognition, such as logistics, production line product management, and supply chain management; (2) environmental monitoring, such as temperature, humidity, and harmful gas monitoring of working environments and natural environments; (3) positioning, such as indoor positioning, intelligent object search, and production line item positioning; (4) intelligent control, such as intelligent control of various electrical appliances in smart homes (turning on and off air conditioners, adjusting temperatures), and intelligent control of various facilities in agricultural greenhouses (automatic irrigation and fertilization).

[0099] Random Access:

[0100] After the cell search process, the terminal device has achieved downlink synchronization with the cell, so the terminal device can receive downlink data. However, the terminal device can only perform uplink transmission after achieving uplink synchronization with the cell. The terminal device can establish a connection with the cell and obtain uplink synchronization through the Random Access Procedure (RAR). In other words, through random access, the terminal device can obtain uplink synchronization and obtain the unique identifier assigned to it by the network device, namely the Cell Radio Network Temporary Identity (C-RNTI). Therefore, random access can be used not only in initial access, but also in the case of user uplink synchronization loss.

[0101] The random access process can usually be triggered by one of the following six types of triggering events:

[0102] (1) Initial Access: The terminal device will enter the RRC connected state (RRC_CONNECTED) from the Radio Resource Control (RRC) idle state (RRC_IDLE state).

[0103] (2) Handover: When a terminal device needs to establish uplink synchronization with a new cell, it needs to initiate random access in the new cell.

[0104] (3) RRC Connection Re-establishment: The terminal device re-establishes the wireless connection after a Radio Link Failure (RLF) occurs.

[0105] (4) In the RRC connected state, when downlink data arrives, the uplink is in an "out-of-sync" state. At this time, after the downlink data arrives, the terminal device needs to respond with an Acknowledgement (ACK) or a Negative Acknowledgement (NACK).

[0106] (5) In the RRC connected state, when uplink data arrives, the uplink is in an "out-of-sync" state or there is no available Physical Uplink Control Channel (PUCCH) resource for Scheduling Request (SR) transmission.

[0107] When uplink data arrives, for example, when a measurement report needs to be reported or data needs to be sent, if the uplink is in an "out-of-sync" state, the terminal device can initiate a random access process; or, if the terminal device that is already in an uplink synchronization state is allowed to use a random access channel (RACH) to replace the role of SR, then when the uplink is in an "out-of-sync" state, the terminal device can initiate a random access process.

[0108] (6) In the RRC connected state, timing advance (TA) is required for positioning. In addition, random access may be triggered by RRC_INACTIVE transition, request for other system information (OSI), or beam failure recovery.

[0109] The 4-step random access process may include the following four steps: Step 1, the terminal device sends Msg 1; Step 2, the network device sends Msg 2; Step 3, the terminal device sends Msg 3; Step 4, the network device sends Msg 4.

[0110] Step 1: The terminal device sends Msg 1 to the network device to inform the network device that the terminal device has initiated a random access request. Msg 1 carries a Random Access Preamble (RAP), also known as a random access preamble, preamble, or preamble. Msg 1 also allows the network device to estimate the transmission delay between it and the terminal device and calibrate the uplink time.

[0111] Step 2: After receiving Msg 1 sent by the terminal device, the network device sends Msg 2, a Random Access Response (RAR) message, to the terminal device. The Msg 2 can be scrambled by the Random Access Radio Network Temporary Identity (RA-RNTI). The terminal device can monitor the PDCCH within the RAR window to receive the RAR message scrambled with the RA-RNTI (without considering the possible measurement gap).

[0112] If the terminal device does not receive a RAR message from the network device within the RAR window, the random access is considered to have failed. If the terminal device successfully receives a RAR message within the RAR window and the index of the preamble carried in the RAR message is the same as the index of the preamble in Msg 1 sent by the terminal device, the terminal device can stop monitoring RAR messages. The terminal device uses the RA-RNTI to descramble the RAR message.

[0113] The RAR message may include corresponding messages for multiple terminal devices that send preamble codes, wherein the response message for each terminal device includes the index of the preamble code used by the terminal device (RAPID), resource allocation information of Msg 3, time advance (TA) adjustment information, and temporary cell-radio network temporary identity (TC-RNTI), etc.

[0114] In the NR standard, the RAR message can be scheduled using the downlink control information (DCI) format (DCI format) 1-0, and the PDCCH that schedules the RAR message can be scrambled using the above-mentioned RA-RNTI.

[0115] Step 3: After receiving the RAR message, the terminal device determines whether the RAR message belongs to itself. For example, the terminal device can use the preamble code to verify whether it is the RAR message belonging to itself. After confirming that it is the RAR message belonging to itself, the terminal device generates Msg 3 at the RRC layer and sends Msg 3 to the network device. The Msg 3 needs to carry the terminal device's identification information.

[0116] For different random access triggering events, the Msg 3 sent by the terminal device in step 3 of the 4-step random access process may include different content.

[0117] For example, in the initial access scenario, Msg 3 includes an RRC Connection Request message generated by the RRC layer, which carries at least the Non-Access Stratum (NAS) identification information of the terminal device. In addition, Msg 3 may also carry, for example, the Serving-Temporary Mobile Subscriber Identity (S-TMSI) or a random number of the terminal device.

[0118] For another example, in the RRC connection reestablishment scenario, Msg 3 includes an RRC Connection Re-establishment Request message generated by the RRC layer and does not carry any NAS messages. In addition, Msg 3 may also carry, for example, the Cell Radio Network Temporary Identifier (C-RNTI) and Protocol Control Information (PCI).

[0119] For another example, in a handover scenario, Msg 3 includes an RRC Handover Confirm message generated by the RRC layer, which carries the C-RNTI of the terminal device. In addition, Msg 3 may also carry information such as a Buffer Status Report (BSR). For other triggering events, such as the arrival of uplink / downlink data, Msg 3 must at least include the C-RNTI of the terminal device.

[0120] It should be noted that uplink transmissions typically use terminal-specific information, such as the C-RNTI, to scramble data carried on the Uplink Shared Channel (UL-SCH). However, the conflict has not yet been resolved, so Msg 3 cannot be scrambled based on the C-RNTI, and only the TC-RNTI can be used.

[0121] Step 4: The network device sends Msg 4 to the terminal device, and the terminal device correctly receives Msg 4 to complete contention resolution. For example, during the RRC connection establishment process, Msg 4 can carry the RRC connection establishment message.

[0122] Because the terminal device in step 3 carries its own unique identifier in Msg 3, such as C-RNTI or identification information from the core network (such as S-TMSI or a random number), the network device will carry the terminal device's unique identifier in Msg 4 during the contention resolution mechanism to specify the terminal device that won the contention. Other terminal devices that did not win the contention resolution will re-initiate random access. The PDCCH in Msg 4 can be scrambled using the TC-RNTI.

[0123] In the 5G system, when performing random access, the terminal device can use the 2-step random access method in addition to the above-mentioned 4-step random access method. One possible method is to send the messages Msg 1 and Msg 3 in the 4-step random access process as the first message in the 2-step random access process; and send Msg 2 and Msg 4 in the 4-step random access process as the second message in the 2-step random access process.

[0124] The 2-step random access process may include the following two steps: Step 1, the terminal device sends a first message; Step 2, the network device sends a second message.

[0125] Step 1: The first message (temporarily referred to as "New Msg 1 (New_Msg 1)") may include a preamble and uplink data. The uplink data may be carried on an uplink channel, which may be, for example, a physical uplink shared channel (Physical Uplink Shared Channel, PUSCH). The uplink channel may, for example, carry identification information of the terminal device and the reason for the RRC request. The first message is similar to part or all of the information carried in Msg 1 and Msg 3 in the 4-step random access process.

[0126] Step 2: If the network device successfully receives the first message sent by the terminal device, it sends a second message to the terminal device. This second message (temporarily referred to as "New_Msg 2") may include, for example, conflict resolution information, C-RNTI allocation information, TA adjustment information, etc. This second message is similar to some or all of the information carried in Msg 2 and Msg 4 in the four-step random access process.

[0127] In the 2-step random access process, the second message carries conflict resolution information for a single terminal device (including information related to the terminal device's identity sent by the terminal device in the first message), C-RNTI allocation information, TA adjustment information, etc. In addition, the second message may also carry RRC resume information, etc.

[0128] Preamble:

[0129] The preamble is a message that the terminal device uses to initiate random access. The preamble can be the first message in the random access process. Therefore, it can be considered that the preamble is used to implement random access of the terminal device.

[0130] Random access is a necessary process for establishing a wireless link between a terminal device and a network device. The terminal device must send a preamble to request access from the network and wait for the network to grant uplink resources before it can transmit uplink data on channels other than the Random Access Channel (RACH). Therefore, whether establishing a Radio Resource Control (RRC) connection, reestablishing an RRC connection, or performing a cell handover, the terminal device must send a preamble to initiate random access.

[0131] Furthermore, because data transmission over the air interface takes time, if a terminal device wishes to send uplink data, it should send it in advance according to the scheduled time interval (TA) so that the data reaches the network at the intended time. This means that the terminal device must maintain uplink synchronization with the network equipment; otherwise, serious intra-cell interference and inter-symbol interference (ISI) will occur. This crucial uplink synchronization is also achieved through random access. In addition to uplink time domain synchronization, the preamble also enables uplink frequency synchronization (also known as frequency offset estimation) and wireless channel estimation. Some positioning processes also require the terminal device to send a preamble.

[0132] As a low-power terminal device, low-power devices naturally also have the need to send preambles for random access and uplink synchronization. However, the low complexity of low-power devices makes it difficult to support the transmission of common Orthogonal Frequency-Division Multiplexing (OFDM) waveforms. Therefore, it is also difficult for low-power devices to send preambles using OFDM waveforms for random access and maintain uplink time-frequency synchronization.

[0133] Therefore, in some scenarios where it is difficult to send OFDM signals, there is no feasible solution for sending preamble codes, but the demand for various terminal devices to send preamble codes is very urgent.

[0134] To this end, the present application provides a preamble transmission method, apparatus, device, and medium that support a terminal device to send a preamble sequence belonging to a first sequence to implement one or more of random access, uplink synchronization, frequency offset estimation, etc. The first sequence is generated based on a binary sequence.

[0135] The binary sequence referred to in this application refers to a sequence of sequence elements that have only two possible values. This can also be understood as meaning that each bit in the binary sequence has only two possible values. For example, any bit in a pseudo-noise (PN) sequence, an m-sequence, or a gold sequence can have a value of "1" or "0."

[0136] Three types of binary sequences are introduced here: m-sequence, gold sequence, and Walsh sequence.

[0137] m-sequence:

[0138] An m-sequence is the longest code sequence generated by a multi-stage shift register or its delay element through linear feedback. It is also known as the longest linear feedback shift register sequence or the maximum-length sequence. The number of shift register stages can be understood as the number of shift registers. The sequence currently stored in a shift register is called a state. After the shift register outputs a bit and the feedback function adds one bit, the shift register moves to the next state.

[0139] In a binary shift register, if r is the number of stages of the shift register, there are 2 stages of the r-stage shift register. r states, excluding the all-0 state, there are 2 r -1 state, so the maximum length of the code sequence it can generate is 2 r -1 bit, that is, the longest period generated by an r-stage linear feedback shift register is equal to 2 r -1.

[0140] First, let's introduce the linear feedback shift register. Figure 7 shows a general schematic diagram of the linear feedback shift register. Assume that the initial state of the shift register is (a0a1…a r-2 a r-1 ). After one shift linear feedback, the input of the first stage on the left side of the shift register is shown in the following formula (1).

[0141] If the shift is performed f times, the input of the first stage on the left side of the shift register is as shown in the following formula (2).

[0142] Here, e = r + f - 1 ≥ r, and f = 1, 2, 3, .... Thus, the input to the first stage of the shift register is affected by the feedback logic and the initial state of the shift register. Equation (2) is called the recursive relation for an r-stage linear feedback shift register.

[0143] Referring to the recursive relationship described in formula (2), depending on the initial state, the r-level shift register can generate 2 r -1 non-constant zero sequence. Therefore, the maximum length of the code sequence that can be generated by an r-level linear feedback shift register is 2 r -1 bit, that is, the longest period of the sequence generated by an r-level linear feedback shift register is equal to 2 r -1.

[0144] The following formula (3) is called the characteristic polynomial of the r-stage linear feedback shift register, which can be used to describe the feedback connection state of the r-stage linear feedback shift register. i If it exists, it means c i =1, otherwise c i =0, the value of x itself has no practical meaning. i The value of determines the feedback link of the shift register. r =1, therefore, f(x) is an r-degree polynomial with a constant term of 1.

[0145] The necessary and sufficient condition for an r-stage linear feedback shift register to generate an m-sequence is that f(x) is an r-order primitive polynomial. If f(x) satisfies the following three conditions, then f(x) is considered to be an r-order primitive polynomial: (1) f(x) is a reduced polynomial, that is, f(x) cannot be factored; (2) f(x) is divisible by (x p +1), where p = 2 r -1; (3) f(x) cannot divide (x q +1), where q<p.

[0146] Take r=4 as an example to illustrate the generation of m sequence. The longest period of the sequence generated by the 4-stage linear feedback shift register is 2 r -1=15. When r=4, the characteristic polynomial f(x) must be a 4th-degree primitive polynomial to generate the m-sequence. In other words, f(x) must not be factorized any further and must be divisible by (x 15 +1), and f(x) cannot divide (x q +1), q<15.

[0147] First, (x 15 +1) factorization, as shown in the following formula (4), so that (x 15 +1) are reduced polynomials, and then find f(x). 15 +1=(x+1)(x 2 +x+1)(x 4 +x+1)(x 4 +x 3 +1)(x 4 +x 3 +x 2 +x+1) (4)

[0148] Among them, (x 15 +1) has 3 fourth-order factors. But (x 4 +x 3 +x 2 +x+1) can divide (x 5 +1), so (x4 +x 3 +x 2 +x+1) is not a primitive polynomial. Therefore, we can find two 4th-degree primitive polynomials: (x 4 +x+1) and (x 4 +x 3 +1), any of the polynomials can generate an m-sequence.

[0149] For example, f(x)=x 4 +x+1 as an example, the m-sequence generator is shown in Figure 8. The modulo-2 sum of a0 and a3 becomes the new most significant bit, a3, after the sequence is right-shifted, and the least significant bit, a0, is output. Assume the initial state of the four-stage shift register is "1000," c4 = c1 = c0 = 1, and c3 = c2 = 0. After 15 cycles, the least significant bit of each shift output forms the m-sequence, resulting in the m-sequence "100110101111000."

[0150] The m-sequence is balanced. In one cycle of the m-sequence, the number of "1"s and "0"s is roughly equal. More precisely, the number of "1"s is one more than the number of "0"s.

[0151] The run distribution of the m-sequence also has characteristics. The elements in a sequence that have the same value and are connected are collectively called a run. The number of elements in a run is called the run length. The number of runs of length h accounts for 2 of the total number of runs in the m-sequence. -h , and in a run of length h, half are runs of consecutive "1s" and half are runs of consecutive "0s." For example, in the m-sequence "100110101111000," there are 8 runs. Of these, there is one run of length 4, namely 1111. There is one run of length 3, namely 000. There are two runs of length 2, namely 11 and 00. There are four runs of length 1, namely two "1s" and two "0s."

[0152] The sequence obtained by adding an m-sequence modulo 2 to its shifted sequence is still a shifted sequence of the m-sequence. This property is called the shift-and-add property of m-sequences, also known as linear superposition. The term "shifted sequence" refers to the basic m-sequence. The sequence obtained by cyclically shifting the basic m-sequence is also called a shifted sequence. For more information, see the "Cyclic Shift" section below.

[0153] The m-sequence has a good autocorrelation property. Assume that the autocorrelation function of the m-sequence is defined as Equation (5). Where A is the number of elements in a period of the m-sequence that are identical to its j-th shifted sequence, D is the number of elements in a period of the m-sequence that are different from its j-th shifted sequence, and L is the period of the m-sequence.

[0154] Formula (5) can also be rewritten as Formula (6).

[0155] According to the shift-add characteristic of m sequence, is still an element of the m-sequence. Therefore, the numerator of formula (6) is equal to the difference between the number of "0" and the number of "1" in one period of the m-sequence.

[0156] From the equilibrium of the m-sequence, we can see that the number of "0" in one cycle of the m-sequence is one less than the number of "1", so the numerator is equal to "-1".

[0157] Therefore, the autocorrelation function of the m sequence can be obtained as shown in formula (7).

[0158] Since the balance, run distribution and autocorrelation characteristics of the m-sequence are very similar to the basic properties of the random sequence, the m-sequence can also be called pseudo-noise (PN) sequence, pseudo-random sequence, etc.

[0159] Gold Sequence:

[0160] Gold sequences are code sequences obtained from optimal pairs of m-sequences. First, we introduce optimal pairs of m-sequences. Two different primitive polynomials of order r each generate an m-sequence. The condition for these two m-sequences to form an optimal pair of m-sequences is that the cross-correlation function satisfies Equation (8).

[0161] Two m-sequences that satisfy equation (8) are called a preferred m-sequence pair. A gold sequence is constructed by adding the m-sequences modulo 2. Furthermore, each cyclic shift of one m-sequence yields a new gold sequence. Therefore, compared to m-sequences, a significant advantage of gold sequences is that they can yield more independent code sequences.

[0162] Gold sequences have good cross-correlation properties and still possess similar properties to m-sequences, such as excellent balance, run-length distribution, and autocorrelation. Furthermore, the maximum cross-correlation value between the gold sequences obtained from a pair of optimal m-sequences will not exceed the maximum cross-correlation value between the pair of optimal m-sequences.

[0163] Walsh Sequence:

[0164] Walsh sequence, also known as Walsh code, is derived from the Hadamard matrix.

[0165] Assume that the second-order Hadamard matrix is We can obtain the Walsh sequences of order 2 (1,1) and (1,-1).

[0166] Assume that the high-order Hadamard matrix is A Walsh sequence of length 2n can be obtained. For example, a Walsh sequence of order 4 can be obtained: (1,1,1,1), (1,-1,1,-1), (1,1,-1,-1), (1,-1,-1,1).

[0167] Walsh sequences are orthogonal sequences, meaning that all elements in a Walsh sequence are orthogonal and do not interfere with each other. Each Walsh sequence is a binary sequence whose length is a power of 2, such as 2, 4, 8, 16, and so on. Walsh sequences are symmetric, meaning that the positive and negative versions of a Walsh sequence are identical, just in reverse order. Walsh sequences also exhibit good cross-correlation properties.

[0168] In this application, "agreement" can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in communication equipment (such as terminal equipment, network equipment), and this application does not limit its specific implementation method. Communication protocol agreement can also be understood as pre-defined by the communication protocol.

[0169] FIG9 shows a flow chart of a method for transmitting a preamble provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0170] Step 710: Send a preamble sequence, where the preamble sequence is one of the first sequences.

[0171] The first sequence is generated based on a binary sequence. A binary sequence only includes sequence elements with two possible values. Therefore, the first sequence also only includes sequence elements with two possible values. For example, the first sequence only includes "0" and "1," or only includes "+1" and "-1."

[0172] In some embodiments, the first sequence is generated according to at least one of the following: an m-sequence; a gold sequence; or a Walsh sequence.

[0173] In some embodiments, the modulation mode of the preamble sequence includes at least one of the following: On-Off Keying (OOK) modulation; Phase Shift Keying (PSK) modulation; Binary Phase Shift Keying (BPSK) modulation; Frequency Shift Keying (FSK) modulation.

[0174] It should be noted that the types of binary sequences provided in this application are not limited to m-sequences, gold sequences, and Walsh sequences. Other binary sequences or other sequences with sequence characteristics similar to binary sequences are also applicable to the methods provided in the embodiments of this application.

[0175] The terminal device executing step 710 can be the terminal device 120 or the terminal device 130 as shown in Figure 1, or the terminal device 120 which is a low-power device as shown in Figure 2, or a terminal device operating in the millimeter wave (mmWave) frequency band, etc.

[0176] In summary, the method provided in the embodiment of the present application, since the first sequence is generated according to the binary sequence, the sequence elements of the first sequence have only two possible values, which is very easy to combine with non-OFDM waveforms such as OOK waveform, PSK waveform, FSK waveform, etc., and provides the possibility of transmitting preamble codes for some communication scenarios where OFDM waveforms are difficult to use, and provides a new feasible solution for preamble code transmission. For some low-power devices, if a preamble code sequence belonging to the first sequence is sent, random access, uplink synchronization, and frequency offset estimation can be achieved while maintaining the good characteristics of low complexity and low power consumption. For terminal devices operating in the millimeter wave frequency band, the first sequence has the advantages of simple generation, easy implementation, and power saving. Combined with the characteristics of high reliability and narrow beam of millimeter wave transmission, the preamble code sequence belonging to the first sequence can meet the requirements of random access, uplink synchronization, frequency offset estimation, etc. in the millimeter wave frequency band.

[0177] Next, taking the generation of the first sequence based on the m-sequence as an example, the generation of the preamble sequence based on the m-sequence is further described based on step 710 .

[0178] FIG10 is a schematic flow chart of a method for transmitting a preamble provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0179] Step 810: Send a preamble sequence, where the preamble sequence is one of the first sequences; wherein the first sequence is generated according to the m-sequence.

[0180] In some embodiments, the preamble sequence is a default sequence in the first sequence. Alternatively, the preamble sequence is a sequence randomly selected by the terminal device in the first sequence. Alternatively, the preamble sequence is a sequence selected by the terminal device in the first sequence according to a specific rule. Alternatively, the preamble sequence is a sequence in the first sequence indicated by the network device.

[0181] The specific rules mentioned in this application may be rules agreed upon in the communication protocol, rules configured by the network device, default rules, and so on.

[0182] In some embodiments, the preamble sequence is carried on a random access channel (RACH).

[0183] In some embodiments, the bandwidth occupied by the preamble sequence is related to at least one of the following: the total bandwidth of the RACH; the available bandwidth of the RACH; and the frequency margin of downlink frequency synchronization.

[0184] For example, assuming that the total bandwidth of the RACH is 180 kHz and the frequency margin of downlink frequency synchronization is 10 kHz, if a 10 kHz guard band is reserved on both sides of the preamble sequence, then the maximum bandwidth occupied by the preamble sequence can be 180-2*10=160 kHz. At this time, the symbol rate of the preamble can reach a maximum of 160 symbols / ms.

[0185] In some embodiments, the binary sequence used to generate the first sequence includes a first m-sequence and / or a second m-sequence.

[0186] The first m-sequence is the m-sequence generated by the primitive polynomial mentioned above. An r-order primitive polynomial can generate an r-order first m-sequence.

[0187] Table 1 shows the upper limit of the number of first m-sequences that can be generated by shift registers of different series. The upper limit of the number of first m-sequences is equal to the number of primitive polynomials. For example, when the series r = 7, there are 18 primitive polynomials, so the upper limit of the number of first m-sequences is 18.

[0188] Table 1 Upper limit of the number of first m-sequences under different levels

[0189] The second m-sequence is obtained by cyclically shifting the first m-sequence. It can also be understood that the second m-sequence is a cyclically shifted sequence of the first m-sequence.

[0190] In the present application, the first m-sequence may also be referred to as at least one of the following: a basic m-sequence, a root m-sequence, a primary m-sequence, a first-level m-sequence, etc. The second m-sequence may also be referred to as at least one of the following: a shifted sequence, a bit-shifted sequence, a cyclically shifted sequence, an extended m-sequence, a secondary m-sequence, a secondary m-sequence, an auxiliary m-sequence, a second-level m-sequence, etc.

[0191] Here we introduce the relevant concepts of circular shift. As the name suggests, circular shift is to circularly shift the values ​​in a sequence. There are two common types of circular shift: circular left shift and circular right shift. Among them, circular left shift is to move the shifted high bit to the low bit of the sequence, and circular right shift is to move the shifted low bit to the high bit of the sequence. The number of bits or bits shifted out by a circular shift is called the cyclic offset of that circular shift, and the sequence obtained by the circular shift is called the shifted sequence. Taking the basic m-sequence "10110101" as an example, Figure 11 shows the process of circular shifting when the cyclic offset is 2 bits. The process of circular left shift is shown in Figure 11 (a), and the process of circular right shift is shown in Figure 11 (b). The circular shift in the embodiments of the present application can be a circular left shift or a circular right shift. The cyclic offset can also be called the cyclic shift amount.

[0192] According to the previous text, the longest period of the first m-sequence with a series number r is 2 r -1. If the circular offset of each circular shift is 1, then at most 2 r -2 second m-sequences. Therefore, when the cyclic shift of the first m-sequence is 1, a total of up to 2 r - 1 m-sequence (including the first m-sequence itself).

[0193] If the cyclic shift step size of the first m sequence is N CS , then the maximum we can get is m-sequences, which include a basic m-sequence and Cyclic shift sequence. In this application, Indicates rounding down. Indicates rounding up, which will not be further explained below.

[0194] Assuming that the number of levels is r, the number of the first m-sequences is N, and the N first m-sequences are shifted by the cyclic shift step N. CS After cyclic shift, the maximum value that can be obtained is m-sequences, including the N first m-sequences themselves and A second m-sequence.

[0195] It can be understood that according to the cyclic shift step size N CS The cyclic offset can be obtained, and the first m sequence is cyclically shifted according to the cyclic offset to obtain several second m sequences. And the cyclic shift step length N CS The smaller it is, the more second m-sequences can be obtained.

[0196] Assuming the first m-sequence is x(n), the second m-sequence can be expressed as x((n+C) mod L), where L is the length of the first m-sequence, C is the cyclic offset of the second m-sequence relative to the first, and mod is the modulo operation. Theoretically, the cyclic offset C can be any integer between 0 and L.

[0197] However, in some cases, a cyclic offset that is too small can make it difficult for the receiver to distinguish between two adjacent cyclically shifted sequences, especially when the chip corresponding to each bit of the m-sequence is small. Therefore, this application also supports further limiting the value of the cyclic offset in some embodiments to ensure the reception quality of the preamble.

[0198] In actual communication scenarios, the distance between the transmitter and receiver is different, and the transmission delay will also be different. As shown in Figure 12, terminal device 101, terminal device 102, terminal device 103, and terminal device 104 respectively send preamble codes to network device 105. Due to the different distances, the transmission delay generated by each terminal device sending the preamble code is also different. Among these four terminal devices, terminal device 101 is closest to network device 105, and terminal device 103 is farthest from network device 105. Assume that the round-trip time (RTT) between terminal device 101 and network device 105 is RTT 1, the round-trip time between terminal device 103 and network device 105 is RTT 2, and the difference between RTT 1 and RTT 2 is t. If t is greater than (T-1) code chip lengths and t is less than T code chip lengths, then in order to facilitate network device 105 to distinguish the preamble codes sent by each terminal device, the cyclic offset is required to be greater than or equal to T. The chip length is the chip length corresponding to the sequence used to generate the preamble. Optionally, to further ensure the reliability of the preamble detection result, it is preferable to design a certain margin for the cyclic offset. For example, the cyclic offset is set to be greater than T, and the difference between the cyclic offset and T is greater than a certain value.

[0199] After understanding how the first m-sequence and the second m-sequence are generated, we can consider how to generate the first sequence according to the first m-sequence and the second m-sequence.

[0200] In some embodiments, the first sequence includes all preamble sequences corresponding to the cell in which the terminal device is located. This can also be understood as meaning that the preamble sequences transmitted by all terminal devices in the same cell belong to the first sequence. Therefore, the first sequence can be considered a cell-level preamble sequence set, and the preamble sequence transmitted by the terminal device is associated with the cell in which it is located.

[0201] In some embodiments, the total number of preamble sequences corresponding to a cell is preconfigured or agreed upon in a communication protocol. That is, the total number of preamble sequences included in the first sequence is preconfigured or agreed upon in a communication protocol.

[0202] In some embodiments, the number of m-sequences used to generate the first sequence is preconfigured or agreed upon by a communication protocol.

[0203] The embodiment of the present application provides two methods for generating a first sequence for a single cell using an m-sequence.

[0204] Method 1: First, determine X first m-sequences corresponding to a cell. Then, generate Y second m-sequences based on these X first m-sequences. The first sequence corresponding to the cell is generated from these X first m-sequences and Y second m-sequences. Alternatively, the first sequence corresponding to the cell can be generated from only the X first m-sequences, or even only the Y second m-sequences.

[0205] Method 2: First, a large m-sequence set is constructed, including several first and second m-sequences. The m-sequence set is then divided into several m-sequence subsets, with each m-sequence subset being assigned as the first sequence for a cell. Alternatively, the m-sequence set can include only several first m-sequences, or even only several second m-sequences.

[0206] Next, the first method is introduced, which generates a first sequence corresponding to a cell according to X first m-sequences.

[0207] The first sequence corresponding to a cell can be generated based on only X first m-sequences, Y second m-sequences, or X first m-sequences and Y second m-sequences. Regardless of the generation method, determining the X first m-sequences is paramount. Because the second m-sequence is a cyclic shift of the first m-sequence, once the X first m-sequences are determined, the Y second m-sequences can be derived naturally based on the cyclic shift step size or cyclic offset.

[0208] Therefore, the following first discusses how to determine the X first m-sequences. In some embodiments, the value of X is determined by a communication protocol, configured by a network device, or autonomously determined by a terminal device. For example, the value of X is adjusted by the network device or the terminal device based on one or more of the following factors: terminal device capabilities, network device capabilities, communication system capacity, communication requirements, the total number of cell identifiers, the number of terminal devices in the same cell, and the like.

[0209] In some embodiments, the X first m-sequences are agreed upon by a communication protocol, or indicated by a network device, or determined by a terminal device.

[0210] In some embodiments, the X first m-sequences are X of the N first m-sequences, where N is an integer greater than or equal to 1, and 1≤X≤N. The N first m-sequences are determined according to the number r of shift register stages.

[0211] Since there is an upper limit to the number of primitive polynomials that can be generated with different series, there is also an upper limit to the number of first m-sequences that correspond one-to-one with these primitive polynomials. The upper limit on the number of first m-sequences for different series r can be found in Table 1. Therefore, the value of N here can be equal to or less than the upper limit on the number of primitive polynomials. For example, when the series r = 5, a maximum of six fifth-degree primitive polynomials can be generated, meaning a maximum of six fifth-order first m-sequences can be generated. Therefore, the value of N can be less than or equal to 6.

[0212] Optionally, the X first m-sequences are any X of the N first m-sequences. Optionally, the X first m-sequences are X default sequences of the communication system from the N first m-sequences. Optionally, the X first m-sequences are X of the N first m-sequences indicated by the network device. Optionally, the X first m-sequences are X selected from the N first m-sequences according to a specific rule.

[0213] Since the X first m-sequences are among the N first m-sequences, we first need to introduce the design of the N first m-sequences, and then introduce how to determine / indicate / select the X first m-sequences.

[0214] First, the design of N first m-sequences is introduced.

[0215] It is understood that in order to facilitate the distinction between each first m-sequence, the N first m-sequences should each have a one-to-one corresponding number or index. The embodiment of the present application uses numbering as an example for illustration. For example, the N first m-sequences are numbered 0, 1, 2..., N-1, or the N first m-sequences are numbered 1, 2..., N, and so on. Other numbering schemes that can distinguish each first m-sequence are also applicable to the embodiment of the present application. The embodiment of the present application uses the numbering of 0, 1, 2..., N-1 as an example.

[0216] In some embodiments, the numbering order of the N first m-sequences is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0217] In some embodiments, the numbering order of the N first m-sequences is arranged from small to large according to the numbering value, or arranged from large to small according to the numbering value.

[0218] In some embodiments, the numbering order of the N first m-sequences is arranged according to the coefficients of the primitive polynomial that generates the first m-sequences. Exemplarily, the numbering order of the N first m-sequences is arranged in the order of the coefficients of the primitive polynomial from high power to low power. Exemplarily, the numbering order of the N first m-sequences is arranged in the order of the coefficients of the primitive polynomial from low power to high power. Exemplarily, the coefficients of the primitive polynomial are represented by binary numbers, and the numbering order of the N first m-sequences is arranged in the order of the binary numbers corresponding to the primitive polynomial from small to large. Exemplarily, the numbering order of the N first m-sequences is arranged in the order of the binary numbers corresponding to the primitive polynomial from large to small.

[0219] In some embodiments, N first m-sequences are first arranged according to a specific rule and then assigned numbers to form N first m-sequences numbered in the order of 0, 1, 2 . . . , N-1.

[0220] For example, the N first m-sequences are arranged in ascending order according to the binary numbers corresponding to the primitive polynomials, and then assigned numbers. Then, the binary number corresponding to the first m-sequence numbered 0 is the smallest of all the binary numbers corresponding to the N first m-sequences, and the binary number corresponding to the first m-sequence numbered N-1 is the largest of all the binary numbers.

[0221] In some embodiments, the N first m-sequences are first assigned numbers and then arranged according to a specific rule. Therefore, the numbering order of the N first m-sequences may be disrupted, for example, not in the order from 0 to N-1.

[0222] For example, the network device indicates that the numbering order of the N first m-sequences is 2, 0, N-1, ..., 1, which means that the first m-sequence numbered 2 is ranked first among the N first m-sequences, and the first m-sequence numbered 1 is ranked Nth among the N first m-sequences.

[0223] In some embodiments, the design of the numbering sequence can be understood as the case where the first m-sequence has both logical and physical numbering. The logical numbering refers to the logical order of the numbers in the first m-sequence, which can be understood as the numbers 0, 1, 2…, N-1 or 1, 2…, N in the embodiments of this application. The physical numbering refers to the position of the numbers in the first m-sequence in the memory, or the position in the agreed mapping relationship, which can be understood as the numbering sequence in the embodiments of this application (for example, 2, 0, N-1…, 1).

[0224] If the numbering order of the N first m-sequences is arranged in ascending order according to the number value, it can be understood that the logical number of the first m-sequence is the same as the physical number.

[0225] If the numbering order of the N first m-sequences is not arranged in ascending order of number value, it can be understood that the logical numbering of the first m-sequences is different from the physical numbering. The reason why the numbering order of the N first m-sequences may be disrupted is to take into account the correlation between m-sequences. For example, by changing the numbering order of the first m-sequences, first m-sequences with relatively good correlations can be arranged adjacent to each other. This makes it easier for the network device to ensure that the preamble sequence set corresponding to a cell has good correlation when determining the first sequence by configuring the first starting information. Furthermore, by appropriately configuring the X first m-sequences corresponding to different adjacent cells (for example, indicating different first starting information to different cells), the preamble sequence sets corresponding to adjacent cells can also have good correlation. Furthermore, data storage may be affected by factors such as memory allocation methods and operating system memory management. Therefore, the numbering order of the N first m-sequences may need to be adjusted based on storage conditions. Therefore, it is possible to adjust the numbering order of the N first m-sequences, that is, adjust the physical numbering of the first m-sequences, based on actual conditions.

[0226] In simple terms, the numbering sequence involved in this application can be understood as a logical order or a physical order, and can be adjusted based on actual conditions, communication requirements, communication protocol agreements and other factors.

[0227] Next, it is introduced how to determine, indicate or select X first m-sequences from the N first m-sequences mentioned above.

[0228] In some embodiments, the X first m-sequences are randomly selected by the terminal device from the N first m-sequences. Alternatively, the X first m-sequences are default first m-sequences from the N first m-sequences, such as the first m-sequence numbered 1 by default (or other values), the first m-sequence that is arranged last by default (or other positions by default), the first m-sequence that is numbered even by default, and so on.

[0229] In some embodiments, the X first m-sequences are indicated by a network device. Exemplarily, the network device indicates the numbers of the X first m-sequences via signaling. The signaling may be, for example, one or more of system information, RRC signaling, a Media Access Control (MAC) control element (CE), downlink control information (DCI), and the like.

[0230] Considering the value of X, we will discuss how to determine the X first m-sequences in two cases:

[0231] 1. Case X = 1

[0232] If X=1, it means that the first sequence corresponding to one cell is generated according to one basic m-sequence.

[0233] In some embodiments, the first m-sequence is determined or selected based on a cell identifier of the terminal device. Exemplarily, the number of the first m-sequence used to generate the first sequence is determined based on the cell identifier of the terminal device. The number of the first m-sequence refers to the number of the first m-sequence among the N first m-sequences.

[0234] In some embodiments, the number of the first m-sequence used to generate the first sequence is equal to the cell identifier of the terminal device. For example, the cell identifier of the terminal device is 5, and the first m-sequence included in the first sequence is the first m-sequence numbered 5 among the N first m-sequences.

[0235] In some embodiments, the number of the first m-sequence used to generate the first sequence is determined according to a mathematical operation result of a cell identifier of the terminal device.

[0236] Exemplarily, the number of the first m-sequence used to generate the first sequence is equal to the modulo result of the terminal device's cell identifier and N. N here refers to the number of N first m-sequences, which is determined by the shift register level r. The value of N can be equal to or less than the upper limit of the number of primitive polynomials. Exemplarily, the terminal device's cell identifier is 16, and when the level r = 6, a maximum of 6 primitive polynomials can be generated. Let N be 6, and 16 mod 6 = 4. Therefore, the first m-sequence used to generate the first sequence is the first m-sequence numbered 4 among the N first m-sequences.

[0237] Exemplarily, the number of the first m-sequence used to generate the first sequence is equal to an integer multiple of the cell identifier of the terminal device, or equal to the rounded-up result of the quotient of the cell identifier of the terminal device and N, or equal to the rounded-down result of the quotient of the cell identifier of the terminal device and N, and so on.

[0238] In some embodiments, the network device indicates the number of the first m-sequence used to generate the first sequence, or the communication protocol stipulates the number of the first m-sequence used to generate the first sequence.

[0239] 2. X>1

[0240] If X>1, it means that the first sequence corresponding to one cell is generated according to multiple basic m-sequences.

[0241] In some embodiments, the X first m-sequences are determined based on the first sequence information. Optionally, at least part of the first sequence information is indicated by the network device, and / or at least part of the first sequence information is agreed upon by the communication protocol, and / or at least part of the first sequence information is determined by the terminal device.

[0242] In some embodiments, the first sequence information includes at least one of the following information:

[0243] First starting information, used to indicate the starting position of the X first m-sequences in the N first m-sequences;

[0244] First length information, used to indicate the value of X;

[0245] First end information, used to indicate the end position of the X first m-sequences in the N first m-sequences;

[0246] A first bitmap, where each bit corresponds one-to-one to the N first m-sequences;

[0247] The numbers of the X first m-sequences;

[0248] The total number of sequences in the first sequence, S;

[0249] The number of the preamble sequence sent by the terminal device in the first sequence;

[0250] Cyclic shift step size N CS , which can also be called the cyclic shift factor;

[0251] The numbering order of the N first m-sequences;

[0252] Cycle offset C.

[0253] Among them, the first sequence can be understood as a set of preamble code sequences corresponding to the cell where the terminal device is located.

[0254] In some embodiments, the first sequence information includes first starting information and first length information. Alternatively, the first sequence information includes first starting information, first length information, and the numbering order of the N first m-sequences. For example, N = 9, and the communication protocol stipulates that the numbering order of the N first m-sequences is 0, 1, 2, ..., 8. The network device indicates: first starting information = 2, and first length information = 3. Then, the X first m-sequences include first m-sequences numbered 2, 3, and 4. This method requires fewer indication bits, making it easier to determine the X consecutive first m-sequences.

[0255] In some embodiments, the first start information and the first length information may also be represented by a coded value, such as a start and length indicator value (SLIV).

[0256] In some embodiments, the first sequence information includes first start information and first end information. Alternatively, the first sequence information includes first start information, first end information, and the numbering order of N first m-sequences. For example, N=9, and the network device indicates that the numbering order of the N first m-sequences is 2, 6, 5, 7, 1, 3, 8, 4, 0. The communication protocol stipulates that the first start information = 3, and the terminal device autonomously determines the first end information = 7. Then, the X first m-sequences include first m-sequences numbered 5, 7, 1, 3, and 8. This method requires fewer indication bits, making it easier to determine X consecutive first m-sequences.

[0257] In some embodiments, the first sequence information includes first length information and first end information. Alternatively, the first sequence information includes first length information, first end information, and the numbering order of the N first m-sequences. For example, N=8, and the terminal device autonomously determines that the numbering order of the N first m-sequences is 3, 7, 1, 0, 5, 6, 4, 2. The network device indicates: first length information = 3, and first end information = 7. Then, the X first m-sequences include first m-sequences numbered 5, 6, and 4. This method requires fewer indication bits, making it easier to determine X consecutive first m-sequences.

[0258] In some embodiments, the first sequence information includes numbers of X first m-sequences. For example, the network device indicates to the terminal device that the X first m-sequences are numbered 2, 6, and 9, and the terminal device generates the first sequence based on the first m-sequences numbered 2, 6, and 9.

[0259] In some embodiments, the first sequence information includes a first bitmap. Alternatively, the first sequence information includes a first bitmap and a numbering order of N first m-sequences. When the bit value is the first value, it indicates that the first m-sequence corresponding to the bit is indicated as one of the X first m-sequences, and when the bit value is the second value, it indicates that the first m-sequence corresponding to the bit is not indicated as one of the X first m-sequences. Among them, the first value is "1" and the second value is "0", or the first value is "0" and the second value is "1". Of course, the first value and the second value can also be other values. The embodiment of the present application is schematically illustrated by taking the first value "1" and the second value "0" as an example. For example, N=6, the communication protocol stipulates that the numbering order of the N first m-sequences is 1, 0, 5, 4, 2, 3, and the first bitmap sent by the network device includes 6 bits, and these 6 bits correspond one-to-one to the N first m-sequences from low to high. Assuming that the value of the first bitmap is 001101, it means that the X first m-sequences include the first m-sequences numbered 5, 4, and 3. The first bitmap can be used to determine the X discrete first m-sequences, which has greater flexibility but may require more bits for indication.

[0260] In some embodiments, the first sequence information includes a cyclic shift step size N CS , the numbering order of the N first m-sequences. Alternatively, the first sequence information includes the cyclic shift step size N CS Alternatively, the first sequence information includes the first starting information and the numbering order of the N first m-sequences.

[0261] In some embodiments, the first sequence information includes first starting information, cyclic shift step length N CS , the numbering order of the N first m-sequences. Alternatively, the first sequence information includes the first starting information, the cyclic shift step size N CS , the total number of sequences in the first sequence. Alternatively, the first sequence information includes the first starting information, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence. Alternatively, the first sequence information includes the cyclic shift step size N CS , the numbering order of the N first m sequences, and the total number of sequences in the first sequence.

[0262] In some embodiments, the first sequence information includes first starting information, cyclic shift step length N CS , the numbering order of the N first m sequences, and the total number of sequences in the first sequence.

[0263] Exemplarily, the first m-sequence numbered u is determined according to the first starting information, assuming that the length of the first m-sequence numbered u is L, and the cyclic shift step length N is CS Determine the cyclic offset C, and cyclically shift the first m-sequence numbered u according to the determined cyclic offset C to obtain m sequences (including the first m sequence numbered u itself). Is it less than the total number of sequences S in the first sequence? If This means that the first sequence has not been constructed yet. It means that the first sequence has been constructed, and the X first m-sequences include the first m-sequence numbered u. For example, according to the numbering order of N first m-sequences, the first m-sequence numbered d that immediately follows the first m-sequence numbered u is determined. Assuming that the length of the first m-sequence numbered d is also L, the first m-sequence numbered d is cyclically shifted according to the determined cyclic offset C to obtain m-sequences (including the first m-sequence numbered d). Is it less than the total number of sequences S in the first sequence? If This means that the first sequence has not been constructed yet. Continue to cyclically shift the first m-sequence immediately following the first m-sequence numbered d, and repeat the above steps until the total number of m-sequences obtained after cyclic shifting is equal to the total number of sequences S in the first sequence. This indicates that the first sequence has been constructed, and the X first m-sequences include the first m-sequences numbered u and d.

[0264] In the embodiment of the present application, the lengths of the N first m-sequences are all equal for illustrative purposes. Therefore, the lengths of the X first m-sequences used to generate the first sequence are also equal. Of course, this does not exclude the case where the lengths of the N first m-sequences are unequal.

[0265] Optionally, the network device indicates to the terminal device: first starting information, cyclic shift step length N CS The numbering order of the N first m-sequences and the total number S of sequences in the first sequence are agreed upon by the communication protocol.

[0266] Optionally, the network device indicates to the terminal device: first starting information, cyclic shift step length N CS , the numbering order of the N first m-sequences, and the total number of sequences S in the first sequence.

[0267] Optionally, the network device indicates to the terminal device: the first starting information, the numbering order of the N first m-sequences. Cyclic shift step length N CS The total number of sequences S in the first sequence is agreed upon by the communication protocol.

[0268] Optionally, the network device indicates to the terminal device: first starting information. Cyclic shift step length N CS The total number of sequences in the first sequence S is determined by the communication protocol. The order in which the N first m-sequences are numbered is determined by the terminal device.

[0269] Optionally, the network device indicates to the terminal device: first starting information. The total number of sequences S in the first sequence is agreed upon by the communication protocol. Cyclic shift step length N CS The order in which the N first m-sequences are numbered is determined by the terminal device.

[0270] For example, the communication protocol stipulates N CS =2, and it is agreed that the total number of sequences included in the first sequence corresponding to a cell is S=64. The network device indicates that the numbering order of the N first m-sequences is 3, 7, 1, 0, 5, 6, 4, 2. Assume that the length of the N first m-sequences is L=63. The network device indicates that the first starting information is 2. After receiving the instruction from the network device, the terminal device determines the first m-sequence numbered 7 based on the first starting information. After cyclic shift, the first m-sequence numbered 7 is obtained. m-sequences (including the first m-sequence numbered 7 itself). Obviously, 31 < 64. Then, based on the numbering order of the N first m-sequences, the first m-sequence numbered 1 is determined. After cyclic shifting the first m-sequence numbered 1, 31 m-sequences are obtained (including the first m-sequence numbered 1 itself). Obviously, 31 * 2 < 64. Repeat the above steps and continue to cyclically shift the first m-sequence numbered 0 once to obtain 2 m-sequences (including the first m-sequence numbered 0 itself). 31 * 2 + 2 = 64. Therefore, the X first m-sequences include the first m-sequences numbered 7, 1, and 0. The Y second m-sequences include all the second m-sequences of the first m-sequences numbered 7 and 1, as well as one second m-sequence of the first m-sequence numbered 0.

[0271] The above example involves the cyclic shift step size N CS To determine the content of the cyclic offset C, the following formula (9) exemplifies a design:

[0272] In some embodiments, the cyclic shift step size N CS It is agreed by the communication protocol, and / or indicated by the network device, and / or determined by the terminal device. CS Associated with the cell radius, it can also be understood as the cyclic shift step size N CS Associated with the coverage radius of the network device, the terminal device determines the cyclic shift step size N according to the cell radius CS For example, the cyclic shift step size N CS Associated with the cell identity, the terminal device determines the cyclic shift step size N according to the cell identity CS .

[0273] In some embodiments, the first sequence information includes the first starting information, the cyclic shift C, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence S. The principle of this case is the same as the above "the first sequence information includes the first starting information, the cyclic shift step N CS , the numbering order of the N first m sequences, and the total number of sequences in the first sequence S" are similar, except that there is no need to use the cyclic shift step size N CS Instead of determining the cyclic offset C, the cyclic offset C may be determined directly according to the first sequence information.

[0274] In some embodiments, the first sequence information includes first starting information, a cyclic offset set, the numbering order of the N first m-sequences, and the total number of sequences S in the first sequence. The reason for supporting the first sequence information to include a cyclic offset set is that the number of second m-sequences that can be generated by the first m-sequence affects the number of first m-sequences in the first sequence. If more cyclic offsets are supported for cyclic shifting of the first m-sequences, the number of first m-sequences required to form the first sequence will be reduced. Optionally, different cyclic offset sets can be configured for different first m-sequences to achieve more flexible cyclic shifting.

[0275] Regarding Y second m-sequences:

[0276] After obtaining X first m sequences according to the above method, combined with the cyclic shift step size N CS Y second m-sequences can be determined. For example, if the length of the first m-sequence is L, according to the cyclic shift step N CS , a first m sequence generates at most Second m-sequences, therefore, X first m-sequences can generate at most A second m-sequence. Or, Y<X*

[0277] The reason for existence The reason is that the total number of sequences S in the first sequence may be indicated by the network device or agreed upon by the communication protocol, but the cyclic shift step size N CS The situation determined by the terminal device. For example, the communication protocol stipulates S=63, the network device indicates X=6, if Then, Y=57<66.

[0278] Regardless of whether the first sequence information is indicated by the network device, agreed upon by the communication protocol, or determined by the terminal device, when the first sequence information includes the total number S of sequences in the first sequence, the terminal device should ensure that X+Y=S when obtaining the first sequence.

[0279] In some embodiments, the value of Y is determined by a communication protocol, configured by a network device, or autonomously determined by a terminal device. For example, the value of Y is adjusted by the network device or the terminal device based on one or more of the following factors: the capabilities of the terminal device, the capabilities of the network device, the capacity of the communication system, the communication demand, the total number of cell identifiers, the number of terminal devices in the same cell, and the like.

[0280] After determining X first m-sequences and Y second m-sequences, the first sequence can be generated. Next, the sequence arrangement within the first sequence is described.

[0281] In some embodiments, the first sequence is generated based on X first m-sequences and Y second m-sequences. That is, in the binary sequence used to generate the first sequence, the number of first m-sequences is X, and the number of second m-sequences is Y. Here, X is an integer greater than or equal to 0, and Y is an integer greater than or equal to 0, and X and Y cannot be 0 at the same time. It can also be understood that the first sequence corresponding to the cell where the terminal device is located is generated by the X first m-sequences and several shifted sequences thereof.

[0282] Permutations of X first m-sequences within the first sequence:

[0283] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence follows their numbering order among the N first m-sequences. That is, the numbering order of the X first m-sequences when generating the first sequence is the same as the numbering order of the X first m-sequences among the N first m-sequences. For example, if the numbering order of the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6, and the X first m-sequences include first m-sequences numbered 4, 3, 2, and 7, then when generating the first sequence, the X first m-sequences are still arranged in the numbering order of 4, 3, 2, and 7.

[0284] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence is determined according to at least one of the following: the corresponding primitive polynomial coefficients, the binary numbers of the corresponding primitive polynomial coefficients, and the numbering values ​​of the first m-sequences.

[0285] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0286] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence is different from the numbering order of the X first m-sequences in the N first m-sequences. For example, the X first m-sequences are arranged in ascending order of number value, or in descending order of number value, or in descending order of primitive polynomial coefficients from low to high power, or in descending order of primitive polynomial coefficients from high to low power, or in descending order of primitive polynomial binary numbers, or in descending order of primitive polynomial binary numbers, etc. For example, if the numbering order of the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6, and the X first m-sequences include first m-sequences numbered 4, 3, 2, and 7, then the X first m-sequences in the first sequence are arranged in the order of 2, 3, 4, and 7.

[0287] Permutation of Y second m-sequences within the first sequence:

[0288] In some embodiments, the numbering order of the Y second m-sequences within the first sequence is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0289] In some embodiments, the numbering order of the Y second m-sequences in the first sequence is determined based on at least one of the following: a cyclic offset, a numbering order of the corresponding first m-sequence, a corresponding primitive polynomial coefficient, a binary number of the corresponding primitive polynomial coefficient, and a numbering value of the second m-sequence.

[0290] In some embodiments, the Y second m-sequences are arranged in the first sequence by first numbering the corresponding first m-sequences and then by cyclic offset from smallest to largest. Alternatively, the Y second m-sequences are arranged by first numbering the corresponding first m-sequences and then by cyclic offset from largest to smallest. Exemplarily, the Y second m-sequences include: y1 second m-sequences obtained by cyclic shifting the first m-sequence numbered H1, y2 second m-sequences obtained by cyclic shifting the first m-sequence numbered H2, and y3 second m-sequences obtained by cyclic shifting the first m-sequence numbered H3. H1<H2<H3. Therefore, the Y second m-sequences are arranged in the following order: y1 second m-sequences arranged by cyclic offset from smallest to largest, y2 second m-sequences arranged by cyclic offset from smallest to largest, and y3 second m-sequences arranged by cyclic offset from smallest to largest. Y1, y2, and y3 are all equal, or y1, y2, and y3 are unequal.

[0291] In some embodiments, the Y second m-sequences are numbered in the first sequence by first arranging the corresponding primitive polynomial coefficients from high to low power, and then arranging them from small to large according to the cyclic offset. Alternatively, the Y second m-sequences are numbered by first arranging the corresponding primitive polynomial coefficients from high to low power, and then arranging them from large to small according to the cyclic offset. Alternatively, the Y second m-sequences are numbered by first arranging the corresponding primitive polynomial coefficients from low to high power, and then arranging them from small to large according to the cyclic offset. Alternatively, the Y second m-sequences are numbered by first arranging the corresponding primitive polynomial coefficients from low to high power, and then arranging them from large to small according to the cyclic offset.

[0292] In some embodiments, the Y second m-sequences are numbered in the first sequence by first sorting the binary numbers of the corresponding primitive polynomial coefficients from small to large, and then sorting them by cyclic offset from small to large. Alternatively, the Y second m-sequences are numbered by first sorting the binary numbers of the corresponding primitive polynomial coefficients from small to large, and then sorting them by cyclic offset from large to small. Alternatively, the Y second m-sequences are numbered by first sorting the binary numbers of the corresponding primitive polynomial coefficients from large to small, and then sorting them by cyclic offset from small to large. Alternatively, the Y second m-sequences are numbered by first sorting the binary numbers of the corresponding primitive polynomial coefficients from large to small, and then sorting them by cyclic offset from large to small.

[0293] In some embodiments, the Y second m-sequences are numbered as 1, 2, ..., Y, or 0, 1, 2, ..., Y-1, etc. Other numbering schemes that can distinguish the first m-sequences are also applicable to the embodiments of the present application.

[0294] Permutations of X first m-sequences and Y second m-sequences within the first sequence:

[0295] In some embodiments, X first m-sequences are arranged first in the first sequence, and then Y second m-sequences are arranged, and the Y second m-sequences are arranged after the X first m-sequences. For example, assuming that the X first m-sequences are represented by M 1,1 ,M 1,2 …,M 1,X , assuming that Y second m-sequences are represented as M 2,1 ,M 2,2 …,M 2,Y , then the order of the m sequences in the first sequence is M 1,1 ,M 1,2 …,M 1,X ,M 2,1 ,M 2,2 …,M 2,Y , or, M 1,X ,M 1,X-1 …,M 1,1 ,M 2,Y ,M 2,Y-1 …,M 2,1 .

[0296] In some embodiments, Y second m-sequences are arranged first within the first sequence, and then X first m-sequences are arranged, and the X first m-sequences are arranged after the Y second m-sequences.

[0297] In some embodiments, X first m-sequences and Y second m-sequences are arranged crosswise. Exemplarily, X first m-sequences are arranged first in the first sequence (they can be arranged according to binary numbers and / or primitive polynomial coefficients and / or numbered values, as described above), and each second m-sequence is arranged after its corresponding first m-sequence in order of cyclic offset from small to large. Alternatively, X first m-sequences are arranged first in the first sequence, and each second m-sequence is arranged after its corresponding first m-sequence in order of cyclic offset from large to small. Exemplarily, assuming that the X first m-sequences are represented by M 1,0 ,M 2,0 ,M 3,0 , each first m sequence generates two second m sequences, M 1,0 The corresponding second m-sequence is denoted as M 1,1 ,M 1,2 , M 2,0 The corresponding second m-sequence is denoted as M 2,1 ,M 2,2 , M 3,0 The corresponding second m-sequence is denoted as M 3,1 ,M 3,2 , then the order of the m sequences in the first sequence is M 1,0 ,M 1,1 ,M 1,2 ,M 2,0 ,M 2,1 ,M 2,2 ,M 3,0 ,M 3,1 ,M 3,2 That is to say, after each first m-sequence, the corresponding second m-sequence is arranged.

[0298] After sorting the X first m-sequences and / or Y second m-sequences based on the above method, a first sequence corresponding to the required number (for example, S) can be obtained. The number of each sequence in the first sequence can correspond to the number of the preamble sequence, that is, the number of each sequence in the first sequence corresponds to the number of the preamble sequence. Exemplarily, the m-sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 0; the m-sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 1; and so on. Exemplarily, the m-sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 1; the m-sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 2; and so on.

[0299] The numbering order of the X first m-sequences and the Y second m-sequences can be the same or different. For example, both the first m-sequences and the second m-sequences are arranged according to their numbering values. For example, the first m-sequences are arranged according to primitive polynomial coefficients, and the second m-sequences are arranged according to cyclic offsets. For other possibilities, please refer to the above content and will not be elaborated on here.

[0300] The numbering value range of the X first m-sequences and the numbering value range of the Y second m-sequences can be completely the same, partially the same, or completely different. For details, please refer to the relevant content in the second method below, "First, introduce the design of the m-sequence set."

[0301] The first sequence corresponding to a cell can be determined through method 1. Therefore, whether different cells can use the same first sequence is a matter for further discussion.

[0302] In some cases, terminal devices in different cells are configured with different time-frequency resources, and the first sequences corresponding to different cells can be supported to be completely identical or partially identical. For example, the time-frequency resources configured by cell 1 for sending the preamble sequence are different from the time-frequency resources configured by cell 2 for sending the preamble sequence. Then, the first sequence corresponding to cell 1 and the first sequence corresponding to cell 2 can be completely identical or partially identical. In particular, when the distance between cell 1 and cell 2 is far, the mutual interference problem between the two cells is not serious, and the two cells can be supported to use the same first sequence. When cell 1 and cell 2 are close or even adjacent to each other, there may be mutual interference problems between the two cells. If the time-frequency resource positions configured by the two cells for preamble transmission are completely different, the two cells can be supported to use completely identical or partially identical first sequences. If the time-frequency resource positions configured by the two cells for preamble transmission overlap, the two cells can be supported to use partially identical or even completely different first sequences.

[0303] In some cases, terminal devices in different cells are configured with the same time-frequency resources, and completely different or partially identical first sequences corresponding to different cells can be supported. For example, the time-frequency resources configured by cell 3 for sending the preamble sequence overlap with the time-frequency resources configured by cell 4 for sending the preamble sequence. Then, the first sequence corresponding to cell 3 and the first sequence corresponding to cell 4 can be partially the same or completely different. Especially when the distance between cell 3 and cell 4 is far, the mutual interference problem between the two cells is not serious, so the two cells can be supported to adopt partially the same or even completely the same first sequence. When cell 3 and cell 4 are close or even adjacent to each other, there may be mutual interference problems between the two cells. If the time-frequency resource positions configured by the two cells for preamble transmission are exactly the same, the two cells can be supported to adopt completely different first sequences. If the time-frequency resource positions configured by the two cells for preamble transmission overlap, the two cells can be supported to adopt partially the same or completely different first sequences.

[0304] Whether different cells use the same first sequence, combined with the generation of the first m-sequence and the second m-sequence, can have the following three situations:

[0305] 1. Different cells correspond to the same first m-sequence and the same second m-sequence. For example, this is achieved by indicating the same first sequence information to different cells, or by stipulating in a communication protocol that different cells use the same first sequence information.

[0306] 2. Different cells correspond to the same first m-sequence and different second m-sequences, that is, the basic m-sequences corresponding to different cells are the same, but the shift sequences are different. For example, this is achieved by providing different first sequence information corresponding to different cells. Exemplarily, the network device indicates the same first starting information, and the communication protocol stipulates that the cyclic shift step sizes corresponding to different cells are different. Then, the second m-sequences corresponding to different cells are naturally different. Exemplarily, the communication protocol stipulates that different cells use the same basic m-sequence, and the network device indicates the cyclic shift step sizes for different cells separately, or the terminal device autonomously determines the cyclic shift step size. Then, the second m-sequences corresponding to different cells are naturally different.

[0307] 3. Different cells correspond to different first m-sequences and different second m-sequences. In other words, different cells correspond to different basic m-sequences. For example, this is achieved by providing different first sequence information corresponding to different cells. Exemplarily, the network device indicates different first starting information to different cells, so that different cells use different basic m-sequences, and the communication protocol specifies the cyclic shift step sizes corresponding to different cells. Regardless of whether different cells use the same cyclic shift step size, since the first m-sequences used by each cell are different, the second m-sequences obtained after cyclic shift will naturally not be exactly the same. Exemplarily, the network device indicates different first starting information and different cyclic shift step sizes to different cells, so that different cells correspond to different basic m-sequences and second m-sequences. For another example, the basic m-sequences corresponding to different cells are determined based on the cell identifier or the calculation result of the cell identifier, so different cells can naturally correspond to different first m-sequences and second m-sequences.

[0308] Next, the second method is introduced, which generates a first sequence corresponding to a cell according to the m-sequence subset.

[0309] The m-sequence subset is a subset of the m-sequence set, wherein the m-sequence set includes the first m-sequence and / or the second m-sequence.

[0310] In some embodiments, the m-sequence set includes a first m-sequence and a second m-sequence, and the m-sequence subset includes the first m-sequence and / or the second m-sequence.

[0311] In some embodiments, within the m-sequence set, the number of first m-sequences is determined by the number of shift register stages r, and the number of second m-sequences is determined by the cyclic shift step size. The relationship between the number of stages r and the number of first m-sequences can be found in Table 1 above. The number of second m-sequences can be found in the "Related Concepts of Cyclic Shift" section above.

[0312] In some embodiments, the number of m-sequences in the m-sequence set is determined according to the number of shift register stages and the cyclic shift step size.

[0313] In some embodiments, an m-sequence subset is a subset of an m-sequence set. Optionally, an m-sequence subset is any subset of an m-sequence set. It is understood that any set is a subset of itself, and therefore, an m-sequence subset may also be the m-sequence set itself. Optionally, an m-sequence subset is a subset selected from an m-sequence set according to a specific rule. Optionally, an m-sequence subset is a subset of an m-sequence set that is defaulted by the communication system.

[0314] In some embodiments, the m-sequence subset is determined or selected by the terminal device from the m-sequence set. Alternatively, the m-sequence subset is indicated by the network device.

[0315] Next, we first introduce the design of the m-sequence set and then introduce how the m-sequence subset is determined, selected, or indicated.

[0316] First, the design of the m-sequence set is introduced.

[0317] It can be understood that, for ease of distinction, each m-sequence in the m-sequence set should have a one-to-one corresponding number or index, and the embodiment of the present application is described using numbering as an example.

[0318] Considering that an m-sequence set may contain both the first m-sequence and the second m-sequence, two numbering methods are provided here:

[0319] 1. The numbering does not distinguish between the first m-sequence and the second m-sequence. Assume that the m-sequence set includes W m-sequences, then the m-sequence set corresponds to W numbers, and the W numbers correspond to the W m-sequences one-to-one.

[0320] 2. Numbering to distinguish the first and second m-sequences. Assume that the m-sequence set includes a total of W m-sequences, including W1 first m-sequences and W2 second m-sequences, where W = W1 + W2. Then, the number of each m-sequence consists of two parts: one part distinguishes the first and second m-sequences, and the other part indicates its number within the first or second m-sequence. For example, the third value indicates belonging to the first m-sequence, and W1 first m-sequences correspond to W1 numbers; the fourth value indicates belonging to the second m-sequence, and W2 second m-sequences correspond to W2 numbers. The third and fourth values ​​can be any two different integers, with the third value being 1 and the fourth value being 0 as an example. The numbering rules for the W1 numbers corresponding to the W1 first m-sequences and the W2 numbers corresponding to the W2 second m-sequences can be the same or different, and the numbering ranges can also be the same or different. For example, the W1 first m-sequences are numbered 1 to W1, and the W2 second m-sequences are numbered 1 to W2. Then the number "1-1" represents the first m-sequence numbered 1 among the W1 first m-sequences, the number "0-1" represents the second m-sequence numbered 1 among the W2 second m-sequences, the number "1-W1" represents the first m-sequence numbered W1 among the W1 first m-sequences, and the number "0-W2" represents the second m-sequence numbered W2 among the W2 second m-sequences.

[0321] The order of m-sequence numbers within an m-sequence set:

[0322] In some embodiments, all m-sequences in the m-sequence set are first arranged according to a specific rule and then assigned numbers to form W m-sequences numbered in the order of 0, 1, 2, ..., W-1. Alternatively, all m-sequences in the m-sequence set are first randomly arranged and then assigned numbers to form W m-sequences numbered in the order of 0, 1, 2, ..., W-1.

[0323] In some embodiments, all m-sequences in the m-sequence set are first assigned numbers, and then all the m-sequences are arranged according to a specific rule. Alternatively, all the m-sequences in the m-sequence set are first assigned numbers, and then all the m-sequences are randomly arranged. Therefore, the numbering order in the resulting m-sequence set may be disrupted and not the numbering order from 0 to W-1.

[0324] In some embodiments, the numbering order of the m-sequences in the m-sequence set is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0325] Illustratively, each m-sequence in the m-sequence set has a one-to-one corresponding number, and the number order of the m-sequences in the m-sequence set is arranged from small to large according to the number value, or from large to small according to the number value.

[0326] In some embodiments, the numbering order of the first m-sequence in the m-sequence set is determined according to at least one of the following: the corresponding primitive polynomial coefficient, the binary number of the corresponding primitive polynomial coefficient, and the number value of the first m-sequence.

[0327] In some embodiments, the first m-sequences in the m-sequence set are arranged from small to large according to the number values ​​of the first m-sequences, or arranged from large to small according to the number values ​​of the first m-sequences.

[0328] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is arranged according to the coefficients of the primitive polynomial that generated the first m-sequences. Exemplarily, all first m-sequences are arranged in order from higher to lower powers of the primitive polynomial coefficients. Exemplarily, all first m-sequences are arranged in order from lower to higher powers of the primitive polynomial coefficients.

[0329] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is arranged according to the binary numbers of the corresponding primitive polynomial coefficients. Exemplarily, the primitive polynomial coefficients are represented by binary numbers, and all first m-sequences are arranged in ascending order according to the binary numbers corresponding to the primitive polynomials. Exemplarily, all first m-sequences are arranged in descending order according to the binary numbers corresponding to the primitive polynomials.

[0330] In some embodiments, the numbering order of the second m-sequences in the m-sequence set is determined based on at least one of the following: a cyclic offset, the numbering order of the corresponding first m-sequences, the corresponding primitive polynomial coefficients, the binary number of the corresponding primitive polynomial coefficients, and the number value of the second m-sequence.

[0331] In some embodiments, the second m-sequences in the m-sequence set are arranged from small to large according to the number values ​​of the second m-sequences, or arranged from large to small according to the number values ​​of the second m-sequences.

[0332] In some embodiments, the numbering order of the second m-sequences in the m-sequence set is arranged according to the cyclic offset. Exemplarily, the second m-sequences are arranged in ascending order of the cyclic offset. Exemplarily, the second m-sequences are arranged in descending order of the cyclic offset.

[0333] In some embodiments, within the m-sequence set, all first m-sequences are arranged first (they may be arranged according to binary numbers and / or primitive polynomial coefficients and / or numbered values, as described above), and then all second m-sequences are arranged (they may be arranged according to cyclic offsets and / or the numbering order of the first m-sequences and / or binary numbers and / or primitive polynomial coefficients and / or numbered values, as described above). All second m-sequences are arranged after all first m-sequences. For example, assuming that all first m-sequences are represented as M 1,1 ,M 1,2 …,M 1,X , assuming that the entire second m sequence is represented by M 2,1 ,M 2,2 …,M 2,Y , then the order of the m sequences in the m sequence set is M 1,1 ,M 1,2 …,M 1,X ,M 2,1 ,M 2,2 …,M 2,Y , or, M 1,X ,M 1,X-1 …,M 1,1 ,M 2,Y ,M 2,Y-1 …,M 2,1 .

[0334] In some embodiments, within an m-sequence set, all second m-sequences are arranged first (they may be arranged according to the order of cyclic offsets and / or the numbering of first m-sequences and / or binary numbers and / or primitive polynomial coefficients and / or numbering values, as described above), and then all first m-sequences are arranged (they may be arranged according to binary numbers and / or primitive polynomial coefficients and / or numbering values, as described above), with all first m-sequences following all second m-sequences.

[0335] In some embodiments, within an m-sequence set, the first m-sequence and the second m-sequence are arranged alternately. Exemplarily, X first m-sequences are arranged within the m-sequence set (which may be arranged according to binary numbers and / or primitive polynomial coefficients and / or numbered values, as described above), and each second m-sequence is arranged after its corresponding first m-sequence in ascending order of cyclic offset. Exemplarily, X first m-sequences are arranged within the m-sequence set, and each second m-sequence is arranged after its corresponding first m-sequence in descending order of cyclic offset. Exemplarily, X first m-sequences are arranged within the m-sequence set, and each second m-sequence is arranged after its corresponding first m-sequence in ascending order of numbered values. Exemplarily, X first m-sequences are arranged within the m-sequence set, and each second m-sequence is arranged after its corresponding first m-sequence in descending order of numbered values.

[0336] The numbering order rules of the first m-sequence and the second m-sequence can be the same or different. Exemplarily, the first m-sequence and the second m-sequence are both arranged according to the numbering values. Exemplarily, the first m-sequence is arranged according to the coefficients of the primitive polynomial, and the second m-sequence is arranged according to the cyclic offset. Other possibilities are described above and will not be repeated here.

[0337] Then, it is introduced how the m-sequence subset is determined, selected or indicated.

[0338] In some embodiments, the number of m-sequences in the m-sequence subset is preconfigured or agreed upon in a communication protocol. Optionally, the number of first m-sequences in the m-sequence subset is preconfigured or agreed upon in a communication protocol. Optionally, the number of second m-sequences in the m-sequence subset is preconfigured or agreed upon in a communication protocol.

[0339] In some embodiments, the m-sequence subset is randomly selected by the terminal device from the m-sequence set. Alternatively, the m-sequence subset is a default subset of the m-sequence set. For example, the m-sequence subset is a subset consisting of m-sequences with odd numbers by default, or a subset consisting of m-sequences with numbers from 1 to 64 by default, or a subset consisting of m-sequences with the last several digits by default, etc.

[0340] In some embodiments, the m-sequence set is divided into at least one m-sequence subset, and each m-sequence subset has a one-to-one corresponding set number.

[0341] In some embodiments, the m-sequence subset is indicated by a network device. Exemplarily, the network device indicates the set number of the m-sequence subset via signaling, wherein the signaling is, for example, one or more of system information, RRC signaling, MAC CE, DCI, etc.

[0342] In some embodiments, the m-sequence subset used to generate the first sequence is determined or selected based on the cell identifier of the terminal device. Exemplarily, the set number of the m-sequence subset is determined according to the cell identifier of the terminal device.

[0343] In some embodiments, the set number of the m-sequence subset used to generate the first sequence is equal to the cell identifier of the terminal device. For example, the cell identifier of the terminal device is 20, and the m-sequence subset used to generate the first sequence is the m-sequence subset numbered 20 in the m-sequence set.

[0344] In some embodiments, the set number of the m-sequence subset used to generate the first sequence is determined according to a mathematical operation result of a cell identifier of the terminal device.

[0345] Exemplarily, the m-sequence set is divided into x m-sequence subsets (x ≥ 1), and the set number of the m-sequence subset used to generate the first sequence is equal to the modulo result of the cell identifier of the terminal device and x. Exemplarily, the cell identifier of the terminal device is 18, x is 5, and 18 mod 5 = 3. Then, the m-sequence subset used to generate the first sequence is the m-sequence subset numbered 3 in the m-sequence set.

[0346] Exemplarily, the set number of the m-sequence subset used to generate the first sequence is equal to an integer multiple of the cell identifier of the terminal device, or equal to the rounded-up result of the quotient of the cell identifier of the terminal device and x, or equal to the rounded-down result of the quotient of the cell identifier of the terminal device and x, and so on.

[0347] After sorting the m-sequences in the m-sequence set based on the above method, an m-sequence subset can be obtained. Based on the total number S of sequences in the m-sequence subset and the first sequence, a first sequence corresponding to the required number can be obtained. The first sequence includes all or part of the m-sequences in the m-sequence subset. The number of each sequence in the first sequence can correspond to the number of the preamble sequence, that is, the number of each sequence in the first sequence corresponds one-to-one with the number of the preamble sequence. Exemplarily, the m-sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 0; the m-sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 1; and so on. Exemplarily, the m-sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 1; the m-sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 2; and so on.

[0348] The m-sequence subset corresponding to a cell can be determined by the second method. Therefore, whether different cells can use the same m-sequence subset is a matter for further discussion.

[0349] Similar to Solution 1, this embodiment of the present application supports different cells corresponding to completely identical m-sequence subsets, partially identical m-sequence subsets, or completely different m-sequence subsets. Whether the m-sequence subsets are identical can be determined by whether the set numbers are identical, or by whether the m-sequence numbers within the m-sequence subsets are consistent.

[0350] If different cells correspond to different m-sequence subsets, different first sequences can be generated for different cells, so that terminal devices in different cells can select preamble code sequences from different first sequences, thereby avoiding preamble code conflicts and interference problems between cells as much as possible.

[0351] For example, assuming that cell A corresponds to the m-sequence subset {0, 2, 4, 6, 8} with a set number of 2, it means that the first sequence used by cell A includes the m-sequences with sequence numbers 0, 2, 4, 6, and 8. assuming that cell B corresponds to the m-sequence subset {1, 5, 7} with a set number of 5, it means that the first sequence used by cell B includes the m-sequences with sequence numbers 1, 5, and 7. It can be seen that the m-sequence subset corresponding to cell A is different from the m-sequence subset corresponding to cell B, and the first sequences generated according to different m-sequence subsets are naturally different. Therefore, the possibility of conflict and interference between terminal devices in cell A and terminal devices in cell B when sending preamble code sequences is significantly reduced.

[0352] After understanding how the first sequence is generated, we can further consider how to generate the preamble sequence sent by the terminal device. The embodiment of the present application provides two solutions for generating the preamble sequence.

[0353] Solution 1: According to the above-mentioned method 1 or method 2, the terminal device generates a first sequence and randomly selects a sequence from the first sequence as the preamble sequence when sending the preamble sequence.

[0354] It can be seen that in solution 1, the terminal device actually generates a preamble sequence set for the cell where it is located, and when a preamble sequence needs to be sent, it selects one from the generated preamble sequence set.

[0355] Solution 2: The terminal device first determines the number of the preamble sequence to be sent in the first sequence, and then generates the preamble sequence according to the method 1 or method 2 described above.

[0356] It can be seen that in solution 2, the terminal device actually only needs to generate the preamble code sequence that it needs to send one by one.

[0357] Next, we will first introduce the scheme 1 for generating the preamble sequence:

[0358] The generation of the first sequence may refer to the aforementioned method 1 (generating a first sequence corresponding to a cell based on X first m-sequences) or method 2 (generating a first sequence corresponding to a cell based on an m-sequence subset).

[0359] In some embodiments, after the terminal device generates a first sequence corresponding to a cell, it stores the first sequence in a memory, which can be local or non-local, such as a server, a cloud platform, a virtualization center, etc.

[0360] In some embodiments, different terminal devices within the same cell each randomly select a sequence from the first sequence as the preamble sequence. Alternatively, different terminal devices within the same cell each select a sequence from the first sequence according to a specific rule as the preamble sequence. The preamble sequences selected by different terminal devices should be different to avoid preamble conflicts within the cell. However, it is not ruled out that different terminal devices may select the same preamble sequence, which may cause a conflict. Subsequently, the network device will need to reconfirm the random access situation with the terminal device that caused the conflict.

[0361] Next, we introduce the second method for generating the preamble sequence:

[0362] Since only one-to-one correspondence is required to generate the preamble sequence to be sent, it is first necessary to clarify which one of the first sequences the preamble sequence is. Optionally, the network device indicates to the terminal device that the preamble sequence in the first sequence is numbered 1. s Alternatively, the communication protocol stipulates that the terminal device uses the first sequence numbered 1 s Alternatively, the terminal device autonomously determines that the preamble sequence is numbered 1 in the first sequence. s .

[0363] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: first starting information, a cyclic shift step, and a value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0364] Combined I s and other first sequence information, such as the first starting information, the cyclic shift step size N CS , the numbering order of the N first m-sequences, etc., can determine which basic m-sequence is used to generate the preamble sequence.

[0365] Exemplarily, the first sequence information includes the number I of the preamble sequence sent by the terminal device in the first sequence. s , and the numbering order of the N first m sequences. The terminal device is based on I s, uniquely determine the preamble sequence to be sent. If the preamble sequence is a basic m-sequence, the preamble sequence can be directly generated according to the stored and / or configured sequence information.

[0366] Exemplarily, the first sequence information includes the number I of the preamble sequence sent by the terminal device in the first sequence. s , cyclic shift step size N CS , and the numbering order of the N first m sequences. The terminal device is based on I s Uniquely determine the preamble sequence to be sent. If the preamble sequence is a cyclic shift sequence, the stored and / or configured sequence information and cyclic shift step size N can be used. CS The preamble sequence is directly generated.

[0367] The embodiment of the present application supports formulating the above-mentioned solution 2 for generating the preamble sequence.

[0368] Assume that combined with I s The basic m-sequence determined by the first sequence information and other first sequence information is the third m-sequence, that is, the preamble sequence is generated according to the third m-sequence.

[0369] In some embodiments, the sequence element numbered n in the preamble sequence is determined based on the sequence element numbered n′ in the third m-sequence. Alternatively, the value of the nth bit in the preamble sequence is determined based on the value of the n′th bit in the third m-sequence.

[0370] In some embodiments, n′ is determined based on at least one of the following: n, a cyclic shift step size, a number of the preamble sequence in the first sequence, and a first length value. The first length value is the length of the third m-sequence. n is greater than or equal to 0 and less than the first length value.

[0371] In some embodiments, n′ is determined based on a first modulo result. The first modulo result is a modulo result of the first sum value and the first length value. The first sum value is the sum of n and a target cyclic offset. The target cyclic offset is the cyclic offset of the target sequence relative to the third m-sequence.

[0372] In some embodiments, the target cyclic offset is equal to the first product. The first product is determined according to the cyclic shift step size and the target number. The target number is the target sequence generated in the third m sequence. The target sequence is used to generate the preamble sequence, and the preamble sequence can be obtained after the target sequence is modulated.

[0373] In some embodiments, the first product = cyclic shift step length * target number. For example, the order of numbering the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6. If the first starting information indicates e = 3, it means that the first sequence corresponding to the cell is generated based on the first m-sequence numbered 0 and several subsequent first m-sequences. Assuming that the cyclic shift step length N CS It is determined that each first m-sequence can generate 12 m-sequences (including the first m-sequence itself). s =30, then, considering that the first m-sequences numbered 0 and 4 generate a total of 12*2=24 m-sequences, 30-24=6, the preamble sequence should be the cyclic shift sequence of the first m-sequence numbered 3. That is, The target sequence can be found by cyclically shifting the first m sequence ranked at the 5th position among the N first m sequences, and the first m sequence ranked at the 5th position is the first m sequence numbered 3. In addition to the first m sequence numbered 3 itself, the target sequence should be found by cyclic shifting the first m sequence numbered 3. CS The 30th m-sequence can be obtained by cyclically shifting the first m-sequence numbered 3 five times. Therefore, the target sequence is the five-shift sequence of the first m-sequence numbered 3, and the cyclic offset of the target sequence relative to the first m-sequence numbered 3 is C=N. CS *(6-1).

[0374] In some embodiments, the sequence element numbered n in the preamble sequence is the difference between the value 1 and the second product. The second product is the product of the value 2 and the sequence element numbered n' in the first m-sequence. It can also be understood that the value of the n-th bit in the preamble sequence is equal to 1 minus the second product, and the second product is equal to 2 and the value of the n'-th bit in the third m-sequence.

[0375] For example, the preamble sequence can be expressed as formula (10). preamble (n) represents the preamble sequence, x0(n) represents the third m sequence used to generate the preamble sequence, N CS represents the cyclic shift step size, I s Indicates the number of the preamble sequence in the first sequence, and L indicates the sequence length of x0(n). Target number d preamble (n) = 1-2x0((n+N CS *I m )mod L) (10)

[0376] In some embodiments, formula (10) is applicable to the case where the preamble sequence is obtained through BPSK modulation.

[0377] In some embodiments, the sequence element numbered n in the preamble sequence is the sequence element numbered n' in the first m-sequence. It can also be understood that the value of the nth bit in the preamble sequence is equal to the value of the n'th bit in the third m-sequence.

[0378] For example, the preamble sequence can be expressed as formula (11). preamble (n) represents the preamble sequence, x0(n) represents the third m sequence used to generate the preamble sequence, N CS represents the cyclic shift step size, I s Indicates the number of the preamble sequence in the first sequence, and L indicates the sequence length of x0(n). Target number d preamble (n) = x0((n+N CS *I m )mod L) (11)

[0379] In some embodiments, formula (11) is applicable to the case where the preamble code sequence is obtained through OOK modulation.

[0380] [Example] Assume that the order of the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6, the first starting information indicates e = 3, and the cyclic shift step size is N CS =3, the length of each first m-sequence is equal, both L = 127. Then, a first m-sequence can generate a total of There are m-sequences (including the first m-sequence itself). The total number of sequences in the first sequence is S (S≥1), and the numbers or indexes of the S sequences range from 0 to S-1.

[0381] 【1】Assume that the preamble sequence is numbered I in the first sequence s =5<42, then, the target sequence can be found by cyclically shifting a basic m-sequence. The preamble sequence is generated based on the cyclic shift sequence of the first m-sequence numbered 0. The first m-sequence numbered 0 is the first m-sequence indicated by the first start information.

[0382] The above process can be expressed by the formula: Therefore, the target sequence can be found by performing a cyclic shift on the first m-sequence ranked at position 3 among the N first m-sequences, and the first m-sequence ranked at position 3 is numbered 0.

[0383] At this time, the target number Target loop offset = N CS *I m =3*4.

[0384] If calculated by formula (10), we can get dpreamble (n)=1-2x0((n+3*4)mod 127).

[0385] If calculated by formula (11), we can get d preamble (n)=x0((n+3*4)mod 127).

[0386] Here, x0(n) represents the first m-sequence numbered 0, n′=(n+3*4) mod 127, and the cyclic offset of the target sequence relative to x0(n) is 12.

[0387] 【2】Assume that the preamble sequence is numbered I in the first sequence s =50>42, then the preamble sequence is obtained by cyclic shifting the first m-sequence numbered 4. The first m-sequence numbered 4 is immediately after the first m-sequence numbered 0 indicated by the first start information.

[0388] The above process can be expressed by the formula: Therefore, the target sequence can be found by performing a cyclic shift on the first m-sequence ranked at the 4th position among the N first m-sequences, and the first m-sequence ranked at the 4th position is the first m-sequence numbered 4.

[0389] At this time, the target number Target loop offset = N CS *I m =3*7.

[0390] If calculated by formula (10), we can get d preamble (n)=1-2x0((n+3*7)mod 127).

[0391] If calculated by formula (11), we can get d preamble (n)=x0((n+3*7)mod 127).

[0392] Here, x0(n) represents the first m-sequence numbered 4, n′=(n+3*7) mod 127, and the cyclic offset of the target sequence relative to x0(n) is 21.

[0393] In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending a preamble sequence through an m-sequence. It supports both selecting a first m-sequence to form a first sequence and constructing an m-sequence set to form a first sequence, providing a flexible construction solution for the first sequence corresponding to a cell. It supports both the terminal device randomly selecting an m-sequence as a preamble sequence from the first sequence and the terminal device generating a preamble sequence through information such as the cyclic shift step size and the number of the preamble sequence in the first sequence, providing a flexible determination solution for the preamble sequence corresponding to a terminal device. Furthermore, it supports both different cells using the same first sequence to save communication resources and different cells using different first sequences to avoid conflicts within the communication system and ensure communication efficiency within the communication system. Furthermore, the m-sequence has good autocorrelation and cross-correlation characteristics, and the preamble sequence generated by the m-sequence still has such good characteristics, which helps to improve the accuracy and reliability of uplink synchronization and frequency offset estimation, and ensure the reliability, success rate, and efficiency of random access. Moreover, an m-sequence can be cyclically shifted to obtain more m-sequences, which can provide a large number of optional preamble sequences for a cell and support the provision of preamble sequences for a large number of terminal devices in the communication system.

[0394] Next, taking the case where the type of the first sequence is a gold sequence as an example, the generation of the preamble sequence based on the gold sequence is further described based on step 710 .

[0395] FIG13 shows a flow chart of a method for transmitting a preamble provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0396] Step 1110: Send a preamble sequence, where the preamble sequence is one of the first sequences; wherein the first sequence is generated according to the gold sequence.

[0397] In some embodiments, the preamble sequence is a default sequence in the first sequence. Alternatively, the preamble sequence is a sequence randomly selected by the terminal device in the first sequence. Alternatively, the preamble sequence is a sequence selected by the terminal device in the first sequence according to a specific rule. Alternatively, the preamble sequence is a sequence in the first sequence indicated by the network device.

[0398] In some embodiments, the first sequence includes all preamble sequences corresponding to the cell in which the terminal device is located. This can also be understood as meaning that the preamble sequences transmitted by all terminal devices in the same cell belong to the first sequence. Therefore, the first sequence can be considered a cell-level preamble sequence set, and the preamble sequence transmitted by the terminal device is associated with the cell in which it is located.

[0399] In some embodiments, the total number of preamble sequences corresponding to a cell is preconfigured or agreed upon in a communication protocol. That is, the total number of preamble sequences included in the first sequence is preconfigured or agreed upon in a communication protocol.

[0400] In some embodiments, the number of gold sequences used to generate the first sequence is preconfigured or agreed upon in a communication protocol.

[0401] In some embodiments, the binary sequence used to generate the first sequence includes a first number of gold sequences. The first number of gold sequences is generated based on at least one preferred pair of m-sequences. The relevant information regarding preferred m-sequence pairs has been described above. Based on two different primitive polynomials, both of order r, at most one preferred pair of m-sequences can be generated. Modulo-2 addition of the preferred m-sequence pairs yields a gold sequence. Therefore, each cyclic shift of the preferred m-sequence pairs yields a new gold sequence.

[0402] In some embodiments, the first number is agreed upon by a communication protocol, configured by a network device, or autonomously determined by a terminal device. Exemplarily, the first number is adjusted by the network device or the terminal device based on one or more of the following factors: terminal device capabilities, network device capabilities, communication system capacity, communication requirements, the total number of cell identifiers, the number of terminal devices in the same cell, and the like.

[0403] Similar to the case of generating a preamble sequence according to an m-sequence, the embodiment of the present application provides two methods for generating a first sequence according to a gold sequence.

[0404] Method 1: first determine Z gold sequence families corresponding to a cell, and generate a first sequence corresponding to the cell from the Z gold sequence families. In this case, the first number of gold sequences are all or part of the sequences in the Z gold sequence families.

[0405] Method 2: First, a large gold sequence set is constructed, including several gold sequence families. Then, the gold sequence set is divided into several gold sequence subsets, and a gold sequence subset is mapped as the first sequence of a cell. In this case, the first number of gold sequences is all or part of the sequences in a gold sequence subset.

[0406] The embodiments of the present application involve the concept of gold sequence families. Here, how to generate a gold sequence family is introduced.

[0407] As can be seen from the foregoing, the gold sequence is obtained by adding a preferred m-sequence pair modulo 2. In the embodiment of the present application, the two m-sequences included in a preferred m-sequence pair are referred to as the fourth m-sequence and the fifth m-sequence. It will be understood that in this application, the names such as "first," "second," "third," "fourth," and "fifth" are only used to distinguish and describe, and do not imply restrictions on the order, naming, etc. of the m-sequences. For example, the fourth m-sequence is any one m-sequence in the preferred m-sequence pair, and the fifth m-sequence is the other m-sequence in the preferred m-sequence pair.

[0408] Gold sequence family generation method 1: the fourth m sequence remains unchanged, and the fifth m sequence is cyclically shifted

[0409] Assuming the number of shift register stages is r, if the fourth m sequence remains unchanged and the fifth m sequence is cyclically shifted, the modulo-2 addition of the cyclic shift sequences of the fourth m sequence and the fifth m sequence can yield at most 2 r -1 gold sequence, plus the fourth m sequence and the fifth m sequence itself, then, through method 1, at most 2 r -1+2=2 r +1 gold sequence.

[0410] For the sake of distinction, the gold sequences generated by method 1 can be referred to as the first gold sequence family, and the gold sequences included in the first gold sequence family are called first gold sequences. The first gold sequence family includes at most 2 r +1 first gold sequence. For example, if r=5, a maximum of 33 first gold sequences can be obtained through method 1.

[0411] It should be noted that 2 r +1 is the upper limit of the number of first gold sequences that the first gold sequence family can contain, but it does not mean that the first gold sequence family must contain 2 r +1 first gold sequence.

[0412] Optionally, the number of first gold sequences in the first gold sequence family is determined according to at least one of the following: the level r, the length L0 of the fourth m-sequence, the length L1 of the fifth m-sequence, the cyclic offset, and the cyclic shift step.

[0413] Optionally, the number of first gold sequences in the first gold sequence family is configured by a network device or agreed upon by a communication protocol.

[0414] Assuming that the number of optimal pairs of m sequences is k, then the upper limit of the number of gold sequences that can be generated by method 1 is k*(2 r+1). Wherein, k is determined according to the number of shift register stages r and the aforementioned formula (8), and represents the number of optimal pairs of m sequences that can be found when the number of stages is r.

[0415] Gold sequence family generation method 2: the fourth m sequence is cyclically shifted, and the fifth m sequence is also cyclically shifted

[0416] Assuming the number of shift register stages is r, if the fourth m sequence remains unchanged and the fifth m sequence is cyclically shifted, the modulo-2 addition of the cyclic shift sequences of the fourth m sequence and the fifth m sequence can yield at most 2 r -1 gold sequence.

[0417] Assuming the number of shift register stages is r, if the fifth m sequence remains unchanged and the fourth m sequence is cyclically shifted, the modulo-2 addition of the cyclic shift sequences of the fifth m sequence and the fourth m sequence can yield at most 2 r -1 gold sequence.

[0418] Then, the fourth m-sequence is cyclically shifted, and the fifth m-sequence is cyclically shifted. The cyclic shift sequence of the fourth m-sequence and the cyclic shift sequence of the fifth m-sequence are added modulo 2, and at most (2 r -1)*(2 r -1) gold sequence.

[0419] For the sake of distinction, the gold sequences generated by method 2 can be referred to as the second gold sequence family, and the gold sequences included in the second gold sequence family are called second gold sequences. The second gold sequence family includes at most (2 r -1)*(2 r -1) second gold sequences. For example, if r=5, the fourth m-sequence and the fifth m-sequence are cyclically shifted respectively, and a maximum of 961 second gold sequences can be obtained.

[0420] It should be noted that (2 r -1)*(2 r -1) is the upper limit of the number of second gold sequences that the second gold sequence family can contain, but it does not mean that the second gold sequence family must contain (2 r -1)*(2 r -1) second gold sequence.

[0421] Optionally, the number of second gold sequences in the second gold sequence family is determined according to at least one of the following: the level r, the length L0 of the fourth m-sequence, the length L1 of the fifth m-sequence, the cyclic offset, and the cyclic shift step.

[0422] Optionally, the number of second gold sequences in the second gold sequence family is configured by the network device or agreed upon by the communication protocol.

[0423] Assuming that the number of optimal pairs of m sequences is k, then the upper limit of the number of gold sequences that can be generated by method 2 is k*(2 r -1)*(2 r -1). Wherein, k is determined according to the number of shift register stages r and the aforementioned formula (8), and represents the number of optimal pairs of m sequences that can be found when the number of stages is r.

[0424] Method 3 for generating gold sequence family: cyclic shift of the first gold sequence

[0425] As described in Method 1, when the number of shift register stages is r, the first gold sequence family can include at most 2 r +1 first gold sequence. Mode 3 obtains more gold sequences by continuously performing cyclic shift on the first gold sequence in the first gold sequence family.

[0426] After a gold sequence is cyclically shifted, it can get up to 2 r -1 gold sequence. Then, 2 r After cyclic shift of +1 gold sequence, we can get (2 r +1)*(2 r -1) gold sequence.

[0427] For the sake of distinction, the gold sequences generated by mode 3 can be referred to as the third gold sequence family, and the gold sequences included in the third gold sequence family are called third gold sequences. The third gold sequence family includes at most (2 r +1)*(2 r For example, if r=5, a maximum of 33 first gold sequences can be obtained through method 1, and a maximum of 33*31=1023 third gold sequences can be obtained through method 3.

[0428] It should be noted that (2 r +1)*(2 r -1) is the upper limit of the number of third gold sequences that the third gold sequence family can contain, but it does not mean that the third gold sequence family must contain (2 r +1)*(2 r -1) third gold sequence.

[0429] Optionally, the number of third gold sequences in the third gold sequence family is determined according to at least one of the following: the level r, the length L0 of the fourth m-sequence, the length L1 of the fifth m-sequence, the cyclic offset, and the cyclic shift step.

[0430] Optionally, the number of third gold sequences in the third gold sequence family is configured by the network device or agreed upon by the communication protocol.

[0431] Assuming that the number of optimal pairs of m sequences is k, then the upper limit of the number of gold sequences that can be generated by method 3 is k*(2 r +1)*(2 r -1). Wherein, k is determined according to the number of shift register stages r and the aforementioned formula (8), and represents the number of optimal pairs of m sequences that can be found when the number of stages is r.

[0432] It should be noted that Mode 1, Mode 2, and Mode 3 can be used individually or in combination. That is, the first, second, and third gold sequence families do not conflict with each other. First sequences comprising different types of gold sequence families can coexist within a communication system. For example, the first sequence corresponding to cell A includes the first and third gold sequence families, while the first sequence corresponding to cell B includes the second gold sequence family.

[0433] It can be seen that, compared to Method 1, when the number of levels is the same, Methods 2 and 3 can obtain more sequences. When the first sequence is expected to contain more gold sequences, Methods 2 and 3 are more suitable. However, it is clear that Method 3 is more complex than Method 2, and Method 2 is more complex than Method 1. Therefore, if the complexity of generating the first sequence is expected to be lower, Method 1 is more suitable.

[0434] In this application, a gold sequence family may also be referred to as a gold sequence group or a gold sequence set. One gold sequence family corresponds to one preferred m-sequence pair.

[0435] After understanding how to generate the gold sequence family, we can consider how to generate the first sequence based on the gold sequence family.

[0436] Next, we will first introduce the first method, which generates a first sequence corresponding to a cell based on Z gold sequence families. It can be understood that the Z gold sequence families correspond to Z pairs of m-sequence preferred pairs.

[0437] In some embodiments, the value of Z is determined by a communication protocol, configured by a network device, or autonomously determined by a terminal device. For example, the value of X is adjusted by the network device or the terminal device based on one or more of the following factors: terminal device capabilities, network device capabilities, communication system capacity, communication requirements, the total number of cell identifiers, the number of terminal devices in the same cell, and the like.

[0438] In some embodiments, the Z gold sequence families are agreed upon by a communication protocol, or indicated by a network device, or determined by a terminal device.

[0439] In some embodiments, the Z gold sequence families are Z of the M gold sequence families, where M is an integer greater than or equal to 1, and 1≤Z≤M. The M gold sequence families are determined according to the number of shift register stages r, specifically, according to the number of preferred pairs of m sequences corresponding to the number of shift register stages r.

[0440] Since there is an upper limit on the number of m-sequence pairs that can be generated at different levels, there is also an upper limit on the number of gold sequence families that correspond one-to-one to each m-sequence pair. The value of M can be equal to or less than the upper limit on the number of m-sequence pairs. For example, if three m-sequence pairs are found according to Equation (8) when the level is r, then the value of M can be less than or equal to 3.

[0441] Optionally, the Z gold sequence families are any Z gold sequence families from the M gold sequence families. Optionally, the Z gold sequence families are Z gold sequence families selected from the M gold sequence families according to a specific rule. Optionally, the Z gold sequence families are Z default gold sequence families of the M gold sequence families used by the communication system. Optionally, the Z gold sequence families are Z gold sequence families indicated by the network device from the M gold sequence families.

[0442] Since the Z gold sequence families are among the M gold sequence families, we first need to introduce the design of the M gold sequence families, and then introduce how to determine / indicate / select these Z gold sequence families.

[0443] First, the design of the M gold sequence families is introduced. It is understood that in order to facilitate the distinction between the various gold sequence families, the M gold sequence families should have corresponding numbers or indexes, and the embodiment of the present application uses the numbering as an example for description.

[0444] In some embodiments, the M gold sequence families are numbered 0, 1, 2, ..., M-1, or the M gold sequence families are numbered 1, 2, ..., M, etc. Other numbering schemes that can distinguish the gold sequence families are also applicable to the embodiments of the present application.

[0445] In some embodiments, the M gold sequence families are first arranged according to a specific rule and then assigned numbers.

[0446] In some embodiments, the M gold sequence families are first arranged according to the numbers of the m sequence preference pairs, and then M numbers are allocated.

[0447] Assume that M pairs of m-sequences are selected from N m-sequences according to formula (8). It is understood that the N m-sequences have one-to-one corresponding sequence numbers, and these N m-sequences have a numbering order. Optionally, the numbering order of the N m-sequences is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device. For details, please refer to the relevant content in the "Design of N First m-Sequences" above, which will not be repeated here.

[0448] Then, the numbering of all m-sequences included in the M-pair of m-sequence preferred pairs can be consistent with or inconsistent with their numbering in the N m-sequences. For example, after selecting the M-pair of m-sequence preferred pairs from the N m-sequences, all m-sequences included in the M-pair of m-sequence preferred pairs are renumbered starting from 0 or 1. Whether or not all m-sequences included in the M-pair of m-sequence preferred pairs continue to use their numbering in the N m-sequences is supported by the embodiments of the present application, as long as each m-sequence has a one-to-one corresponding numbering.

[0449] Illustratively, the number of a preferred m-sequence pair is the number of the fourth m-sequence in the preferred m-sequence pair. Optionally, the fourth m-sequence is any m-sequence in the preferred m-sequence pair, or the fourth m-sequence is an m-sequence with a smaller number in the preferred m-sequence pair, or the fourth m-sequence is an m-sequence with a larger number in the preferred m-sequence pair, and so on.

[0450] For example, the number of a preferred m-sequence pair is the product of the numbers of the two m-sequences included in the preferred m-sequence pair. For example, if a preferred m-sequence pair includes m-sequences numbered 2 and 4, the number of the preferred m-sequence pair is 8.

[0451] Illustratively, the number of a preferred m-sequence pair is the sum, difference, or modulo result of the numbers of the two m-sequences included in the preferred m-sequence pair.

[0452] In some embodiments, the numbers of the M gold sequence families are consistent with the numbers of their corresponding m-sequence preferred pairs. For example, if a certain m-sequence preferred pair is numbered 3, then the gold sequence family generated by the m-sequence preferred pair is also numbered 3.

[0453] In some embodiments, the M gold sequence families are arranged in ascending order according to the numbering of the M-pairs of m-sequence preferred pairs, and then assigned numbers from 0 to M-1, or assigned numbers from 1 to M. For example, M=5, the M-pairs of m-sequence preferred pairs are numbered 1, 3, 5, 7, and 9, the gold sequence family generated by the m-sequence preferred pair numbered 1 is numbered 1, and the gold sequence family generated by the m-sequence preferred pair numbered 9 is numbered 5.

[0454] In some embodiments, the M gold sequence families are arranged in descending order according to the numbering of the M-pairs of m-sequence preferred pairs, and then assigned numbers from 0 to M-1, or assigned numbers from 1 to M. For example, M=5, the M-pairs of m-sequence preferred pairs are numbered 9, 7, 5, 3, and 1, the gold sequence family generated by the m-sequence preferred pair numbered 9 is numbered 1, and the gold sequence family generated by the m-sequence preferred pair numbered 1 is numbered 5.

[0455] In some embodiments, numbers are first assigned to the M gold sequence families, and then the M gold sequence families are arranged according to a specific rule. Therefore, the numbering order of the M gold sequence families may be disrupted, for example, not in the order from 0 to M-1.

[0456] For example, the M gold sequence families are numbered in the order of 2, 0, M-1…, 1, which means that the gold sequence family numbered 2 is ranked first among the M gold sequence families, and the gold sequence family numbered 1 is ranked Mth among the M gold sequence families.

[0457] In some embodiments, the numbering order of the M gold sequence families is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0458] In some embodiments, the numbering order of the M gold sequence families is determined according to at least one of the following: the level r, the number of gold sequences in the gold sequence family, the length of the gold sequence in the gold sequence family, the number of the gold sequence family, the number of the gold sequence in the gold sequence family, the number of the corresponding m-sequence, the numbering order of the corresponding m-sequence, the corresponding primitive polynomial coefficient, the binary number of the corresponding primitive polynomial coefficient, and the cyclic offset.

[0459] In some embodiments, the numbering order of the M gold sequence families is arranged from small to large according to the numbering values ​​of the gold sequence families, or arranged from large to small according to the numbering values ​​of the gold sequence families.

[0460] In some embodiments, the numbering order of the M gold sequence families is arranged according to the numbering and / or numbering order of the m sequences used to generate the gold sequence families.

[0461] In some embodiments, the numbering order of the M gold sequence families is consistent with the numbering order of their corresponding m-sequence preferred pairs. For example, if the numbering order of the M-pairs of m-sequence preferred pairs is 2, 0, M-1…, 1, then the numbering order of the M gold sequence families is also 2, 0, M-1…, 1.

[0462] In some embodiments, the M gold sequence families are numbered in ascending order according to the numbers of the M pairs of m-sequence preferred pairs. For example, if M=5 and the M pairs of m-sequence preferred pairs are numbered 1, 3, 5, 7, and 9, then the gold sequence family generated by the m-sequence preferred pair numbered 1 is ranked first, and the gold sequence family generated by the m-sequence preferred pair numbered 9 is ranked fifth.

[0463] In some embodiments, the M gold sequence families are numbered in descending order according to the numbers of the M-pair m-sequence preferred pairs. For example, if M=5 and the M-pair m-sequence preferred pairs are numbered 9, 7, 5, 3, and 1, then the gold sequence family generated by the m-sequence preferred pair numbered 9 is ranked first, and the gold sequence family generated by the m-sequence preferred pair numbered 1 is ranked fifth.

[0464] In some embodiments, the M gold sequence families are numbered in ascending order based on the product of the numbers of the two m-sequences included in each of the M preferred m-sequence pairs. For example, if preferred m-sequence pair A includes m-sequences numbered 2 and 3, then the product of the numbers of the two m-sequences included in preferred m-sequence pair A is 6. If preferred m-sequence pair B includes m-sequences numbered 0 and 5, then the product of the numbers of the two m-sequences included in preferred m-sequence pair B is 0. Therefore, the gold sequence family corresponding to preferred m-sequence pair A is arranged after the gold sequence family corresponding to preferred m-sequence pair B.

[0465] In some embodiments, the numbering order of the M gold sequence families is arranged in descending order according to the product of the numbers of the two m sequences respectively included in the M pairs of m-sequences.

[0466] In some embodiments, the M gold sequence families are numbered in ascending order based on the sum of the numbers of the two m-sequences included in each of the M preferred m-sequence pairs. For example, if a preferred m-sequence pair A includes m-sequences numbered 2 and 3, then the sum of the numbers of the two m-sequences included in the preferred m-sequence pair A is 5. If a preferred m-sequence pair C includes m-sequences numbered 0 and 1, then the sum of the numbers of the two m-sequences included in the preferred m-sequence pair C is 1. The gold sequence family corresponding to the preferred m-sequence pair A is then arranged after the gold sequence family corresponding to the preferred m-sequence pair C.

[0467] In some embodiments, the numbering order of the M gold sequence families is arranged in descending order according to the sum of the numbers of the two m-sequences respectively included in the M pairs of m-sequences.

[0468] In some embodiments, the numbering order of the M gold sequence families is first arranged based on the m-sequence with the smaller number in the preferred pair, and then arranged based on the m-sequence with the larger number in the preferred pair. Alternatively, the numbering order of the M gold sequence families is first arranged based on the m-sequence with the larger number in the preferred pair, and then arranged based on the m-sequence with the smaller number in the preferred pair.

[0469] Assume that in a pair of preferred m-sequence pairs, the m-sequence with the smaller number is called sequence E, and the m-sequence with the larger number is called sequence F. For example, if the preferred m-sequence pair C is {0,1}, then in the preferred m-sequence pair C, the m-sequence numbered 0 is called sequence E, and the m-sequence numbered 1 is called sequence F. For another example, if the preferred m-sequence pair D is {1,2}, then in the preferred m-sequence pair D, the m-sequence numbered 1 is called sequence E, and the m-sequence numbered 2 is called sequence F.

[0470] For example, assuming that M pairs of m-sequence preferred pairs are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, respectively, if the sequences E in each preferred pair (i.e., the m-sequences with smaller number values) are first arranged from small to large, there are two pairs of m-sequence preferred pairs whose sequence E is numbered 0, and there are two pairs of m-sequence preferred pairs whose sequence E is numbered 1, and then the sequences F in each preferred pair (i.e., the m-sequences with larger number values) are arranged from small to large, the arrangement order of the M pairs of m-sequence preferred pairs can be obtained as follows: {0, 1}, {0, 3}, {1, 2}, {1, 5}, {4, 6}.

[0471] For example, assuming that M pairs of m-sequence preferred pairs are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, respectively, if they are first arranged from large to small according to the number of the sequence E in each preferred pair, there are two pairs of m-sequence preferred pairs whose sequence E is numbered 0, and there are two pairs of m-sequence preferred pairs whose sequence E is numbered 1, and then the sequence F in each preferred pair is arranged from large to small, the arrangement order of the M pairs of m-sequence preferred pairs can be obtained as: {4, 6}, {1, 5}, {1, 2}, {0, 3}, {0, 1}.

[0472] For example, assuming that the preferred pairs of M pairs of m sequences are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, respectively, if the sequences F in each preferred pair are arranged from large to small according to their numbers, the order of the preferred pairs of M pairs of m sequences can be obtained as follows: {4, 6}, {1, 5}, {0, 3}, {1, 2}, {0, 1}.

[0473] For example, assuming that the preferred pairs of M pairs of m sequences are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, if the sequence F numbers in each preferred pair are arranged from small to large, the order of the preferred pairs of M pairs of m sequences can be obtained as: {0, 1}, {1, 2}, {0, 3}, {1, 5}, {4, 6}.

[0474] It can be understood that when arranging according to sequence E and sequence F in each preferred pair, they are not limited to the order of numbers from small to large or from large to small, and can also be arranged according to primitive polynomial coefficients, binary numbers of primitive polynomial coefficients, etc. For details, please refer to the arrangement rules described above.

[0475] In some embodiments, the numbering order of the M gold sequence families is first arranged based on the first m-sequence in the preferred pair, and then arranged based on the second m-sequence in the preferred pair. Alternatively, the numbering order of the M gold sequence families is first arranged based on the second m-sequence in the preferred pair, and then arranged based on the first m-sequence in the preferred pair.

[0476] For example, if the m-sequence pair C is {0,1}, then the first m-sequence in the m-sequence pair C is the m-sequence on the left, that is, the m-sequence numbered 0; the second m-sequence is the m-sequence on the right, that is, the m-sequence numbered 1. For another example, if the m-sequence pair D is {2,1}, then the first m-sequence in the m-sequence pair D is the m-sequence on the left, that is, the m-sequence numbered 2, and the second m-sequence is the m-sequence on the right, that is, the m-sequence numbered 1.

[0477] For example, the preferred pairs of M pairs of m-sequences are {0, 1}, {2, 1}, {0, 3}, {4, 6}, and {1, 5}. If the numbers of the first m-sequences in each preferred pair are arranged from small to large, and there are two pairs of preferred m-sequences whose first m-sequences are both numbered 0, and then the numbers of the second m-sequences are arranged from small to large, the order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {0, 1}, {0, 3}, {1, 5}, {2, 1}, and {4, 6}.

[0478] For example, the preferred pairs of M pairs of m-sequences are {0, 1}, {2, 1}, {0, 3}, {4, 6}, and {1, 5}. If the numbers of the second m-sequences in each preferred pair are arranged from large to small, and there are two pairs of preferred pairs of m-sequences whose second m-sequences are both numbered 1, and then the numbers of the first m-sequences are arranged from large to small, the order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {4, 6}, {1, 5}, {0, 3}, {2, 1}, and {0, 1}.

[0479] It can be understood that when arranging according to the first m-sequence and the second m-sequence in each preferred pair, they are not limited to the order of numbers from small to large or from large to small, and can also be arranged according to the primitive polynomial coefficients, the binary numbers of the primitive polynomial coefficients, etc. For details, please refer to the arrangement rules described above.

[0480] In some embodiments, the design of the numbering order can be understood as a situation where the gold sequence family has both logical numbers and physical numbers. Among them, the logical number refers to the order of the numbers of the gold sequence family in data logic, such as the numbers 0, 1, 2…, M-1, or the numbers 1, 2…, M in the embodiment of the present application; the physical number refers to the position of the numbers of the gold sequence family in the memory, or the position in the agreed mapping relationship, such as the numbering order (such as 2, 0, M-1…, 1) in the embodiment of the present application. The logical number and the physical number of the gold sequence family can be the same or different. The reason is similar to that of the m sequence, and it supports adjusting the numbering order according to factors such as correlation, storage method, memory management, etc., so that the first sequence corresponding to a cell has a better correlation, and also makes the first sequence of the adjacent cell have a better correlation.

[0481] Then, it is introduced how the Z gold sequence families are determined, selected or indicated.

[0482] In some embodiments, the Z gold sequence families are randomly selected by the terminal device from the M gold sequence families. Alternatively, the Z gold sequence families are default gold sequence families from the M gold sequence families. Exemplarily, the Z gold sequence families are defaulted to the gold sequence family numbered 1 (or other values), or are defaulted to the gold sequence family with the last three digits of the number sequence (or other positions), or are defaulted to the gold sequence family with an even number.

[0483] In some embodiments, the Z gold sequence families are indicated by a network device. Exemplarily, the network device indicates the numbers of the Z gold sequence families via signaling, wherein the signaling may be one or more of system information, RRC signaling, MAC CE, DCI, etc.

[0484] Considering the value of Z, we will discuss how to determine the Z gold sequence families in two cases:

[0485] 1. Case where Z = 1: If Z = 1, it means that the first sequence corresponding to one cell is generated according to one gold sequence family.

[0486] In some embodiments, the gold sequence family is determined or selected based on the cell identifier of the terminal device. Exemplarily, the number of the gold sequence family is determined according to the cell identifier of the terminal device.

[0487] In some embodiments, the number of the gold sequence family corresponding to the first sequence is equal to the cell ID of the terminal device. For example, if the cell ID of the terminal device is 5, the gold sequence family corresponding to the first sequence is the gold sequence family numbered 5 among the M gold sequence families.

[0488] In some embodiments, the number of the gold sequence family corresponding to the first sequence is determined according to a mathematical operation result of a cell identifier of the terminal device.

[0489] Exemplarily, the number of the gold sequence family corresponding to the first sequence is equal to the modulo product of the terminal device's cell ID and M. Here, M is the number of M gold sequence families, determined by the number of shift register stages r. The value of M can be equal to or less than the upper limit of the number of preferred m-sequence pairs. Exemplarily, if the terminal device's cell ID is 9 and the number of stages is r, a maximum of four preferred m-sequence pairs can be generated. Let M be 4, and 9 mod 4 = 1. Then, the gold sequence family corresponding to the first sequence is the gold sequence family numbered 1 among the M gold sequence families.

[0490] Exemplarily, the number of the gold sequence family corresponding to the first sequence is equal to an integer multiple of the cell identifier of the terminal device, or equal to the rounded-up result of the quotient of the cell identifier of the terminal device and M, or equal to the rounded-down result of the quotient of the cell identifier of the terminal device and M, and so on.

[0491] In some embodiments, the network device indicates the number of the gold sequence family used to generate the first sequence, or the communication protocol stipulates the number of the gold sequence family used to generate the first sequence.

[0492] 2. Case where Z>1: If Z>1, it means that the first sequence corresponding to one cell is generated according to multiple gold sequence families.

[0493] In some embodiments, the Z gold sequence families are determined based on the second sequence information. Optionally, at least part of the second sequence information is indicated by the network device, and / or at least part of the second sequence information is agreed upon by the communication protocol, and / or at least part of the second sequence information is determined by the terminal device.

[0494] In some embodiments, the second sequence information includes at least one of the following information:

[0495] The second starting information is used to indicate the starting position of the Z gold sequence families in the M gold sequence families;

[0496] Second length information, used to indicate the value of Z;

[0497] Second end information, used to indicate the end position of the Z gold sequence families in the M gold sequence families;

[0498] The second bitmap, where each bit corresponds to a family of M gold sequences.

[0499] The number of the Z gold sequence families;

[0500] The total number of sequences in the first sequence;

[0501] The number of the preamble sequence sent by the terminal device in the first sequence;

[0502] The cyclic shift step size, also known as the cyclic shift factor;

[0503] The numbering order of the M gold sequence families;

[0504] Cycle offset C.

[0505] Among them, the first sequence can be understood as a set of preamble code sequences corresponding to the cell where the terminal device is located.

[0506] In some embodiments, the second sequence information includes second start information and second length information. Alternatively, the second sequence information includes the second start information, the second length information, and the numbering order of the M gold sequence families. For example, the terminal device determines M = 9 based on the number of shift register stages r, and the communication protocol stipulates that the numbering order of the M gold sequence families is 0, 1, 2, ..., 8. The network device indicates that the second start information = 2 and the second length information = 3. Therefore, the Z gold sequence families include the gold sequence families numbered 2, 3, and 4.

[0507] In some embodiments, the second start information and the second length information may also be represented by a coding value, such as SLIV.

[0508] In some embodiments, the second sequence information includes second start information and second end information. Alternatively, the second sequence information includes second start information, second end information, and the numbering sequence of the M gold sequence families. For example, the network device indicates M = 9, and the numbering sequence of the M gold sequence families is 2, 6, 5, 7, 1, 3, 8, 4, 0. The network device also indicates second start information = 3, and the communication protocol stipulates second end information = 7. Then, the Z gold sequence families include the gold sequence families numbered 5, 7, 1, 3, and 8.

[0509] In some embodiments, the second sequence information includes second length information and second end information. Alternatively, the second sequence information includes second length information, second end information, and the numbering sequence of the M gold sequence families. For example, the communication protocol stipulates that M = 8, and the numbering sequence of the M gold sequence families is 3, 7, 1, 0, 5, 6, 4, 2. If the network device indicates that the second length information = 3 and the second end information = 7, then the Z gold sequence families include the gold sequence families numbered 5, 6, and 4.

[0510] In some embodiments, the first sequence information includes the numbers of the Z gold sequence families. For example, the network device indicates to the terminal device that the Z gold sequence families are numbered 1, 6, and 9, and the terminal device generates the first sequence according to the gold sequence families numbered 1, 6, and 9.

[0511] In some embodiments, the second sequence information includes a second bit map. Alternatively, the second sequence information includes a second bit map and the numbering order of the M gold sequence families. When the bit value is the first value, it indicates that the gold sequence family corresponding to the bit is indicated as one of the Z gold sequence families. When the bit value is the second value, it indicates that the gold sequence family corresponding to the bit is not indicated as one of the Z gold sequence families. Among them, the first value is "1" and the second value is "0", or the first value is "0" and the second value is "1". Of course, the first value and the second value can also be other values. The embodiment of the present application is schematically illustrated by taking the first value "1" and the second value "0" as an example. For example, M=6, the numbering order of the M gold sequence families is 1, 0, 5, 4, 2, 3, and the second bit map includes 6 bits. These 6 bits correspond one-to-one to the M gold sequence families from low to high. Assuming the value of the second bitmap is 001101, it means that the Z gold sequence families include the gold sequence families numbered 5, 4, and 3. The second bitmap can be used to determine the Z discrete gold sequence families. Compared with the solution of determining the gold sequence families based on one or more of the second start information, the second length information, and the second end information, the design of the second bitmap has greater flexibility, but may require more bits for indication.

[0512] In some embodiments, the second sequence information includes a cyclic shift step size and a numbering order of the M gold sequence families. Alternatively, the second sequence information includes a cyclic shift step size and second starting information. Alternatively, the second sequence information includes the second starting information and a numbering order of the M gold sequence families.

[0513] In some embodiments, the second sequence information includes the second starting information, the cyclic shift step, and the numbering order of the M gold sequence families. Alternatively, the second sequence information includes the second starting information, the cyclic shift step, and the total number of sequences in the first sequence. Alternatively, the second sequence information includes the second starting information, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence. Alternatively, the second sequence information includes the cyclic shift step, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence.

[0514] In some embodiments, the second sequence information includes second starting information, a cyclic shift step, a numbering order of the M gold sequence families, and a total number of sequences in the first sequence.

[0515] Exemplarily, a gold sequence family numbered u is determined based on the second starting information, a cyclic offset for the gold sequence family is determined based on the cyclic shift step size, and a first preferred m-sequence pair is cyclically shifted based on the determined cyclic offset. The first preferred m-sequence pair is used to generate the preferred m-sequence pair for the gold sequence family numbered u, resulting in a total of R gold sequences. A determination is then made as to whether R is less than the total number of sequences in the first sequence, S. If R < S, a second preferred m-sequence pair is cyclically shifted based on the cyclic offset. The second preferred m-sequence pair is used to generate the preferred m-sequence pair for the gold sequence family numbered d. The gold sequence family numbered d immediately follows the gold sequence family numbered u. This process is repeated in this manner until the total number of gold sequences obtained is greater than or equal to the total number of sequences in the first sequence, S.

[0516] The principle of determining the Z gold sequence families based on the second starting information, the cyclic shift step size, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence is similar to the principle of determining the X first m-sequences based on the first starting information, the cyclic shift step size, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence in the embodiment shown in FIG10 . The difference is that a gold sequence family is generated using a preferred m-sequence pair. During the cyclic shift process, only one m-sequence included in the preferred m-sequence pair can be cyclically shifted (corresponding to method 1 for forming a gold sequence family), two m-sequences included in the preferred m-sequence pair can be cyclically shifted (corresponding to method 2 for forming a gold sequence family), or the gold sequence obtained through cyclic shifting can be cyclically shifted (corresponding to method 3 for forming a gold sequence family). Therefore, compared to the first m-sequences, a preferred m-sequence pair can generate a larger number of gold sequences; compared to the total number of sequences generated based on the X first m-sequences, a larger total number of sequences is more likely to be obtained based on the Z gold sequence families.

[0517] In the embodiment of the present application, the lengths of the gold sequences in the Z gold sequence families are all equal as an example for schematic illustration. Of course, this does not exclude the case where the lengths of the Z gold sequence families are unequal.

[0518] In some embodiments, the cyclic shift step size N CS It is agreed by the communication protocol, and / or indicated by the network device, and / or determined by the terminal device. CS Associated with the cell radius, it can also be understood as the cyclic shift step size N CS Associated with the coverage radius of the network device, the terminal device determines the cyclic shift step size N according to the cell radius CS For example, the cyclic shift step size N CS Associated with the cell identity, the terminal device determines the cyclic shift step size N according to the cell identity CS .

[0519] For example, the number of shift register stages r=5, and the communication protocol stipulates N CS =2, and it is agreed that the total number of sequences included in the first sequence corresponding to a cell is S=64. The network device indicates that the numbering order of the M gold sequence families is 3, 7, 1, 0, 5, 6, 4, 2. Assume that the length of each of the M gold sequence families is L=63. The network device indicates that the first starting information is 2. After receiving the instruction from the network device, the terminal device determines the gold sequence family numbered 7 based on the first starting information. Assume that the gold sequence family numbered 7 includes 2 r +1 = 33 gold sequences (including the m-sequence preferred pair itself). Obviously, 33 < 64. Then, based on the numbering order of the M gold sequence families, the gold sequence family numbered 1 is determined. After cyclic shift, the gold sequence family numbered 1 can also obtain a maximum of 33 gold sequences. Obviously, 33 * 2 > 64. Therefore, the Z gold sequence families include the gold sequence families numbered 7 and 1. The first sequence includes the gold sequence family numbered 7 and the 31 gold sequences in the gold sequence family numbered 1.

[0520] In some embodiments, the second sequence information includes the second starting information, the cyclic shift C, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence. The principle of this case is the same as the above "the second sequence information includes the first starting information, the cyclic shift step N CS , the numbering order of the N first m sequences, and the total number of sequences in the first sequence S" are similar, except that there is no need to use the cyclic shift step size N CS Instead of determining the cyclic offset C, the cyclic offset C may be determined directly according to the second sequence information.

[0521] In some embodiments, the second sequence information includes second starting information, a cyclic offset set, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence. Optionally, different cyclic offset sets can be configured for different gold sequence families to achieve more flexible cyclic shifting.

[0522] In some embodiments, the second sequence information includes the number of the preamble sequence sent by the terminal device in the first sequence. Alternatively, the second sequence information includes the number of the preamble sequence sent by the terminal device in the first sequence and the numbering order of the M gold sequence families. Exemplarily, the terminal device uniquely determines the preamble sequence to be sent based on the number of the preamble sequence to be sent in the first sequence, and then directly generates the preamble sequence according to the stored and / or configured sequence information.

[0523] In some embodiments, the second sequence information includes the number of the preamble sequence sent by the terminal device in the first sequence and the cyclic offset. Alternatively, the second sequence information includes the number of the preamble sequence sent by the terminal device in the first sequence, the cyclic offset, and the numbering order of the M gold sequence families. Exemplarily, the terminal device uniquely determines the preamble sequence to be sent based on the number of the preamble sequence to be sent in the first sequence, and then directly generates the preamble sequence according to the stored and / or configured sequence information and cyclic offset.

[0524] In some embodiments, the second sequence information includes the number of the preamble sequence sent by the terminal device in the first sequence and the cyclic shift step. Alternatively, the second sequence information includes the number of the preamble sequence sent by the terminal device in the first sequence, the cyclic shift step, and the numbering order of the M gold sequence families. Exemplarily, the terminal device uniquely determines the preamble sequence to be sent based on the number of the preamble sequence to be sent in the first sequence, determines the cyclic offset based on the cyclic shift step, and then directly generates the preamble sequence according to the stored and / or configured sequence information and cyclic offset.

[0525] After determining the Z gold sequence families, the first sequence can be generated. Next, the sequence arrangement within the first sequence is described.

[0526] In some embodiments, the numbering order of the Z gold sequence families corresponding to the first sequence follows their numbering order within the M gold sequence families. That is, the numbering order of the Z gold sequence families when generating the first sequence is the same as the numbering order of the Z gold sequence families within the M gold sequence families. For example, the M gold sequence families are numbered 0, 1, 2…, 8. Assuming that the Z gold sequence families include gold sequence families numbered 2, 3, 4, and 5, then when generating the first sequence, the Z gold sequence families are still numbered 2, 3, 4, and 5.

[0527] In some embodiments, the numbering order of the Z gold sequence families when generating the first sequence is determined according to at least one of the following: the m-sequence preferred pair number, the corresponding primitive polynomial coefficient, and the binary number of the corresponding primitive polynomial coefficient.

[0528] In some embodiments, the numbering order of the Z gold sequence families when generating the first sequence is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0529] In some embodiments, the numbering order of the Z gold sequence families when generating the first sequence is different from the numbering order of the Z gold sequence families in the M gold sequence families. For example, the Z gold sequence families are arranged in ascending order of number values, or in descending order of number values, or in descending order of coefficients of primitive polynomials from low to high powers, or in descending order of coefficients of primitive polynomials from high to low powers, or in descending order of binary numbers of primitive polynomials, or in descending order of binary numbers of primitive polynomials, or in descending order of binary numbers of primitive polynomials, or in descending order of numbers of preferred pairs of m sequences, etc.

[0530] Then, the numbering order within each gold sequence family can also be default, random, arranged according to specific rules, agreed upon by the communication protocol, or indicated by the network device.

[0531] Illustratively, the numbering order of the gold sequences within each gold sequence family is arranged from small to large according to the cyclic offset, or from large to small according to the cyclic offset.

[0532] Optionally, the numbering rules within different gold sequence families may be the same or different. Here, taking different numbering rules as an example, the Z gold sequence families are first numbered 0, 1, 2, ..., 8 according to the numbering of the m-sequence preferred pairs. The gold sequences within the gold sequence family numbered 0 are arranged in ascending order of cyclic offset, and the gold sequences within the remaining numbered gold sequence families are arranged in descending order of cyclic offset. If the numbering rules are the same, for example, the numbering order within the Z gold sequence families is either arranged in ascending order of cyclic offset or in descending order of cyclic offset.

[0533] As can be seen from the foregoing, the first sequence includes all or part of the gold sequences in the Z gold sequence families.

[0534] If the first sequence includes some gold sequences from the Z gold sequence families, then the determination of this portion of gold sequences warrants further discussion. Optionally, this portion of gold sequences is randomly selected, or indicated by a network device, or agreed upon by a communication protocol, or determined by a terminal device. Optionally, this portion of gold sequences is determined based on at least one of the following: a cell identifier, the numbering order of the gold sequence families, the numbering order of the gold sequences, or the first quantity (i.e., the number of gold sequences included in the first sequence described above).

[0535] Exemplarily, the first sequence includes some gold sequences in the Z gold sequence families, where the some gold sequences are gold sequences with earlier numbering in the Z gold sequence families, or gold sequences with smaller cyclic offsets.

[0536] Exemplarily, the first sequence includes some gold sequences in the Z gold sequence families, where the some gold sequences are gold sequences with later numbering in the Z gold sequence families, or gold sequences with larger cyclic offsets.

[0537] Exemplarily, the first sequence includes some gold sequences in the Z gold sequence families, and the some gold sequences are gold sequences numbered as odd or even in the Z gold sequence families.

[0538] After sorting the gold sequences of the Z gold sequence families based on the above method, the first sequence corresponding to the required number (for example, S) can be obtained. The number of each sequence in the first sequence can correspond to the number of the preamble sequence, that is, the number of each sequence in the first sequence corresponds to the number of the preamble sequence. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 0; the gold sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 1; and so on. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 1; the gold sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 2; and so on.

[0539] The first sequence corresponding to a cell can be determined through method 1. Therefore, whether different cells can use the same first sequence is a matter for further discussion.

[0540] Similar to the case where the first sequence is formed by an m-sequence, the embodiment of the present application supports different cells corresponding to completely identical first sequences, or partially identical first sequences, or completely different first sequences.

[0541] Whether different cells use the same first sequence, combined with the generation of Z gold sequence families, may have the following three situations:

[0542] 1. Different cells correspond to the same M gold sequence families and the same Z gold sequence families. This is achieved, for example, by indicating the same second sequence information to different cells, or by stipulating in a communication protocol that different cells use the same second sequence information.

[0543] 2. Different cells correspond to the same M gold sequence families and different Z gold sequence families. For example, this is achieved by corresponding different second sequence information to different cells. Exemplarily, the network device indicates different second starting information for different cells, and the communication protocol stipulates that the cyclic shift step sizes for different cells are different, then the Z gold sequence families are naturally different. Exemplarily, the network device indicates the same second starting information, and the communication protocol stipulates that the values ​​of Z corresponding to different cells are different, then the Z gold sequence families corresponding to different cells are naturally different. Exemplarily, the communication protocol stipulates that different cells use the same m-sequence preferred pair, and the network device indicates the cyclic shift step sizes for different cells respectively, or the terminal device autonomously determines the cyclic shift step size, then the second gold sequence families corresponding to different cells are naturally different. Exemplarily, the network device indicates different second starting information and different cyclic shift step sizes to different cells, so that different cells correspond to different Z gold sequence families.

[0544] 3. Different cells correspond to different M gold sequence families and different Z gold sequence families. For example, different cells are assigned different numbers of shift register stages, resulting in different numbers of m-sequence optimization pairs corresponding to each cell. This allows different cells to correspond to different M gold sequence families. The network device indicates different first starting information and different cyclic shift step sizes to different cells, resulting in different Z gold sequence families corresponding to different cells.

[0545] Next, the second method is introduced, which generates a first sequence corresponding to a cell according to the gold sequence subset.

[0546] A Gold sequence subset is a subset of a Gold sequence set. The Gold sequence set includes at least one Gold sequence family. A Gold sequence family is generated based on a preferred pair of m-sequences. For the design of a Gold sequence family, refer to Scheme 1.

[0547] In some embodiments, the gold sequence set includes at least one gold sequence family, and the gold sequence subset includes at least one gold sequence family.

[0548] In some embodiments, the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the number of shift register stages r, the cyclic offset, the cyclic shift step, the length of the m-sequence, and the number of preferred pairs of m-sequences.

[0549] In some embodiments, the number of gold sequence families in the gold sequence set is determined according to the level r and the cyclic offset, or according to the level r and the cyclic shift step size, or according to the number of preferred m-sequence pairs.

[0550] In some embodiments, the gold sequence subset is a subset of the gold sequence set. Optionally, the gold sequence subset is any subset of the gold sequence set. It is understood that any set is a subset of itself, and therefore, the m-sequence subset may also be the m-sequence set itself. Optionally, the gold sequence subset is a subset selected from the gold sequence set according to a specific rule. Optionally, the gold sequence subset is a subset of the gold sequence set that is defaulted by the communication system.

[0551] In some embodiments, the gold sequence subset is determined or selected by the terminal device from the gold sequence set. Alternatively, the gold sequence subset is indicated by the network device.

[0552] Next, we first introduce the design of the gold sequence set and then how the gold sequence subset is determined, selected, or indicated.

[0553] First, the design of the gold sequence set is introduced. It is understood that, for easy distinction, each gold sequence family in the gold sequence set should have a one-to-one corresponding number or index. The embodiment of the present application uses the numbering as an example for explanation.

[0554] In some embodiments, all gold sequence families within the gold sequence set are first arranged according to a specific rule and then assigned numbers. Alternatively, all gold sequence families within the gold sequence set are first arranged randomly and then assigned numbers.

[0555] In some embodiments, all gold sequence families within a gold sequence set are first assigned numbers, and then all the gold sequence families are arranged according to a specific rule. Alternatively, all the gold sequence families within a gold sequence set are first assigned numbers, and then all the gold sequence families are randomly arranged. As a result, the order of the numbers within the resulting gold sequence set may be disrupted.

[0556] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0557] Illustratively, each gold sequence family in the gold sequence set has a one-to-one corresponding number, and the numbering order of the gold sequence families in the gold sequence set is arranged from small to large according to the number value, or from large to small according to the number value.

[0558] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is determined based on at least one of the following: the level r, the number of gold sequences within the gold sequence family, the length of the gold sequences within the gold sequence family, the number of the gold sequence family, the number of the gold sequences within the gold sequence family, the number of the corresponding m-sequences, the numbering order of the corresponding m-sequences, the corresponding primitive polynomial coefficients, the binary numbers of the corresponding primitive polynomial coefficients, and the cyclic offset.

[0559] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is determined according to the numbers and / or numbering order of the m-sequences used to generate the gold sequence families.

[0560] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is consistent with the numbering order of their corresponding m-sequence preferred pairs.

[0561] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is arranged in descending order according to the numbers of the preferred m-sequence pairs. Alternatively, the numbering order of the gold sequence families within the gold sequence set is arranged in ascending order according to the numbers of the preferred m-sequence pairs.

[0562] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is arranged in ascending order based on the product of the numbers of the two m-sequences respectively included in the m-sequence preferred pair. Alternatively, the numbering order of the gold sequence families within the gold sequence set is arranged in descending order based on the product of the numbers of the two m-sequences respectively included in the m-sequence preferred pair.

[0563] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is arranged in ascending order based on the sum of the numbers of the two m-sequences respectively included in each pair of m-sequence preferred pairs. Alternatively, the numbering order of the gold sequence families within the gold sequence set is arranged in descending order based on the sum of the numbers of the two m-sequences respectively included in each pair of m-sequence preferred pairs.

[0564] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is first arranged based on the m-sequence with the smaller number in the preferred pair, and then arranged based on the m-sequence with the larger number in the preferred pair. Alternatively, the numbering order of the gold sequence families within the gold sequence set is first arranged based on the m-sequence with the larger number in the preferred pair, and then arranged based on the m-sequence with the smaller number in the preferred pair.

[0565] Assume that in a pair of preferred m-sequence pairs, the m-sequence with the smaller number is called sequence E, and the m-sequence with the larger number is called sequence F. For example, if the preferred m-sequence pair C is {0,1}, then in the preferred m-sequence pair C, the m-sequence numbered 0 is called sequence E, and the m-sequence numbered 1 is called sequence F. For another example, if the preferred m-sequence pair D is {1,2}, then in the preferred m-sequence pair D, the m-sequence numbered 1 is called sequence E, and the m-sequence numbered 2 is called sequence F.

[0566] For example, assuming that M pairs of m-sequence preferred pairs are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, respectively, if they are first arranged from large to small according to the number of the sequence E in each preferred pair, there are two pairs of m-sequence preferred pairs whose sequence E is numbered 0, and there are two pairs of m-sequence preferred pairs whose sequence E is numbered 1, and then the sequence F in each preferred pair is arranged from large to small, the arrangement order of the M pairs of m-sequence preferred pairs can be obtained as: {4, 6}, {1, 5}, {1, 2}, {0, 3}, {0, 1}.

[0567] For example, assuming that the preferred pairs of M pairs of m sequences are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, respectively, if the sequences F in each preferred pair are arranged from large to small according to their numbers, the order of the preferred pairs of M pairs of m sequences can be obtained as follows: {4, 6}, {1, 5}, {0, 3}, {1, 2}, {0, 1}.

[0568] For example, assuming that the preferred pairs of M pairs of m sequences are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, if the sequence F numbers in each preferred pair are arranged from small to large, the order of the preferred pairs of M pairs of m sequences can be obtained as: {0, 1}, {1, 2}, {0, 3}, {1, 5}, {4, 6}.

[0569] It can be understood that when arranging according to sequence E and sequence F in each preferred pair, they are not limited to the order of numbers from small to large or from large to small, and can also be arranged according to primitive polynomial coefficients, binary numbers of primitive polynomial coefficients, etc. For details, please refer to the arrangement rules described above.

[0570] In some embodiments, the numbering order of the M gold sequence families is first arranged based on the first m-sequence in the preferred pair, and then arranged based on the second m-sequence in the preferred pair. Alternatively, the numbering order of the M gold sequence families is first arranged based on the second m-sequence in the preferred pair, and then arranged based on the first m-sequence in the preferred pair.

[0571] For example, if the m-sequence pair C is {0,1}, then the first m-sequence in the m-sequence pair C is the m-sequence on the left, that is, the m-sequence numbered 0; the second m-sequence is the m-sequence on the right, that is, the m-sequence numbered 1. For another example, if the m-sequence pair D is {2,1}, then the first m-sequence in the m-sequence pair D is the m-sequence on the left, that is, the m-sequence numbered 2, and the second m-sequence is the m-sequence on the right, that is, the m-sequence numbered 1.

[0572] For example, the preferred pairs of M pairs of m-sequences are {0, 1}, {2, 1}, {0, 3}, {4, 6}, and {1, 5}. If the numbers of the first m-sequences in each preferred pair are arranged from small to large, and there are two pairs of preferred m-sequences whose first m-sequences are both numbered 0, and then the numbers of the second m-sequences are arranged from small to large, the order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {0, 1}, {0, 3}, {1, 5}, {2, 1}, and {4, 6}.

[0573] For example, the preferred pairs of M pairs of m-sequences are {0, 1}, {2, 1}, {0, 3}, {4, 6}, and {1, 5}. If the numbers of the second m-sequences in each preferred pair are arranged from large to small, and there are two pairs of preferred pairs of m-sequences whose second m-sequences are both numbered 1, and then the numbers of the first m-sequences are arranged from large to small, the order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {4, 6}, {1, 5}, {0, 3}, {2, 1}, and {0, 1}.

[0574] It can be understood that when arranging according to the first m-sequence and the second m-sequence in each preferred pair, they are not limited to the order of numbers from small to large or from large to small, and can also be arranged according to the primitive polynomial coefficients, the binary numbers of the primitive polynomial coefficients, etc. For details, please refer to the arrangement rules described above.

[0575] Then, how the gold sequence subset is determined, selected, or indicated is introduced.

[0576] In some embodiments, the number of gold sequences in the gold sequence subset is preconfigured or agreed upon by a communication protocol.

[0577] In some embodiments, the gold sequence subset is randomly selected by the terminal device from the gold sequence set. Alternatively, the gold sequence subset is a default subset of the gold sequence set. For example, the gold sequence subset is a subset consisting of gold sequences with odd numbers by default. Another example is a subset consisting of gold sequences with numbers from 1 to 64 by default. Another example is a subset consisting of gold sequences arranged in the last several digits by default, and so on.

[0578] In some embodiments, the gold sequence set is divided into x gold sequence subsets (x≥1), and each gold sequence subset has a one-to-one corresponding set number.

[0579] In some embodiments, the gold sequence subset is indicated by a network device. Exemplarily, the network device indicates the set number of the gold sequence subset via signaling, wherein the signaling may be one or more of system information, RRC signaling, MAC CE, DCI, etc.

[0580] In some embodiments, the gold sequence subset used to generate the first sequence is determined or selected based on the cell identifier of the terminal device. Exemplarily, the set number of the gold sequence subset is determined according to the cell identifier of the terminal device.

[0581] In some embodiments, the set number of the gold sequence subset used to generate the first sequence is equal to the cell identifier of the terminal device. For example, if the cell identifier of the terminal device is 20, the gold sequence subset used to generate the first sequence is the gold sequence subset numbered 20 in the gold sequence set.

[0582] In some embodiments, the set number of the gold sequence subset used to generate the first sequence is determined according to a mathematical operation result of a cell identifier of the terminal device.

[0583] Exemplarily, the set number of the gold sequence subset used to generate the first sequence is equal to the modulo result of the cell identifier of the terminal device and x. Exemplarily, the cell identifier of the terminal device is 18, x is 5, and 18 mod 5 = 3. Then, the gold sequence subset used to generate the first sequence is the gold sequence subset numbered 3 in the gold sequence set.

[0584] Exemplarily, the set number of the gold sequence subset used to generate the first sequence is equal to an integer multiple of the cell identifier of the terminal device, or equal to the rounded-up result of the quotient of the cell identifier of the terminal device and x, or equal to the rounded-down result of the quotient of the cell identifier of the terminal device and x, and so on.

[0585] After sorting the gold sequences in the gold sequence set based on the above method, a gold sequence subset can be obtained. According to the total number S of sequences in the gold sequence subset and the first sequence, the first sequence corresponding to the required number can be obtained. The first sequence includes all or part of the gold sequences in the gold sequence subset. The number of each sequence in the first sequence can correspond to the number of the preamble sequence, that is, the number of each sequence in the first sequence corresponds one-to-one with the number of the preamble sequence. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 0; the gold sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 1; and so on. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the preamble sequence numbered 1; the gold sequence numbered 1 in the first sequence corresponds to the preamble sequence numbered 2; and so on.

[0586] Solution 2 can determine the gold sequence subset corresponding to a cell. Therefore, whether different cells can use the same gold sequence subset is a matter for further discussion.

[0587] Similar to Solution 1, this embodiment of the present application supports different cells corresponding to completely identical gold sequence subsets, partially identical gold sequence subsets, or completely different gold sequence subsets. Whether the gold sequence subsets are identical can be determined by whether the set numbers are identical, or by whether the gold sequence numbers within the gold sequence subsets are consistent.

[0588] If different cells correspond to different gold sequence subsets, different first sequences can be generated for different cells, so that terminal devices in different cells can select preamble code sequences from different first sequences, thereby avoiding preamble code conflicts and interference problems between cells as much as possible.

[0589] For example, assuming that cell A corresponds to the gold sequence subset {0, 2, 4, 6, 8} with a set number of 2, it means that the first sequence used by cell A includes the gold sequences with sequence numbers 0, 2, 4, 6, and 8. assuming that cell B corresponds to the gold sequence subset {1, 5, 7} with a set number of 5, it means that the first sequence used by cell B includes the gold sequences with sequence numbers 1, 5, and 7. It can be seen that the gold sequence subset corresponding to cell A is different from the gold sequence subset corresponding to cell B, and the first sequences generated according to different gold sequence subsets are naturally different. The possibility of conflict and interference between terminal devices in cell A and terminal devices in cell B when sending preamble code sequences is significantly reduced.

[0590] After understanding how the first sequence is generated, we can further consider how to generate the preamble sequence sent by the terminal device. The embodiment of the present application provides two solutions for generating the preamble sequence.

[0591] Solution 1: According to the above-mentioned method 1 or method 2, the terminal device generates a first sequence and randomly selects a sequence from the first sequence as the preamble sequence when sending the preamble sequence.

[0592] It can be seen that in solution 1, the terminal device actually generates a preamble sequence set for the cell where it is located, and when a preamble sequence needs to be sent, it selects one from the generated preamble sequence set.

[0593] Solution 2: The terminal device first determines the number of the preamble sequence to be sent in the first sequence, and then generates the preamble sequence according to the method 1 or method 2 described above.

[0594] It can be seen that in solution 2, the terminal device actually only needs to generate the preamble code sequence that it needs to send one by one.

[0595] Next, we will first introduce the scheme 1 for generating the preamble sequence: the generation of the first sequence can refer to the aforementioned method 1 (generating the first sequence corresponding to a cell based on Z gold sequence families) or method 2 (generating the first sequence corresponding to a cell based on a gold sequence subset).

[0596] In some embodiments, after the terminal device generates a first sequence corresponding to a cell, it stores the first sequence in a memory, which can be local or non-local, such as a server, a cloud platform, a virtualization center, etc.

[0597] In some embodiments, different terminal devices within the same cell each randomly select a sequence from the first sequence as the preamble sequence. Alternatively, different terminal devices within the same cell each select a sequence from the first sequence according to a specific rule as the preamble sequence. The preamble sequences selected by different terminal devices should be different to avoid preamble conflicts within the cell. However, it is not ruled out that different terminal devices may select the same preamble sequence, which may cause a conflict. Subsequently, the network device will need to reconfirm the random access situation with the terminal device that caused the conflict.

[0598] Next, we introduce the second solution for generating the preamble sequence:

[0599] Since only one-to-one correspondence is required to generate the preamble sequence to be sent, it is determined which of the preamble sequences in the first sequence is the first. Optionally, the network device indicates to the terminal device that the preamble sequence in the first sequence is numbered 1. s Alternatively, the communication protocol stipulates that the terminal device uses the first sequence numbered 1 s Alternatively, the terminal device autonomously determines that the preamble sequence is numbered 1 in the first sequence. s .

[0600] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: second starting information, a cyclic shift step, and a value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0601] Combined I s and other second sequence information, such as the second starting information, the cyclic shift step size N CS , the numbering order of the M gold sequence families, etc., can determine which m-sequence preferred pair the preamble sequence corresponds to, that is, which gold sequence family it corresponds to.

[0602] Exemplarily, the second sequence information includes the number I of the preamble sequence sent by the terminal device in the first sequence. s , and the numbering order of the M gold sequence families. The terminal device is based on Is , uniquely determine the preamble sequence to be sent, and then the preamble sequence can be transmitted according to the stored and / or configured sequence information and cyclic shift step size N CS The preamble sequence is directly generated.

[0603] The embodiment of the present application supports formulating the second solution of the above-mentioned preamble code sequence.

[0604] Assume that combined with I s The target m-sequence preferably pair determined by the other second sequence information includes the fourth m-sequence and the fifth m-sequence, that is, the preamble sequence is generated according to the fourth m-sequence and the fifth m-sequence.

[0605] First, we introduce how to determine the optimal pair of target m-sequences.

[0606] In some embodiments, the number of the target m-sequence preferred pair is determined according to at least one of the following: the number of the preamble sequence in the first sequence is 1; s , second starting information, cyclic shift step size N CS , the numbering order of the M gold sequence families.

[0607] The position of the target gold sequence family in the M gold sequence families is the first one starting from the position indicated by the second start information. That is, the target gold sequence family is the first one among the M gold sequence families. Wherein, e is the value indicated by the second starting information, Q represents the number of gold sequences included in a gold sequence family, and I s The target gold sequence family is the gold sequence family to which the target sequence belongs. The target sequence is used to generate the preamble sequence, which is modulated to obtain the preamble sequence. Determining the target gold sequence family also determines the target m-sequence optimal pair.

[0608] For example, the numbering sequence is 0, 1, 2, 3, 4, 5, 6, 7, 8. Assume that the second start information indicates 1, I s =50, Q=12, then the position of the target gold sequence family is the fifth from the first in the M gold sequence families. It can also be understood that the target gold sequence family is the fifth from the first in the M gold sequence families. Therefore, it can be determined that the target gold sequence family is the gold sequence family numbered 4.

[0609] For example, the order of numbering the M gold sequence families is 5, 1, 0, 4, 3, 2, 7, 8, and 6. If the second starting information indicates 3, it means that the first sequence corresponding to the cell is generated based on the gold sequence family numbered 0 and several subsequent gold sequence families. Assume that each pair of m sequences is determined to be able to generate 17 gold sequences based on the level r. If the preamble sequence is numbered 1 in the first sequence, s =30. Considering that the gold sequence numbered 0 includes 17 gold sequences, 30-17=13. The preamble sequence should be a gold sequence in the gold sequence family numbered 4. In other words, the target m-sequence optimal pair is the m-sequence optimal pair corresponding to the gold sequence family numbered 4. Therefore, the target sequence is the 13th gold sequence in the gold sequence family numbered 4.

[0610] In some embodiments, the number of the target m-sequence preferred pair and the number of the target gold sequence family are determined according to the cell identifier. For example, the number of the target gold sequence family is determined according to the modulo result of the cell identifier and M.

[0611] In some embodiments, the sequence element numbered n in the preamble sequence is determined based on the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence. Alternatively, the value of the nth bit in the preamble sequence is determined based on the value of the ath bit in the fourth m-sequence and the value of the bth bit in the fifth m-sequence. The fourth m-sequence and the fifth m-sequence constitute a preferred m-sequence pair, with the fourth m-sequence being one m-sequence in the preferred m-sequence pair and the fifth m-sequence being the other m-sequence in the preferred m-sequence pair.

[0612] In some embodiments, a is determined based on at least one of the following: n, parameter m0, and the second length value. b is determined based on at least one of the following: n, parameter m1, and the second length value. Parameter m0 represents a cyclic offset of a fourth m-sequence when generating a preamble sequence, and parameter m1 represents a cyclic offset of a fifth m-sequence when generating a preamble sequence.

[0613] The second length value is the length value of the fourth m-sequence, that is, the length value of the fifth m-sequence, and n is greater than or equal to 0 and less than the second length value.

[0614] In some embodiments, a is determined based on a second modulo result, which is a modulo result of the second sum and the second length, and the second sum is the sum of n and parameter m0.

[0615] In some embodiments, b is determined based on a third modulo result, which is a modulo result of the third sum and the second length value, and the third sum is the sum of n and the parameter m1.

[0616] In some embodiments, the sequence element numbered n in the preamble sequence is the third product, which can also be understood as the value of the nth bit in the preamble sequence being equal to the third product. The third product is the product of the first difference and the second difference. The first difference is the difference between the value 1 and the fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence. The second difference is the difference between the value 1 and the fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

[0617] For example, the preamble sequence can be expressed as formula (12). preamble (n) represents the preamble sequence, x0(n) represents the fourth m-sequence used to generate the preamble sequence, x1(n) represents the fifth m-sequence used to generate the preamble sequence, and L represents the second length value. preamble (n)=[1-2x0((n+m0)mod L)]·[1-2x1((n+m1)mod L)] (12)

[0618] In some embodiments, formula (12) is applicable to the case where the preamble sequence is obtained through BPSK modulation.

[0619] In some embodiments, the sequence element numbered n in the preamble sequence is the modulo-2 sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence. Alternatively, the value of the nth bit in the preamble sequence is equal to the modulo-2 sum of the value of the ath bit in the fourth m-sequence and the value of the bth bit in the fifth m-sequence.

[0620] For example, the preamble sequence can be expressed as formula (13). preamble (n) represents the preamble sequence, x0(n) represents the fourth m-sequence used to generate the preamble sequence, x1(n) represents the fifth m-sequence used to generate the preamble sequence, and L represents the second length value. preamble (n)=[x0((n+m0)mod L)+x1((n+m1)mod L)]mod 2 (13)

[0621] In some embodiments, formula (13) is applicable to the case where the preamble code sequence is obtained through OOK modulation.

[0622] In some embodiments, the parameter m0 and the parameter m1 are determined according to the number of the preamble sequence in the first sequence. Assume that the number of the preamble sequence in the first sequence is 1 S .

[0623] In some embodiments, the parameter m0 is determined according to the first sub-identifier, and the parameter m1 is determined according to the second sub-identifier. Assume that the first sub-identifier is represented by The second sub-identifier is represented by

[0624] In some embodiments, the first sub-identifier and the second sub-identifier Determined according to the number of the preamble sequence in the first sequence.

[0625] About parameter m0, parameter m1, and the first sub-identifier Second sub-identifier To determine , this application embodiment provides two calculation methods:

[0626] Calculation method 1:

[0627] In some embodiments, the first sub-identifier and the second sub-identifier According to the number I of the preamble sequence in the first sequence S , and / or, cyclic shift step size N CS Determine. Among them, 1≤N CS ≤S, where S represents the total number of sequences in the first sequence.

[0628] In some embodiments, in,

[0629] In some embodiments, the parameter m0 is determined based on a modulo result of the first sub-identifier and the parameter G, and the parameter m1 is determined based on a modulo result of the second sub-identifier and the parameter F.

[0630] In some embodiments, parameter m0 is equal to the modulo result of the first sub-identifier and parameter G, and parameter m1 is equal to the modulo result of the second sub-identifier and parameter F. That is,

[0631] In some embodiments, parameter m0 is equal to q1 times the modulo result of the first sub-identifier and parameter G, and parameter m1 is equal to q2 times the modulo result of the second sub-identifier and parameter F. That is, Wherein, q1 is a positive integer, and q2 is a positive integer.

[0632] Optionally, the parameter G is smaller than the second length value, that is, G < L. Optionally, the parameter F is smaller than the second length value, that is, F < L.

[0633] Optionally, the parameter m0 is smaller than the second length value, that is, m0 < L. Optionally, the parameter m1 is smaller than the second length value, that is, m1 < L.

[0634] In some embodiments, the parameter G and the parameter F are determined according to the total number of sequences in the first sequence.

[0635] In some embodiments, assuming the total number of sequences in the first sequence is S, the product of parameter G and parameter F is equal to S, that is, G*F=S. It can also be understood that parameter G and parameter F are divisors of S. For example, if S=64, then G=8, F=8; or G=1, F=64; or G=2, F=32; or G=4, F=16; or G=1, F=64; or G=16, F=4; or G=32, F=2; or G=64, F=1.

[0636] In some embodiments, the sum of parameter G and parameter F is equal to S, that is, G+F=S. Alternatively, an integer multiple of the product of parameter G and parameter F is equal to S, and so on.

[0637] In some embodiments, F=N CS , Where 1≤N CS ≤S.

[0638] Example 1: Assume that the communication protocol stipulates that the total number of gold sequences in the first sequence is S (S ≥ 1), and the number or index of these S gold sequences ranges from 0 to S-1. Assume that the parameters G and F are divisors of S, for example, G = 8, F = 8. Assume that the network device indicates that the number of the preamble sequence in the first sequence is I s =56, L=63, N CS =3. Assuming that a gold sequence family includes Q = 12 gold sequences, and the communication protocol stipulates that the second starting information = 1, then the target gold sequence family is the arrangement of M gold sequence families. At this time, the fourth m-sequence x0(n) and the fifth m-sequence x1(n) correspond to the fifth-ranked m-sequence preferred pair among the M m-sequence preferred pairs.

[0639] Then, according to Can get

[0640] according to

[0641] If calculated by formula (12), we can get d preamble (n)=[1-2x0((n+2)mod 63)]·[1-2x1((n+2)mod 63)], 0≤n<63.

[0642] If calculated by formula (13), we can get d preamble(n)=[x0((n+2)mod 63)+x1((n+2)mod 63)]mod 2, 0≤n<63.

[0643] Example 2: Assume that the communication protocol stipulates that the total number of gold sequences in the first sequence is S (S ≥ 1), and the number or index of these S gold sequences ranges from 0 to S-1. Assume that the network device indicates that the number of the preamble sequence in the first sequence is I s =15, L=63, N CS =4,q1=3,q2=4. Assume that a gold sequence family includes Q=12 gold sequences, The network device indicates that the second starting information = 2. Therefore, the target gold sequence family is the gold sequence family ranked 2+1=3 among the M gold sequence families. At this point, the fourth m-sequence x0(n) and the fifth m-sequence x1(n) correspond to the third preferred m-sequence pair among the M preferred m-sequence pairs.

[0644] Then, according to Can get

[0645] According to F=N CS , We can get F=4,

[0646] according to

[0647] If calculated by formula (12), we can get d preamble (n)=[1-2x0((n+9)mod 63)]·[1-2x1((n+0)mod 63)], 0≤n<63.

[0648] If calculated by formula (13), we can get d preamble (n)=[x0((n+9)mod 63)+x1((n+0)mod 63)]mod 2, 0≤n<63.

[0649] Calculation method 2:

[0650] In some embodiments, the first sub-identifier and the second sub-identifier Determined according to at least one of the following: the number of the preamble sequence in the first sequence S , cyclic shift step size N CS , the total number of sequences in the first sequence S, the number of gold sequence families V required to form the first sequence. Among them, 1≤N CS ≤S.

[0651] In some embodiments, in,

[0652] Optionally, each gold sequence family in the V gold sequence families includes the same number of gold sequences, or each gold sequence family includes a different number of gold sequences.

[0653] In some embodiments, the parameter m0 is determined based on a modulo result of the first sub-identifier and the parameter G, and the parameter m1 is determined based on a modulo result of the second sub-identifier and the parameter F.

[0654] In some embodiments, parameter m0 is equal to the modulo result of the first sub-identifier and parameter G, and parameter m1 is equal to the modulo result of the second sub-identifier and parameter F. That is,

[0655] In some embodiments, parameter m0 is equal to q1 times the modulo result of the first sub-identifier and parameter G, and parameter m1 is equal to q2 times the modulo result of the second sub-identifier and parameter F. That is, Wherein, q1 is a positive integer, and q2 is a positive integer.

[0656] Optionally, the parameter G is smaller than the second length value, that is, G < L. Optionally, the parameter F is smaller than the second length value, that is, F < L.

[0657] Optionally, the parameter m0 is smaller than the second length value, that is, m0 < L. Optionally, the parameter m1 is smaller than the second length value, that is, m1 < L.

[0658] In some embodiments, the parameter G and the parameter F are determined according to at least one of the following: the total number of sequences S in the first sequence, the number of gold sequence families V required to form the first sequence, the cyclic shift step size N CS .

[0659] In some embodiments, the product of parameter G and parameter F is equal to S / V, that is, G*F=S / V. It can also be understood that parameter G and parameter F are divisors of S / V. For example, if S=64 and V=2, then G=1 and F=32; or, G=2 and F=16; or, G=4 and F=8; or, G=8 and F=4; or, G=16 and F=2; or, G=32 and F=1.

[0660] In some embodiments, the sum of parameter G and parameter F is equal to S / V, that is, G+F=S / V. Alternatively, an integer multiple of the product of parameter G and parameter F is equal to S / V, and so on.

[0661] In some embodiments, F=N CS , Where 1≤NCS ≤S.

[0662] Example 3: Assume that the communication protocol stipulates that the total number of gold sequences in the first sequence is S = 64. To form these 64 gold sequences, V = 2 gold sequence families are required, and the number of gold sequences contained in these two gold sequence families is the same. Then, one gold sequence family needs to contain 32 gold sequences. Assume that the parameters G and F are divisors of S / V, for example, G = 4 and F = 8. Assume that the network device indicates that the preamble sequence in the first sequence is numbered I. s =20, L=63, N CS =3.

[0663] Then, according to Can get

[0664] according to

[0665] If calculated by formula (12), we can get d preamble (n)=[1-2x0((n+2)mod 63)]·[1-2x1((n+2)mod 63)], 0≤n<63.

[0666] If calculated by formula (13), we can get d preamble (n)=[x0((n+2)mod 63)+x1((n+2)mod 63)]mod 2, 0≤n<63.

[0667] Example 4: Assume that the communication protocol stipulates that the total number of gold sequences in the first sequence is S = 64, and V = 3 gold sequence families are required to form these 64 gold sequences. Assume that the terminal device determines that the number of the preamble sequence in the first sequence is I s =49, L=63, N CS =4,q1=3,q2=4.

[0668] Then, according to Can get

[0669] According to F=N CS , We can get F=4,

[0670] according to

[0671] If calculated by formula (12), we can get d preamble(n)=[1-2x0((n+3)mod 63)]·[1-2x1((n+0)mod 63)], 0≤n<63.

[0672] If calculated by formula (13), we can get d preamble (n)=[x0((n+3)mod 63)+x1((n+0)mod 63)]mod 2, 0≤n<63.

[0673] It should be noted that, regardless of calculation method 1 or calculation method 2, the calculation methods of m0 and m1 can be swapped. For example, parameter m0 is determined according to the second sub-identifier, and parameter m1 is determined according to the first sub-identifier. For example, parameter m0 is equal to the modulo result of the second sub-identifier and parameter F, and parameter m1 is equal to the modulo result of the first sub-identifier and parameter G. For example, for example,

[0674] In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending a preamble sequence through a gold sequence. It supports both selecting Z gold sequence families to form a first sequence and constructing a gold sequence set to form a first sequence, providing a flexible construction solution for the first sequence corresponding to a cell. It supports both the terminal device randomly selecting a gold sequence as a preamble sequence from the first sequence and the terminal device generating a preamble sequence through information such as the cyclic shift step size and the number of the preamble sequence in the first sequence, providing a flexible determination solution for the preamble sequence corresponding to a terminal device. Furthermore, it supports both different cells using the same first sequence to save communication resources and different cells using different first sequences to avoid conflicts within the communication system and ensure communication efficiency within the communication system. Furthermore, the gold sequence has good autocorrelation and cross-correlation characteristics, and the preamble sequence generated by the gold sequence still has such good characteristics, which helps to improve the accuracy and reliability of uplink synchronization and frequency offset estimation, and ensure the reliability, success rate and efficiency of random access. Compared to using m-sequences to form the first sequence, using gold sequences can increase the number of sequences within the first sequence. This means that a cell can be provided with more optional preamble sequences, supporting the provision of preamble sequences for a large number of terminal devices within the communication system. However, it can also be seen that using m-sequences to form the first sequence is simpler to implement and less complex.

[0675] In the present application, the modulation mode of the preamble sequence includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation. The preamble sequences involved in the present application, such as the preamble sequences shown in Figures 9, 10, 13, 14, 15, 16, and 17, can adopt the following modulation rules:

[0676] Assuming OOK modulation, the preamble elements with values ​​of "1" and "0" correspond to high and low levels in the OOK sequence, respectively. For example, a preamble element with a value of "1" corresponds to a high level in the OOK sequence, while a preamble element with a value of "0" corresponds to a low level in the OOK sequence. Alternatively, a preamble element with a value of "1" corresponds to a low level in the OOK sequence, while a preamble element with a value of "0" corresponds to a high level in the OOK sequence.

[0677] Assuming PSK modulation, the sequence elements of the preamble sequence with values ​​of "1" and "0" correspond to phase continuity (+1) and phase jumps (0 or -1) in the PSK sequence, respectively. For example, a sequence element of the preamble sequence with a value of "1" corresponds to phase continuity (+1) in the PSK sequence, and a sequence element of the preamble sequence with a value of "0" corresponds to phase jumps (0 or -1) in the PSK sequence; or, a sequence element of the preamble sequence with a value of "1" corresponds to phase jumps (0 or -1) in the PSK sequence, and a sequence element of the preamble sequence with a value of "0" corresponds to phase continuity (+1) in the PSK sequence.

[0678] Assuming BPSK modulation, the sequence elements with values ​​of "1" and "0" in the preamble sequence correspond to the positive level (+1) and negative level (-1) in the BPSK sequence, respectively. For example, the sequence elements with values ​​of "1" in the preamble sequence correspond to the positive level (+1) in the BPSK sequence, and the sequence elements with values ​​of "0" in the preamble sequence correspond to the negative level (-1) in the BPSK sequence; or, the sequence elements with values ​​of "1" in the preamble sequence correspond to the negative level (-1) in the BPSK sequence, and the sequence elements with values ​​of "0" in the preamble sequence correspond to the positive level (+1) in the BPSK sequence.

[0679] Assuming FSK modulation, the sequence elements with values ​​of "1" and "0" in the preamble sequence correspond to the two carrier frequencies of the FSK sequence. For example, the sequence elements with a value of "1" in the preamble sequence correspond to carrier frequency 1 of the FSK sequence, and the sequence elements with a value of "0" in the preamble sequence correspond to carrier frequency 0 of the FSK sequence; or, the sequence elements with a value of "1" in the preamble sequence correspond to carrier frequency 0 of the FSK sequence, and the sequence elements with a value of "0" in the preamble sequence correspond to carrier frequency 1 of the FSK sequence.

[0680] Figure 14 shows the simulation results for constructing the first sequence using an m-sequence. Figure 14 uses a basic m-sequence with a length of 127 and a shift register number of 7. Cyclic shifting can generate more shifted sequences. Assuming eight users multiplex this basic m-sequence to transmit preamble sequences, the receiver can clearly detect all eight preamble sequences, demonstrating that multiplexing a single m-sequence is fully supported for preamble transmission across multiple cells.

[0681] Therefore, the solution in this application of forming the first sequence through the m sequence and the gold sequence can generate a larger preamble code sequence capacity, thereby supporting a large number of terminal devices to send preamble code sequences.

[0682] If the preamble sequence is generated based on a Walsh sequence, the process of constructing the first sequence using the Walsh sequence can refer to the embodiments shown in Figures 10 and 13. Similarly, the preamble sequence can also be generated by defining the number of Walsh sequences in the first sequence, constructing a Walsh sequence set, and expressing the preamble sequence using a formula.

[0683] FIG15 shows a flow chart of a preamble transmission method provided by an exemplary embodiment of the present application. The method is executed by a network device and includes:

[0684] Step 1310: Receive a preamble sequence, where the preamble sequence is one of the first sequences.

[0685] The first sequence is generated based on a binary sequence. A binary sequence includes only sequence elements with two possible values. Therefore, the first sequence also includes only sequence elements with two possible values. For example, the first sequence includes only "0" and "1," or only "+1" and "-1."

[0686] In some embodiments, the first sequence is generated according to at least one of the following: an m-sequence; a gold sequence; or a Walsh sequence.

[0687] In some embodiments, the modulation mode of the preamble sequence includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

[0688] It should be noted that the types of binary sequences provided in this application are not limited to m-sequences, gold sequences, and Walsh sequences. Other binary sequences or other sequences with sequence characteristics similar to binary sequences are also applicable to the methods provided in the embodiments of this application.

[0689] The network device that performs step 1310 may be the network device 110 shown in FIG. 1 , or the network device 110 shown in FIG. 2 , or a network device operating in a millimeter wave (mmWave) frequency band, and so on.

[0690] In summary, the method provided in the embodiments of the present application, because the first sequence is generated based on a binary sequence, the sequence elements of the first sequence have only two possible values, making it very easy to combine with non-OFDM waveforms such as OOK waveforms, PSK waveforms, and FSK waveforms. This provides the possibility of transmitting preamble codes in some communication scenarios where OFDM waveforms are difficult to use, and provides a new feasible solution for preamble code transmission. The preamble code sequence belonging to the first sequence has the advantages of low complexity and simple implementation, and helps to achieve low-power random access, uplink synchronization, and frequency offset estimation.

[0691] FIG16 shows a flow chart of a method for transmitting a preamble provided by an exemplary embodiment of the present application. The method is executed by a network device and includes:

[0692] Step 1410: Receive a preamble sequence, where the preamble sequence is one of the first sequences; wherein the first sequence is generated according to the m-sequence.

[0693] For details about the preamble sequence and the first sequence, please refer to step 810 and will not be described in detail here.

[0694] It's important to note that in order to accurately receive and detect preamble sequences, network devices must also determine the corresponding first sequence for each cell. Specifically, due to oscillator mismatch, Doppler shift, noise interference, and other factors, the preamble sequence sent from the transmitter and the preamble sequence arriving at the receiver will inevitably deviate in the time and frequency domains. To ensure high accuracy in preamble sequence detection, the network device must perform correlation detection on the received preamble sequence and the local preamble sequence, obtain clock information and / or frequency offset estimation results, calibrate the received preamble sequence in the time domain based on the clock information, and calibrate the received preamble sequence in the frequency domain based on the frequency offset estimation results, to facilitate accurate preamble sequence detection. The local preamble sequence used in the detection process should be generated locally by the network device. However, preamble sequence transmission is random, and the network device does not know what sequence a particular terminal device will transmit. Therefore, the network device must be aware of the possible transmission sequences of terminal devices in each cell so that, upon receiving a preamble sequence, it can find a similar preamble sequence locally for correlation detection. That is, the network device should clearly know the first sequence corresponding to each cell so that it can accurately detect the preamble sequence when receiving the preamble sequence.

[0695] The two methods of generating the first sequence based on the m-sequence shown in Figure 10 are also applicable to network devices. In other words, the network device and the terminal device should determine the first sequence separately, and both the network device and the terminal device should clearly understand which m-sequences constitute the first sequence corresponding to the cell.

[0696] Regardless of whether the network device and the terminal device use exactly the same method to determine the first sequence corresponding to the same cell, the first sequence determined by the network device and generated by the terminal device for the same cell should be the same. This ensures that after receiving the preamble code sequence, the network device can clearly identify which terminal device sent the preamble code sequence.

[0697] Exemplarily, the communication protocol stipulates the total number of sequences in the first sequence and the cyclic shift step size. The network device indicates first starting information and the order of N first m-sequences to the terminal device. The terminal device determines X first m-sequences and Y second m-sequences based on the first starting information, the order of the N first m-sequences, the cyclic shift step size, and the total number of sequences in the first sequence, and generates the first sequence based on the X first m-sequences and the Y second m-sequences. The network device should also determine the first sequence corresponding to the cell where the terminal device is located based on the first starting information, the order of the N first m-sequences, the cyclic shift step size, and the total number of sequences in the first sequence.

[0698] In some embodiments, the network device determines X first m-sequences according to a cell identifier or first sequence information.

[0699] In some embodiments, the network device determines the X first m-sequences according to at least one of the following: first starting information, a cyclic shift step, a numbering order of the N first m-sequences, and a total number of sequences in the first sequence.

[0700] In some embodiments, the network device determines a numbering order of the N first m-sequences.

[0701] In some embodiments, the network device determines the first number of m-sequences in the m-sequence set according to the number of shift register stages.

[0702] In some embodiments, the network device determines the number of first m-sequences in the m-sequence set according to the number of shift register stages, the number of first m-sequences, and the cyclic shift step size.

[0703] In some embodiments, the network device determines a numbering order of the first m-sequence and / or the second m-sequence within the set of m-sequences.

[0704] In some embodiments, the network device determines the m-sequence subset according to a cell identifier.

[0705] In summary, the method provided in the embodiment of the present application is that the preamble code sequence of the type m-sequence has good characteristics of low complexity and simple implementation, and helps to achieve low-power random access, uplink synchronization, and frequency offset estimation.

[0706] The scheme for constructing the first sequence is highly flexible. It supports constructing the first sequence by selecting a first m-sequence or by building a set of m-sequences, providing a flexible scheme for constructing the first sequence corresponding to a cell. It supports both randomly selecting an m-sequence from the first sequence as the preamble sequence and generating a preamble sequence based on information such as the cyclic shift step size and the preamble sequence's number within the first sequence, providing a flexible scheme for determining the preamble sequence corresponding to a terminal device. Furthermore, it supports using the same first sequence across different cells to save communication resources, as well as using different first sequences across different cells to avoid conflicts within the communication system and ensure communication efficiency. Furthermore, m-sequences have excellent autocorrelation and cross-correlation properties, and preamble sequences generated from them also exhibit these properties, helping to improve the accuracy and reliability of uplink synchronization and frequency offset estimation, and ensuring the reliability, success rate, and efficiency of random access. Furthermore, cyclic shifting of an m-sequence can yield multiple m-sequences, providing a large number of optional preamble sequences for a cell and supporting the provision of preamble sequences for a large number of terminal devices within the communication system.

[0707] FIG17 is a schematic flow chart of a preamble transmission method provided by an exemplary embodiment of the present application. The method is executed by a network device and includes:

[0708] Step 1510: Receive a preamble sequence, where the preamble sequence is one of the first sequences; wherein the first sequence is generated according to the gold sequence.

[0709] For details about the preamble sequence and the first sequence, please refer to step 1110 and will not be repeated here.

[0710] It should be noted that in order to accurately receive and detect the preamble sequence, the network device should also determine the first sequence corresponding to each cell. The reason here can be referred to step 1410 and will not be repeated here.

[0711] In other words, the two methods of generating the first sequence based on the gold sequence shown in Figure 13 are also applicable to the network device. In other words, the network device and the terminal device should determine the first sequence separately, and both the network device and the terminal device should clearly understand which gold sequences constitute the first sequence corresponding to the cell.

[0712] Regardless of whether the network device and the terminal device use exactly the same method to determine the first sequence corresponding to the same cell, the first sequence determined by the network device and generated by the terminal device for the same cell should be the same. This ensures that after receiving the preamble code sequence, the network device can clearly identify which terminal device sent the preamble code sequence.

[0713] Exemplarily, the communication protocol stipulates the total number of sequences in the first sequence and the cyclic shift step size. The network device indicates second starting information and the order of M gold sequence families to the terminal device. The terminal device determines Z gold sequence families based on the second starting information, the order of the M gold sequence families, the cyclic shift step size, and the total number of sequences in the first sequence, and generates the first sequence based on the Z gold sequence families. The network device should also determine the first sequence corresponding to the cell where the terminal device is located based on the second starting information, the order of the M gold sequence families, the cyclic shift step size, and the total number of sequences in the first sequence.

[0714] In some embodiments, the network device determines Z gold sequence families according to the cell identifier or the second sequence information.

[0715] In some embodiments, the network device determines the Z gold sequence families according to at least one of the following: the second starting information, the cyclic shift step size, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence.

[0716] In some embodiments, the network device determines a numbering order of the M gold sequence families.

[0717] In some embodiments, the network device determines the number of sequences in the gold sequence set according to the number of shift register stages.

[0718] In some embodiments, the network device determines the number of sequences in the gold sequence set according to at least one of the following: the number of shift register stages, the cyclic offset, the cyclic shift step, the length of the m-sequence, and the number of preferred pairs of m-sequences.

[0719] In some embodiments, the network device determines the numbering order of the gold sequence families within the m-sequence set.

[0720] In some embodiments, the network device determines the gold sequence subset according to the cell identifier.

[0721] In some embodiments, the network device determines the preferred cyclic offsets m0 and m1 of the m-sequence according to the cell identifier.

[0722] In summary, the method provided in the embodiment of the present application is that the preamble code sequence of the gold sequence type has the good characteristics of low complexity and simple implementation, and helps to achieve low-power random access, uplink synchronization, and frequency offset estimation.

[0723] The scheme for constructing the first sequence is highly flexible. It supports constructing the first sequence by selecting Z gold sequence families or by building a gold sequence set, providing a flexible scheme for constructing the first sequence corresponding to a cell. It supports a terminal device randomly selecting a gold sequence from the first sequence as the preamble sequence, or generating a preamble sequence based on information such as the cyclic shift step size and the preamble sequence's number within the first sequence, providing a flexible scheme for determining the preamble sequence corresponding to a terminal device. Furthermore, it supports different cells using the same first sequence to save communication resources, as well as different first sequences to avoid conflicts within the communication system and ensure communication efficiency within the communication system. Furthermore, gold sequences have excellent autocorrelation and cross-correlation properties, and preamble sequences generated using gold sequences also exhibit these excellent properties, helping to improve the accuracy and reliability of uplink synchronization and frequency offset estimation, and ensuring the reliability, success rate, and efficiency of random access. Compared with the scheme of using m sequence to form the first sequence, the use of gold sequence can increase the number of sequences in the first sequence, that is, it can provide more optional preamble code sequences for a cell and support the provision of preamble code sequences for a large number of terminal devices in the communication system.

[0724] FIG18 shows a block diagram of a preamble transmission apparatus according to an exemplary embodiment of the present application. The apparatus can be implemented as a terminal device as shown in FIG9 , FIG10 , or FIG13 , or as a portion of a terminal device as shown in FIG9 , FIG10 , or FIG13 . The apparatus includes a transmitting module 1610 . Optionally, the apparatus also includes a processing module 1630 and / or a receiving module 1650 .

[0725] The sending module 1610 is configured to send a preamble sequence, where the preamble sequence is one of a first sequence; wherein the first sequence is generated according to at least one of the following sequences: an m sequence; a Gold sequence; or a Walsh sequence.

[0726] In some embodiments, the first sequence is generated according to a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0727] In some embodiments, the apparatus further comprises a processing module 1630 for performing a cyclic shift.

[0728] In some embodiments, in the first sequence, the number of the first m-sequences is X, and the number of the second m-sequences is Y; wherein X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not equal to 0 at the same time.

[0729] In some embodiments, the X first m-sequences are determined by the apparatus from N first m-sequences, where N is an integer greater than 1; or, the X first m-sequences are indicated by a network device.

[0730] In some embodiments, the processing module 1630 is further configured to determine the X first m-sequences.

[0731] In some embodiments, the apparatus further comprises a receiving module 1650 for receiving an indication from a network device.

[0732] In some embodiments, the X first m-sequences are any X of N first m-sequences, where N is an integer greater than 1; or, the X first m-sequences are determined according to a cell identifier; or, the X first m-sequences are determined according to first sequence information.

[0733] In some embodiments, the first sequence information includes at least one of the following: first start information, used to indicate the number of the starting m-sequence of the X first m-sequences among the N first m-sequences; first length information, used to indicate the value of X; first end information, used to indicate the number of the ending m-sequence of the X first m-sequences among the N first m-sequences; the total number of sequences in the first sequence; the number of the preamble sequence in the first sequence; a cyclic shift step; a numbering order of the N first m-sequences; and a first bit map, wherein each bit of the first bit map corresponds one-to-one to the N first m-sequences.

[0734] In some embodiments, the X first m-sequences are determined based on the first starting information and the first length information; or, the X first m-sequences are determined based on the first length information and the first end information; or, the X first m-sequences are determined based on the first starting information and the first end information; or, the X first m-sequences are determined based on at least one of the following: the first starting information, the cyclic shift step, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence.

[0735] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: the first starting information, the cyclic shift step, and the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0736] In some embodiments, the numbering order of the N first m-sequences is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the apparatus.

[0737] In some embodiments, the processing module 1630 is further configured to determine a numbering order of the N first m-sequences.

[0738] In some embodiments, the numbering order of the N first m-sequences is determined according to the following order: the order of the numbers of the N first m-sequences from small to large; the order of the numbers of the N first m-sequences from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small.

[0739] In some embodiments, the first sequence includes an m-sequence subset, which is a subset of an m-sequence set; wherein the m-sequence set includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0740] In some embodiments, within the m-sequence set, the number of the first m-sequences is determined according to the order of the first m-sequences; within the m-sequence set, the number of the second m-sequences is determined according to at least one of the following: the number of the first m-sequences, the length of the first m-sequences, and a cyclic offset.

[0741] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the apparatus.

[0742] In some embodiments, the processing module 1630 is further configured to determine a numbering order of the first m-sequence in the m-sequence set.

[0743] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is determined according to the following order: the order of the numbers of the first m-sequences in the m-sequence set from small to large; the order of the numbers of the first m-sequences in the m-sequence set from large to small; the order of the coefficients of primitive polynomials from high power to low power; the order of the coefficients of primitive polynomials from low power to high power; the order of the binary numbers of the coefficients of primitive polynomials from small to large; and the order of the binary numbers of the coefficients of primitive polynomials from large to small.

[0744] In some embodiments, the numbering order of the second m-sequences in the m-sequence set is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the apparatus.

[0745] In some embodiments, the processing module 1630 is further configured to determine a numbering order of the second m-sequences in the m-sequence set.

[0746] In some embodiments, the numbering order of the second m-sequences in the m-sequence set is determined according to the following order: the order of the numbers of the first m-sequences in the m-sequence set from small to large; the order of the numbers of the first m-sequences in the m-sequence set from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the cyclic offsets from small to large; and the order of the cyclic offsets from large to small.

[0747] In some embodiments, each second m-sequence in the m-sequence set is arranged after its corresponding first m-sequence in numerical order; or, all second m-sequences in the m-sequence set are arranged after all first m-sequences in the m-sequence set in numerical order.

[0748] In some embodiments, the m-sequence subset is any subset of the m-sequence set; or, the m-sequence subset is determined according to a cell identifier; or, the m-sequence subset is indicated by a network device.

[0749] In some embodiments, the processing module 1630 is further configured to determine the m-sequence subset.

[0750] In some embodiments, the sequence element numbered n in the preamble sequence is determined based on the sequence element numbered n′ in the third m-sequence; wherein n′ is determined based on at least one of the following: the n, the cyclic shift step, the number of the preamble sequence in the first sequence, and a first length value; the first length value is the length value of the third m-sequence, and n is greater than or equal to 0 and less than the first length value.

[0751] In some embodiments, the processing module 1630 is further configured to determine a sequence element numbered n in the preamble sequence.

[0752] In some embodiments, the n′ is determined based on a first modulo result; wherein the first modulo result is a modulo result of a first sum value and the first length value; the first sum value is the sum of the n and the first product; the first product is the product of the cyclic shift step and the number of the preamble code sequence in the first sequence.

[0753] In some embodiments, the processing module 1630 is further configured to determine n′.

[0754] In some embodiments, the sequence element numbered n in the preamble sequence is the difference between the value 1 and the second product, where the second product is the product of the value 2 and the sequence element numbered n′ in the third m-sequence; or, the sequence element numbered n in the preamble sequence is the sequence element numbered n′ in the third m-sequence.

[0755] In some embodiments, the first sequence includes a first number of gold sequences; wherein the first number of gold sequences are generated according to at least one preferred pair of m-sequences.

[0756] In some embodiments, the first number of gold sequences are all or part of the gold sequences in a family of Z gold sequences, where Z is an integer greater than or equal to 1.

[0757] In some embodiments, the Z gold sequence families are determined by the apparatus from M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are indicated by a network device.

[0758] In some embodiments, the processing module 1630 is further configured to determine the Z gold sequence families.

[0759] In some embodiments, the Z gold sequence families are any Z of the M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are determined according to a cell identifier; or, the Z gold sequence families are determined according to the second sequence information.

[0760] In some embodiments, the second sequence information includes at least one of the following: second start information, used to indicate the number of a starting gold sequence family of the Z gold sequence families in the M gold sequence families; second length information, used to indicate the value of Z; second end information, used to indicate the number of an ending gold sequence family of the Z gold sequence families in the M gold sequence families; the total number of sequences in the first sequence; the number of the preamble sequence in the first sequence; a cyclic shift step; a numbering order of the M gold sequence families; and a second bit map, wherein each bit of the second bit map corresponds one-to-one to the M gold sequence families.

[0761] In some embodiments, the Z gold sequence families are determined based on the second starting information and the second length information; or, the Z gold sequence families are determined based on the second length information and the second end information; or, the Z gold sequence families are determined based on the second starting information and the second end information; or, the Z gold sequence families are determined based on at least one of the following: the second starting information, the cyclic shift step size, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence.

[0762] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: the second starting information, the cyclic shift step, and the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0763] In some embodiments, the numbering order of the M gold sequence families is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the apparatus.

[0764] In some embodiments, the processing module 1630 is further configured to determine a numbering order of the M gold sequence families.

[0765] In some embodiments, the numbering order of the M gold sequence families is determined according to the following order: the order of the numbers of the M gold sequence families from small to large; the order of the numbers of the M gold sequence families from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the numbering of the m-sequence preferred pairs from small to large; the order of the numbering of the m-sequence preferred pairs from large to small; the order of the cyclic offsets from small to large; and the order of the cyclic offsets from large to small.

[0766] In some embodiments, the first sequence includes a gold sequence subset, which is a subset of a gold sequence set; wherein the gold sequence set includes at least one gold sequence family, and a gold sequence family is generated based on a pair of m-sequence preference pairs.

[0767] In some embodiments, the processing module 1630 is further configured to generate at least one gold sequence family.

[0768] In some embodiments, the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the level r, the cyclic offset, the cyclic shift step, the length of the m-sequence, and the number of preferred pairs of m-sequences.

[0769] In some embodiments, the processing module 1630 is further configured to determine the number of gold sequence families in the gold sequence set.

[0770] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the apparatus.

[0771] In some embodiments, the processing module 1630 is further configured to determine a numbering order of the gold sequence families within the gold sequence set.

[0772] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is determined according to the following order: the order of the numbering of the gold sequence families within the gold sequence set from small to large; the order of the numbering of the gold sequence families within the gold sequence set from large to small; the order of the coefficients of primitive polynomials from high power to low power; the order of the coefficients of primitive polynomials from low power to high power; the order of the binary numbers of the coefficients of primitive polynomials from small to large; the order of the binary numbers of the coefficients of primitive polynomials from large to small; the order of the numbering of preferred m-sequence pairs from small to large; the order of the numbering of preferred m-sequence pairs from large to small; the order of cyclic offsets from small to large; and the order of cyclic offsets from large to small.

[0773] In some embodiments, the gold sequence subset is any subset of the gold sequence set; or, the gold sequence subset is determined according to a cell identifier; or, the gold sequence subset is indicated by a network device.

[0774] In some embodiments, the processing module 1630 is further configured to determine the gold sequence subset.

[0775] In some embodiments, the gold sequence family includes a first gold sequence family, the first gold sequence family includes a first gold sequence, and the first gold sequence is obtained by cyclic shifting an m-sequence in an m-sequence preferred pair.

[0776] In some embodiments, the gold sequence family includes a second gold sequence family, the second gold sequence family includes a second gold sequence, and the second gold sequence is obtained by cyclic shifting two m-sequences in an m-sequence preference pair.

[0777] In some embodiments, the gold sequence family includes a third gold sequence family, the third gold sequence of the third gold sequence family is obtained by cyclic shifting the first gold sequence, and the first gold sequence is obtained by cyclic shifting an m-sequence in an m-sequence preferred pair.

[0778] In some embodiments, the sequence element numbered n in the preamble sequence is determined based on the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence; wherein the fourth m-sequence is one m-sequence in a preferred m-sequence pair, and the fifth m-sequence is the other m-sequence in the preferred m-sequence pair.

[0779] In some embodiments, the sequence element numbered n in the preamble sequence is the third product, and the third product is the product of the first difference and the second difference; wherein the first difference is the difference between the value 1 and the fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; and the second difference is the difference between the value 1 and the fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

[0780] In some embodiments, the sequence element numbered n in the preamble sequence is a modulo-2 result of the sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence.

[0781] In some embodiments, a is determined based on at least one of the following: n, parameter m0, and a second length value; b is determined based on at least one of the following: n, parameter m1, and the second length value; wherein n is greater than or equal to 0 and less than the second length value, and the second length value is the length value of the fourth m-sequence and the fifth m-sequence.

[0782] In some embodiments, the processing module 1630 is further configured to determine a and b.

[0783] In some embodiments, a is determined based on a second modulo result, which is the modulo result of the second sum value and the second length value, and the second sum value is the sum of n and the parameter m0; b is determined based on a third modulo result, which is the modulo result of the third sum value and the second length value, and the third sum value is the sum of n and the parameter m1.

[0784] In some embodiments, the parameter m0 is determined based on the first sub-identifier, and the parameter m1 is determined based on the second sub-identifier; or, the parameter m0 is determined based on the second sub-identifier, and the parameter m1 is determined based on the first sub-identifier; or, the parameter m0 is determined based on the first sub-identifier and the second sub-identifier, and the parameter m1 is determined based on the first sub-identifier; or, the parameter m0 is determined based on the first sub-identifier, and the parameter m1 is determined based on the first sub-identifier and the second sub-identifier.

[0785] In some embodiments, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence.

[0786] In some embodiments, the processing module 1630 is further configured to determine the first sub-identifier and the second sub-identifier.

[0787] In some embodiments, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence and the cyclic shift step size.

[0788] In some embodiments, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence, the cyclic shift step, and the number of gold sequence families required to form the first sequence.

[0789] In some embodiments, the total number of sequences in the first sequence is agreed upon by a communication protocol or configured by a network device.

[0790] In some embodiments, the first sequences corresponding to different cells are completely identical, partially identical, or completely identical.

[0791] In some embodiments, the modulation mode of the preamble sequence includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

[0792] In some embodiments, the preamble sequence is carried on a random access channel; the bandwidth occupied by the preamble sequence is related to at least one of the following: the total bandwidth of the random access channel; the available bandwidth of the random access channel; and the frequency margin of downlink frequency synchronization.

[0793] In summary, the apparatus provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending a preamble sequence through an m-sequence. It supports both selecting a first m-sequence to form a first sequence and constructing an m-sequence set to form a first sequence, providing a flexible construction solution for the first sequence corresponding to a cell. It supports both the terminal device randomly selecting an m-sequence as a preamble sequence from the first sequence and the terminal device generating a preamble sequence through information such as the cyclic shift step size and the number of the preamble sequence in the first sequence, providing a flexible determination solution for the preamble sequence corresponding to a terminal device. Furthermore, it supports both different cells using the same first sequence to save communication resources and different cells using different first sequences to avoid conflicts within the communication system and ensure communication efficiency within the communication system. Furthermore, the m-sequence has good autocorrelation and cross-correlation characteristics, and the preamble sequence generated by the m-sequence still has such good characteristics, which helps to improve the accuracy and reliability of uplink synchronization and frequency offset estimation, and ensure the reliability, success rate, and efficiency of random access. Moreover, an m-sequence can be cyclically shifted to obtain more m-sequences, which can provide a large number of optional preamble sequences for a cell and support the provision of preamble sequences for a large number of terminal devices in the communication system.

[0794] FIG19 shows a block diagram of a preamble transmission apparatus according to an exemplary embodiment of the present application. The apparatus can be implemented as a network device as shown in FIG15 , FIG16 , or FIG17 , or as a portion of a network device as shown in FIG15 , FIG16 , or FIG17 . The apparatus includes a receiving module 1710 . Optionally, the apparatus also includes a sending module 1730 and / or a processing module 1750 .

[0795] The receiving module 1710 is configured to receive a preamble sequence, where the preamble sequence is one of the first sequences; wherein the type of the first sequence includes at least one of the following: an m sequence; a Gold sequence; or a Walsh sequence.

[0796] In some embodiments, the first sequence includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0797] In some embodiments, in the first sequence, the number of the first m-sequences is X, and the number of the second m-sequences is Y; wherein X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not equal to 0 at the same time.

[0798] In some embodiments, the X first m-sequences are determined by the terminal device from N first m-sequences, where N is an integer greater than 1; or, the X first m-sequences are indicated by the apparatus.

[0799] In some embodiments, the apparatus further comprises a sending module 1730 for sending instructions and / or configurations to a terminal device.

[0800] In some embodiments, the sending module 1730 is further configured to indicate the X first m-sequences.

[0801] In some embodiments, the X first m-sequences are any X of N first m-sequences, where N is an integer greater than 1; or, the X first m-sequences are determined according to a cell identifier; or, the X first m-sequences are determined according to first sequence information.

[0802] In some embodiments, the first sequence information includes at least one of the following: first start information, used to indicate the number of the starting m-sequence of the X first m-sequences among the N first m-sequences; first length information, used to indicate the value of X; first end information, used to indicate the number of the ending m-sequence of the X first m-sequences among the N first m-sequences; the total number of sequences in the first sequence; the number of the preamble sequence in the first sequence; a cyclic shift step; a numbering order of the N first m-sequences; and a first bit map, wherein each bit of the first bit map corresponds one-to-one to the N first m-sequences.

[0803] In some embodiments, the X first m-sequences are determined based on the first starting information and the first length information; or, the X first m-sequences are determined based on the first length information and the first end information; or, the X first m-sequences are determined based on the first starting information and the first end information; or, the X first m-sequences are determined based on at least one of the following: the first starting information, the cyclic shift step, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence.

[0804] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: the first starting information, the cyclic shift step, and the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0805] In some embodiments, the numbering order of the N first m-sequences is agreed upon by a communication protocol, or is indicated by the apparatus, or is a default order, or is determined by a terminal device.

[0806] In some embodiments, the sending module 1730 is further configured to indicate a numbering order of the N first m-sequences.

[0807] In some embodiments, the numbering order of the N first m-sequences is determined according to the following order: the order of the numbers of the N first m-sequences from small to large; the order of the numbers of the N first m-sequences from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small.

[0808] In some embodiments, the first sequence includes an m-sequence subset, which is a subset of an m-sequence set; wherein the m-sequence set includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0809] In some embodiments, within the m-sequence set, the number of the first m-sequences is determined according to the order of the first m-sequences; within the m-sequence set, the number of the second m-sequences is determined according to at least one of the following: the number of the first m-sequences, the length of the first m-sequences, and a cyclic offset.

[0810] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is agreed upon by a communication protocol, or is indicated by the apparatus, or is a default order, or is determined by a terminal device.

[0811] In some embodiments, the sending module 1730 is further configured to indicate a numbering order of the first m-sequence in the m-sequence set.

[0812] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is determined according to the following order: the order of the numbers of the first m-sequences in the m-sequence set from small to large; the order of the numbers of the first m-sequences in the m-sequence set from large to small; the order of the coefficients of primitive polynomials from high power to low power; the order of the coefficients of primitive polynomials from low power to high power; the order of the binary numbers of the coefficients of primitive polynomials from small to large; and the order of the binary numbers of the coefficients of primitive polynomials from large to small.

[0813] In some embodiments, the numbering order of the second m-sequences in the m-sequence set is agreed upon by a communication protocol, or is indicated by the apparatus, or is a default order, or is determined by a terminal device.

[0814] In some embodiments, the sending module 1730 is further configured to indicate a numbering order of second m-sequences in the m-sequence set.

[0815] In some embodiments, the numbering order of the second m-sequences in the m-sequence set is determined according to the following order: the order of the numbers of the first m-sequences in the m-sequence set from small to large; the order of the numbers of the first m-sequences in the m-sequence set from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the cyclic offsets from small to large; and the order of the cyclic offsets from large to small.

[0816] In some embodiments, each second m-sequence in the m-sequence set is arranged after its corresponding first m-sequence in numerical order; or, all second m-sequences in the m-sequence set are arranged after all first m-sequences in the m-sequence set in numerical order.

[0817] In some embodiments, the m-sequence subset is any subset of the m-sequence set; or, the m-sequence subset is determined acc...

Claims

1. A preamble transmission method, characterized in that, the method is executed by a terminal device, and the method includes: sending a preamble sequence, where the preamble sequence is one of a first sequence; wherein, the first sequence is generated according to at least one of the following sequences: m sequence; Gold sequence; Walsh sequence.

2. The method according to claim 1, characterized in that, the first sequence is generated according to a first m sequence and / or a second m sequence, and the second m sequence is obtained by circularly shifting the first m sequence.

3. The method according to claim 2, characterized in that, the number of the first m sequences corresponding to the first sequence is X, and the number of the second m sequences corresponding to the first sequence is Y; wherein, X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not both equal to 0.

4. The method according to claim 3, characterized in that, the X first m sequences are determined by the terminal device from N first m sequences, where N is an integer greater than 1; or, the X first m sequences are indicated by a network device.

5. The method according to claim 3 or 4, characterized in that, the X first m sequences are any X of the N first m sequences, where N is an integer greater than 1; or, the X first m sequences are determined according to a cell identifier; or, the X first m sequences are determined according to first sequence information.

6. The method according to claim 5, characterized in that, the first sequence information includes at least one of the following: first start information, used to indicate the start position of the X first m sequences in the N first m sequences; first length information, used to indicate the value of X; first end information, used to indicate the end position of the X first m sequences in the N first m sequences; the total number of sequences in the first sequence; the numbers of the X first m sequences; the number of the preamble sequence in the first sequence; circular shift step size; the number order of the N first m sequences; first bit map, and each bit of the first bit map corresponds to one of the N first m sequences.

7. The method according to claim 6, characterized in that, the X first m sequences are determined according to the first start information and the first length information; or, the X first m sequences are determined according to the first length information and the first end information; or, the X first m sequences are determined according to the first start information and the first end information; or, the X first m sequences are determined according to at least one of the following: the first start information, the circular shift step size, the number order of the N first m sequences, the total number of sequences in the first sequence.

8. The method according to claim 6 or 7, characterized in that, the i-th sequence in the first sequence is determined according to at least one of the following: the first start information, the circular shift step size, the value of i; wherein, the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

9. The method according to any one of claims 4 to 8, wherein, the numbering order of the N first m-sequences is agreed by a communication protocol, or indicated by a network device, or is a default order, or determined by the terminal device.

10. The method according to claim 9, wherein, the numbering order of the N first m-sequences is determined according to one of the following orders: the order of the numbers of the N first m-sequences from small to large; the order of the numbers of the N first m-sequences from large to small; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small.

11. The method according to claim 1, wherein, the first sequence is generated according to an m-sequence subset, and the m-sequence subset is a subset of an m-sequence set; wherein, the m-sequence set includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by circularly shifting the first m-sequence.

12. The method according to claim 11, wherein, within the m-sequence set, the number of the first m-sequences is determined according to the order of the first m-sequences; and / or, within the m-sequence set, the number of the second m-sequences is determined according to at least one of the following: the number of the first m-sequences, the length of the first m-sequences, the circular shift step size.

13. The method according to claim 11 or 12, wherein, the numbering order of the first m-sequences within the m-sequence set is agreed by a communication protocol, or indicated by a network device, or is a default order, or determined by the terminal device.

14. The method according to claim 13, wherein, the numbering order of the first m-sequences within the m-sequence set is determined according to one of the following orders: the order of the numbers of the first m-sequences within the m-sequence set from small to large; the order of the numbers of the first m-sequences within the m-sequence set from large to small; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small.

15. The method according to any one of claims 11 to 14, wherein, the numbering order of the second m-sequences within the m-sequence set is agreed by a communication protocol, or indicated by a network device, or is a default order, or determined by the terminal device.

16. The method according to claim 15, wherein, The numbering order of the second m-sequence in the set of m-sequences is determined according to one of the following orders: the order of the numbers of the first m-sequence in the set of m-sequences from smallest to largest; the order of the numbers of the first m-sequence in the set of m-sequences from largest to smallest; the order of the coefficients of the primitive polynomial from the highest power to the lowest power; the order of the coefficients of the primitive polynomial from the lowest power to the highest power; the order of the binary numbers of the coefficients of the primitive polynomial from smallest to largest; the order of the binary numbers of the coefficients of the primitive polynomial from largest to smallest; the order of the cyclic offsets from smallest to largest; the order of the cyclic offsets from largest to smallest.

17. The method according to any one of claims 11 to 16, wherein, each of the second m-sequences in the set of m-sequences is arranged after its corresponding first m-sequence in the numbering order; or, all of the second m-sequences in the set of m-sequences are arranged after all of the first m-sequences in the set of m-sequences in the numbering order.

18. The method according to any one of claims 11 to 17, wherein, the subset of m-sequences is any subset of the set of m-sequences; or, the subset of m-sequences is determined according to the cell identifier; or, the subset of m-sequences is indicated by the network device.

19. The method according to any one of claims 1 to 17, wherein, the sequence element numbered n in the preamble sequence is determined according to the sequence element numbered n' in the third m-sequence; wherein, the n' is determined according to at least one of the following: the n, the cyclic shift step size, the number of the preamble sequence in the first sequence, the first length value; the first length value is the length value of the third m-sequence, and the n is greater than or equal to 0 and less than the first length value.

20. The method according to claim 19, wherein, the n' is determined according to the first modulo result; wherein, the first modulo result is the modulo result of the first sum value and the first length value; the first sum value is the sum of the n and the first product; the first product is the product of the cyclic shift step size and the target number, and the target number is the number of the target sequence generating the preamble sequence among all the m-sequences generated by the third m-sequence.

21. The method according to claim 19 or 20, wherein, the sequence element numbered n in the preamble sequence is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered n' in the third m-sequence; or, the sequence element numbered n in the preamble sequence is the sequence element numbered n' in the third m-sequence.

22. The method according to claim 1, wherein, the first sequence is generated according to the first number of gold sequences; wherein, the first number of gold sequences is generated according to at least one pair of m-sequence preferred pairs.

23. The method according to claim 22, wherein, the first number of gold sequences is all or part of the gold sequences in Z gold sequence families, and Z is an integer greater than or equal to 1.

24. The method according to claim 23, wherein, The Z sets of gold sequences are determined by the terminal device from M sets of gold sequences, where M is an integer greater than 1; or, the Z sets of gold sequences are indicated by the network device.

25. The method according to claim 23 or 24, wherein, the Z sets of gold sequences are any Z sets among the M sets of gold sequences, where M is an integer greater than 1; or, the Z sets of gold sequences are determined according to the cell identifier; or, the Z sets of gold sequences are determined according to the second sequence information.

26. The method according to claim 25, wherein, the second sequence information includes at least one of the following: second start information for indicating the starting position of the Z sets of gold sequences among the M sets of gold sequences; second length information for indicating the value of Z; second end information for indicating the ending position of the Z sets of gold sequences among the M sets of gold sequences; the total number of sequences in the first sequence; the numbers of the Z sets of gold sequences; the number of the preamble sequence in the first sequence; cyclic shift step size; the numbering order of the M sets of gold sequences; second bit map, where each bit of the second bit map corresponds one by one to the M sets of gold sequences.

27. The method according to claim 26, wherein, the Z sets of gold sequences are determined according to the second start information and the second length information; or, the Z sets of gold sequences are determined according to the second length information and the second end information; or, the Z sets of gold sequences are determined according to the second start information and the second end information; or, the Z sets of gold sequences are determined according to at least one of the following: the second start information, the cyclic shift step size, the numbering order of the M sets of gold sequences, the total number of sequences in the first sequence.

28. The method according to claim 26 or 27, wherein, the i-th sequence in the first sequence is determined according to at least one of the following: the second start information, the cyclic shift step size, the value of i; where the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

29. The method according to any one of claims 24 to 28, wherein, the numbering order of the M sets of gold sequences is agreed upon by the communication protocol, or is indicated by the network device, or is the default order, or is determined by the terminal device.

30. The method according to claim 29, wherein, The numbering order of the M gold sequence families is determined according to one of the following orders: the order of the numbers of the M gold sequence families from small to large; the order of the numbers of the M gold sequence families from large to small; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the numbers of the m-sequence optimal pairs from small to large; the order of the numbers of the m-sequence optimal pairs from large to small; the order of the cyclic offsets from small to large; the order of the cyclic offsets from large to small.

31. According to the method described in claim 1, it is characterized in that the first sequence is generated according to a gold sequence subset, and the gold sequence subset is a subset of a gold sequence set; wherein, the gold sequence set includes at least one gold sequence family, and one gold sequence family is generated based on a pair of m-sequence optimal pairs.

32. According to the method described in claim 31, it is characterized in that the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the series r, the cyclic offset, the cyclic shift step size, the length of the m-sequence, the number of m-sequence optimal pairs.

33. According to the method described in claim 31 or 32, it is characterized in that the numbering order of the gold sequence families in the gold sequence set is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the terminal device.

34. According to the method described in claim 33, it is characterized in that the numbering order of the gold sequence families in the gold sequence set is determined according to one of the following orders: the order of the numbers of the gold sequence families in the gold sequence set from small to large; the order of the numbers of the gold sequence families in the gold sequence set from large to small; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the numbers of the m-sequence optimal pairs from small to large; the order of the numbers of the m-sequence optimal pairs from large to small; the order of the cyclic offsets from small to large; the order of the cyclic offsets from large to small.

35. According to the method described in any one of claims 31 to 34, it is characterized in that the gold sequence subset is any subset of the gold sequence set; or, the gold sequence subset is determined according to a cell identifier; or, the gold sequence subset is indicated by a network device.

36. According to the method described in any one of claims 23 to 35, it is characterized in that the gold sequence family includes a first gold sequence family, the first gold sequence family includes a first gold sequence, and the first gold sequence is obtained by modulo 2 addition of the cyclic shift sequences of a fourth m-sequence and a fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form an m-sequence optimal pair.

37. The method according to any one of claims 23 to 35, characterized in that, the gold sequence family includes a second gold sequence family, the second gold sequence family includes a second gold sequence, the second gold sequence is obtained by modulo 2 addition of a cyclic shift sequence of a fourth m-sequence and a cyclic shift sequence of a fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

38. The method according to any one of claims 23 to 35, characterized in that, the gold sequence family includes a third gold sequence family, the third gold sequence family includes a third gold sequence, the third gold sequence is obtained by cyclic shifting of a first gold sequence, the first gold sequence is obtained by modulo 2 addition of a cyclic shift sequence of a fourth m-sequence and a cyclic shift sequence of a fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

39. The method according to claim 1 or any one of claims 22 to 38, characterized in that, the sequence element numbered n in the preamble sequence is determined according to the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence; wherein, the fourth m-sequence is one of the m-sequences in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

40. The method according to claim 39, characterized in that, the sequence element numbered n in the preamble sequence is a third product, the third product is the product of a first difference and a second difference; wherein, the first difference is the difference between the value 1 and a fourth product, the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; the second difference is the difference between the value 1 and a fifth product, the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

41. The method according to claim 39, characterized in that, the sequence element numbered n in the preamble sequence is the modulo 2 result of the sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence.

42. The method according to any one of claims 39 to 41, characterized in that, The a is determined according to at least one of the following: the n, the parameter m 0 , a second length value; said b is determined according to at least one of the following: said n, parameter m 1 , the second length value; wherein n is greater than or equal to 0 and less than the second length value, and the second length value is the length value of the fourth m-sequence and the fifth m-sequence.

43. The method according to claim 42, characterized in that, a is determined according to a second modulo result, where the second modulo result is a modulo result of a second sum value and the second length value, and the second sum value is n and the parameter m 0 The sum of b is determined according to the third modulo result, the third modulo result is the modulo result of the third sum value and the second length value, and the third sum value is the sum of n and the parameter m 1 sum.

44. The method according to claim 42 or 43, characterized in that, the parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the second sub-identifier; or, the parameter m 0 is determined according to the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier and the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the first sub-identifier and the second sub-identifier.

45. The method according to claim 44, characterized in that, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence.

46. The method according to claim 45, characterized in that, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence and the cyclic shift step size.

47. The method according to claim 45, characterized in that, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence, the cyclic shift step size, and the number of gold sequence families required to form the first sequence.

48. The method according to any one of claims 1 to 47, characterized in that, the total number of sequences in the first sequence is agreed upon by a communication protocol or configured by a network device.

49. The method according to any one of claims 1 to 48, characterized in that, the first sequences corresponding to different cells are exactly the same, partially the same, or completely different.

50. The method according to any one of claims 1 to 49, characterized in that, the modulation method of the preamble sequence includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

51. The method according to any one of claims 1 to 50, characterized in that, the preamble sequence is carried on a random access channel; the bandwidth occupied by the preamble sequence is related to at least one of the following: the total bandwidth of the random access channel; the available bandwidth of the random access channel; the frequency margin of downlink frequency synchronization.

52. A preamble transmission method, characterized in that, the method is executed by a network device, and the method includes: receiving a preamble sequence, where the preamble sequence is one of the first sequences; wherein, the first sequence is generated according to at least one of the following sequences: m sequence; Gold sequence; Walsh sequence.

53. The method according to claim 52, characterized in that, the first sequence is generated according to a first m sequence and / or a second m sequence, and the second m sequence is obtained by circularly shifting the first m sequence.

54. The method according to claim 53, characterized in that, the number of the first m sequences corresponding to the first sequence is X, and the number of the second m sequences corresponding to the first sequence is Y; wherein, X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not both equal to 0 at the same time.

55. The method according to claim 54, characterized in that, the X first m sequences are determined by a terminal device from N first m sequences, where N is an integer greater than 1; or, the X first m sequences are indicated by the network device.

56. The method according to claim 54 or 55, characterized in that, the X first m sequences are any X of the N first m sequences, where N is an integer greater than 1; or, the X first m sequences are determined according to a cell identifier; or, the X first m sequences are determined according to first sequence information.

57. The method according to claim 56, characterized in that, the first sequence information includes at least one of the following: first start information, used to indicate the start position of the X first m sequences in the N first m sequences; first length information, used to indicate the value of X; first end information, used to indicate the end position of the X first m sequences in the N first m sequences; the total number of sequences in the first sequence; the numbers of the X first m sequences; the number of the preamble sequence in the first sequence; circular shift step size; the number order of the N first m sequences; first bit map, and each bit of the first bit map corresponds to one of the N first m sequences.

58. The method according to claim 57, wherein, the X first m-sequences are determined according to the first start information and the first length information; or, the X first m-sequences are determined according to the first length information and the first end information; or, the X first m-sequences are determined according to the first start information and the first end information; or, the X first m-sequences are determined according to at least one of the following: the first start information, the cyclic shift step size, the numbering order of the N first m-sequences, the total number of sequences in the first sequence.

59. The method according to claim 57 or 58, wherein, the i-th sequence in the first sequence is determined according to at least one of the following: the first start information, the cyclic shift step size, the value of i; wherein, the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

60. The method according to any one of claims 55 to 59, wherein, the numbering order of the N first m-sequences is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by the terminal device.

61. The method according to claim 60, wherein, the numbering order of the N first m-sequences is determined according to one of the following orders: the order of the numbers of the N first m-sequences from smallest to largest; the order of the numbers of the N first m-sequences from largest to smallest; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest.

62. The method according to claim 52, wherein, the first sequence is generated according to an m-sequence subset, and the m-sequence subset is a subset of an m-sequence set; wherein, the m-sequence set includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

63. The method according to claim 62, wherein, within the m-sequence set, the number of the first m-sequences is determined according to the order of the first m-sequences; within the m-sequence set, the number of the second m-sequences is determined according to at least one of the following: the number of the first m-sequences, the length of the first m-sequence, the cyclic shift step size.

64. The method according to claim 62 or 63, wherein, the numbering order of the first m-sequences within the m-sequence set is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by the terminal device.

65. The method according to claim 64, wherein, The numbering order of the first m-sequence in the set of m-sequences is determined according to one of the following orders: the order of the numbers of the first m-sequence in the set of m-sequences from smallest to largest; the order of the numbers of the first m-sequence in the set of m-sequences from largest to smallest; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest.

66. According to the method described in any one of claims 62 to 65, wherein, the numbering order of the second m-sequence in the set of m-sequences is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by the terminal device.

67. According to the method described in claim 66, wherein, the numbering order of the second m-sequence in the set of m-sequences is determined according to one of the following orders: the order of the numbers of the first m-sequence in the set of m-sequences from smallest to largest; the order of the numbers of the first m-sequence in the set of m-sequences from largest to smallest; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest; the order of the cyclic offsets from smallest to largest; the order of the cyclic offsets from largest to smallest.

68. According to the method described in any one of claims 62 to 67, wherein, each second m-sequence in the set of m-sequences is arranged in order of numbering after its corresponding first m-sequence; or all the second m-sequences in the set of m-sequences are arranged in order of numbering after all the first m-sequences in the set of m-sequences.

69. According to the method described in any one of claims 62 to 68, wherein, the subset of m-sequences is any subset of the set of m-sequences; or the subset of m-sequences is determined according to the cell identifier; or the subset of m-sequences is indicated by the network device.

70. According to the method described in any one of claims 52 to 69, wherein, the sequence element numbered n in the preamble sequence is determined according to the sequence element numbered n' in the third m-sequence; wherein, the n' is determined according to at least one of the following: the n, the cyclic shift step size, the number of the preamble sequence in the first sequence, the first length value; the first length value is the length value of the third m-sequence, and the n is greater than or equal to 0 and less than the first length value.

71. According to the method described in claim 70, wherein, the n' is determined according to a first modulo result; wherein, the first modulo result is the modulo result of the first sum value and the first length value; the first sum value is the sum of the n and the first product; the first product is the product of the cyclic shift step size and the target number, and the target number is the number of the target sequence that generates the preamble sequence among all the m-sequences generated by the third m-sequence.

72. According to the method described in claim 70 or 71, wherein, The sequence element numbered n in the preamble sequence is the difference between the value 1 and the second product, where the second product is the product of the value 2 and the sequence element numbered n' in the third m-sequence; or, the sequence element numbered n in the preamble sequence is the sequence element numbered n' in the third m-sequence.

73. The method according to claim 52, wherein, the first sequence is generated according to a first quantity of gold sequences; wherein, the first quantity of gold sequences is generated according to at least a pair of preferably selected m-sequences.

74. The method according to claim 73, wherein, the first quantity of gold sequences is all or part of the gold sequences in Z gold sequence families, and Z is an integer greater than or equal to 1.

75. The method according to claim 74, wherein, the Z gold sequence families are determined by the terminal device from M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are indicated by the network device.

76. The method according to claim 74 or 75, wherein, the Z gold sequence families are any Z of the M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are determined according to the cell identifier; or, the Z gold sequence families are determined according to the second sequence information.

77. The method according to claim 76, wherein, the second sequence information includes at least one of the following: second start information, used to indicate the starting position of the Z gold sequence families in the M gold sequence families; second length information, used to indicate the value of Z; second end information, used to indicate the ending position of the Z gold sequence families in the M gold sequence families; the total number of sequences in the first sequence; the numbers of the Z gold sequence families; the number of the preamble sequence in the first sequence; cyclic shift step size; the numbering order of the M gold sequence families; second bit map, where each bit of the second bit map corresponds one-to-one to the M gold sequence families.

78. The method according to claim 77, wherein, the Z gold sequence families are determined according to the second start information and the second length information; or, the Z gold sequence families are determined according to the second length information and the second end information; or, the Z gold sequence families are determined according to the second start information and the second end information; or, the Z gold sequence families are determined according to at least one of the following: the second start information, the cyclic shift step size, the numbering order of the M gold sequence families, the total number of sequences in the first sequence.

79. The method according to claim 77 or 78, wherein, The i-th sequence in the first sequence is determined according to at least one of the following: the second starting information, the cyclic shift step size, and the value of i; where the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

80. The method according to any one of claims 75 to 79, characterized in that, the numbering order of the M gold sequence families is agreed upon by a communication protocol, or indicated by the network device, or is the default order, or is determined by the terminal device.

81. The method according to claim 80, characterized in that, the numbering order of the M gold sequence families is determined according to one of the following orders: the order of the numbers of the M gold sequence families from small to large; the order of the numbers of the M gold sequence families from large to small; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the numbers of the m-sequence preferred pairs from small to large; the order of the numbers of the m-sequence preferred pairs from large to small; the order of the cyclic offsets from small to large; the order of the cyclic offsets from large to small.

82. The method according to claim 52, characterized in that, the first sequence is generated according to a gold sequence subset, and the gold sequence subset is a subset of a gold sequence set; where the gold sequence set includes at least one gold sequence family, and one gold sequence family is generated based on a pair of m-sequence preferred pairs.

83. The method according to claim 82, characterized in that, the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the series r, the cyclic offset, the cyclic shift step size, the length of the m-sequence, the number of m-sequence preferred pairs.

84. The method according to claim 82 or 83, characterized in that, the numbering order of the gold sequence families in the gold sequence set is agreed upon by a communication protocol, or indicated by the network device, or is the default order, or is determined by the terminal device.

85. The method according to claim 84, characterized in that, the numbering order of the gold sequence families in the gold sequence set is determined according to one of the following orders: the order of the numbers of the gold sequence families in the gold sequence set from small to large; the order of the numbers of the gold sequence families in the gold sequence set from large to small; the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the numbers of the m-sequence preferred pairs from small to large; the order of the numbers of the m-sequence preferred pairs from large to small; the order of the cyclic offsets from small to large; the order of the cyclic offsets from large to small.

86. The method according to any one of claims 82 to 85, characterized in that, The gold sequence subset is any subset of the gold sequence set; alternatively, the gold sequence subset is determined according to the cell identifier; alternatively, the gold sequence subset is indicated by the network device.

87. According to the method of any one of claims 84 to 86, wherein, The gold sequence family includes a first gold sequence family, the first gold sequence family includes a first gold sequence, and the first gold sequence is obtained by modulo 2 addition of the cyclic shift sequences of the fourth m-sequence and the fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

88. According to the method of any one of claims 84 to 86, wherein, The gold sequence family includes a second gold sequence family, the second gold sequence family includes a second gold sequence, and the second gold sequence is obtained by modulo 2 addition of the cyclic shift sequence of the fourth m-sequence and the cyclic shift sequence of the fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

89. According to the method of any one of claims 84 to 86, wherein, The gold sequence family includes a third gold sequence family, the third gold sequence family includes a third gold sequence, and the third gold sequence is obtained by cyclic shifting the first gold sequence, and the first gold sequence is obtained by modulo 2 addition of the cyclic shift sequences of the fourth m-sequence and the fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

90. According to the method of claim 52 or any one of claims 73 to 89, wherein, The sequence element numbered n in the preamble sequence is determined according to the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence; wherein, the fourth m-sequence is one of the m-sequences in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

91. According to the method of claim 90, wherein, The sequence element numbered n in the preamble sequence is a third product, and the third product is the product of a first difference and a second difference; wherein, the first difference is the difference between the value 1 and a fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; the second difference is the difference between the value 1 and a fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

92. According to the method of claim 90, wherein, The sequence element numbered n in the preamble sequence is the modulo 2 result of the sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence.

93. According to the method of any one of claims 90 to 92, wherein, The a is determined according to at least one of the following: the n, the parameter m 0 and the second length value; the b is determined according to at least one of the following: the n, the parameter m 1 and the second length value; where n is greater than or equal to 0 and less than the second length value, and the second length value is the length value of the fourth m-sequence and the fifth m-sequence.

94. According to the method of claim 93, wherein, The a is determined according to a second modulo result, where the second modulo result is the modulo result of a second sum value and the second length value, and the second sum value is the sum of the n and the parameter m; the b is determined according to a third modulo result, where the third modulo result is the modulo result of a third sum value and the second length value, and the third sum value is the sum of the n and the parameter m. 0 The sum; the b is determined according to a third modulo result, where the third modulo result is the modulo result of a third sum value and the second length value, and the third sum value is the sum of the n and the parameter m. 1 The sum.

95. According to the method of claim 93 or 94, wherein, The parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the second sub-identifier; or, the parameter m 0 is determined according to the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier and the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the first sub-identifier and the second sub-identifier.

96. According to the method of claim 95, wherein, The first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence.

97. The method according to claim 96, wherein, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence and the cyclic shift step size.

98. The method according to claim 96, wherein, the first sub-identifier and the second sub-identifier are determined according to the number of the preamble sequence in the first sequence, the cyclic shift step size, and the number of Gold sequence families required to form the first sequence.

99. The method according to any one of claims 52 to 98, wherein, the total number of sequences in the first sequence is agreed by a communication protocol or configured by the network device.

100. The method according to any one of claims 52 to 99, wherein, the first sequences corresponding to different cells are completely the same, partially the same, or completely different.

101. The method according to any one of claims 52 to 100, wherein, the modulation method of the preamble sequence includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

102. The method according to any one of claims 52 to 101, wherein, the preamble sequence is carried on a random access channel; the bandwidth occupied by the preamble sequence is related to at least one of the following: the total bandwidth of the random access channel; the available bandwidth of the random access channel; the frequency margin of downlink frequency synchronization.

103. A preamble transmission device, wherein, the device includes: a sending module, configured to send a preamble sequence, where the preamble sequence is one in a first sequence; wherein, the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

104. A preamble transmission device, wherein, the device includes: a receiving module, configured to receive a preamble sequence, where the preamble sequence is one in a first sequence; wherein, the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

105. A communication device, wherein, the communication device includes: a processor; a receiver and / or a transmitter connected to the processor; a memory for storing executable instructions of the processor; wherein, the communication device is configured to implement the preamble transmission method according to any one of claims 1 to 51, or any one of claims 52 to 102.

106. A communication device, wherein, the communication device includes: a receiver and / or a transmitter; wherein, the communication device is configured to implement the preamble transmission method according to any one of claims 1 to 51.

107. A computer-readable storage medium, wherein, executable instructions are stored in the readable storage medium, and the executable instructions are loaded and executed by a processor to implement the preamble transmission method according to any one of claims 1 to 51, or any one of claims 52 to 102.

108. A chip, wherein, The chip includes a programmable logic circuit or program, and the chip is used to implement the preamble transmission method described in any one of claims 1 to 51, or any one of claims 52 to 102.

109. A computer program product, characterized in that the computer program product includes computer instructions, the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the preamble transmission method described in any one of claims 1 to 51, or any one of claims 52 to 102.

110. A computer program, characterized in that the computer program includes computer instructions, and a processor of a computer device executes the computer instructions, so that the computer device executes the preamble transmission method described in any one of claims 1 to 51, or any one of claims 52 to 102.

Images