WO2022099697A1 - 序列发送的方法和装置 - Google Patents

序列发送的方法和装置 Download PDF

Info

Publication number
WO2022099697A1
WO2022099697A1 PCT/CN2020/129086 CN2020129086W WO2022099697A1 WO 2022099697 A1 WO2022099697 A1 WO 2022099697A1 CN 2020129086 W CN2020129086 W CN 2020129086W WO 2022099697 A1 WO2022099697 A1 WO 2022099697A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
terminal device
nth
network device
scrambled
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2020/129086
Other languages
English (en)
French (fr)
Inventor
徐修强
张云昊
吴艺群
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN202080107012.8A priority Critical patent/CN116569592B/zh
Priority to PCT/CN2020/129086 priority patent/WO2022099697A1/zh
Priority to EP20961251.4A priority patent/EP4240052A4/en
Publication of WO2022099697A1 publication Critical patent/WO2022099697A1/zh
Priority to US18/317,311 priority patent/US12426100B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
    • H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0091—Signalling for the administration of the divided path, e.g. signalling of configuration information
    • H04L5/0094—Indication of how sub-channels of the path are allocated
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signalling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H04W74/004—Transmission of channel access control information in the uplink, i.e. towards network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H04W74/0836—Random access procedures, e.g. with 4-step access with 2-step access

Definitions

  • the present application relates to the field of communications, and more particularly, to a method and apparatus for sequence transmission.
  • LTE long term evolution
  • NR new radio
  • eMBB enhanced mobile broadband
  • URLLC ultra-reliable low latency communication
  • mMTC massive machine type communication
  • the typical characteristics of mMTC scenarios are that the number of terminals is large, the data packets are small, and the packet arrival interval is large. For example, there are tens of thousands to millions of terminals per square kilometer, and the data packet arrival interval of each terminal is several hours or even days. The size of each packet is several to dozens of bytes.
  • the terminal device needs to send a random access preamble (preamble) to the base station. After the base station detects the preamble, it sends a random access response (RAR) message to the terminal device. The terminal device sends according to the RAR message. upstream data.
  • preamble random access preamble
  • RAR random access response
  • the essence of preamble is a sequence.
  • the detection performance of the base station to the terminal will decrease, for example, the base station cannot detect the sequence, or detects However, it is impossible to determine how many terminals have sent this sequence, which will affect the transmission and reception of uplink data.
  • the number of available sequences is fixed, the greater the number of terminals, the greater the possibility of transmission sequence collision.
  • the present application provides a method and apparatus for sequence transmission, which can reduce the probability of sequence collision.
  • a method for sending a sequence is provided, which is applied to random access of a terminal device.
  • the method includes: within a first time period, the terminal device sends a first sequence to a network device, where the first sequence is sent by a first sequence.
  • a parameter is determined; the terminal device scrambles the second sequence according to the first parameter to generate a second scrambled sequence; within the second time period, the terminal device sends the network device the The scrambled second sequence; the terminal device performs scramble processing on the Nth sequence according to the N-1th parameter to generate a scrambled Nth sequence, and the N-1th sequence is determined by the N-1th parameter , where N is an integer greater than 2; within the Nth time period, the terminal device sends the scrambled Nth sequence to the network device.
  • the terminal device can send at least three sequences to the network device in different time periods, respectively, including the first sequence, the second sequence, and the Nth sequence.
  • the first sequence, the second sequence, and the Nth sequence are the Randomly selected from the resource pool, if the total number of available sequences in the resource pool is Q, the number of available sequence combinations is at least Q 3 , thereby increasing the total number of available sequences and reducing the probability of sequence conflict.
  • the method further includes: receiving, by the terminal device, indication information sent by the network device; and, according to the indication information, the terminal device selecting the first sequence, the second sequence, the N-1th sequence, and the Nth sequence.
  • the terminal device performs scramble processing on the second sequence according to the first parameter, and generates a scrambled second sequence, including: the terminal device, according to the first parameter, Generating a first scrambling sequence; the terminal device performs scrambling processing on the second sequence according to the first scrambling sequence to generate the scrambled second sequence.
  • the method further includes: receiving, by the terminal device, a random access response message sent by the network device.
  • the first sequence, the second sequence, the Nth sequence, and the first scrambling sequence are any one of the following sequences: Zodoff-Shu ZC sequence, longest sequence Linear shift register m-sequence, pseudo-noise PN sequence, discrete Fourier transform DFT sequence, Elter Alltop sequence or Good Gold sequence.
  • a method for sending a sequence is provided, applied to random access of a terminal device, the method includes: within a first time period, a network device receives a first sequence sent by the terminal device, the first sequence Determined by the first parameter; within the second time period, the network device receives a second scrambled sequence sent by the terminal device, the second scrambled sequence is the terminal device according to the first parameter A sequence that has been scrambled on the second sequence; the network device descrambles the scrambled second sequence according to the first parameter to obtain the second sequence; within the Nth time period, The network device receives the scrambled N-th sequence sent by the terminal device, where the scrambled N-th sequence is a sequence that the terminal device has performed scrambled on the N-th sequence according to the N-1-th parameter, and the scrambled N-th sequence is The N-1th sequence is determined by the N-1th parameter, where N is an integer greater than 2; the network device descrambles the scrambled the scr
  • the method further includes: the network device sending indication information to the terminal device, where the indication information is used to instruct the terminal device to select the first sequence, the second sequence, the N-1th sequence, and the Nth sequence.
  • the network device descrambles the scrambled second sequence according to the first parameter to obtain the second sequence, including: the network device according to the first parameter A parameter is used to generate a first descrambling sequence; the network device descrambles the scrambled second sequence according to the first descrambling sequence to obtain the second sequence.
  • the method further includes: sending, by the network device, a random access response message to the terminal device according to the first sequence, the second sequence and the Nth sequence.
  • the first sequence, the second sequence, the Nth sequence, and the first descrambling sequence are any one of the following sequences: Zodoff-Shu ZC sequence, longest sequence Linear shift register m-sequence, pseudo-noise PN sequence, discrete Fourier transform DFT sequence, Elter Alltop sequence or Good Gold sequence.
  • a method for sending a sequence is provided, which is applied to random access of a terminal device, the method comprising: in a first time period, the terminal device sends M sequences to a network device, among the M sequences Including the first sequence to the longest linear shift register M sequence, the M sequences are respectively determined by M parameters, and the M parameters are in one-to-one correspondence with the M sequences, where M is greater than or equal to 2
  • the terminal device performs scramble processing on the Nth sequence according to the M parameters to generate a scrambled Nth sequence, where N is equal to M+1; within the second time period, the terminal device The scrambled Nth sequence is sent to the network device.
  • the terminal device can send at least two sequences to the network device in the first time period, and send one sequence to the network device in the second time period, the sequences sent in the same time period are different, and the sequences sent in different time periods It can be the same or different. If the total number of available sequences in the resource pool is Q, the number of available sequence combinations is at least Q 2 (Q-1), thereby increasing the total number of available sequences and reducing sequence conflicts. The probability.
  • the method further includes: receiving, by the terminal device, indication information sent by the network device; and, according to the indication information, selecting, by the terminal device, the M sequences and the Nth sequence.
  • the terminal device performs scramble processing on the Nth sequence according to the M parameters to generate a scrambled Nth sequence, including: the terminal device, according to the M parameters, Generating an Nth scrambling sequence; the terminal device performs scrambling processing on the Nth sequence according to the Nth scrambling sequence to generate the scrambled Nth sequence.
  • the method further includes: receiving, by the terminal device, a random access response message sent by the network device.
  • the M sequences, the Nth sequence, and the second scrambling sequence are any one of the following sequences: a Zodoff-Shu ZC sequence, a longest linear shift register m sequence , Pseudo-Noise PN sequence, Discrete Fourier Transform DFT sequence, Elter Alltop sequence or Good Gold sequence.
  • a method for sending a sequence is provided, applied to random access of a terminal device, the method includes: within a first time period, a network device receives M sequences sent by the terminal device, the M sequences including the first sequence to the longest linear shift register M sequence, the M sequences are respectively determined by M parameters, and the M parameters are in one-to-one correspondence with the M sequences, wherein the M is greater than or an integer equal to 2; within the second time period, the network device receives the scrambled Nth sequence sent by the terminal device, and the scrambled Nth sequence is the The parameter is the sequence in which the Nth sequence has been scrambled, where N is equal to M+1; the network device descrambles the scrambled Nth sequence according to the M parameters to obtain the Nth sequence sequence.
  • the method further includes: the network device sending indication information to the terminal device, where the indication information is used to instruct the terminal device to select the M sequences and the Nth sequence.
  • the network device descrambles the scrambled Nth sequence according to the M parameters to obtain the Nth sequence, which includes: the network device according to the M parameters generating the Nth descrambling sequence according to the parameters; the network device performs descrambling processing on the scrambled Nth sequence according to the Nth descrambling sequence to obtain the Nth sequence.
  • the method further includes: sending, by the network device, a random access response message to the terminal device according to the M sequences and the Nth sequence.
  • the M sequences, the Nth sequence, and the second descrambling sequence are any one of the following sequences: a Zodoff-Shu ZC sequence, a longest linear shift register m sequence , Pseudo-Noise PN sequence, Discrete Fourier Transform DFT sequence, Elter Alltop sequence or Good Gold sequence.
  • a communication apparatus comprising a unit for implementing the functions of the method in the first aspect or any possible implementation manner of the first aspect.
  • a communication apparatus comprising a unit for implementing the functions of the method in the second aspect or any possible implementation manner of the second aspect.
  • a communication apparatus comprising a unit for implementing the functions of the method in the third aspect or any possible implementation manner of the third aspect.
  • a communication apparatus comprising a unit for implementing the functions of the method in the fourth aspect or any possible implementation manner of the fourth aspect.
  • a communication device comprising: a processor and a transceiver, the transceiver is configured to receive computer code or instructions and transmit them to the processor, and the processor executes the computer code or instructions, A method as in the first aspect or any possible implementation manner of the first aspect.
  • a communication device comprising: a processor and a transceiver, wherein the transceiver is configured to receive computer code or instructions and transmit them to the processor, and the processor executes the computer code or instructions, A method as in the second aspect or any possible implementation of the second aspect.
  • a communication device comprising: a processor and a transceiver, the transceiver is configured to receive computer code or instructions and transmit them to the processor, and the processor executes the computer code or instructions , as the method in the third aspect or any possible implementation manner of the third aspect.
  • a twelfth aspect provides a communication device, comprising: a processor and a transceiver, the transceiver is configured to receive computer code or instructions and transmit them to the processor, where the processor executes the computer code or instructions , as the method in the fourth aspect or any possible implementation manner of the fourth aspect.
  • a thirteenth aspect provides a communication system, including the terminal device and the network device in the method of the first aspect, the second aspect, the third aspect or the fourth aspect.
  • a fourteenth aspect provides a computer-readable storage medium, where a computer program is stored in the computer-readable medium; when the computer program runs on a computer, the computer causes the computer to execute the first to fourth aspects or the first aspect to the method in any possible implementation manner of the fourth aspect.
  • FIG. 1 is a schematic diagram of a 2-stage-based preamble sending scheme.
  • FIG. 2 is a schematic diagram of an applicable communication system.
  • FIG. 3 is a flowchart interaction diagram of a method for sending a sequence according to an embodiment of the present application.
  • FIG. 4 is a flowchart interaction diagram of another method for sending a sequence according to an embodiment of the present application.
  • FIG. 5 is a schematic block diagram of a communication apparatus according to an embodiment of the present application.
  • FIG. 6 is a schematic block diagram of another communication apparatus according to an embodiment of the present application.
  • FIG. 7 is a schematic block diagram of another communication apparatus according to an embodiment of the present application.
  • FIG. 8 is a schematic block diagram of another communication apparatus according to an embodiment of the present application.
  • FIG. 9 is a schematic block diagram of a communication device according to an embodiment of the present application.
  • FIG. 10 is a schematic block diagram of a communication system according to an embodiment of the present application.
  • the embodiments of the present application can be applied to various communication systems, such as a sidelink communication system (sidelink communication), a vehicle to everything (V2X) system, a wireless local area network (WLAN), and a narrowband Internet of Things system (narrow band-internet of things, NB-IoT), global system for mobile communications (GSM), enhanced data rate for GSM evolution (enhanced data rate for gsm evolution, EDGE), wideband code division multiple access system (wideband code division multiple access, WCDMA), code division multiple access 2000 system (code division multiple access, CDMA2000), time division synchronization code division multiple access system (time division-synchronization code division multiple access, TD-SCDMA), long term evolution system (long term evolution, LTE), satellite communication, fifth generation (5th generation, 5G) system or new communication systems that will appear in the future.
  • sidelink communication sidelink communication
  • V2X vehicle to everything
  • WLAN wireless local area network
  • NB-IoT narrowband Internet of Things system
  • GSM global system for mobile
  • the terminal device involved in the embodiments of the present application may be a device that includes a wireless transceiver function and can provide a communication service for a user.
  • the terminal device may be a device in a V2X system, a device in a device to device (device to device, D2D) system, a device in a machine type communication (machine type communication, MTC) system, and the like.
  • Various wireless communication capable handheld devices, in-vehicle devices, wearable devices, computing devices, or other processing devices connected to a wireless modem may be included.
  • the terminal can be a mobile station (mobile station, MS), a subscriber unit (subscriber unit), user equipment (user equipment, UE), a cellular phone (cellular phone), a cordless phone, a session initiation protocol (session initiation protocol, SIP) phone, Wireless local loop (WLL) station, smart phone (smart phone), wireless data card, personal digital assistant (personal digital assistant, PDA) computer, tablet computer, wireless modem (modem), handheld device (handset) ), laptop computer (laptop computer), machine type communication (machine type communication, MTC) terminal, etc.
  • MS mobile station
  • subscriber unit subscriber unit
  • user equipment user equipment
  • UE a cellular phone
  • cordless phone a session initiation protocol (session initiation protocol, SIP) phone
  • WLL Wireless local loop
  • smart phone smart phone
  • wireless data card personal digital assistant (personal digital assistant, PDA) computer, tablet computer, wireless modem (modem), handheld device (handset) ), laptop computer (laptop computer), machine type communication (machine type communication
  • eMBB enhanced mobile broadband
  • URLLC ultra-reliable low latency communication
  • mMTC massive machine type communication
  • the typical characteristics of mMTC scenarios are that the number of terminals is large, the data packets are small, and the packet arrival interval is large. For example, there are tens of thousands to millions of terminals per square kilometer, and the data packet arrival interval of each terminal is several hours or even days. The size of each packet is several to dozens of bytes.
  • the traditional scheduling-based uplink transmission method is not suitable, because in the traditional scheduling-based uplink transmission, the terminal first needs to enter the connection state through random access (RA) and send the schedule to the base station.
  • Request scheduling request, SR
  • monitor the uplink grant sent by the base station and send data packets to the base station according to the scheduling information in the uplink grant.
  • the terminal will consume a lot of delay and power consumption to establish a connection , sending SR, monitoring scheduling information, etc., the actual time used for data transmission is very short, resulting in extremely low data transmission efficiency.
  • more efficient uplink packet transmission methods can be considered, such as uplink grant-free (GF), early data transmission (EDT), and 2-step random access (2-step random access). channel, 2-step RACH), etc.
  • Uplink license-free transmission means that the terminal sends uplink data packets to the base station on the physical uplink shared channel (PUSCH) resources preconfigured by the base station without monitoring the dynamic authorization of the base station before sending the data packets.
  • the PUSCH also contains pilot signals, such as Demodulation Reference Signal (DMRS), and the pilot signals are used by the base station to detect whether the terminal sends data. For example, when the base station detects the reference signal, it is considered that there is a terminal using After sending data based on the reference signal, the base station can then estimate the uplink shared channel according to the detected reference signal, and demodulate the terminal data. Therefore, for uplink license-free transmission, the sending of the reference signal plays an important role.
  • DMRS Demodulation Reference Signal
  • Early data transmission is a method of sending uplink data in a 4-step random access process.
  • the terminal When the terminal has data to send, it sends Msg1 to the base station, that is, sends a random access preamble (preamble) in the physical random access channel (PRACH); after the base station detects the preamble, it sends Msg2 to the terminal, that is Random access response (RAR) message, RAR carries timing advance (TA) and uplink authorization for scheduling Msg3; after monitoring RAR, the terminal sends Msg3, Msg3 according to the uplink authorization.
  • RAR Random access response
  • TA timing advance
  • EDT EDT
  • traditional 4-step random access the terminal cannot send uplink data to the base station. It can be seen from the EDT process that the transmission and detection of the preamble is very important, because the base station can only send RAR for the preamble after detecting the preamble, and the terminal can then send the Msg3 carrying the data.
  • Two-step random access is an uplink packet transmission method that further simplifies early data transmission.
  • 2-step RACH includes two steps, namely MsgA and MsgB.
  • MsgA consists of two parts, namely PRACH and PUSCH.
  • PRACH carries the preamble
  • PUSCH carries the uplink data
  • the PUSCH also includes DMRS for the base station to perform channel estimation;
  • MsgA the detection of MsgA is the detection of preamble
  • the base station sends MsgB to the terminal, which contains a contention resolution message, if the base station detects MsgA, but fails to receive the message correctly.
  • the base station may send RAR to the terminal, and schedule the terminal to retransmit the uplink data.
  • the transmission and detection of preambles are also important for 2-step RACH.
  • the essence is a sequence.
  • the detection performance of the base station to the terminal will decrease.
  • the base station cannot detect the same sequence. sequence, or the sequence is detected but it cannot be determined that several terminals have sent the sequence, which will affect the transmission and reception of uplink data.
  • the number of available sequences is fixed, the greater the number of terminals, the greater the possibility of transmission sequence collision.
  • the preamble in the random access process usually adopts the Zadoff-chu (Zadoff-chu, ZC) sequence:
  • L RA is a prime number
  • n is the sequence length
  • u is the root sequence index
  • v is the cyclic shift index
  • x u (i) is the root sequence determined by the root sequence index
  • C v is the cyclic shift value
  • C v Ncs*v, where N cs is the cyclic shift interval, and N cs is greater than or equal to zero.
  • the terminal device determines the root sequence according to the root sequence index configured by the base station, and then determines different preamble sequences according to different cyclic shift values.
  • NR is the same as LTE, and each cell supports up to 64 preamble sequences.
  • the number of preamble sequences that can be generated by each root sequence is determined by the cyclic shift interval. When the number of preamble sequences generated by one root sequence is less than 64, the terminal will continue to generate preamble sequences according to other root sequences until the number of preamble sequences reaches 64. It can be seen that the number Q of preambles that can be determined depends on two factors, one is the number of root sequences n, and the other is the number K of preambles that each root sequence can generate, that is, the total number of preamble sequences that can be generated Q is equal to n*K.
  • the preamble sequences generated by different root sequences are not orthogonal, the situation where the same cell uses multiple root sequences is usually avoided.
  • the total number of preamble sequences available for each cell is limited, such as 64 in LTE and NR.
  • the preamble sent by the terminal when performing 4-step random access or two-step random access or data early transmission is usually randomly selected from all available preambles, when the number of terminals is large, there will be more than one preamble.
  • the probability of the terminal selecting the same preamble is relatively high, which may cause the base station to fail to detect.
  • a two-stage (2-stage) based preamble transmission scheme is proposed, which can increase the number of available preambles to Q 2 .
  • FIG 1 a schematic diagram of a 2-stage-based preamble sending scheme is shown.
  • the specific method is as follows: the terminal device sends two sequences of preamble-1 and preamble-2 in two time periods, such as 4-step random access or EDT.
  • Msg1 contains two PRACH sending occasions, where each PRACH occasion sends a preamble sequence.
  • the base station detects preambles in two time periods. If the base station detects preamble-1 and preamble-2 in the two time periods respectively, the base station determines that a terminal device has sent a combination of preamble-1 and preamble-2.
  • preamble-1 and preamble-2 cannot be arbitrary, otherwise false alarms will appear on the base station side.
  • the base station device detects preambles with indexes x1 and x2 in period 1, and detects preambles with indexes y1 and y2 in period 2, then the base station cannot determine whether a terminal device has selected indices of x1 and y2 or The preamble combination of x2 and y1.
  • the following methods for determining preamble-1 and preamble-2 are proposed. The specific steps include:
  • the terminal randomly selects preamble-1 from the preamble resource pool
  • the terminal randomly selects preamble-x from the preamble resource pool, and then calculates an S sequence according to the index (index) of preamble-1 in the resource pool, and scrambles the obtained S sequence (here, the corresponding elements can be multiplied) preamble-x gets preamble-2;
  • the terminal sends preamble-1 in period 1 and preamble-2 in period 2;
  • the base station After detecting preamble-1 in period 1, the base station determines the S sequence according to the same rule, uses the obtained S sequence to descramble the signal received in period 2, and then detects preamble-x therefrom.
  • preamble-2 Since the generation of preamble-2 is related to preamble-1, the problem of false alarms can be avoided. For example, suppose that the index of the preamble-1 selected by the terminal device 1 in the period 1 is x1, the index of the preamble-x selected in the period 2 is y1, the S sequence determined by the terminal device according to x1 is s1, and the terminal device according to s1 and the index are The preamble of y1 determines preamble-2. At the same time, the index of preamble-1 selected by terminal device 2 in period 1 is x2, and the index of preamble-x selected in period 2 is y2. The S sequence determined by terminal equipment according to x2 is s2.
  • Preamble-2 is determined based on s2 and the preamble with index y2.
  • the base station side detects preambles with indexes x1 and x2 in period 1, and then detects preamble-x with index y1 in period 2 according to s1, and detects preamble-2 with index y2 in period 2 according to s2. In this way, the base station does not It will be judged that at the same time, terminal 3 has selected the preamble combination with index x1 and index y2 in time period 1 and time period 2 respectively, because the base station does not detect the preamble with index y2 in time period 2 according to s1.
  • this method can expand the total number of available sequences from Q to Q2 .
  • an embodiment of the present application proposes a method for sequence transmission, in the case of a given sequence resource pool, the number of available sequences can be increased, and the probability of sequence conflict can be reduced.
  • the technical solutions provided in this application are mainly applied to the 5G NR system, and can also be applied to other communication systems, as long as there is an entity in the communication system that sends configuration information to another entity, sends data to another entity, or receives data sent by another entity.
  • the other entity receives the configuration information sent by the entity, and sends data to the entity according to the configuration information, or receives the data sent by the entity.
  • FIG. 2 a schematic diagram of an applicable communication system is shown.
  • the sending entity of the configuration information is a network entity
  • the receiving entity of the configuration information is a terminal device, such as UE
  • the network device and UE1 to UE6 form a communication system.
  • UE1-UE6 can send uplink data to network equipment, and the network equipment needs to receive the uplink data sent by UE1-UE6.
  • the network device may send configuration information to UE1 to UE6.
  • both the sending entity and the receiving entity of the configuration information can be terminal devices.
  • terminal device 1 sends configuration information to terminal device 2, and receives the terminal device. 2; and the terminal device 2 receives the configuration information sent by the terminal device 1, and sends data to the terminal device 1.
  • this application can be used for random access, including 2-step random access 2-step RACH, 4-step random access 4-step RACH, 4-step data early transmission EDT, uplink license-free transmission GF, transmission based on preconfigured uplink resources, transmission based on configuration grant.
  • the present application can be applied to a terminal device in a connected state or an active state (active), and can also be applied to a terminal device in an inactive state (inactive) or an idle state (idle).
  • the present application can be used for random access preamble design in random access process, and can also be used for various reference signal designs, such as DMRS sequence, sounding reference signal (SRS), channel state information reference signal (channel state information reference signal, CSI-RS), phase tracking reference signal (phase tracking reference signal, PTRS), etc.
  • DMRS sequence sounding reference signal
  • SRS sounding reference signal
  • CSI-RS channel state information reference signal
  • phase tracking reference signal phase tracking reference signal
  • PTRS phase tracking reference signal
  • FIG. 3 an interactive flowchart of a sequence sending method proposed by an embodiment of the present application is shown. This method extends the two-phase sequence sending to multi-phase, enabling a further increase in the total number of available sequences.
  • the terminal device selects the first sequence from the resource pool, and within the first time period, the terminal device sends the first sequence to the network device, where the first sequence is determined by the first parameter.
  • the network device is an entity for transmitting and receiving signals, such as a base station.
  • the terminal device receives the indication information sent by the network device, and the terminal device selects the first sequence from the resource pool according to the indication information sent by the network device; optional , the first sequence may also be randomly selected by the terminal device, or selected according to other rules.
  • the first sequence may be a ZC sequence, or any one of the following sequences, or other sequences.
  • Pseudo noise (PN) sequence The PN sequence applied by the 5G NR system is generated by a Goode Gold sequence with a length of 31.
  • x 1 (n+31) (x 1 (n+3)+x 1 (n))mod 2
  • x 2 (n+31) (x 2 (n+3)+x 2 (n+2)+x 2 (n+1)+x 2 (n))mod 2
  • c(n) is the generated PN sequence
  • the length is M PN
  • n 0, 1,..., M PN -1
  • N C 160
  • DFT Discrete Fourier Transform
  • the Gold sequence is the modulo two sum of the two longest linear shift register m sequences.
  • the network device receives the first sequence sent by the terminal device.
  • the terminal device selects the second sequence from the resource pool, and performs scramble processing on the second sequence according to the first parameter for determining the first sequence to generate a scrambled second sequence.
  • the second sequence may be selected by the terminal device according to the indication information sent by the network device, or may be randomly selected by the terminal device, or selected according to other rules.
  • the second sequence may be any one of a ZC sequence, an m sequence, a pseudo-noise PN sequence, a discrete Fourier transform DFT sequence, an Alltop sequence, or a Gold sequence, or may be other sequences.
  • the terminal device generates a first scrambling sequence according to the first parameter; and the terminal device performs scrambling processing on the second sequence according to the first scrambling sequence to generate a scrambled second sequence.
  • the first scrambling sequence may be any one of a ZC sequence, an m sequence, a pseudo-noise PN sequence, a discrete Fourier transform DFT sequence, an Alltop sequence, or a Gold sequence, or may be other sequences.
  • the first parameter may be a root sequence index, a cyclic shift index, a cyclic shift interval or a cyclic shift value. If the first sequence is an m sequence or a Gold sequence, the first parameter may be a cyclic shift value. If the first sequence is an Alltop sequence, the first parameter can be ⁇ or ⁇ .
  • x can be the above parameter information, for example, when the first scrambling sequence is a ZC sequence, y can be any parameter among the root sequence index, cyclic shift index, cyclic shift interval or cyclic shift value;
  • y can be cyclic shift information, such as any parameter information in a cyclic shift index, a cyclic shift interval or a cyclic shift value;
  • y can be ⁇ or ⁇ ;
  • y may be cyclic shift information, such as any parameter information in a cyclic shift index, a cyclic shift interval, or a cyclic shift value.
  • the terminal device performs scrambling processing on the second sequence according to the first scrambling sequence, and a specific implementation method includes: multiplying the corresponding elements of the first scrambling sequence and the second sequence to generate a scrambled second sequence.
  • the terminal device sends the scrambled second sequence to the network device.
  • the network device receives the scrambled second sequence sent by the terminal device.
  • the network device descrambles the scrambled second sequence according to the first parameter to obtain the second sequence.
  • the network device determines a first parameter for determining the first sequence according to the first sequence sent by the terminal device, and generates a first descrambling sequence according to the first parameter, where the first descrambling sequence and the first scrambling sequence are the same
  • the network device descrambles the scrambled second sequence according to the first descramble sequence to obtain a second unscrambled sequence.
  • the terminal device selects the Nth sequence from the resource pool, and performs scramble processing on the Nth sequence according to the N-1 parameter used to determine the N-1th sequence to generate a scrambled Nth sequence, where N is An integer greater than 2, that is, the terminal device sends at least three sequences to the network device in at least three time periods respectively.
  • the Nth sequence may be selected by the terminal device according to the indication information sent by the network device, or may be randomly selected by the terminal device, or selected according to other rules.
  • the Nth sequence may be any one of a ZC sequence, an m sequence, a pseudo-noise PN sequence, a discrete Fourier transform DFT sequence, an Alltop sequence, or a Gold sequence, or may be other sequences.
  • the terminal device generates the N-1th scrambling sequence according to the N-1th parameter; the terminal device performs scramble processing on the Nth sequence according to the N-1th scrambling sequence, and generates a scrambled Nth sequence.
  • the N-1th scrambling sequence may be any one of a ZC sequence, an m sequence, a pseudo-noise PN sequence, a discrete Fourier transform DFT sequence, an Alltop sequence, or a Gold sequence, or may be other sequences.
  • the terminal device sends the scrambled Nth sequence to the network device.
  • the network device receives the scrambled Nth sequence sent by the terminal device.
  • the network device descrambles the scrambled Nth sequence according to the N-1th parameter used to determine the N-1th sequence to obtain the Nth sequence.
  • the network device determines the N-1th parameter for determining the N-1th sequence according to the N-1th sequence sent by the terminal device, and generates the N-1th descrambling sequence according to the N-1th parameter.
  • the 1 descrambling sequence and the N-1 th scrambling sequence are the same sequence, and the network device descrambles the scrambled N th sequence according to the N-1 th descrambling sequence to obtain the N th sequence that is not scrambled.
  • the network device After receiving and acquiring the combination of the first sequence, the second sequence and the Nth sequence sent by the terminal device, the network device performs subsequent operations for the combination.
  • the network device sends a random access response RAR message to the terminal device, and the terminal device receives the RAR message sent by the network device, and sends data to the network device according to the time-frequency resources indicated in the RAR message.
  • time periods may be different time units, such as different symbols, time slots, subframes, radio frames, etc., and different time periods may be continuous or discontinuous in time, such as each The stage is that there is an orthogonal frequency division multiplexing (orthogonal frequency division multiplexing, OFDM) symbol, and the two time periods can be two adjacent consecutive OFDM symbols, or two non-adjacent OFDM symbols.
  • OFDM orthogonal frequency division multiplexing
  • the second sequence and the Nth sequence may be selected by the terminal device in the first period of time or before the first period of time, or may be selected within the second period of time and the Nth period of time, respectively. Do not make any restrictions.
  • the terminal device may send at least three sequences to the network device in different time periods, respectively, including the first sequence, the second sequence, and the Nth sequence, and the first sequence, the second sequence, and the Nth sequence.
  • the sequence is randomly selected by the terminal device from the resource pool. If the total number of available sequences in the resource pool is Q, the number of available sequence combinations is at least Q 3 , thereby increasing the total number of available sequences and reducing the probability of sequence conflict.
  • the network device allocates three time units to the terminal device for the terminal device to send a random access preamble sequence.
  • the Q sequences contained in the sequence resource pool are ZC sequences x u, v (n), 0 ⁇ n ⁇ N-1, n is the sequence length, u is the root sequence index, and v is the cyclic shift index;
  • the specific sequence sending process is as follows:
  • Step 2 The network device receives the sequence o 1 (n) sent by the terminal device;
  • Step 3 The terminal device randomly selects preamble-2 from the preamble resource pool. Assuming that the cyclic shift of the selected sequence is 30, the sequence can be expressed as x u,30 (n), and the terminal device selects the selected sequence in step 1.
  • Step 5 The terminal device randomly selects preamble-3 from the preamble resource pool. Assuming that the cyclic shift of the selected sequence is 4, the sequence can be expressed as x u,4 (n), and the terminal device selects the selected sequence in step 3.
  • sequence transmission in which the scrambling sequence is an Alltop sequence is given below.
  • the network device allocates three time units to the terminal device for the terminal device to send a random access preamble sequence.
  • the M sequences contained in the sequence resource pool are ZC sequences x u, v (n), 0 ⁇ n ⁇ N-1, n is the sequence length, u is the root sequence index, and v is the cyclic shift index;
  • the specific sequence sending process is as follows:
  • Step 2 The network device receives the sequence o 1 (n) sent by the terminal device;
  • Step 3 The terminal device randomly selects preamble-2 from the preamble resource pool. Assuming that the cyclic shift of the selected sequence is 30, the sequence can be expressed as x u, 30 (n), and the terminal device selects according to step 1.
  • Step 5 The terminal device randomly selects preamble-3 from the preamble resource pool. Assuming that the cyclic shift of the selected sequence is 4, the sequence can be expressed as x u,4 (n), and the terminal device selects the selected sequence in step 3.
  • Step 6 The network device receives the sequence o 3 (n) sent by the terminal device, and generates a root sequence index and/or a cyclic shift index value in x u,30 (n) sent by the terminal device in the second time unit.
  • the network device descrambles the o 3 (n) sent by the terminal device according to the second descrambling sequence , obtain x u,4 (n).
  • the network device can determine that a terminal device has sent a combination of preamble-1, preamble-2, and preamble-3 according to the detection conditions in the three time units, and perform subsequent operations for the combination, such as sending RAR.
  • FIG. 4 an interactive flowchart of another sequence sending method proposed by an embodiment of the present application is shown. This method can also achieve an increase in the number of total available sequences.
  • the terminal device selects M sequences from the resource pool, the M sequences include the first sequence to the longest linear shift register M sequence, the M sequences are determined by M parameters, and the M parameters are the same as the M sequences.
  • M is an integer greater than or equal to 2
  • the terminal device sends the M sequences to the network device.
  • the terminal device receives the indication information sent by the network device, and the terminal device selects the M sequences from the resource pool according to the indication information sent by the network device; optional , the M sequences may also be randomly selected by the terminal device, or selected according to other rules.
  • the M sequences are sequences of the same type, and the type of the sequence can be any one of ZC sequence, m sequence, pseudo-noise PN sequence, discrete Fourier transform DFT sequence, Alltop sequence or Gold sequence, or it can be other sequences.
  • the network device receives the M sequences sent by the terminal device.
  • the terminal device selects the Nth sequence from the resource pool, and performs scramble processing on the Nth sequence according to the M parameters used to determine the M sequences to generate a scrambled Nth sequence, where N is equal to M+1 .
  • the Nth sequence may be selected by the terminal device according to the indication information sent by the network device, or may be randomly selected by the terminal device, or selected according to other rules.
  • the Nth sequence may be any one of a ZC sequence, an m sequence, a pseudo-noise PN sequence, a discrete Fourier transform DFT sequence, an Alltop sequence, or a Gold sequence, or may be other sequences. It should be understood that the first sequence to the Mth sequence and the Nth sequence may be sequences of the same type, or may be sequences of different types.
  • the terminal device generates an Nth scrambling sequence according to the M parameters; and the terminal device performs scramble processing on the Nth sequence according to the Nth scrambling sequence to generate a scrambled Nth sequence.
  • the Nth scrambling sequence may be any one of a ZC sequence, an m sequence, a pseudo-noise PN sequence, a discrete Fourier transform DFT sequence, an Alltop sequence, or a Gold sequence, or may be other sequences.
  • the M parameters may be indexes of each of the M sequences in the resource pool. For example, if the M sequences selected by the terminal device from the resource pool are ZC sequences, the M parameters may be a root sequence index, a cyclic shift index, a cyclic shift interval or a cyclic shift value. If the M sequences are m sequences or Gold sequences, the M parameters may be cyclic shift values. If the M sequences are Alltop sequences, the M parameters can be ⁇ or ⁇ .
  • x1, x2 can be the parameter information of the above example, for example, when the Nth scrambling sequence is a ZC sequence, y can be any parameter in the root sequence index, cyclic shift index, cyclic shift interval or cyclic shift value; When the Nth scrambling sequence is a PN sequence, y can be cyclic shift information, such as any parameter information in a cyclic shift index, a cyclic shift interval or a cyclic shift value; when the Nth scrambling sequence is an Alltop sequence , y can be ⁇ or ⁇ ; when the first scrambling sequence is m sequence or Gold sequence, y can be cyclic shift information, such as cyclic shift index, cyclic shift interval or any parameter in cyclic shift value information.
  • the terminal device performs scramble processing on the Nth sequence according to the Nth scrambling sequence, and a specific implementation method includes: multiplying the Nth scrambled sequence by the corresponding element of the Nth sequence to generate a scrambled Nth sequence.
  • the terminal device sends the scrambled Nth sequence to the network device.
  • the network device receives the scrambled Nth sequence sent by the terminal device.
  • the network device descrambles the scrambled Nth sequence according to the M parameters to obtain the Nth sequence.
  • the network device determines M parameters for determining the M sequences according to the M sequences sent by the terminal device, and generates the Nth descrambling sequence according to the M parameters, where the Nth descrambling sequence and the Nth scrambling sequence are the same , perform descrambling processing on the scrambled Nth sequence to obtain the Nth sequence that is not scrambled.
  • the network device After receiving and acquiring the combination of the first sequence to the Mth sequence and the Nth sequence sent by the terminal device, the network device performs subsequent operations for the combination.
  • the network device sends a random access response RAR message to the terminal device, and the terminal device receives the RAR message sent by the network device, and sends data to the network device according to the time-frequency resources indicated in the RAR message.
  • time periods may be different time units, such as different symbols, time slots, subframes, radio frames, etc., and different time periods may be continuous or discontinuous in time, such as each The stage is that there is an orthogonal frequency division multiplexing (orthogonal frequency division multiplexing, OFDM) symbol, and the two time periods can be two adjacent consecutive OFDM symbols, or two non-adjacent OFDM symbols.
  • OFDM orthogonal frequency division multiplexing
  • the Nth sequence may be selected by the terminal device in the first time period or before the first time period, or may be selected within the Nth time period, which is not limited in this application.
  • the terminal device may send at least two sequences to the network device in the first time period, and send one sequence to the network device in the second time period, and the sequences sent in the same time period are different.
  • the sequences sent in the time period can be the same or different. If the total number of available sequences in the resource pool is Q, the number of available sequence combinations is at least Q 2 (Q-1), thus increasing the total number of available sequences. , which can reduce the probability of sequence collision.
  • the network device allocates two time units to the terminal device for the terminal device to send the random access preamble sequence.
  • the network device sends two sequences to the end device, and in the second time unit, the network device sends one sequence to the end device.
  • the specific sequence sending process is as follows:
  • Step 2 The network device receives the sequences o 1 (n) and o 2 (n) sent by the terminal device;
  • Step 3 The terminal device randomly selects preamble-3 from the preamble resource pool. Assuming that the cyclic shift index of the selected sequence is 30, the sequence can be expressed as x u, 30 (n). The determined index 2,5 is used as the cyclic shift value of the m sequence to generate the Nth scrambling sequence The terminal device generates a sequence according to the Nth scrambling sequence s N (n) and x u,30 (n) The terminal device sends o 3 (n) to the network device within the second time unit;
  • Step 4 The network device receives the sequence o 3 (n) sent by the terminal device, and according to the cyclic shift index values in x u,2 (n) and x u,5 (n) sent by the terminal device in the first time unit , generate the Nth descrambling sequence (Nth scrambling sequence) The network device descrambles o 3 (n) sent by the terminal device according to the Nth descrambling sequence to obtain x u,30 (n).
  • sequence transmission in which the scrambling sequence is an Alltop sequence is given below. Taking the sending of three sequences as an example, it is assumed that the network device allocates two time units to the terminal device for the terminal device to send the random access preamble sequence. In the first time unit, the network device sends two sequences to the end device, and in the second time unit, the network device sends one sequence to the end device.
  • sequence resource pool 1 Assume that the Q sequences contained in sequence resource pool 1 are all ZC sequences x u, v (n), 0 ⁇ n ⁇ N-1, n is the sequence length, u is the root sequence index, and v is the cyclic shift index; use
  • the specific sequence sending process is as follows:
  • Step 2 The network device receives the sequences o 1 (n) and o 2 (n) sent by the terminal device;
  • Step 3 The terminal device randomly selects preamble-3 from the preamble resource pool. Assuming that the cyclic shift index of the selected sequence is 30, the sequence can be expressed as x u, 30 (n).
  • the terminal device generates a sequence according to the Nth scrambling sequence s N (n) and x u,30 (n)
  • the terminal device sends o 3 (n) to the network device within the second time unit;
  • Step 4 The network device receives the sequence o 3 (n) sent by the terminal device, and according to the cyclic shift index values in x u,2 (n) and x u,5 (n) sent by the terminal device in the first time unit , generate the Nth descrambling sequence (Nth scrambling sequence) The network device descrambles o 3 (n) sent by the terminal device according to the Nth descrambling sequence to obtain x u,30 (n).
  • the network device can determine that a terminal device has sent a combination of preamble-1, preamble-2, and preamble-3 according to the detection conditions in the two time units, and perform subsequent operations for the combination, such as sending RAR.
  • the terminal device may also send multiple sequences to the network device during the first time period, send one sequence or multiple sequences to the network device during the second time period, send one sequence to the network device during the third time period, and so on.
  • This embodiment of the present application does not make any limitation on this.
  • FIG. 5 a schematic block diagram of a communication apparatus 500 according to an embodiment of the present application is shown.
  • the apparatus may be applied to the terminal device in the method embodiment of FIG. 3 provided in this application.
  • the communication apparatus 500 includes: a transceiving unit 510 and a processing unit 520, the transceiving unit 510 is configured to send a first sequence to a network device within a first time period, where the first sequence is determined by a first parameter;
  • the processing unit 520 configured to perform scramble processing on the second sequence according to the first parameter to generate a scrambled second sequence
  • the transceiver unit 510 is further configured to, within a second time period, send the scrambled second sequence to the network device;
  • the processing unit 520 is further configured to perform scramble processing on the Nth sequence according to the N-1th parameter to generate a scrambled Nth sequence, where the N-1th sequence is determined by the N-1th parameter, wherein, N is an integer greater than 2;
  • the transceiver unit 510 is further configured to send the scrambled Nth sequence to the network device within the Nth time period.
  • the transceiver unit 510 is further configured to receive indication information sent by the network device; the processing unit 520 is further configured to, according to the indication information, select the first sequence, all the the second sequence, the N-1th sequence, and the Nth sequence.
  • the processing unit 520 is specifically configured to: generate a first scrambling sequence according to the first parameter; perform scrambling processing on the second sequence according to the first scrambling sequence to generate the scrambled second sequence.
  • the transceiver unit 510 is further configured to receive a random access response message sent by the network device.
  • the first sequence, the second sequence, the Nth sequence, and the first descrambling sequence are any one of the following sequences: a Zodoff-Shu ZC sequence, an m sequence, and a pseudo-noise PN sequence , discrete Fourier transform DFT sequence, Alltop sequence or Gold sequence.
  • FIG. 6 a schematic block diagram of a communication apparatus 600 according to an embodiment of the present application is shown.
  • the apparatus may be applied to the network device in the method embodiment of FIG. 3 provided in this application.
  • the communication apparatus 600 includes: a transceiving unit 610 and a processing unit 620.
  • the transceiving unit 610 is configured to receive, within a first time period, a first sequence sent by the terminal device, where the first sequence is determined by a first parameter ;
  • the transceiver unit 610 is further configured to, within a second time period, receive a second scrambled sequence sent by the terminal device, where the second scrambled sequence is a pair of the terminal device according to the first parameter.
  • the second sequence has been scrambled;
  • the processing unit 620 configured to descramble the scrambled second sequence according to the first parameter to obtain the second sequence
  • the transceiver unit 610 is further configured to, within the Nth time period, receive a scrambled Nth sequence sent by the terminal device, where the scrambled Nth sequence is a pair of the terminal device according to the N-1th parameter.
  • the Nth sequence has been scrambled, and the N-1th sequence is determined by the N-1th parameter, where N is an integer greater than 2;
  • the processing unit 620 is further configured to, according to the N-1th parameter, descramble the scrambled Nth sequence to obtain the Nth sequence.
  • the transceiver unit 610 is further configured to send indication information to the terminal device, where the indication information is used to instruct the terminal device to select the first sequence, the second sequence, the N-1th sequence and the Nth sequence.
  • the processing unit 620 is specifically configured to, according to the first parameter, generate a first descrambling sequence; and descramble the second scrambled sequence according to the first descrambling sequence, to obtain the second sequence.
  • the transceiver unit 610 is further configured to send a random access response message to the terminal device according to the first sequence, the second sequence and the Nth sequence.
  • the first sequence, the second sequence, the Nth sequence, and the first descrambling sequence are any one of the following sequences: a Zodoff-Shu ZC sequence, an m sequence, and a pseudo-noise PN sequence , discrete Fourier transform DFT sequence, Alltop sequence or Gold sequence.
  • FIG. 7 a schematic block diagram of a communication apparatus 700 according to an embodiment of the present application is shown.
  • the apparatus may be applied to the terminal device in the method embodiment of FIG. 4 provided in this application.
  • the communication device 700 includes: a transceiver unit 710 and a processing unit 720 .
  • the transceiver unit 710 is configured to send M sequences to the network device within the first time period, where the M sequences include the first sequence to the longest linear shift register M sequence, and the M sequences are respectively Determined by M parameters, the M parameters are in one-to-one correspondence with the M sequences, wherein M is an integer greater than or equal to 2;
  • the processing unit 720 is configured to perform scramble processing on the Nth sequence according to the M parameters to generate a scrambled Nth sequence, where N is equal to M+1;
  • the transceiver unit 710 is further configured to, within a second time period, send the scrambled Nth sequence to the network device.
  • the transceiver unit 710 is further configured to receive indication information sent by the network device; the processing unit 720 is further configured to, according to the indication information, select the M sequences and all the M sequences from the resource pool. the Nth sequence.
  • the processing unit 720 is specifically configured to: generate the Nth scrambling sequence according to the M parameters; perform scrambling processing on the Nth sequence according to the Nth scrambling sequence to generate the scrambled Nth sequence.
  • the transceiver unit 710 is further configured to receive a random access response message sent by the network device.
  • the M sequences, the Nth sequence, and the Nth scrambling sequence are any of the following sequences: Zodoff-Schuh ZC sequence, m sequence, pseudo-noise PN sequence, discrete Fourier transform DFT sequence, Alltop sequence or Gold sequence.
  • FIG. 8 a schematic block diagram of a communication apparatus 800 according to an embodiment of the present application is shown.
  • the apparatus may be applied to the network device in the method embodiment of FIG. 4 provided in this application.
  • the communication device 800 includes: a transceiver unit 810 and a processing unit 820 .
  • the transceiver unit 810 is configured to receive, within a first time period, M sequences sent by the terminal device, where the M sequences include the first sequence to the longest linear shift register M sequence, and the M sequences
  • the sequences are respectively determined by M parameters, and the M parameters are in one-to-one correspondence with the M sequences, wherein the M is an integer greater than or equal to 2;
  • the transceiver unit 810 is further configured to, within the second time period, receive a scrambled Nth sequence sent by the terminal device, where the scrambled Nth sequence is the terminal device according to the Mth parameter.
  • the processing unit 820 is configured to descramble the scrambled Nth sequence according to the M parameters to obtain the Nth sequence.
  • the transceiver unit 810 is further configured to send indication information to the terminal device, where the indication information is used to instruct the terminal device to select the M sequences and the Nth sequence from the resource pool.
  • the processing unit 820 is specifically configured to: generate the Nth descrambling sequence according to the M parameters; perform descrambling processing on the scrambled Nth sequence according to the Nth descrambling sequence, Obtain the Nth sequence.
  • the transceiver unit 810 is further configured to send a random access response message to the terminal device according to the M sequences and the Nth sequence.
  • the M sequences, the Nth sequence, and the Nth descrambling sequence are any one of the following sequences: Zodoff-Shu ZC sequence, m sequence, pseudo-noise PN sequence, discrete Fourier transform DFT sequence, Alltop sequence or Gold sequence.
  • An embodiment of the present application provides a communication device 900. As shown in FIG. 9, a schematic block diagram of a communication device 900 according to an embodiment of the present application is shown.
  • the device 900 includes: a processor 910 and a transceiver 920, the transceiver 920 is configured to receive computer codes or instructions and transmit them to the processor 910, and the processor 910 executes the computer codes or instructions, as described herein A method in any possible implementation manner in the application embodiments.
  • the above-mentioned processor 910 may be an integrated circuit chip with signal processing capability. In the implementation process, each step of the above method embodiments may be completed by a hardware integrated logic circuit in a processor or an instruction in the form of software.
  • the above-mentioned processor may be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (field programmable gate array, FPGA), or other possible solutions. Programming logic devices, discrete gate or transistor logic devices, discrete hardware components.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • Programming logic devices, discrete gate or transistor logic devices, discrete hardware components The methods, steps, and logic block diagrams disclosed in the embodiments of this application can be implemented or executed.
  • a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied as executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor.
  • the software modules may be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other storage media mature in the art.
  • the storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.
  • the embodiment of the present application provides a communication system 1000, including the terminal device 1010 and the network device 1020 in the method for sending a sequence provided by the embodiment of the present application.
  • a schematic block diagram of a communication system 1000 according to an embodiment of the present application is shown.
  • the embodiments of the present application further provide a computer-readable storage medium, on which a computer program for implementing the methods in the foregoing method embodiments is stored.
  • a computer program for implementing the methods in the foregoing method embodiments is stored.
  • the computer program runs on a computer, the computer can implement the methods in the above method embodiments.
  • the term "and/or” in this application is only an association relationship to describe associated objects, which means that there can be three kinds of relationships, for example, A and/or B, which can mean that A exists alone, and A and B exist at the same time. , there are three cases of B alone.
  • the character "/" in this document generally indicates that the contextual object is an "or” relationship; the term “at least one” in this application can mean “one” and "two or more", for example, A At least one of , B, and C can mean: A alone exists, B exists alone, C exists alone, A and B exist simultaneously, A and C exist simultaneously, C and B exist simultaneously, and A and B and C exist simultaneously. seven situations.
  • the disclosed system, apparatus and method may be implemented in other manners.
  • the apparatus embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the functions, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium.
  • the technical solution of the present application can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution, and the computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program codes .

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请提供了一种序列发送的方法和装置，能够降低序列冲突的概率，该方法包括：在第一时间段内，终端设备向网络设备发送第一序列，所述第一序列由第一参数确定；所述终端设备根据所述第一参数，对第二序列进行加扰处理，生成加扰的第二序列；在第二时间段内，所述终端设备向所述网络设备发送所述加扰的第二序列；所述终端设备根据第N-1参数，对第N序列进行加扰处理，生成加扰的第N序列，第N-1序列由所述第N-1参数确定，其中，N为大于2的整数；在第N时间段内，所述终端设备向所述网络设备发送所述加扰的第N序列。

Description

序列发送的方法和装置 技术领域
本申请涉及通信领域，并且更具体地，涉及一种序列发送的方法和装置。
背景技术
在传统的蜂窝网移动通信系统中，例如长期演进系统(long term evolution，LTE)、新无线(new radio，NR)中，通常存在多种类型的终端，例如增强型移动宽带(enhanced mobile broad band，eMBB)终端、极高可靠极低时延通信(ultra-reliable low latency communication，URLLC)终端、大规模机器类通信(massive machine type communication，mMTC)终端，分别对应eMBB、URLLC、mMTC三种场景。
mMTC场景的典型特征是，终端的数量庞大、数据包小、包到达间隔大，例如每平方公里有几万到几百万个终端，每个终端的数据包到达间隔为几小时甚至几天，每个包的大小为几个到几十个字节。终端设备在进行上行传输过程中，需要向基站发送随机接入前导(preamble)，基站检测到preamble后，向终端设备发送随机接入响应(random access response，RAR)消息，终端设备根据RAR消息发送上行数据。
preamble的本质是序列，当多于一个终端在相同的时频资源上发送了相同的序列，即发送序列冲突时，基站对终端的检测性能会下降，例如基站检测不到该序列，或者检测到该序列但是无法判断有几个终端发送了该序列，进而会影响上行数据的发送和接收。当可用的序列数量固定时，终端数量越多，发送序列冲突的可能性也越大。
发明内容
本申请提供了一种序列发送的方法和装置，能够降低序列冲突的概率。
第一方面，提供一种序列发送的方法，应用于终端设备的随机接入，该包括：在第一时间段内，所述终端设备向网络设备发送第一序列，所述第一序列由第一参数确定；所述终端设备根据所述第一参数，对第二序列进行加扰处理，生成加扰的第二序列；在第二时间段内，所述终端设备向所述网络设备发送所述加扰的第二序列；所述终端设备根据第N-1参数，对第N序列进行加扰处理，生成加扰的第N序列，第N-1序列由所述第N-1参数确定，其中，N为大于2的整数；在第N时间段内，所述终端设备向所述网络设备发送所述加扰的第N序列。
基于上述技术方案，终端设备可以在不同时间段分别向网络设备发送至少3个序列，包括第一序列、第二序列以及第N序列，第一序列、第二序列以及第N序列是终端设备从资源池中随机选择的，若资源池中可用序列的总数为Q，则可用的序列组合数至少为Q 3，从而提高了可用序列的总数量，能够降低序列冲突的概率。
在一种可能的实现方式中，所述方法还包括：所述终端设备接收所述网络设备发送的指示信息；所述终端设备根据所述指示信息，从资源池中选择所述第一序列、所述第二序 列、所述第N-1序列和所述第N序列。
在一种可能的实现方式中，所述终端设备根据所述第一参数，对第二序列进行加扰处理，生成加扰的第二序列，包括：所述终端设备根据所述第一参数，生成第一加扰序列；所述终端设备根据所述第一加扰序列，对所述第二序列进行加扰处理，生成所述加扰的第二序列。
在一种可能的实现方式中，所述方法还包括：所述终端设备接收所述网络设备发送的随机接入响应消息。
在一种可能的实现方式中，所述第一序列、所述第二序列、所述第N序列以及所述第一加扰序列为以下任意一种序列：佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
第二方面，提供一种序列发送的方法，应用于终端设备的随机接入，该方法包括：在第一时间段内，网络设备接收所述终端设备发送的第一序列，所述第一序列由第一参数确定；在第二时间段内，所述网络设备接收所述终端设备发送的加扰的第二序列，所述加扰的第二序列是所述终端设备根据所述第一参数对第二序列进行过加扰处理的序列；所述网络设备根据所述第一参数，对所述加扰的第二序列进行解扰，获得所述第二序列；在第N时间段内，所述网络设备接收所述终端设备发送的加扰的第N序列，所述加扰的第N序列是所述终端设备根据第N-1参数对第N序列进行过加扰处理的序列，第N-1序列由所述第N-1参数确定，其中，N为大于2的整数；所述网络设备根据所述第N-1参数，对所述加扰的第N序列进行解扰，获得所述第N序列。
在一种可能的实现方式中，所述方法还包括：所述网络设备向所述终端设备发送指示信息，所述指示信息用于指示所述终端设备从资源池中选择所述第一序列、所述第二序列、所述第N-1序列和所述第N序列。
在一种可能的实现方式中，所述网络设备根据所述第一参数，对所述加扰的第二序列进行解扰，获得所述第二序列，包括：所述网络设备根据所述第一参数，生成第一解扰序列；所述网络设备根据所述第一解扰序列，对所述加扰的第二序列进行解扰，获得所述第二序列。
在一种可能的实现方式中，所述方法还包括：所述网络设备根据所述第一序列、所述第二序列和所述第N序列，向所述终端设备发送随机接入响应消息。
在一种可能的实现方式中，所述第一序列、所述第二序列、所述第N序列以及所述第一解扰序列为以下任意一种序列：佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
第三方面，提供一种序列发送的方法，应用于终端设备的随机接入，该方法包括：在第一时间段内，所述终端设备向网络设备发送M个序列，所述M个序列中包括第一序列至第最长线性移位寄存器M序列，所述M个序列分别由M个参数确定，所述M个参数与所述M个序列一一对应，其中，M为大于或等于2的整数；所述终端设备根据所述M个参数，对第N序列进行加扰处理，生成加扰的第N序列，其中，N等于M+1；在第二时间段内，所述终端设备向所述网络设备发送所述加扰的第N序列。
基于上述技术方案，终端设备可以在第一时间段向网络设备发送至少两个序列，在第二时间段向网络设备发送一个序列，相同时间段发送的序列是不同的，不同时间段发送的 序列可以是相同的也可以是不同的，若资源池中可用序列的总数为Q，则可用的序列组合数至少为Q 2(Q-1)，从而提高了可用序列的总数量，能够降低序列冲突的概率。
在一种可能的实现方式中，所述方法还包括：所述终端设备接收所述网络设备发送的指示信息；所述终端设备根据所述指示信息，从资源池中选择所述M个序列和所述第N序列。
在一种可能的实现方式中，所述终端设备根据所述M个参数，对第N序列进行加扰处理，生成加扰的第N序列，包括：所述终端设备根据所述M个参数，生成第N加扰序列；所述终端设备根据所述第N加扰序列，对所述第N序列进行加扰处理，生成所述加扰的第N序列。
在一种可能的实现方式中，所述方法还包括：所述终端设备接收所述网络设备发送的随机接入响应消息。
在一种可能的实现方式中，所述M个序列、所述第N序列以及所述第二加扰序列为以下任意一种序列：佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
第四方面，提供一种序列发送的方法，应用于终端设备的随机接入，该方法包括：在第一时间段内，网络设备接收所述终端设备发送的M个序列，所述M个序列中包括第一序列至第最长线性移位寄存器M序列，所述M个序列分别由M个参数确定，所述M个参数与所述M个序列一一对应，其中，所述M为大于或等于2的整数；在第二时间段内，所述网络设备接收所述终端设备发送的加扰的第N序列，所述加扰的第N序列是所述终端设备根据所述第M个参数对第N序列进行过加扰处理的序列，其中，N等于M+1；所述网络设备根据所述M个参数，对所述加扰的第N序列进行解扰，获得所述第N序列。
在一种可能的实现方式中，所述方法还包括：所述网络设备向所述终端设备发送指示信息，所述指示信息用于指示所述终端设备从资源池中选择所述M个序列和所述第N序列。
在一种可能的实现方式中，所述网络设备根据所述M个参数，对所述加扰的第N序列进行解扰，获得所述第N序列，包括：所述网络设备根据所述M个参数，生成第N解扰序列；所述网络设备根据所述第N解扰序列，对所述加扰的第N序列进行解扰处理，获得所述第N序列。
在一种可能的实现方式中，所述方法还包括：所述网络设备根据所述M个序列和所述第N序列，向所述终端设备发送随机接入响应消息。
在一种可能的实现方式中，所述M个序列、所述第N序列以及所述第二解扰序列为以下任意一种序列：佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
第五方面，提供了一种通信装置，包括用于实现如第一方面或第一方面任意可能的实现方式中的方法的功能的单元。
第六方面，提供了一种通信装置，包括用于实现如第二方面或第二方面任意可能的实现方式中的方法的功能的单元。
第七方面，提供了一种通信装置，包括用于实现如第三方面或第三方面任意可能的实现方式中的方法的功能的单元。
第八方面，提供了一种通信装置，包括用于实现如第四方面或第四方面任意可能的实现方式中的方法的功能的单元。
第九方面，提供了一种通信设备，包括：处理器和收发器，所述收发器用于接收计算机代码或指令，并传输至所述处理器，所述处理器运行所述计算机代码或指令，如第一方面或第一方面任意可能的实现方式中的方法。
第十方面，提供了一种通信设备，包括：处理器和收发器，所述收发器用于接收计算机代码或指令，并传输至所述处理器，所述处理器运行所述计算机代码或指令，如第二方面或第二方面任意可能的实现方式中的方法。
第十一方面，提供了一种通信设备，包括：处理器和收发器，所述收发器用于接收计算机代码或指令，并传输至所述处理器，所述处理器运行所述计算机代码或指令，如第三方面或第三方面任意可能的实现方式中的方法。
第十二方面，提供了一种通信设备，包括：处理器和收发器，所述收发器用于接收计算机代码或指令，并传输至所述处理器，所述处理器运行所述计算机代码或指令，如第四方面或第四方面任意可能的实现方式中的方法。
第十三方面，提供了一种通信系统，包括第一方面、第二方面、第三方面或第四方面所述方法中的终端设备和网络设备。
第十四方面，提供了一种计算机可读存储介质，所述计算机可读介质存储有计算机程序；所述计算机程序在计算机上运行时，使得计算机执行第一方面至第四方面或第一方面至第四方面任意可能的实现方式中的方法。
附图说明
图1为一种基于2-stage的preamble发送方案示意图。
图2为一种可应用的通信系统示意图。
图3为本申请实施例的一种序列发送的方法的流程交互图。
图4为本申请实施例的另一种序列发送的方法的流程交互图。
图5为本申请实施例的一种通信装置的示意性框图。
图6为本申请实施例的另一种通信装置的示意性框图。
图7为本申请实施例的另一种通信装置的示意性框图。
图8为本申请实施例的另一种通信装置的示意性框图。
图9为本申请实施例的一种通信设备的示意性框图。
图10为本申请实施例的一种通信系统的示意性框图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
本申请实施例可以应用于各种通信系统，例如侧行通信系统(sidelink communication)、车联通信(vehicle to everything，V2X)系统、无线局域网系统(wireless local area network，WLAN)、窄带物联网系统(narrow band-internet of things，NB-IoT)、全球移动通信系统(global system for mobile communications，GSM)、增强型数据速率GSM演进系统(enhanced data rate for gsm evolution，EDGE)、宽带码分多址系统(wideband code division  multiple access，WCDMA)、码分多址2000系统(code division multiple access，CDMA2000)、时分同步码分多址系统(time division-synchronization code division multiple access，TD-SCDMA)，长期演进系统(long term evolution，LTE)、卫星通信、第五代(5th generation，5G)系统或者将来出现的新的通信系统等。
本申请实施例中所涉及到的终端设备可以为包含无线收发功能、且可以为用户提供通讯服务的设备。具体地，终端设备可以为V2X系统中的设备、设备对设备(device to device，D2D)系统中的设备、机器类型通信(machine type communication，MTC)系统中的设备等。可以包括各种具有无线通信功能的手持设备、车载设备、可穿戴设备、计算设备或连接到无线调制解调器的其它处理设备。终端可以是移动台(mobile station，MS)、用户单元(subscriber unit)、用户设备(user equipment,UE)、蜂窝电话(cellular phone)、无绳电话、会话启动协议(session initiation protocol，SIP)电话、无线本地环路(wireless local loop，WLL)站、智能电话(smart phone)、无线数据卡、个人数字助理(personal digital assistant，PDA)电脑、平板型电脑、无线调制解调器(modem)、手持设备(handset)、膝上型电脑(laptop computer)、机器类型通信(machine type communication，MTC)终端等。
传统的蜂窝网移动通信系统中，例如LTE、新无线(new radio，NR)中，通常存在多种类型的终端，例如增强型移动宽带(enhanced mobile broad band，eMBB)终端、极高可靠极低时延通信(ultra-reliable low latency communication，URLLC)终端、大规模机器类通信(massive machine type communication，mMTC)终端，分别对应eMBB、URLLC、mMTC三种场景。
mMTC场景的典型特征是，终端的数量庞大、数据包小、包到达间隔大，例如每平方公里有几万到几百万个终端，每个终端的数据包到达间隔为几小时甚至几天，每个包的大小为几个到几十个字节。这种场景中，不适合采用传统的基于调度的上行传输方法，这是因为传统的基于调度的上行传输中，终端首先需要通过随机接入(random access，RA)进入连接状态，向基站发送调度请求(scheduling request，SR)，然后监听基站发送的上行授权，并根据上行授权中的调度信息，向基站发送数据包，这一过程中，终端将消耗大量的时延和功耗用于建立连接、发送SR、监听调度信息等，实际用于数据发送的时间很短，导致极低的数据传输效率。这种情况下，可以考虑更高效的上行小包传输方法，例如上行免授权传输(grant-free，GF)、数据早传(early data transmission，EDT)、两步随机接入(2-step random access channel，2-step RACH)等。
上行免授权传输是指终端在基站预配置的物理上行共享信道(physical uplink shared channel，PUSCH)资源上向基站发送上行数据包，而不需要在发送数据包之前，监听基站的动态授权。PUSCH中同时包含了导频信号，如解调参考信号(De Modulation Reference Signal，DMRS)，导频信号用于基站对终端是否发送数据进行检测，例如，基站检测到参考信号时，认为有终端使用了该参考信号发送了数据，基站进而可以根据检测到的参考信号对上行共享信道进行估计，并解调终端数据，因此，对于上行免授权传输而言，参考信号的发送起到重要的作用。
数据早传是一种在4步随机接入过程中发送上行数据的方法。当终端有数据需要发送时，向基站发送Msg1，即在物理随机接入信道(physical random access channel，PRACH) 中发送随机接入前导(preamble)；基站检测到preamble后，向终端发送Msg2，即随机接入响应(random access response，RAR)消息，RAR中携带时间提前量(timing advance，TA)以及用于调度Msg3的上行授权；终端监听到RAR后，根据其中的上行授权，发送Msg3，Msg3中携带上行数据；基站接收到Msg3后，向终端发送竞争解决消息。EDT与传统的4步随机接入的区别在于，EDT中的Msg3可以携带上行数据，而传统的4步随机接入过程中，终端不能向基站发送上行数据。从EDT的过程可以看出，preamble的发送和检测至关重要，因为基站只有在检测到preamble之后，才能针对该preamble发送RAR，终端进而才能发送承载了数据的Msg3。
两步随机接入是一种对数据早传进一步简化的上行小包传输方法，2-step RACH包含两步，即MsgA和MsgB。当终端有数据需要发送时，向基站发送MsgA，MsgA由两部分组成，即PRACH和PUSCH，PRACH承载了preamble，PUSCH中承载了上行数据，PUSCH中同时还包含DMRS，用于基站进行信道估计；基站检测到MsgA之后(MsgA的检测即preamble的检测)，如果也正确接收了其中的数据，则基站向终端发送MsgB，其中包含竞争解决消息，如果基站检测到MsgA，但是没能正确接收其中的上行数据时，基站可以向终端发送RAR，调度终端重传上行数据。同样，preamble的发送和检测对2-step RACH也很重要。
不管是DMRS还是preamble，本质都是序列，当多于一个终端在相同的时频资源上发送了相同的序列，即发送序列冲突时，基站对终端的检测性能会下降，例如基站检测不到该序列，或者检测到该序列但是无法判断有几个终端发送了该序列，进而会影响上行数据的发送和接收。当可用的序列数量固定时，终端数量越多，发送序列冲突的可能性也越大。
随机接入过程中的preamble通常采用佐道夫-舒(Zadoff-chu，ZC)序列：
x u,v(n)＝x u((n+C v)mod L RA)
Figure PCTCN2020129086-appb-000001
其中，L RA为质数，n为序列长度，u为根序列索引，v为循环移位索引，x u(i)为根序列索引确定的根序列，C v为循环移位值，C v＝Ncs*v，其中，N cs为循环移位间隔，N cs大于或等于零。终端设备根据基站配置的根序列索引确定根序列，再根据不同的循环移位值确定不同的preamble序列。
NR与LTE相同，每个小区最多支持64个preamble序列。每个根序列能产生的preamble序列的数量由循环移位间隔确定，当一个根序列产生的preamble序列数量不足64个时，终端会继续根据其他根序列产生preamble序列，直到preamble数量达到64个。由此可见，所能确定的preamble的数量Q取决于两个因素，一个是根序列数量n，另一个是每个根序列所能产生的preamble的数量K，即能产生的preamble序列总数Q等于n*K。
考虑到不同根序列所产生的preamble序列之间是不正交的，通常情况下会避免同一个小区使用多个根序列的情形。这种情况下，每个小区可用的preamble序列总数是有限的，例如LTE和NR中的64。这种情况下，由于终端进行4步随机接入或两步随机接入或数据早传时所发送的preamble通常是从所有可用的preamble中随机选择的，当终端数量很多时，出现多于一个终端选择同一个preamble的概率会较大，从而可能导致基站检测失败。
目前，提出了一种基于两步(2-stage)的preamble发送方案，可以将可用的preamble数量提升至Q 2。如图1所示，出示了基于2-stage的preamble发送方案示意图，具体方法为：终端设备在两个时段发送两个序列preamble-1和preamble-2，例如4步随机接入或EDT中的Msg1包含了两个PRACH发送时机，其中每个PRACH时机发送一个preamble序列。基站通过检测两个时段的preamble，如果基站在两个时段分别检测到preamble-1和preamble-2，则基站判断有终端设备发送了preamble-1和preamble-2的组合。
preamble-1和preamble-2的选择不能是任意的，否则基站侧会出现虚警。例如假设终端设备1从preamble资源池中随机选择的preamble-1和preamble-2的索引(编号)分别为x1和y1，终端设备2从资源池中随机选择的两个preamble的索引(编号)分别为x2和y2，基站设备在时段1检测到索引为x1和x2的preamble，在时段2检测到索引为y1和y2的preamble，则基站无法判断是否有终端设备选择了索引分别为x1和y2或x2和y1的preamble组合。为避免出现虚警，提出如下确定preamble-1和preamble-2的方法，具体的步骤包括：
(1)终端从preamble资源池中随机选择preamble-1；
(2)终端从preamble资源池中随机选择preamble-x，然后根据preamble-1在资源池中的索引(index)计算一个S序列，用得到的S序列加扰(这里可以是对应元素相乘)preamble-x得到preamble-2；
(3)终端在时段1发送preamble-1，在时段2发送preamble-2；
基站在时段1检测到preamble-1之后，根据同样的规则确定S序列，用得到的S序列解扰时段2接收到的信号，然后再从中检测preamble-x。
由于preamble-2的生成与preamble-1相关，可以避免虚警的问题。例如，假设终端设备1在时段1选择的preamble-1的索引为x1，在时段2选择的preamble-x的索引为y1，终端设备根据x1确定的S序列为s1，终端设备根据s1和索引为y1的preamble确定preamble-2，同时终端设备2在时段1选择的preamble-1的索引为x2，在时段2选择的preamble-x的索引为y2，终端设备根据x2确定的S序列为s2，终端根据s2和索引为y2的preamble确定preamble-2。基站侧在时段1检测到索引为x1和x2的preamble，然后根据s1在时段2检测出索引为y1的preamble-x，根据s2在时段2检测出索引为y2的preamble-2，这样，基站不会判断同时有终端3在时段1和时段2分别选择了索引为x1和索引为y2的preamble组合，因为基站没有根据s1在时段2检测出索引为y2的preamble。同时，由于用于生成preamble-2的preamble-x也是终端从序列资源池中随机选择的，所以该方法可以将总的可用序列数从Q个扩展到Q 2个。
通过两阶段PRACH，虽然可以将可用的总序列数从Q扩展到Q 2，但是当Q较小时,例如小区半径较大，子载波间隔较大时，单小区可用的preamble数量会很少，preamble序列的冲突概率仍会较大。
为此，本申请实施例提出了一种序列发送的方法，在给定序列资源池的情况下，可以增加可用序列的数量，能够降低序列冲突的概率。
本申请提供的技术方案主要应用于5G NR系统，也可以应用于其他通信系统，只要该通信系统中存在实体向另一个实体发送配置信息，并向另一实体发送数据，或接收另一实体发送的数据；另一个实体接收实体发送的配置信息，并根据配置信息向实体发送数据， 或接收实体发送的数据。
如图2所示，出示了一种可应用的通信系统示意图。当配置信息的发送实体为网络实体，配置信息的接收实体为终端设备，例如UE时，网络设备和UE1～UE6组成一个通信系统。在该通信系统中，UE1～UE6可以发送上行数据给网络设备，网络设备需要接收UE1～UE6发送的上行数据。同时，网络设备可以向UE1～UE6发送配置信息。
此外，UE4～UE6也可以组成一个通信系统，此时，配置信息的发送实体和接收实体可以都是终端设备，例如车联网系统中，终端设备1向终端设备2发送配置信息，并且接收终端设备2发送的数据；而终端设备2接收终端设备1发送的配置信息，并向终端设备1发送数据。
对于传输场景，本申请可用于随机接入，包括基于2步的随机接入2-step RACH、基于4步的随机接入4-step RACH、基于4步的数据早传EDT、上行免授权传输GF、基于预配置上行资源的传输、基于配置的授权的传输。
本申请可应用于处于连接状态或激活状态(active)的终端设备、也可以应用于处于非连接状态(inactive)或空闲态(idle)的终端设备。
本申请可以用于随机接入过程中的随机接入前导preamble设计，也可以用于各种参考信号设计，例如DMRS序列、探测参考信号(sounding reference signal，SRS)、信道状态信息参考信号(channel state information reference signal，CSI-RS)、相位跟踪参考信号(phase tracking reference signal，PTRS)等。
如图3所示，出示了本申请实施例提出的一种序列发送的方法的流程交互图。该方法将两阶段的序列发送扩展到多阶段，实现总可用序列数量的进一步增加。
310，终端设备从资源池中选择第一序列，在第一时间段内，终端设备向网络设备发送该第一序列，该第一序列由第一参数确定。该网络设备为用于收发信号的实体，例如基站。
可选的，在所述终端设备向网络设备发送第一序列之前，终端设备接收到网络设备发送的指示信息，终端设备根据网络设备发送的指示信息从资源池中选择该第一序列；可选的，该第一序列也可以是终端设备随机选择的，或者，根据其他规则选择的。
第一序列可以是ZC序列，也可以是以下序列中的任意一种序列，也可以为其他序列。
(1)最长线性移位寄存器m序列：长度为2 m-1(m>1)的最长线性移位寄存器m序列可以定义为
Figure PCTCN2020129086-appb-000002
其中，
Figure PCTCN2020129086-appb-000003
一种举例为，
Figure PCTCN2020129086-appb-000004
其中，x(0)＝0,x(1)＝0,x(2)＝0,x(3)＝0,x(4)＝1。
(2)伪噪声(pseudo noise，PN)序列：5G NR系统应用的PN序列由长为31的古德Gold序列产生，
c(n)＝(x 1(n+N C)+x 2(n+N C))mod 2
x 1(n+31)＝(x 1(n+3)+x 1(n))mod 2
x 2(n+31)＝(x 2(n+3)+x 2(n+2)+x 2(n+1)+x 2(n))mod 2
其中，c(n)为产生的PN序列，长度为M PN，n＝0,1,...,M PN-1，N C＝160，第一个m 序列的x 1(n)初始值为x 1(0)＝1,x 1(n)＝0,n＝1,2,...,30，第二个m序列x 2(n)的初始值为
Figure PCTCN2020129086-appb-000005
(3)离散傅里叶变换(discrete fourier transform，DFT)序列：DFT序列可以看做DFT矩阵中的一行或一列，DFT矩阵的元素定义为x pq＝ω -pq，ω＝e -2πi/N，N为序列长度，i为虚数单位，i 2＝-1。
(4)爱尔特Alltop序列：Alltop序列定义为c(γ,ω)＝g(γ,ω)，例如
Figure PCTCN2020129086-appb-000006
0≤n≤L-1，0≤ω≤L-1。
(5)古德Gold序列：Gold序列是两个最长线性移位寄存器m序列的模二和。
320，在第一时间段内，网络设备接收终端设备发送的第一序列。
330，终端设备从资源池中选择第二序列，并根据确定第一序列的第一参数，对第二序列进行加扰处理，生成加扰的第二序列。该第二序列可以是终端设备根据网络设备发送的指示信息选择的，也可以是终端设备随机选择的，或者，根据其他规则选择的。该第二序列可以是ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列中的任意一种序列，也可以为其他序列。
具体而言，可选的，终端设备根据第一参数，生成第一加扰序列；终端设备根据第一加扰序列，对第二序列进行加扰处理，生成加扰的第二序列。第一加扰序列可以是ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列中的任意一种序列，也可以为其他序列。
例如，如果终端设备从资源池中选择的第一序列为ZC序列，第一参数可以为根序列索引、循环移位索引、循环移位间隔或循环移位值。如果第一序列为m序列或Gold序列，第一参数可以为循环移位值。如果第一序列是Alltop序列，第一参数可以为γ或ω。
终端设备根据第一参数x，生成第一加扰序列S的方法包括：根据第一参数x生成第一加扰序列S 1的参数信息y＝f(x)，f表示函数，例如y＝x。x可以为上述参数信息，例如，当第一加扰序列为ZC序列，y可以是根序列索引、循环移位索引、循环移位间隔或循环移位值中的任一参数；当第一加扰序列是PN序列时，y可以是循环移位信息，例如循环移位索引、循环移位间隔或循环移位值中的任一参数信息；当第一加扰序列是Alltop序列，y可以是γ或ω；当第一加扰序列是m序列或Gold序列时，y可以是循环移位信息，例如循环移位索引、循环移位间隔或循环移位值中的任一参数信息。
终端设备根据第一加扰序列，对第二序列进行加扰处理，具体的实现方法包括：将第一加扰序列与第二序列的对应元素的相乘，生成加扰的第二序列。
340，在第二时间段内，终端设备向网络设备发送加扰的第二序列。
350，网络设备接收终端设备发送的加扰的第二序列。
360，网络设备根据第一参数，对加扰的第二序列进行解扰，获得第二序列。
具体而言，网络设备根据终端设备发送的第一序列确定用于确定第一序列的第一参数，根据第一参数生成第一解扰序列，第一解扰序列与第一加扰序列是相同的序列，该网络设备根据该第一解扰序列对加扰的第二序列进行解扰，获得不被加扰的第二序列。
370，终端设备从资源池中选择第N序列，并根据用于确定第N-1序列的N-1参数， 对第N序列进行加扰处理，生成加扰的第N序列，其中，N为大于2的整数，即终端设备在至少3个时间段分别向网络设备发送至少3个序列。该第N序列可以是终端设备根据网络设备发送的指示信息选择的，也可以是终端设备随机选择的，或者，根据其他规则选择的。该第N序列可以是ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列中的任意一种序列，也可以为其他序列。
具体而言，可选的，终端设备根据第N-1参数，生成第N-1加扰序列；终端设备根据第N-1加扰序列，对第N序列进行加扰处理，生成加扰的第N序列。第N-1加扰序列可以是ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列中的任意一种序列，也可以为其他序列。
380，在第N时间段内，终端设备向网络设备发送加扰的第N序列。
390，网络设备接收终端设备发送的加扰的第N序列。
391，网络设备根据用于确定第N-1序列的第N-1参数，对加扰的第N序列进行解扰，获得第N序列。
具体而言，网络设备根据终端设备发送的第N-1序列确定用于确定第N-1序列的第N-1参数，根据第N-1参数生成第N-1解扰序列，第N-1解扰序列与第N-1加扰序列是相同的序列，该网络设备根据该第N-1解扰序列对加扰的第N序列进行解扰，获得不被加扰的第N序列。
网络设备接收并获取到该终端设备发送的第一序列、第二序列以及第N序列的组合后，进行针对该组合情况执行后续的操作。可选的，网络设备向终端设备发送随机接入响应RAR消息，终端设备接收网络设备发送的RAR消息，并根据RAR消息中指示的时频资源向网络设备发送数据。
应理解，不同时间段可以是不同的时间单元，例如不同的符号、时隙、子帧、无线帧等，不同的时间段在时间上可以是连续的、也可以是不连续的，例如每个阶段是有一个正交频分复用技术(orthogonal frequency division multiplexing，OFDM)符号，两个时间段可以是相邻的两个连续的OFDM符号，也可以是不相邻的两个OFDM符号。
应理解，第二序列和第N序列可以是终端设备在第一时间段或第一时间段之前选择的，也可以是分别在第二时间段、第N时间段内选择的，本申请对此不做任何限定。
本申请实施例提供的技术方案中，终端设备可以在不同时间段分别向网络设备发送至少3个序列，包括第一序列、第二序列以及第N序列，第一序列、第二序列以及第N序列是终端设备从资源池中随机选择的，若资源池中可用序列的总数为Q，则可用的序列组合数至少为Q 3，从而提高了可用序列的总数量，能够降低序列冲突的概率。
以3个时间段为例，假设网络设备为终端设备分配了三个时间单元，用于终端设备发送随机接入前导序列。假设序列资源池中包含的Q个序列为ZC序列x u,v(n),0≤n≤N-1，n为序列长度，u为根序列索引，v为循环移位索引；使用的加扰序列为m序列，c w(n)＝c 0(n+w)，w为循环移位值，c 0(n+w)为长度为2 m-1的m序列的周期扩展，其中，m＝log 2(N+1)。具体的序列发送过程如下：
步骤一：终端设备从preamble资源池中随机选择preamble-1，假设所选择的序列的循环移位索引为2，则该序列可以表示为x u,2(n)，终端设备在第一时间单元向网络设备发送序列o 1(n)＝x u,2(n)；
步骤二：网络设备接收终端设备发送的序列o 1(n)；
步骤三：终端设备从preamble资源池中随机选择preamble-2，假设所选择的序列的循环移位为30，则该序列可以表示为x u,30(n)，终端设备将步骤一中所选择的preamble-1的循环移位索引值2作为m序列的循环移位值，生成第一加扰序列s 1(n)＝c 2(n)，终端设备根据第一加扰序列s 1(n)和x u,30(n)，生成序列o 2(n)＝x u,30(n)*c 2(n)，终端设备在第二时间单元内向网络设备发送o 2(n)；
步骤四：网络设备接收终端设备发送的序列o 2(n)，并根据在第一时间单元终端设备发送的x u,2(n)中的循环移位索引值，生成第一解扰序列(第一加扰序列)s 1(n)＝c 2(n)，该网络设备根据该第一解扰序列，对终端设备发送的o 2(n)进行解扰，获得x u,30(n)；
步骤五：终端设备从preamble资源池中随机选择preamble-3，假设所选择的序列的循环移位为4，则该序列可以表示为x u,4(n)，终端设备将步骤三中所选择的preamble-2的循环移位索引值30作为m序列的循环移位值，生成第二加扰序列s 2(n)＝c 30(n)，终端设备根据第二加扰序列s 2(n)和x u,4(n)生成序列o 3(n)＝x u,4(n)*c 30(n)，终端设备在第三时间单元内向网络设备发送o 3(n)；
步骤六：网络设备接收终端设备发送的序列o 3(n)，并根据在第二时间单元终端设备发送的x u,30(n)中的循环移位索引值，生成第二解扰序列(第二加扰序列)s 2(n)＝c 30(n)，该网络设备根据该第二解扰序列，对终端设备发送的o 3(n)进行解扰，获得x u,4(n)。
以下给出加扰序列为Alltop序列的序列发送实例。以3个时间段为例，假设网络设备为终端设备分配了三个时间单元，用于终端设备发送随机接入前导序列。假设序列资源池中包含的M个序列为ZC序列x u,v(n),0≤n≤N-1，n为序列长度，u为根序列索引，v为循环移位索引；使用的加扰序列为Alltop序列c(γ,ω)＝g(γ,ω)，例如
Figure PCTCN2020129086-appb-000007
0≤n≤L-1，0≤ω≤L-1。具体的序列发送过程如下：
步骤一：终端设备从preamble资源池中随机选择preamble-1，假设所选择的序列的循环移位索引为2，则该序列可以表示为x u,2(n)，终端设备在第一时间单元发送序列o 1(n)＝x u,2(n)；
步骤二：网络设备接收终端设备发送的序列o 1(n)；
步骤三：终端设备从preamble资源池中随机选择preamble-2，假设所选择的序列的循环移位为30，则该序列可以表示为x u,30(n)，终端设备根据步骤一中所选择的preamble-1的根序列索引和/或循环移位索引值确定Alltop序列的ω、γ，例如确定ω＝2，γ＝u，生成第一加扰序列s 1(n)＝g u,2(n)，终端设备根据根据第一加扰序列s 1(n)和x u,30(n)，生成序列o 2(n)＝x u,30(n)*g u,2(n)，终端设备在第二时间单元内向网络设备发送o 2(n)；
步骤四:网络设备接收终端设备发送的序列o 2(n)，并根据在第一时间单元终端设备发送的x u,2(n)中的根序列索引和/或循环移位索引值，生成第一解扰序列(第一加扰序列)s 1(n)＝g u,2(n)，该网络设备根据该第一解扰序列，对终端设备发送的o 2(n)进行解扰，获得x u,30(n)；
步骤五：终端设备从preamble资源池中随机选择preamble-3，假设所选择的序列的循环移位为4，则该序列可以表示为x u,4(n)，终端设备将步骤三中所选择的preamble-2的根序列索引和/或循环移位索引值确定Alltop序列的ω、γ，例如确定ω＝30，γ＝u，生成 第二加扰序列s 2(n)＝g u,30(n)，终端设备根据第二加扰序列s 2(n)和x u,4(n)生成序列o 3(n)＝x u,4(n)*g u,30(n)，终端设备在第三时间单元内向网络设备发送o 3(n)；
步骤六：网络设备接收终端设备发送的序列o 3(n)，并根据在第二时间单元终端设备发送的x u,30(n)中的根序列索引和/或循环移位索引值，生成第二解扰序列(第二加扰序列)s 2(n)＝g u,30(n)，该网络设备根据该第二解扰序列，对终端设备发送的o 3(n)进行解扰，获得x u,4(n)。
网络设备根据在三个时间单元上的检测情况，可以判断出有终端设备发送了preamble-1、preamble-2和preamble-3的组合，进行针对该组合情况执行后续操作，例如发送RAR等。
应理解，网络设备为终端设备分配的发送序列的时间段越多，终端设备发送给网络设备的序列的数量越多，可用的序列组合数就越多。
如图4所示，出示了本申请实施例提出的另一种序列发送的方法的流程交互图。该方法也可以实现总可用序列数量的增加。
410，终端设备从资源池中选择M个序列，M个序列中包括第一序列至第最长线性移位寄存器M序列，M个序列分别由M个参数确定，M个参数与M个序列一一对应，其中，M为大于或等于2的整数；在第一时间段内，终端设备向网络设备发送该M个序列。
可选的，在所述终端设备向网络设备发送M个序列之前，终端设备接收到网络设备发送的指示信息，终端设备根据网络设备发送的指示信息从资源池中选择该M个序列；可选的，该M个序列也可以是终端设备随机选择的，或者，根据其他规则选择的。
其中，M个序列为同一类型的序列，序列的类型可以是ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列中的任意一种序列，也可以为其他序列。
420，在第一时间段内，网络设备接收终端设备发送的M个序列。
430，终端设备从资源池中选择第N序列，并根据用于确定M个序列的M个参数，对第N序列进行加扰处理，生成加扰的第N序列，其中，N等于M+1。该第N序列可以是终端设备根据网络设备发送的指示信息选择的，也可以是终端设备随机选择的，或者，根据其他规则选择的。该第N序列可以是ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列中的任意一种序列，也可以为其他序列。应理解，第一序列至第M序列与第N序列可以为同一类型的序列，也可以为不同类型的序列。
具体而言，可选的，终端设备根据M个参数，生成第N加扰序列；终端设备根据第N加扰序列，对所述第N序列进行加扰处理，生成加扰的第N序列。第N加扰序列可以是ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列中的任意一种序列，也可以为其他序列。
M个参数可以是M个序列各自在资源池中的索引。例如，如果终端设备从资源池中选择的M个序列为ZC序列，M个参数可以为根序列索引、循环移位索引、循环移位间隔或循环移位值。如果M个序列为m序列或Gold序列，M个参数可以为循环移位值。如果M个序列是Alltop序列，M个参数可以为γ或ω。
以M等于2为例，终端设备根据M个参数，生成第N加扰序列的方法包括：根据参数x1和参数x2生成第N加扰序列S N的参数信息y＝h(x1，x2)，h表示函数，例如y等于 组合(x1，x2)在全部可能组合中的编号。x1，x2可以为上述举例的参数信息，例如，当第N加扰序列为ZC序列，y可以是根序列索引、循环移位索引、循环移位间隔或循环移位值中的任一参数；当第N加扰序列是PN序列时，y可以是循环移位信息，例如循环移位索引、循环移位间隔或循环移位值中的任一参数信息；当第N加扰序列是Alltop序列，y可以是γ或ω；当第一加扰序列是m序列或Gold序列时，y可以是循环移位信息，例如循环移位索引、循环移位间隔或循环移位值中的任一参数信息。
终端设备根据第N加扰序列，对第N序列进行加扰处理，具体的实现方法包括：将第N加扰序列与第N序列的对应元素的相乘，生成加扰的第N序列。
440，在第二时间段内，终端设备向网络设备发送加扰的第N序列。
450，网络设备接收终端设备发送的加扰的第N序列。
460，网络设备根据M个参数，对加扰的第N序列进行解扰，获得第N序列。
具体而言，网络设备根据终端设备发送的M个序列确定用于确定M个序列的M个参数，根据M个参数生成第N解扰序列，第N解扰序列与第N加扰序列是相同的序列，对加扰的第N序列进行解扰处理，获得不被加扰的第N序列。
网络设备接收并获取到该终端设备发送的第一序列至第M序列以及第N序列的组合后，进行针对该组合情况执行后续的操作。可选的，网络设备向终端设备发送随机接入响应RAR消息，终端设备接收网络设备发送的RAR消息，并根据RAR消息中指示的时频资源向网络设备发送数据。
应理解，不同时间段可以是不同的时间单元，例如不同的符号、时隙、子帧、无线帧等，不同的时间段在时间上可以是连续的、也可以是不连续的，例如每个阶段是有一个正交频分复用技术(orthogonal frequency division multiplexing，OFDM)符号，两个时间段可以是相邻的两个连续的OFDM符号，也可以是不相邻的两个OFDM符号。
应理解，第N序列可以是终端设备在第一时间段或第一时间段之前选择的，也可以是在第N时间段内选择的，本申请对此不做任何限定。
本申请实施例提供的技术方案中，终端设备可以在第一时间段向网络设备发送至少两个序列，在第二时间段向网络设备发送一个序列，相同时间段发送的序列是不同的，不同时间段发送的序列可以是相同的也可以是不同的，若资源池中可用序列的总数为Q，则可用的序列组合数至少为Q 2(Q-1)，从而提高了可用序列的总数量，能够降低序列冲突的概率。
以发送了3个序列为例，假设网络设备为终端设备分配了两个时间单元，用于终端设备发送随机接入前导序列。在第一个时间单元，网络设备向终端设备发送了两个序列，在第二个时间单元，网络设备向终端设备发送了一个序列。假设序列资源池1中包含的Q个序列都为ZC序列x u,v(n),0≤n≤N-1，n为序列长度，u为根序列索引，v为循环移位索引；使用的加扰序列为m序列，c w(n)＝c 0(n+w)，w为循环移位值，c 0(n+w)为长度为2 m-1的m序列的周期扩展，其中，m＝log 2(N+1)。具体的序列发送过程如下：
步骤一：终端设备从preamble资源池中随机选择preamble-1和preamble-2，假设所选择的序列的循环移位索引为2和5，则序列分别表示为x u,2(n)和x u,5(n)，终端设备在第一时间单元向网络设备发送序列o 1(n)＝x u,2(n)和o 2(n)＝x u,5(n)。由于序列资源池中包含Q个序列，即Q个循环移位索引，假设循环索引组合(2，5)在全部的组合中的编号为index 2,5。
步骤二：网络设备接收终端设备发送的序列o 1(n)和o 2(n)；
步骤三：终端设备从preamble资源池中随机选择preamble-3，假设所选择的序列的循环移位索引为30，则该序列可以表示为x u,30(n)，终端设备将步骤一中所确定的index 2,5作为m序列的循环移位值，生成第N加扰序列
Figure PCTCN2020129086-appb-000008
终端设备根据第N加扰序列s N(n)和x u,30(n)，生成序列
Figure PCTCN2020129086-appb-000009
终端设备在第二时间单元内向网络设备发送o 3(n)；
步骤四：网络设备接收终端设备发送的序列o 3(n)，并根据在第一时间单元终端设备发送的x u,2(n)和x u,5(n)中的循环移位索引值，生成第N解扰序列(第N加扰序列)
Figure PCTCN2020129086-appb-000010
该网络设备根据该第N解扰序列，对终端设备发送的o 3(n)进行解扰，获得x u,30(n)。
以下给出加扰序列为Alltop序列的序列发送实例。以发送了3个序列为例，假设网络设备为终端设备分配了两个时间单元，用于终端设备发送随机接入前导序列。在第一个时间单元，网络设备向终端设备发送了两个序列，在第二个时间单元，网络设备向终端设备发送了一个序列。假设序列资源池1中包含的Q个序列都为ZC序列x u,v(n),0≤n≤N-1，n为序列长度，u为根序列索引，v为循环移位索引；使用的加扰序列为Alltop序列c(γ,ω)＝g(γ,ω)，例如
Figure PCTCN2020129086-appb-000011
0≤n≤L-1，0≤ω≤L-1。具体的序列发送过程如下：
步骤一：终端设备从preamble资源池中随机选择preamble-1和preamble-2，假设所选择的序列的循环移位索引为2和5，则序列分别表示为x u,2(n)和x u,5(n)，终端设备在第一时间单元向网络设备发送序列o 1(n)＝x u,2(n)和o 2(n)＝x u,5(n)。由于序列资源池中包含Q个序列，即Q个循环移位索引，假设循环索引组合(2，5)在全部的组合中的编号为index 2,5。
步骤二：网络设备接收终端设备发送的序列o 1(n)和o 2(n)；
步骤三：终端设备从preamble资源池中随机选择preamble-3，假设所选择的序列的循环移位索引为30，则该序列可以表示为x u,30(n)，终端设备根据步骤一中所确定的index 2,5确定Alltop序列的ω、γ，例如确定ω＝index 2,5，γ＝u，生成第N加扰序列
Figure PCTCN2020129086-appb-000012
终端设备根据第N加扰序列s N(n)和x u,30(n)，生成序列
Figure PCTCN2020129086-appb-000013
终端设备在第二时间单元内向网络设备发送o 3(n)；
步骤四：网络设备接收终端设备发送的序列o 3(n)，并根据在第一时间单元终端设备发送的x u,2(n)和x u,5(n)中的循环移位索引值，生成第N解扰序列(第N加扰序列)
Figure PCTCN2020129086-appb-000014
该网络设备根据该第N解扰序列，对终端设备发送的o 3(n)进行解扰，获得x u,30(n)。
网络设备根据在两个时间单元上的检测情况，可以判断出有终端设备发送了preamble-1、preamble-2和preamble-3的组合，进行针对该组合情况执行后续操作，例如发送RAR等。
应理解，终端设备也可以在第一时间段向网络设备发送多个序列，在第二时间段向网络设备发送一个序列或多个序列，在第三时间段向网络设备发送一个序列等。本申请实施例对此不做任何限定。
本申请实施例提出了一种通信装置，如图5所示，出示了本申请实施例的一种通信装置500的示意性框图。该装置可以应用于本申请提供的图3方法实施例中的终端设备。
该通信装置500包括：收发单元510和处理单元520，所述收发单元510，用于在第一时间段内，向网络设备发送第一序列，所述第一序列由第一参数确定；
所述处理单元520，用于根据所述第一参数，对第二序列进行加扰处理，生成加扰的第二序列；
所述收发单元510还用于，在第二时间段内，向所述网络设备发送所述加扰的第二序列；
所述处理单元520还用于，根据第N-1参数，对第N序列进行加扰处理，生成加扰的第N序列，第N-1序列由所述第N-1参数确定，其中，N为大于2的整数；
所述收发单元510还用于，在第N时间段内，向所述网络设备发送所述加扰的第N序列。
可选的，所述收发单元510还用于，接收所述网络设备发送的指示信息；所述处理单元520还用于，根据所述指示信息，从资源池中选择所述第一序列、所述第二序列、所述第N-1序列和所述第N序列。
可选的，所述处理单元520具体用于，根据所述第一参数，生成第一加扰序列；根据所述第一加扰序列，对所述第二序列进行加扰处理，生成所述加扰的第二序列。
可选的，所述收发单元510还用于，接收所述网络设备发送的随机接入响应消息。
可选的，所述第一序列、所述第二序列、所述第N序列以及所述第一解扰序列为以下任意一种序列：佐道夫-舒ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列。
本申请实施例提出了另一种通信装置，如图6所示，出示了本申请实施例的一种通信装置600的示意性框图。该装置可以应用于本申请提供的图3方法实施例中的网络设备。该通信装置600包括：收发单元610和处理单元620，所述收发单元610，用于在第一时间段内，接收所述终端设备发送的第一序列，所述第一序列由第一参数确定；
所述收发单元610还用于，在第二时间段内，接收所述终端设备发送的加扰的第二序列，所述加扰的第二序列是所述终端设备根据所述第一参数对第二序列进行过加扰处理的序列；
所述处理单元620，用于根据所述第一参数，对所述加扰的第二序列进行解扰，获得所述第二序列；
所述收发单元610还用于，在第N时间段内，接收所述终端设备发送的加扰的第N序列，所述加扰的第N序列是所述终端设备根据第N-1参数对第N序列进行过加扰处理的序列，第N-1序列由所述第N-1参数确定，其中，N为大于2的整数；
所述处理单元620还用于，根据所述第N-1参数，对所述加扰的第N序列进行解扰，获得所述第N序列。
可选的，所述收发单元610还用于，向所述终端设备发送指示信息，所述指示信息用 于指示所述终端设备从资源池中选择所述第一序列、所述第二序列、所述第N-1序列和所述第N序列。
可选的，所述处理单元620具体用于，根据所述第一参数，生成第一解扰序列；根据所述第一解扰序列，对所述加扰的第二序列进行解扰，获得所述第二序列。
可选的，所述收发单元610还用于，根据所述第一序列、所述第二序列和所述第N序列，向所述终端设备发送随机接入响应消息。
可选的，所述第一序列、所述第二序列、所述第N序列以及所述第一解扰序列为以下任意一种序列：佐道夫-舒ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列。
本申请实施例提出了另一种通信装置，如图7所示，出示了本申请实施例的一种通信装置700的示意性框图。该装置可以应用于本申请提供的图4方法实施例中的终端设备。该通信装置700包括：收发单元710和处理单元720。所述收发单元710，用于在第一时间段内，向网络设备发送M个序列，所述M个序列中包括第一序列至第最长线性移位寄存器M序列，所述M个序列分别由M个参数确定，所述M个参数与所述M个序列一一对应，其中，M为大于或等于2的整数；
所述处理单元720，用于根据所述M个参数，对第N序列进行加扰处理，生成加扰的第N序列，其中，N等于M+1；
所述收发单元710还用于，在第二时间段内，向所述网络设备发送所述加扰的第N序列。
可选的，所述收发单元710还用于，接收所述网络设备发送的指示信息；所述处理单元720还用于，根据所述指示信息，从资源池中选择所述M个序列和所述第N序列。
可选的，所述处理单元720具体用于：根据所述M个参数，生成第N加扰序列；根据所述第N加扰序列，对所述第N序列进行加扰处理，生成所述加扰的第N序列。
可选的，所述收发单元710还用于，接收所述网络设备发送的随机接入响应消息。
可选的，所述M个序列、所述第N序列以及所述第N加扰序列为以下任意一种序列：佐道夫-舒ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列。
本申请实施例提出了另一种通信装置，如图8所示，出示了本申请实施例的一种通信装置800的示意性框图。该装置可以应用于本申请提供的图4方法实施例中的网络设备。该通信装置800包括：收发单元810和处理单元820。
所述收发单元810，用于在第一时间段内，接收所述终端设备发送的M个序列，所述M个序列中包括第一序列至第最长线性移位寄存器M序列，所述M个序列分别由M个参数确定，所述M个参数与所述M个序列一一对应，其中，所述M为大于或等于2的整数；
所述收发单元810还用于，在第二时间段内，接收所述终端设备发送的加扰的第N序列，所述加扰的第N序列是所述终端设备根据所述第M个参数对第N序列进行过加扰处理的序列，其中，N等于M+1；
所述处理单元820，用于根据所述M个参数，对所述加扰的第N序列进行解扰，获得所述第N序列。
可选的，所述收发单元810还用于，向所述终端设备发送指示信息，所述指示信息用于指示所述终端设备从资源池中选择所述M个序列和所述第N序列。
可选的，所述处理单元820具体用于：根据所述M个参数，生成第N解扰序列；根据所述第N解扰序列，对所述加扰的第N序列进行解扰处理，获得所述第N序列。
可选的，所述收发单元810还用于，根据所述M个序列和所述第N序列，向所述终端设备发送随机接入响应消息。
可选的，所述M个序列、所述第N序列以及所述第N解扰序列为以下任意一种序列：佐道夫-舒ZC序列、m序列、伪噪声PN序列、离散傅里叶变换DFT序列、Alltop序列或Gold序列。
本申请实施例提供了一种通信设备900，如图9所示，出示了本申请实施例的一种通信设备900的示意性框图。
该设备900包括：处理器910和收发器920，所述收发器920用于接收计算机代码或指令，并传输至所述处理器910，所述处理器910运行所述计算机代码或指令，如本申请实施例中任意可能的实现方式中的方法。
上述的处理器910可能是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated circuit，ASIC)、现成可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
本申请实施例提供了一种通信系统1000，包括本申请实施例提供的序列发送的方法中的终端设备1010和网络设备1020。如图10所示，出示了本申请实施例的一种通信系统1000的示意性框图。
本申请实施例还提供了一种计算机可读存储介质，其上存储有用于实现上述方法实施例中的方法的计算机程序。当该计算机程序在计算机上运行时，使得该计算机可以实现上述方法实施例中的方法。
另外，本申请中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系；本申请中术语“至少一个”，可以表示“一个”和“两个或两个以上”，例如，A、B和C中至少一个，可以表示：单独存在A，单独存在B，单独存在C、同时存在A和B，同时存在A和C，同时存在C和B，同时存在A和B和C，这七种情况。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以 硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。本领域技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (27)

  1. 一种序列发送的方法，其特征在于，应用于终端设备的随机接入，所述方法包括：
    在第一时间段内，所述终端设备向网络设备发送第一序列，所述第一序列由第一参数确定；
    所述终端设备根据所述第一参数，对第二序列进行加扰处理，生成加扰的第二序列；
    在第二时间段内，所述终端设备向所述网络设备发送所述加扰的第二序列；
    所述终端设备根据第N-1参数，对第N序列进行加扰处理，生成加扰的第N序列，第N-1序列由所述第N-1参数确定，其中，N为大于2的整数；
    在第N时间段内，所述终端设备向所述网络设备发送所述加扰的第N序列。
  2. 根据权利要求1所述的方法，其特征在于，在所述终端设备向网络设备发送第一序列之前，所述方法还包括：
    所述终端设备接收所述网络设备发送的指示信息；
    所述终端设备根据所述指示信息，从资源池中选择所述第一序列、所述第二序列、所述第N-1序列和所述第N序列。
  3. 根据权利要求1或2所述的方法，其特征在于，所述终端设备根据所述第一参数，对第二序列进行加扰处理，生成加扰的第二序列，包括：
    所述终端设备根据所述第一参数，生成第一加扰序列；
    所述终端设备根据所述第一加扰序列，对所述第二序列进行加扰处理，生成所述加扰的第二序列。
  4. 根据权利要求1至3中任一项所述的方法，其特征在于，所述方法还包括：
    所述终端设备接收所述网络设备发送的随机接入响应消息。
  5. 根据权利要求1至4中任一项所述的方法，其特征在于，所述第一序列、所述第二序列、所述第N序列以及所述第一加扰序列为以下任意一种序列：
    佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
  6. 一种序列发送的方法，其特征在于，应用于终端设备的随机接入，所述方法包括：
    在第一时间段内，网络设备接收所述终端设备发送的第一序列，所述第一序列由第一参数确定；
    在第二时间段内，所述网络设备接收所述终端设备发送的加扰的第二序列，所述加扰的第二序列是所述终端设备根据所述第一参数对第二序列进行过加扰处理的序列；
    所述网络设备根据所述第一参数，对所述加扰的第二序列进行解扰，获得所述第二序列；
    在第N时间段内，所述网络设备接收所述终端设备发送的加扰的第N序列，所述加扰的第N序列是所述终端设备根据第N-1参数对第N序列进行过加扰处理的序列，第N-1序列由所述第N-1参数确定，其中，N为大于2的整数；
    所述网络设备根据所述第N-1参数，对所述加扰的第N序列进行解扰，获得所述第N序列。
  7. 根据权利要求6所述的方法，其特征在于，在所述网络设备接收所述终端设备发送的第一序列之前，所述方法还包括：
    所述网络设备向所述终端设备发送指示信息，所述指示信息用于指示所述终端设备从资源池中选择所述第一序列、所述第二序列、所述第N-1序列和所述第N序列。
  8. 根据权利要求6或7所述的方法，其特征在于，所述网络设备根据所述第一参数，对所述加扰的第二序列进行解扰，获得所述第二序列，包括：
    所述网络设备根据所述第一参数，生成第一解扰序列；
    所述网络设备根据所述第一解扰序列，对所述加扰的第二序列进行解扰，获得所述第二序列。
  9. 根据权利要求6至8中任一项所述的方法，其特征在于，所述方法还包括：
    所述网络设备根据所述第一序列、所述第二序列和所述第N序列，向所述终端设备发送随机接入响应消息。
  10. 根据权利要求6至9中任一项所述的方法，其特征在于，所述第一序列、所述第二序列、所述第N序列以及所述第一解扰序列为以下任意一种序列：
    佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
  11. 一种序列发送的方法，其特征在于，应用于终端设备的随机接入，所述方法包括：
    在第一时间段内，所述终端设备向网络设备发送M个序列，所述M个序列中包括第一序列至第最长线性移位寄存器M序列，所述M个序列分别由M个参数确定，所述M个参数与所述M个序列一一对应，其中，M为大于或等于2的整数；
    所述终端设备根据所述M个参数，对第N序列进行加扰处理，生成加扰的第N序列，其中，N等于M+1；
    在第二时间段内，所述终端设备向所述网络设备发送所述加扰的第N序列。
  12. 根据权利要求11所述的方法，其特征在于，在所述终端设备向网络设备发送M个序列之前，所述方法还包括：
    所述终端设备接收所述网络设备发送的指示信息；
    所述终端设备根据所述指示信息，从资源池中选择所述M个序列和所述第N序列。
  13. 根据权利要求11或12所述的方法，其特征在于，所述终端设备根据所述M个参数，对第N序列进行加扰处理，生成加扰的第N序列，包括：
    所述终端设备根据所述M个参数，生成第N加扰序列；
    所述终端设备根据所述第N加扰序列，对所述第N序列进行加扰处理，生成所述加扰的第N序列。
  14. 根据权利要求11至13中任一项所述的方法，其特征在于，所述方法还包括：
    所述终端设备接收所述网络设备发送的随机接入响应消息。
  15. 根据权利要求11至14中任一项所述的方法，其特征在于，所述M个序列、所述第N序列以及所述第N加扰序列为以下任意一种序列：
    佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
  16. 一种序列发送的方法，其特征在于，应用于终端设备的随机接入，所述方法包括：
    在第一时间段内，网络设备接收所述终端设备发送的M个序列，所述M个序列中包括第一序列至第最长线性移位寄存器M序列，所述M个序列分别由M个参数确定，所述M个参数与所述M个序列一一对应，其中，所述M为大于或等于2的整数；
    在第二时间段内，所述网络设备接收所述终端设备发送的加扰的第N序列，所述加扰的第N序列是所述终端设备根据所述第M个参数对第N序列进行过加扰处理的序列，其中，N等于M+1；
    所述网络设备根据所述M个参数，对所述加扰的第N序列进行解扰，获得所述第N序列。
  17. 根据权利要求16所述的方法，其特征在于，在所述网络设备接收所述终端设备发送的M个序列之前，所述方法还包括：
    所述网络设备向所述终端设备发送指示信息，所述指示信息用于指示所述终端设备从资源池中选择所述M个序列和所述第N序列。
  18. 根据权利要求16或17所述的方法，其特征在于，所述网络设备根据所述M个参数，对所述加扰的第N序列进行解扰，获得所述第N序列，包括：
    所述网络设备根据所述M个参数，生成第N解扰序列；
    所述网络设备根据所述第N解扰序列，对所述加扰的第N序列进行解扰处理，获得所述第N序列。
  19. 根据权利要求16至18中任一项所述的方法，其特征在于，所述方法还包括：
    所述网络设备根据所述M个序列和所述第N序列，向所述终端设备发送随机接入响应消息。
  20. 根据权利要求16至19中任一项所述的方法，其特征在于，所述M个序列、所述第N序列以及所述第N解扰序列为以下任意一种序列：
    佐道夫-舒ZC序列、最长线性移位寄存器m序列、伪噪声PN序列、离散傅里叶变换DFT序列、爱尔特Alltop序列或古德Gold序列。
  21. 一种通信装置，其特征在于，包括用于实现如权利要求1至5中任一项所述的方法的功能的单元。
  22. 一种通信装置，其特征在于，包括用于实现如权利要求6至10中任一项所述的方法的功能的单元。
  23. 一种通信装置，其特征在于，包括用于实现如权利要求11至15中任一项所述的方法的功能的单元。
  24. 一种通信装置，其特征在于，包括用于实现如权利要求16至20中任一项所述的方法的功能的单元。
  25. 一种通信设备，其特征在于，包括：
    处理器和收发器，所述收发器用于接收计算机代码或指令，并传输至所述处理器，所述处理器运行所述计算机代码或指令，如权利要求1至20中任一项所述的方法。
  26. 一种通信系统，其特征在于，包括：
    权利要求1至20中任一项所述方法中的终端设备和网络设备。
  27. 一种计算机可读存储介质，其特征在于，包括：
    所述计算机可读介质存储有计算机程序；
    所述计算机程序在计算机上运行时，使得计算机执行权利要求1至20中任一项所述的方法。
PCT/CN2020/129086 2020-11-16 2020-11-16 序列发送的方法和装置 Ceased WO2022099697A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CN202080107012.8A CN116569592B (zh) 2020-11-16 2020-11-16 序列发送的方法和装置
PCT/CN2020/129086 WO2022099697A1 (zh) 2020-11-16 2020-11-16 序列发送的方法和装置
EP20961251.4A EP4240052A4 (en) 2020-11-16 2020-11-16 Sequence sending method and apparatus
US18/317,311 US12426100B2 (en) 2020-11-16 2023-05-15 Sequence sending method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/129086 WO2022099697A1 (zh) 2020-11-16 2020-11-16 序列发送的方法和装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/317,311 Continuation US12426100B2 (en) 2020-11-16 2023-05-15 Sequence sending method and apparatus

Publications (1)

Publication Number Publication Date
WO2022099697A1 true WO2022099697A1 (zh) 2022-05-19

Family

ID=81602104

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/129086 Ceased WO2022099697A1 (zh) 2020-11-16 2020-11-16 序列发送的方法和装置

Country Status (4)

Country Link
US (1) US12426100B2 (zh)
EP (1) EP4240052A4 (zh)
CN (1) CN116569592B (zh)
WO (1) WO2022099697A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US12382504B2 (en) * 2021-09-10 2025-08-05 Parallel Wireless, Inc. RACH response preamble reduction
CN120018116A (zh) * 2023-11-16 2025-05-16 华为技术有限公司 通信方法和装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104917544A (zh) * 2014-03-13 2015-09-16 电信科学技术研究院 一种扰码选择方法及装置
CN104935536A (zh) * 2015-04-22 2015-09-23 华为技术有限公司 一种数据处理设备及方法
US20170230155A1 (en) * 2015-10-12 2017-08-10 Newracom, Inc. Protection methods for wireless transmissions
CN108650001A (zh) * 2017-08-11 2018-10-12 华为技术有限公司 一种信号加扰、解扰方法及装置

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101495886B1 (ko) * 2007-07-19 2015-02-26 한국전자통신연구원 하향링크 프레임 생성 방법 및 셀 탐색 방법
KR101895980B1 (ko) * 2011-08-22 2018-09-06 삼성전자 주식회사 무선통신 시스템에서 셀 탐색을 위한 송수신 방법 및 장치
KR102045339B1 (ko) * 2013-04-26 2019-11-15 삼성전자 주식회사 기기 대 기기 무선 통신에서의 발견 신호 자원 지시 방법
WO2015115801A1 (en) * 2014-01-28 2015-08-06 Samsung Electronics Co., Ltd. Method and device for detecting and generating synchronization signal for device-to-device wireless communication
US9769699B2 (en) * 2014-09-17 2017-09-19 Innovative Sonic Corporation Method and apparatus for performing device to device (D2D) content estimation and triggering of buffer status reporting (BSR) in a wireless communication system
KR101994424B1 (ko) * 2016-09-30 2019-06-28 엘지전자 주식회사 무선 통신 시스템에서 동기 신호를 송수신하는 방법 및 이를 위한 장치
EP3591920B1 (en) * 2017-03-04 2022-05-04 LG Electronics Inc. Method for transmitting synchronization signal in wireless communication system and apparatus therefor
US10484153B2 (en) * 2017-03-09 2019-11-19 Samsung Electronics Co., Ltd. Method and apparatus for NR-DMRS sequence design
CN108633013B (zh) * 2017-03-22 2019-09-17 电信科学技术研究院 一种收发物理随机接入信道前导码序列的方法及装置
CN109565345B (zh) * 2017-05-05 2021-07-20 Lg 电子株式会社 接收同步信号的方法及其装置
CN115811376B (zh) * 2017-05-05 2025-08-26 Lg电子株式会社 发送和接收同步信号和物理广播信道块的方法及其设备
US11647495B2 (en) * 2017-10-06 2023-05-09 Qualcomm Incorporated Sequence generation and assignment
CN110636617B (zh) * 2018-06-22 2022-04-05 华为技术有限公司 一种参数配置方法及装置
US11705984B2 (en) * 2018-08-06 2023-07-18 Telefonaktiebolaget Lm Ericsson (Publ) Method for determining demodulation reference signal for multiple access transmission
CN110972172B (zh) * 2018-09-28 2021-02-12 华为技术有限公司 上行免动态授权传输的方法及装置
US20220006552A1 (en) * 2018-11-02 2022-01-06 Apple Inc. Remote interference management reference signal
CN111436093B (zh) * 2019-01-11 2021-10-15 大唐移动通信设备有限公司 一种节能信号的传输方法、终端和网络侧设备
CN112134660B (zh) 2019-06-24 2022-02-18 华为技术有限公司 通信方法及装置
CN112398608B (zh) 2019-08-14 2022-03-29 华为技术有限公司 一种码字的传输方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104917544A (zh) * 2014-03-13 2015-09-16 电信科学技术研究院 一种扰码选择方法及装置
CN104935536A (zh) * 2015-04-22 2015-09-23 华为技术有限公司 一种数据处理设备及方法
US20170230155A1 (en) * 2015-10-12 2017-08-10 Newracom, Inc. Protection methods for wireless transmissions
CN108650001A (zh) * 2017-08-11 2018-10-12 华为技术有限公司 一种信号加扰、解扰方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4240052A4 *

Also Published As

Publication number Publication date
CN116569592A (zh) 2023-08-08
EP4240052A1 (en) 2023-09-06
US20230292378A1 (en) 2023-09-14
CN116569592B (zh) 2025-10-28
EP4240052A4 (en) 2023-11-29
US12426100B2 (en) 2025-09-23

Similar Documents

Publication Publication Date Title
JP6411641B2 (ja) 伝送方法及び通信機器
US11057942B2 (en) Data transmission method for multiplexing data portion, device, and system
EP3554118B1 (en) Grant-free transmission method, terminal device and network device
CN110741715B (zh) 随机接入前导码传输方法及装置
EP3863204B1 (en) Method for transmitting synchronization signal, network apparatus, and terminal apparatus
US12317320B2 (en) COT indication information sending method and apparatus
US20230275795A1 (en) Sequence-Based Signal Processing Method and Signal Processing Apparatus
EP4207818B1 (en) Information transmission method, devices, and storage medium
WO2018201966A1 (en) Methods and apparatuses for random-access
CN111586881A (zh) 随机接入的方法和装置
EP3606224B1 (en) Method and device for sending and receiving preamble sequence of physical random access channel
US12426100B2 (en) Sequence sending method and apparatus
CN109429251B (zh) 传输方法、终端设备和网络设备
WO2018126968A1 (zh) 一种信号发送、接收方法及装置
US20250274814A1 (en) Signal transmission method and apparatus
CN116569647B (zh) 通信连接控制方法及装置、电子设备及存储介质
EP3657746A1 (en) Transmitting device and method thereof
EP3902177B1 (en) Communications method, apparatus, and system
EP4525545A1 (en) Communication method and apparatus
WO2022151424A1 (zh) 一种随机接入方法及其装置
CN115833873B (zh) 一种通信方法及装置
EP4651567A1 (en) Channel access method and apparatus, and computer-readable storage medium
WO2025124080A1 (zh) 一种通信方法及装置
WO2025124081A1 (zh) 一种通信方法及装置
CN121099454A (zh) 通信方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20961251

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 202080107012.8

Country of ref document: CN

ENP Entry into the national phase

Ref document number: 2020961251

Country of ref document: EP

Effective date: 20230529

NENP Non-entry into the national phase

Ref country code: DE

WWG Wipo information: grant in national office

Ref document number: 202080107012.8

Country of ref document: CN