WO2021043059A1

WO2021043059A1 - Random access method and device

Info

Publication number: WO2021043059A1
Application number: PCT/CN2020/111766
Authority: WO
Inventors: 丁梦颖; 汪凡
Original assignee: 华为技术有限公司
Priority date: 2019-09-02
Filing date: 2020-08-27
Publication date: 2021-03-11
Also published as: CN112449438B; CN112449438A

Abstract

The present application provides a random access method and device. The method comprises: according to a corresponding relationship between a preamble set and a base sequence (orthogonal sequence or quasi-orthogonal sequence) set, selecting a plurality of base sequences to generate or calculate a preamble, a candidate preamble in the preamble set and a candidate base sequence in the base sequence set satisfying the corresponding relationship, thus the capacity of the preamble can be expanded in limited physical resources; at the same time, excellent missed detection probability and false detection probability are ensured, satisfying the requirements of a large number of terminals to access a network.

Description

Random access method and device

This application requires that the priority and requirements of a Chinese patent application filed with the State Intellectual Property Office of China with the application number 201910822354.7 and the application name "Random Access Method and Device" be submitted on September 2, 2019 on May 25, 2020 The State Intellectual Property Office of China, the application number is 202010219752.2, the priority of the Chinese patent application with the application name "Random Access Method and Device", the entire content of which is incorporated into this application by reference.

Technical field

This application relates to the field of communication technology, and in particular to a random access method and device.

Background technique

In a wireless communication network, due to user power saving and limited wireless resources, when the terminal is not active for a long time, the network device will disconnect the air interface connection with the terminal. Therefore, when an inactive terminal needs to retransmit data, the terminal first needs to establish a connection with the network device, and the terminal can send a preamble to the network device to initiate a random access process when trying to access the wireless network. However, limited by the physical resources that can carry the preamble, the capacity of the preamble is insufficient, which cannot meet the needs of a large number of terminals to access the network. Therefore, how to expand the capacity of the preamble in the limited physical resources has become an urgent problem to be solved.

Summary of the invention

The embodiments of the present application provide a communication method and device.

In the first aspect, the embodiments of the present application provide a communication method, which may be executed by a terminal or a component of the terminal (such as a processor, a chip, or a chip system), including: obtaining a first sequence {x( n),n=0,1,...,N-1}, (abbreviated as: {x(n)}), and output the first sequence {x(n)}, where the first sequence {x (n)} and d second sequence {{s ₁ (n),n=0,1,...,N-1},{s ₂ (n),n=0,1,...,N-1} ,…,{S _d (n),n=0,1,…,N-1}} (abbreviated as: {{s ₁ (n)},{s ₂ (n)},…,{s _d (n)}}) related. The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is An integer greater than M.

Among them, K candidate first sequences and M candidate second sequences satisfy the first condition described below:

The first condition: any s candidate first sequences in the K candidate first sequences correspond to d×s candidate second sequences, and there is at least d×(1-ε)× in the d×s candidate second sequences s candidate second sequences that are different from each other, ε is a real number greater than 0 and less than 1, and s is an integer greater than 1 and less than K. It can be understood that, for the convenience of description, the first condition can also be expressed as (s; d; ε)-expander criterion.

Through the above method, d second sequences are selected to generate or calculate the first sequence according to the correspondence relationship between K candidate first sequences and M candidate second sequences, where the candidate first sequence and the candidate second sequence meet the corresponding conditions, The capacity of the sequence corresponding to the terminal signal is increased, so that the capacity of the sequence corresponding to the terminal signal can be expanded in limited physical resources to meet the needs of a large number of terminals for accessing the network or sending signals. In addition, since the first sequence and the second sequence in the above method both have low cross-correlation characteristics, it is possible to expand the sequence capacity corresponding to the terminal signal while ensuring good detection performance for the sequence corresponding to the terminal signal.

With reference to the first aspect, in some implementations of the first aspect, the correspondence relationship can be implemented in the form of a table, or in the form of a function, or in other data structures, such as arrays and queues. , Containers, stacks, linear tables, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables.

With reference to the first aspect, in some implementations of the first aspect, configuration information is obtained, and the configuration information configures d second sequences {{s ₁ (n)}, {s ₂ (n)},...,{s _d (n)}}, or the configuration information configures the first sequence {x(n)} and d second sequences {{s ₁ (n)},{s ₂ (n)},...,{s _d (n)}} corresponding relationship. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of the following: system information, radio resource control (radio resource control, RRC) signaling, media access Control (media access control, MAC) control element (CE), or control channel.

With reference to the first aspect, in some embodiments of the first aspect, d second sequences {{s ₁ (n)}, {s ₂ (n)},...,{s _d (n )}}.

With reference to the first aspect, in some embodiments of the first aspect, the corresponding relationship between the K candidate first sequences and the M candidate second sequences is obtained, and the d second sequences are obtained according to the corresponding relationship {{s ₁ (n)},{s ₂ (n)},…,{s _d (n)}}.

In combination with the first aspect, in some embodiments of the first aspect, according to the above d second sequence {{s ₁ (n)}, {s ₂ (n)},...,{s _d (n)}} Generate or calculate the above-mentioned first sequence {x(n)}.

With reference to the first aspect, in some implementations of the first aspect, the above-mentioned first sequence is one of the following: a sequence of a preamble signal, a sequence of a demodulation reference signal (DMRS), The sequence of the phase tracking reference signal (PTRS), the sequence of the sounding reference signal (SRS), the sequence of the synchronization signal, the sequence of the measurement reference signal, or the sequence of the discovery signal. The above-mentioned signal may be a signal sent by a terminal to a network device, or a signal sent by a terminal to one or more other terminals. Optionally, when the first sequence is the sequence of the preamble signal, the value of M can be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8. , Or 4, the value of K can be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a DMRS sequence, the value of M may be 6, 8, 12, 16, 18, 24, or 32, and the value of K may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.

With reference to the first aspect, in some embodiments of the first aspect, the above-mentioned second sequence is a ZC sequence or a sequence obtained from the ZC sequence through the first processing, and the first processing includes one or more of the following: Discrete Fourier transform DFT, or cyclic shift.

By configuring the parameters related to the first sequence through the above configuration method, different devices can be configured to use different first sequence parameters, thereby reducing interference between devices.

In the second aspect, the embodiments of the present application provide a communication method, which may be executed by a network device or a component of the network device (for example, a processor, a chip, or a chip system). The method includes: receiving a first sequence {x(n), n=0,1,...,N-1}, (abbreviated as: {x(n)}), and processing the first sequence {x(n) )}, where the first sequence {x(n)} and d second sequences {{s ₁ (n),n=0,1,...,N-1},{s ₂ (n),n =0,1,…,N-1},…,{s _d (n),n=0,1,…,N-1 (abbreviated as: {s1n,s2n,…,{sdn}}) . The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is An integer greater than M.

With reference to the second aspect, in some implementations of the second aspect, the correspondence relationship can be implemented in the form of a table, or in the form of a function, or in other data structures, such as arrays and queues. , Containers, stacks, linear tables, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables.

With reference to the second aspect, in some implementations of the second aspect, the above method further includes: sending configuration information to the terminal, the configuration information configuring d second sequences {{s ₁ (n)}, {s ₂ (n )},…,{S _d (n)}}, or the configuration information configures the first sequence {x(n)} and d second sequences {{s ₁ (n)},{s ₂ (n) },…,{S _d (n)}} corresponding relationship. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.

With reference to the second aspect, in some implementations of the second aspect, the above-mentioned first sequence is one of the following: preamble sequence, DMRS sequence, PTRS sequence, SRS sequence, synchronization signal sequence, measurement reference signal sequence , Or the sequence of the discovery signal. Optionally, when the first sequence is a preamble sequence, the value of M can be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4. The value of K can be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a DMRS sequence, the value of M may be 6, 8, 12, 16, 18, 24, or 32, and the value of K may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.

With reference to the second aspect, in some embodiments of the second aspect, the above-mentioned second sequence is a ZC sequence or a sequence obtained from the ZC sequence through the first processing, and the first processing includes one or more of the following: Discrete Fourier transform DFT, or cyclic shift.

By configuring the parameters related to the first sequence through the foregoing method of sending configuration information to the terminal, different devices can be configured to use different first sequence parameters, thereby reducing interference between devices.

In a third aspect, an embodiment of the present application provides a communication device, including a module or unit for implementing the foregoing first aspect or the communication method in any possible implementation manner of the first aspect. The device includes corresponding units or components for performing the above-mentioned methods. The units included in the device can be implemented in software and/or hardware. The communication device may be a terminal device or a component (chip or circuit) for the terminal device.

In a fourth aspect, an embodiment of the present application provides a communication device, including a module or unit for implementing the second aspect or the communication method in any possible implementation manner of the second aspect. The device includes corresponding units or components for performing the above-mentioned methods. The units included in the device can be implemented in software and/or hardware. The communication device may be, for example, a network device (such as a base station), or a chip, a chip system, or a processor that can support the network device to implement the foregoing method.

In a fifth aspect, the present application provides a device, including: a processor, the processor is coupled with a memory, the memory is used to store a program or instruction, when the program or instruction is executed by the processor, the The device implements the foregoing first aspect or the method described in any one of the possible implementation manners of the first aspect.

In a sixth aspect, the present application provides a device including: a processor, the processor is coupled with a memory, the memory is used to store a program or instruction, when the program or instruction is executed by the processor, the The device implements the foregoing second aspect or the method described in any possible implementation manner of the second aspect.

In a seventh aspect, the present application provides a storage medium on which a computer program or instruction is stored. When the computer program or instruction is executed, the computer executes the first aspect or any one of the possible implementation manners of the first aspect. The method described.

In an eighth aspect, the present application provides a storage medium on which a computer program or instruction is stored. When the computer program or instruction is executed, the computer executes the second aspect or any one of the possible implementation manners of the second aspect. The method described.

In a ninth aspect, an embodiment of the present application provides a communication system, including: the device described in the third aspect, and/or the device described in the fourth aspect.

In a tenth aspect, an embodiment of the present application provides a communication system, including: the device according to the fifth aspect, and/or the device according to the sixth aspect.

Description of the drawings

FIG. 1 is a schematic diagram of a communication system applied by an embodiment provided by this application;

Figure 2 shows a schematic diagram of an example architecture of a communication system;

FIG. 3 shows a schematic diagram of interaction of a communication method provided by an embodiment of the present application;

4A shows a schematic flowchart of obtaining the correspondence between the candidate first sequence and the candidate second sequence provided by an embodiment of the present application;

FIG. 4B shows another schematic flowchart of obtaining the correspondence between the candidate first sequence and the candidate second sequence according to an embodiment of the present application;

FIG. 5 is a schematic structural diagram of a communication device provided by an embodiment of this application;

FIG. 6 is a schematic structural diagram of a terminal provided by an embodiment of this application;

FIG. 7 is a schematic diagram of another communication device provided by an embodiment of the application.

detailed description

The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

The term "and/or" in this application is only an association relationship describing the associated objects, indicating that there can be three types of relationships, for example, A and/or B, which can mean that A alone exists, and A and B exist at the same time. There are three cases of B alone. In addition, the character "/" in this application generally indicates that the associated objects before and after are in an "or" relationship.

In addition, it should be noted that in this application, words such as "exemplary" or "for example" represent examples, illustrations, or illustrations, and are intended to present related concepts in a specific manner. Any embodiment described as "exemplary" or "for example" in this application should not be construed as being more preferable or advantageous than other embodiments, nor should it be construed that this application can only be applied to these embodiments Scene.

First, the communication system to which the technical solution provided in this application is applicable will be explained.

Technical solutions of the embodiments of the present application can be applied to various communication systems, for example: the LTE (long term evolution, LTE) system, or fifth generation (5 ^th generation, 5G) communication system, or a wireless fidelity (wireless-fidelity , WiFi) system, or new radio (NR) system, or multiple communication system integration system, or future evolution communication system, and other network systems that can be used to provide communication services, which are not limited here.

Figure 1 shows an exemplary structure diagram of a possible communication system. The communication system includes at least one network device (the network device 100 and the network device 110 are shown in the figure), and one or more terminals connected to the network device. The terminal 101 and the terminal 102 shown in FIG. 1 communicate with the network device 100, and the terminal 111 and the terminal 112 shown in FIG. 1 communicate with the network device 110. It can be understood that network devices and terminals may also be referred to as communication devices.

Figure 2 shows a schematic diagram of an example of a possible architecture of a communication system. As shown in Figure 2, the network equipment in the radio access network (RAN) is a centralized unit (CU) and a distributed unit (distributed unit). unit, DU) A base station with a separate architecture (such as gNodeB or gNB). The RAN can be connected to a core network (for example, it can be an LTE core network, or a 5G core network, etc.). CU and DU can be understood as the division of base stations from the perspective of logical functions. CU and DU can be physically separated or deployed together. Multiple DUs can share one CU. One DU can also be connected to multiple CUs (not shown in the figure). The CU and the DU can be connected through an interface, for example, an F1 interface.

Optionally, the CU and DU can be divided according to the protocol layer of the wireless network. For example, radio resource control (RRC), service data adaptation protocol stack (service data adaptation protocol, SDAP), and packet data convergence protocol (packet data convergence protocol, PDCP) layer functions are set in the CU, and the wireless link Functions such as radio link control (RLC), media access control (MAC) layer, and physical (PHY) layer are set in the DU. It should be understood that the division of CU and DU processing functions according to this protocol layer is only an example, and it can also be divided in other ways.

Optionally, the CU or DU can also be divided into part of the processing functions with the protocol layer. In a possible design, part of the functions of the RLC layer and the functions of the protocol layer above the RLC layer are set in the CU, and the remaining functions of the RLC layer and the functions of the protocol layer below the RLC layer are set in the DU. In another possible design, the functions of the CU or DU can also be divided according to service types or other system requirements, for example, according to the delay, and the functions that need to meet the delay requirements in processing time are set in the DU, and there is no need to meet the requirements. The function required for the delay is set in the CU. The network architecture shown in FIG. 2 can be applied to a 5G communication system, and it can also share one or more components or resources with an LTE system. In another design, the CU may also have one or more functions of the core network. One or more CUs can be set centrally or separately. For example, the CU can be set on the network side to facilitate centralized management. The DU can have multiple radio frequency functions, or the radio frequency functions can be set remotely.

Optionally, the functions of the CU may be implemented by one entity or by different entities. For example, the functions of the CU can be further divided, for example, the control plane (CP) and the user plane (UP) are separated, that is, the CU control plane (CU-CP) and the CU user plane (CU-UP) are separated. ). For example, the CU-CP and CU-UP may be implemented by different functional entities, and the CU-CP and CU-UP may be coupled with the DU to jointly complete the function of the base station. In one possible way, CU-CP is responsible for the control plane functions, mainly including RRC and PDCP control plane (PDCP-C). PDCP-C is mainly responsible for the encryption and decryption of control plane data, integrity protection, and serial number. Maintenance, data transmission, etc.; CU-UP is responsible for user plane functions, mainly including SDAP and PDCP user plane (PDCP-U), where SDAP is mainly responsible for processing core network data and mapping data flows To bearer. PDCP-U is mainly responsible for data encryption and decryption, integrity protection, header compression, serial number maintenance, data transmission, etc., among which CU-CP and CU-UP are connected through the E1 interface.

It is understandable that the embodiments provided in this application are also applicable to an architecture where the CU and DU are not separated.

In this application, the network device can be any device with a wireless transceiver function. Including but not limited to: evolved base station in LTE (NodeB or eNB or e-NodeB, evolutional NodeB), base station in NR (gNodeB or gNB) or transmission receiving point/transmission reception point (TRP), WiFi The access node, wireless relay node, wireless backhaul node, etc. in the system. The base station can be: a macro base station, a micro base station, a pico base station, a small station, a relay station, or a balloon station, etc. Multiple base stations can support networks of the same technology mentioned above, or networks of different technologies mentioned above. The base station can contain one or more co-site or non-co-site TRPs. The network device may also be a wireless controller, CU, and/or DU in a cloud radio access network (CRAN) scenario. The network device can also be a server, a wearable device, or a vehicle-mounted device. The following description takes the network device as a base station as an example. The multiple network devices may be base stations of the same type, or base stations of different types. The base station can communicate with the terminal, and it can also communicate with the terminal through a relay station. The terminal can communicate with multiple base stations of different technologies. For example, the terminal can communicate with a base station that supports an LTE network, can also communicate with a base station that supports a 5G network, and can also support dual connections with a base station of an LTE network and a base station of a 5G network. .

The terminal can be user equipment (UE), or access terminal, or user unit, or user station, or mobile station, or mobile station, or remote station, or remote terminal, or mobile equipment, or user terminal, or Terminal, or wireless terminal equipment, or user agent or user device. The terminal can also be a cellular phone, a cordless phone, a wireless local loop (WLL) station, a personal digital assistant (PDA) device, a handheld device with wireless communication function, a computing device, or connected to a wireless modem Other processing equipment, mobile phones, tablets, computers with wireless transceiver functions, virtual reality (VR) terminal equipment, augmented reality (AR) terminal equipment, industrial control (industrial) Wireless terminals in control), vehicle-mounted terminal equipment, wireless terminals in unmanned driving (self-driving), wireless terminals in remote medical (remote medical), wireless terminals in smart grid (smart grid), transportation safety (transportation safety) ) In the wireless terminal, smart city (smart city) wireless terminal, smart home (smart home) wireless terminal, wearable terminal equipment, terminal equipment in the future 5G network or terminal equipment in the future evolution of PLMN, etc. . The terminal can also be fixed or mobile, and the terminal can be deployed on land, water or in the air.

In addition, in the embodiments of the present application, the terminal may also be a terminal device in the Internet of Things (IoT) system. IoT is an important part of the development of information technology in the future. Its main technical feature is to connect items with communication technology. Network connection, so as to realize the intelligent network of human-machine interconnection and interconnection of things. The terminal in the embodiment of the present application may also be a terminal device in machine type communication (MTC). The terminal of the present application may also be a vehicle-mounted module, vehicle-mounted module, vehicle-mounted component, vehicle-mounted chip or vehicle-mounted unit built into a vehicle as one or more components or units. The vehicle passes through the built-in vehicle-mounted module, vehicle-mounted module, and vehicle-mounted unit. Components, on-board chips or on-board units can implement the method of the present application. Therefore, the embodiments of the present application can be applied to the Internet of Vehicles, such as vehicle to everything (V2X), long term evolution-vehicle (LTE-V) technology, and vehicle-to-vehicle (vehicle-to-vehicle). , V2V) and so on. The embodiment of the present application does not limit the application scenario of the terminal.

In a wireless communication network, a terminal can initiate random access to establish a connection required for communication with a network device. The terminal may send a random access preamble to the network device to initiate a random access process. The random access preamble may also be called a preamble, a preamble signal, or a preamble, etc. The name of the random access preamble is not limited in this application. However, when a large number of terminals need to access the network, limited by the physical resources that can carry the preamble, there will be a shortage of the capacity of the preamble, which cannot meet the demand for a large number of terminals to access the network. Therefore, how to expand the capacity of the preamble in the limited physical resources has become an urgent problem to be solved.

In the method provided by the embodiments of the present application, a number of base sequences are selected to generate or calculate the preamble according to the corresponding relationship between the preamble set and the base sequence (orthogonal sequence or quasi-orthogonal sequence) set. Among them, the candidates in the preamble set The preamble and the candidate base sequences in the base sequence set meet the corresponding relationship, so that the capacity of the preamble can be expanded in limited physical resources, while ensuring excellent missed detection probability and false detection probability, and meets the needs of a large number of terminals to access the network.

The physical resources in this application may include one or more of time domain resources, frequency domain resources, code domain resources, or space domain resources. For example, the time domain resource included in the physical resource may include at least one frame, at least one sub-frame, at least one slot, at least one mini-slot, and at least one time unit. , Or at least one time domain symbol, etc. For example, the frequency domain resources included in the physical resource may include at least one carrier (carrier), at least one component carrier (CC), at least one bandwidth part (BWP), and at least one resource block group (resource block group). block group, RBG), at least one physical resource-block group (PRG), at least one resource block (resource block, RB), or at least one sub-carrier (sub-carrier, SC), etc. For example, the airspace resources included in the physical resources may include at least one beam, at least one port, at least one antenna port, or at least one layer/space layer, or the like. For example, the code domain resources included in the physical resources may include at least one orthogonal cover code (OCC), or at least one non-orthogonal multiple access (NOMA) code, and so on.

It is understandable that the above-mentioned physical resources may be physical resources of the baseband, and the physical resources of the baseband may be used by the baseband chip. The aforementioned physical resources may also be physical resources of the air interface. The aforementioned physical resources may also be intermediate frequency or radio frequency physical resources.

To make it easier to understand the embodiments in this application, some concepts or terms involved in this application are first briefly described.

{q _r (h),h=0,1,...,H-1} represents a sequence of length H {q _r (0),q _r (1),...,q _r (H-1)},H It is an integer greater than 1, which can be abbreviated as {q _r (h)}. Where q _r (h) represents an element in the sequence (also can be understood as an object in the sequence), the value of the element in the sequence can be a real number or a complex number, and r can be understood as the number or index of the sequence, R can also be omitted if it does not affect understanding.

{{q _r (h), h=0,1,...,H-1}, r=0,...,R-1} represents a set containing R sequences of length H {{q ₀ (h), h=0,1,…,H-1},{q ₁ (h),h=0,1,…,H-1},…,{q _R-1 (h),h=0,1, …,H-1}}, can be abbreviated as {{q ₀ (h)},{q ₁ (h)},...,{q _R-1 (h)}}, R is an integer greater than 1, r It can be understood as the number or index of the sequence, and r is an integer less than R.

FIG. 3 is a schematic diagram of interaction of a communication method 300 provided by an embodiment of this application. In FIG. 3, the communication method is illustrated by taking the terminal and the network device as the executive body of the interactive indication as an example, but the present application does not limit the executive body of the interactive indication. For example, the executive body of the interactive indication may also be a terminal and Another terminal. For another example, the network device in FIG. 3 may also be a chip, chip system, or processor that supports the network device to implement the method, and the terminal in FIG. 3 may also be a chip, chip system, or chip system that supports the terminal to implement the method. Or processor, etc. As shown in FIG. 3, the method 300 of this embodiment may include:

Operation 310: The terminal obtains a first sequence {x(n), n=0,1,...,N-1} (abbreviated as: {x(n)}), and the first sequence {x(n)} and d second sequence {{s ₁ (n),n=0,1,…,N-1},{s ₂ (n),n=0,1,…,N-1},…,{s _d (n), n = 0, 1,..., N-1 (abbreviated as: {s1n, s2n,..., {sdn}}). The first sequence can also be expressed as xkn, where k can be understood as _{the number or index of the first sequence {x k} (n)}, and a second sequence can be expressed as {s _m (n)}, where m can be understood as The number or index of the second sequence {s _m (n)}.

Operation 320: the terminal sends the foregoing first sequence to the network device, and the network device receives the first sequence.

There are many different understandings of sending the first sequence in this application.

Sending the first sequence can be understood as outputting the first sequence, where "output" can be understood as the output in baseband processing, it can also be understood as the output in intermediate frequency or radio frequency processing, and it can also be understood as the output in the air interface. Processing output.

Sending the first sequence can also be understood as preprocessing the first sequence before sending it. The preprocessing includes one or more of scrambling, modulation, layer mapping, precoding, power adjustment, or physical resource mapping. . For example, sending a first sequence may be understood as sending a signal corresponding to the first sequence (for example, it may be the aforementioned preamble signal, demodulation reference signal (DMRS), phase tracking reference signal, PTRS), sounding reference signal (SRS), synchronization signal, measurement reference signal, or discovery signal), optionally the signal may be a signal obtained after preprocessing the first sequence.

Operation 330: the network device processes the first sequence. It can be understood that, since there are scenarios in which one or more terminals send the foregoing first sequence to the network device, the network device may receive one or more first sequences in operation 320. Optionally, the network device may receive multiple first sequences at the same time, and the “receiving multiple first sequences at the same time” can be understood as receiving multiple first sequences at the same time point, or it can be understood as receiving multiple first sequences at the same time point. Multiple first sequences are received in a time period, or in other words, multiple first sequences are received in the same sequence processing cycle.

The embodiments of the present application can have many different understandings for processing the first sequence.

Processing the first sequence may be understood as the network device receiving the first sequence.

Processing the first sequence can also be understood as the network device receiving the first sequence and using each second sequence in the second sequence set to perform a cross-correlation operation on the first sequence (for example, convolution in the time domain, or in the Do a dot multiplication in the frequency domain) to obtain a cross-correlation sequence corresponding to each second sequence in the second sequence set.

Processing the first sequence can also be understood as using an algorithm (for example, a compressed sensing algorithm) to receive the first sequence, or using an algorithm (for example, a compressed sensing algorithm) to obtain relevant parameter information of the first sequence (for example, the number of the aforementioned first sequence).

The processing of the first sequence by the network device may also be understood as the network device communicating with the terminal based on the above-mentioned one or more first sequences. For example, if the first sequence is a sequence of a preamble signal, the network device may send an access response (also referred to as a random access response) to the terminal based on the sequence of the preamble signal. For another example, if the first sequence is a DMRS sequence, the network device may demodulate the data from the terminal according to the DMRS sequence. It can be understood that this application does not limit the specific form in which the network device communicates with the terminal based on the first sequence.

Through the above method, a number of second sequences are selected to generate or calculate the first sequence according to the correspondence between a number of candidate first sequences and a number of candidate second sequences, wherein the candidate first sequence and the candidate second sequence meet the corresponding conditions, The capacity of the sequence corresponding to the terminal signal is increased, so that the capacity of the sequence corresponding to the terminal signal can be expanded in limited physical resources to meet the needs of a large number of terminals for accessing the network or sending signals. In addition, since the first sequence and the second sequence in the above method both have low cross-correlation characteristics, it is possible to expand the sequence capacity corresponding to the terminal signal while ensuring good detection performance for the sequence corresponding to the terminal signal.

In operation 310, the terminal may obtain the aforementioned first sequence in a variety of different ways.

In a possible implementation manner for obtaining the foregoing first sequence, the first sequence {x(n)} is predefined, and the terminal may obtain the predefined first sequence. For example, the elements in the first sequence (for example: the values of the elements in the first sequence) can be pre-stored in a corresponding device (for example, a memory, a cache, a storage medium, or other devices that can be used to store data), The terminal reads the elements in the first sequence from the device, thereby obtaining the first sequence.

In another possible implementation manner for obtaining the foregoing first sequence, the foregoing first sequence may be configured by a network device for the terminal. For example, the above-mentioned first sequence is configured by the network equipment through high-level signaling (such as RRC signaling or media access control (media access control, MAC) control element (CE)) for the terminal, and the terminal receives the high-level signaling. Let, be able to obtain the first sequence.

In another possible implementation manner for obtaining the foregoing first sequence, the method shown in FIG. 3 may further include an optional operation 302: the terminal obtains d second sequences, and the terminal generates or calculates according to the d second sequences. The first sequence.

The terminal can obtain the aforementioned d second sequences in a variety of different ways. It is easy to understand that the terminal can also generate or calculate the above-mentioned first sequence according to the d second sequences in a variety of different ways. For specific implementation methods, please refer to the subsequent description, which will not be repeated here.

In the embodiments of the present application, there can be many different understandings of "the first sequence is related to the d second sequences". For example, “the first sequence is related to d second sequences” can be understood as the first sequence corresponds to d second sequences, that is, there is a corresponding relationship between the first sequence and the d second sequences. The d second sequences are included in M candidate second sequences, the first sequence is included in K candidate first sequences, d is an integer greater than 1, M is an integer greater than or equal to d, and K is greater than M Integer. Optionally, the above K candidate first sequences are included in the first sequence set. Optionally, the foregoing M candidate second sequences are included in the second sequence set.

The above "there is a correspondence between the first sequence and the d second sequences" can also be understood as the corresponding relationship between the K candidate first sequences and the M candidate second sequences, that is, one candidate in the K candidate first sequences The first sequence corresponds to d candidate second sequences in the M candidate second sequences, that is, one candidate first sequence corresponds to d candidate second sequences. Among them, K candidate first sequences and M candidate second sequences satisfy the first condition described below:

Optionally, the above-mentioned first sequence is one of the following: a preamble sequence, a DMRS sequence, a PTRS sequence, an SRS sequence, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a sequence of a discovery signal. The above-mentioned signal may be a signal sent by a terminal to a network device, or a signal sent by a terminal to one or more other terminals.

Optionally, the foregoing second sequence may also be referred to as a base sequence, and the foregoing second sequence set may also be referred to as a base sequence set. Optionally, the second sequence is a Zadoff-Chu (ZC) sequence, or a sequence obtained by performing first processing on the ZC sequence, and the first processing includes discrete Fourier transform (DFT) and/or cyclic shift. Bit (cyclic shift, CS). Alternatively, the second sequence may also be a pseudo random noise (PN) sequence or an m sequence.

In operation 302, the terminal may obtain the aforementioned d second sequences in a variety of different ways.

In a possible implementation manner for obtaining the foregoing d second sequences, the d second sequences are predefined, and the terminal may obtain the predefined d second sequences. For example, the d second sequences can be pre-stored in a corresponding device (for example, a memory, a cache, a storage medium, or other devices capable of storing data), and the terminal reads the d second sequences from the device, thereby Get the d second sequence.

In another possible implementation manner for obtaining the foregoing d second sequences, the method shown in FIG. 3 may further include optional operation 301: the network device sends configuration information to the terminal, and the configuration information configures the foregoing d second sequences. Sequence, the terminal receives the configuration information and obtains the above-mentioned d second sequences according to the configuration information. Optionally, the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.

In another possible implementation manner for obtaining the above-mentioned d second sequences, the terminal obtains the correspondence between the K candidate first sequences and the M candidate second sequences (it can also be understood as one of the K candidate first sequences). (Or any one) The corresponding relationship between the candidate first sequence and the d candidate second sequences among the M candidate second sequences), and the terminal obtains the aforementioned d second sequences according to the corresponding relationship. For example, the terminal may obtain the aforementioned d second sequences according to the identification information (such as a number or index) of the first sequence and the corresponding relationship. It can be understood that the K candidate first sequences and M candidate second sequences satisfy the aforementioned first condition.

In operation 302, the terminal may obtain the corresponding relationship between the K candidate first sequences and the M candidate second sequences in multiple ways. It can be understood that the terminal may obtain each candidate first sequence in the K candidate first sequences. Correspondence with d candidate second sequences in the M candidate second sequences, or the terminal can also obtain the partial candidate first sequences in the K candidate first sequences and each candidate first sequence and M candidates in the first sequence Correspondence of d candidate second sequences in the second sequence.

In a possible implementation manner for obtaining the correspondence between the K candidate first sequences and the M candidate second sequences, the correspondence is predefined, and the terminal can obtain the predefined correspondence. For example, the corresponding relationship may be pre-stored in a corresponding device (for example, a memory, a cache, a storage medium, or other devices capable of storing data), and the terminal reads the corresponding relationship from the device to obtain the corresponding relationship.

In another possible implementation manner for obtaining the correspondence between the K candidate first sequences and the M candidate second sequences, the method shown in FIG. 3 may further include an optional operation 301: the network device sends the configuration to the terminal Information, the configuration information configures the foregoing corresponding relationship, and the terminal receives the configuration information and obtains the foregoing corresponding relationship according to the configuration information. Optionally, the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.

It can be understood that there are many different implementations of the corresponding relationship. For example, the corresponding relationship can be realized in the form of a table, a function, or other data structures, such as an array, a queue, a container, a stack, a linear table, a pointer, a linked list, a tree, Implementation of graphs, structures, classes, heaps, hash tables, or hash tables.

Exemplarily, the correspondence between K candidate first sequences and M candidate second sequences may be shown in Table 1.

Table 1

00	11	22	33	44	55	66	77	……	kk	……	K-1K-1
m _0,1 m _0,1	m _1,1 m _1,1	m _2,1 m _2,1	m _3,1 m _3,1	m _4,1 m _4,1	m _5,1 m _5,1	m _6,1 m _6,1	m _7,1 m _7,1	……	m _k,1 m _k,1	……	m _K-1,1 m _K-1,1
m _0,2 m _0,2	m _1,2 m _1,2	m _2,2 m _2,2	m _3,2 m _3,2	m _4,2 m _4,2	m _5,2 m _5,2	m _6,2 m _6,2	m _7,2 m _7,2	……	m _k,2 m _k,2	……	m _K-1,2 m _K-1,2
……	……	……	……	……	……	……	……	……	……	……	……
m _0,d m _0,d	m _1,d m _1,d	m _2,d m _2,d	m _3,d m _3,d	m _4,d m _4,d	m _5,d m _5,d	m _6,d m _6,d	m _7,d m _7,d	……	m _k,d m _k,d	……	m _K-1,d m _K-1,d

In Table 1, the number of the candidate first sequence {x _k (n), n=0,1,...,N-1} is denoted by k, where k is an integer greater than or equal to 0 and less than K, and the candidate numbered k is One sequence corresponds to d candidate second sequences, and the numbers of the d candidate second sequences are m _k,1 ,m _k,2 ,...,m _{k,d respectively} . As shown in Table 1, the content corresponding to the first row of Table 1 is the number k of the K candidate first sequences, and the content corresponding to the second to d+1 rows of Table 1 is the number of the candidate second sequence. In Table 1, The content corresponding to the k+1th column is: d candidate second sequences corresponding to the candidate first sequence numbered k, the numbers of the d candidate second sequences are m _{k, 1} , m _{k, 2} … m _{k ,d} . Understandably, the candidate second sequence _{numbered m k,l is}

mk,l is an integer greater than or equal to 0 and less than M, and l is an integer less than or equal to d.

Exemplarily, taking K=640, M=64, and d=2 as an example, the correspondence between K candidate first sequences and M candidate second sequences can be shown in Table 2.

Table 2

00	11	22	33	44	55	66	77	88	……	639639
99	1414	1414	4040	1212	4747	5252	22twenty two	1919	……	1717
3131	4646	6262	6161	5858	4848	5959	5555	5757	……	5353

The content corresponding to the first row of Table 2 is the number or index k of the candidate first sequence (the range of k is 0-639, which is only an illustrative example), and the content corresponding to the second and third rows of Table 2 is The number of the candidate second sequence (m _k,1 and m _k,2 , where the value of k corresponds to the index k of the candidate first sequence). For example, the candidate first sequence with the number k of 1 corresponds to the candidate second sequence with the number 14 (m _1,1 =14) and the number 46 (m _1,2 =46). The candidate first sequence with the number k of 2 corresponds to the candidate second sequence with the number 14 (m _2,1 =14) and the candidate second sequence with the number 62 (m _{2,2 =62).} Table 2 is only an exemplary description of one possible manifestation of the foregoing correspondence relationship, and the embodiment of the present application does not limit the correspondence relationship shown in Table 2 to be adopted.

Optionally, the correspondence relationship may also be realized in the form of a function, and the function satisfies the aforementioned first condition. Exemplarily, taking the value of d as an example, that is, one candidate first sequence corresponds to two candidate second sequences, and the two candidate second sequences are obtained through functions f ₁ (k) and f ₂ (k). Number or index. The k in the function is the number or index of the candidate first sequence. Taking the value of k as 1 as an example (corresponding to the candidate first sequence numbered 1), the corresponding two candidate second sequence numbers are 14 (f ₁ (k)=14) and 46 (f ₂ (k)=46). The implementation of obtaining d second sequences through the function method is more simplified. It should be noted that this application does not limit other functions that can realize the foregoing correspondence relationship, or other implementation manners of the functions.

Exemplarily, the embodiment of the present application proposes several possible implementation manners for calculating the correspondence between the candidate first sequence with a number or index of k and the M candidate second sequences through a function.

In a possible implementation manner, for example, when d=2, the number f ₁ _{(k) of the candidate first sequence with the number or index of k and the number f 2} of the candidate second sequence with the number or index of k are (k) can be calculated by the following function:

f ₁ (k)=q+(p-1)·2 ^x ,

among them,

z=k+1-M ₀ ·(2 ^x-1 +y-2);

q=z-(p-1)·2 ^x-1 ;

M ₀ is half of the number M of candidate second sequences contained in the second sequence set,

Is a vector,

Means

The q (q=1, 2, 3,..., 2 ^x-1 ) element in.

by

After element replacement,

The s1 element in is

The s2-th element in, s1=s2+T(i)-2·((s2-1)mod T(i)+1)+1, T(i)=2 ⁱⁱ⁺¹ , ii is for i The number of prime factors 2 obtained by factorization. special,

It is easy to understand that this implementation exemplarily gives a _{calculation method for f 1} (k) and f ₂ (k), but it is not limited, other functions that can realize the above-mentioned correspondence relationship, or other implementation methods of the function . This implementation takes d=2 as an example, and d can also take other integer values greater than 1 and less than M, which is not limited in the embodiment of the present application.

In another possible implementation manner, for example, when d=2, the number f ₁ (k) of the candidate first sequence with the number or index of k and the number f 1 (k) of the candidate second sequence with the number or index of k ₂ (k) can be calculated using the following function:

f ₁ (k)=q+p·2 ^x+1 ,

among them,

z=kM ₀ ·(2 ^x +y-1);

q=zp·2 ^x ;

Is a vector,

Means

The q (q=0,1,2,...,2 ^x -1) element in.

by

After element replacement,

The s1 element in is

The s2 element in, s1=s2+T(i)-2·(s2 mod T(i))-1, T(i)=2 ⁱⁱ⁺¹ , ii is the prime factor obtained by factoring i The number of 2. special,

It is easy to understand that this implementation takes d=2 as an example, and d can also take other integer values greater than 1 and less than M, which is not limited in the embodiment of the present application.

In operation 302, the terminal may obtain the above-mentioned d second sequences according to the above-mentioned corresponding relationship in multiple ways.

In a possible implementation manner of obtaining the above d second sequences according to the above corresponding relationship, the terminal randomly selects a number or index k, and obtains d second sequences corresponding to the first sequence with the number or index k according to the corresponding relationship. The number or index. According to the number or index of the d second sequences, d second sequences are obtained from the M candidate second sequences.

Exemplarily, the terminal randomly selects a number k=1, and obtains the number or index corresponding to the first sequence with k=1 according to the above-mentioned corresponding relationship. The numbers or indexes of the d=2 second sequences are respectively m _1,1 = 14 and m _1,2 =46, the terminal obtains two second sequences numbered 14 and 46 from the M candidate second sequences.

In another possible implementation manner for obtaining the above d second sequences according to the above corresponding relationship, the number or index k of the above first sequence may be configured by the network device for the terminal. For example, the number or index k of the first sequence is configured by the network device through high-level signaling (such as RRC signaling or MAC CE) for the terminal, and the terminal can obtain the number or index of the first sequence by receiving the high-level signaling. k. The terminal obtains the number or index of the d second sequence corresponding to the first sequence with the number or index k according to the foregoing correspondence, and obtains d second sequences from the M candidate second sequences according to the number or index of the d second sequence. sequence.

In operation 310, there may be multiple different ways to generate or calculate the above-mentioned first sequence according to the above-mentioned d second sequences.

In a possible implementation manner of generating or calculating the foregoing first sequence according to the foregoing d second sequences, the terminal obtains the foregoing first sequence by adding the obtained foregoing d second sequences.

Exemplarily, a possible way of adding d second sequences to obtain the first sequence in an embodiment of the present application may be shown by the following method. The terminal obtains the d second sequences corresponding to the first sequence whose number or index is k are respectively

(Can be abbreviated as:

_{), the first sequence {x k} (n),n=0,1,...,N-1} with the number or index k can be obtained by the following addition method _{, (can be abbreviated as: {x k} (n) }):

among them,

It is the candidate second sequence numbered m _k,l among the M candidate second sequences, m _k,l is an integer greater than or equal to 0 and less than or equal to M-1, l is an integer less than d, and b is greater than 0 Integer.

For example, if the terminal obtains the number or index of the first sequence with k=1, the corresponding d=2 second sequences are {s ₁₄ (n)} and {s ₄₆ (n)}, and the numbers can be obtained by the following addition Or the first sequence {x ₁ (n)} with index k=1:

In another possible implementation manner of generating or calculating the foregoing first sequence according to the foregoing d second sequences, the terminal obtains the d second sequences corresponding to the first sequence whose number or index is k, respectively:

_{The first sequence {x 1} (n)} whose number or index is k can be obtained by the following calculation method:

Wherein, b and c are both integers greater than zero.

Among them, w _k,1 ,w _k,2 ,...,w _k,d are complex numbers, which can be understood as weighting parameters when generating the first sequence. It can be understood that the calculation method in this embodiment is only an example, and this application does not limit other possible calculation methods.

In a possible implementation manner of operation 320, the terminal sends the first sequence on different time domain resources. In other words, the terminal sends a part of the first sequence on a part of time domain resources, and the terminal sends a part of the first sequence on another part of time domain resources. Send another part of the first sequence. In the embodiment of this application, the transmission of the first sequence {x _k (n)} on the orthogonal frequency division multiplexing symbol (OFDM symbol, OS) is taken as an example to illustrate the transmission of the first sequence {x k (n)} on different time domain resources. The network device sends the first sequence, but this application does not limit the type of time domain resource. For example, the time domain resource may also be one or more time slots, one or more subframes, or one or more radio frames.

The first sequence {x _k (n)} and d second sequences

Corresponding, for example, the d second sequences may be obtained from the M candidate second sequences according to the above-mentioned corresponding relationship.

The first sequence is transmitted on different OSs, that is, a part of the first sequence is transmitted on one OS, and other parts of the first sequence are transmitted on other OSs. For example, if the first sequence is transmitted on T (T is an integer greater than 1) OS, the first OS transmits {x _k1 (n)}, and the second OS transmits {x _k2 (n)},..., The T-th OS transmission {x _kT (n)}, where {x _k1 (n)}, {x _k2 (n)},..., {x _kT (n)} constitute the above first sequence {x _k (n) )}. It can be understood that a part of the first sequence {x _k1 (n)} transmitted on the first OS may be generated by a number of second sequences among the d second sequences corresponding to the first sequence {x _{k (n)}} Or calculated. Exemplarily, a possible way of generating or calculating _{{x k1 (n)} is:}

Wherein, b is an integer greater than zero.

After the network device receives each part of the above-mentioned first sequence ({x _k1 (n)}, {x _k2 (n)},...,{x _kT (n)}) on T OSs, it uses M candidate sequences For any candidate second sequence in the second sequence, on its corresponding OS, perform a cross-correlation operation on the part of the first sequence on the OS (for example, convolution in the time domain, or in the frequency domain) Do a dot product) to obtain the cross-correlation sequence corresponding to any one of the M candidate second sequences. An algorithm (for example, a compressed sensing algorithm) is then used to obtain the number of the first sequence received.

Exemplarily, a first sequence {x ₁ (n)} numbered k=1 corresponds to d=4 second sequences

Choose to transmit the first sequence {x ₁ (n)} on T=2 OS. Transmit {x ₁₁ (n)} on the first OS and {x ₁₂ (n)} _{on the second OS. Understandably, {x 11} (n)} and {x ₁₂ (n)} are respectively A part of the first sequence {x ₁ (n)}, and {x ₁₁ (n)} and {x ₁₂ (n)} constitute the first sequence {x ₁ (n)}.

Exemplarily, {x ₁₁ (n)} and {x ₁₂ (n)} satisfy:

It is easy to understand that the foregoing first sequence is transmitted on multiple time domain resources, that is, the time domain resources used to transmit each part of the foregoing first sequence are not completely the same. The embodiment of the present application does not limit the number d of the second sequence included in the first sequence and the number of time domain resources used to transmit the first sequence.

In a possible implementation manner of operation 320, the terminal transmits the first sequence on different physical resources (for example, one or more of time domain resources, frequency resources, or code domain resources). This implementation is similar to the foregoing description of the terminal sending the first sequence on different time domain resources, and will not be repeated here.

In the foregoing various implementations for obtaining the first sequence, the values of K and M may be related to the signal type corresponding to the first sequence.

In the embodiment where the first sequence is the sequence of the preamble signal, the value of M can be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, Or 4, the value of K can be 640, 512, 320, 256, 160, or 128.

In the embodiment where the first sequence is a DMRS sequence, the value of M can be 6, 8, 12, 16, 18, 24, or 32, and the value of K can be 24, 32, 48, 64, 96, or 128.

The method shown in FIG. 3 may include optional operation 301, that is, the network device sends configuration information to the terminal, and the terminal obtains the configuration information.

The terminal can obtain the relevant parameters of the first sequence through the configuration information. These parameters may include one or more of the following: first sequence, d second sequences, candidate second sequence, candidate first sequence, parameter d, candidate The number K of the first sequence, the number M of the candidate second sequence, the number k of the first sequence, the number of d second sequences, and the parameter ε.

Optionally, the configuration information is carried by one or more of the following: system information, RRC, MAC CE, or control channel. It can be understood that the embodiment of the present application does not limit the quantity of configuration information in operation 301. In other words, the configuration information in operation 301 may be one piece of configuration information or multiple pieces of configuration information.

By configuring the parameters related to the first sequence through the above configuration method, different devices can use different parameters of the first sequence through configuration, thereby reducing interference between devices.

Another embodiment of the present application introduces a method for obtaining the correspondence between M candidate second sequences and K candidate first sequences when M candidate second sequences are known, and the M candidate second sequences And K candidate first sequences satisfy the aforementioned first condition.

The correspondence between the M candidate second sequences and the K candidate first sequences includes the correspondence between one candidate first sequence in the K candidate first sequences and d candidate second sequences in the M candidate second sequences. For the convenience of description, the correspondence between one candidate first sequence and d candidate second sequences is recorded as a set of correspondences. Exemplarily, a set of correspondences may be expressed as the number of the candidate first sequence numbered k corresponding to the number of the d candidate second sequences, for example, see Table 1 or Table 2.

The embodiment of the present application mainly introduces how to generate K sets of correspondences, that is, how to obtain the correspondences between K candidate first sequences and M candidate second sequences. FIG. 4A is a schematic flowchart of obtaining the corresponding relationship between the candidate second sequence and the candidate first sequence in an embodiment of the present application. The following will combine FIG. 4A in the embodiment of the present application on how to generate the above-mentioned corresponding relationship based on the M candidate second sequences and The method that satisfies the aforementioned first condition is described in detail. It can be understood that the method introduced in this embodiment can be implemented on both the terminal and the network side. In this embodiment, the terminal is used as an execution subject for introduction. The method illustrated in FIG. 4A includes:

Operation 410: The terminal determines the parameters of the candidate first sequence and the candidate second sequence. This parameter includes: the number of groups K of the corresponding relationship to be generated (also can be understood as the number of candidate first sequences), the number of candidate second sequences M, the number of candidate second sequences corresponding to a candidate first sequence d, Parameter s, and probability P. Optionally, the above-mentioned parameters may be predefined or configured by the network device for the terminal.

ε is initialized to 0, and the number of groups k of the generated correspondence is initialized to 0. Wherein, for the number of groups k of the generated correspondence relationship, the k candidate first sequences and the M candidate second sequences in the k sets of correspondence relationships are the aforementioned first conditions.

Operation 420: Determine whether k has reached K, if operation 430 has not been performed, if it is reached, the process ends.

Operation 430: reset the size S of the unused candidate correspondence set according to the value of k (for example:

). The set of unused candidate correspondence relationships is the number k of the set of all possible correspondence relationships minus the generated correspondence relationship. Exemplarily, the candidate correspondence relationship set is composed of all possible permutations and combinations of d candidate sequences arbitrarily selected from M candidate second sequences (all possible permutations and combinations total

One), the one "permutation and combination" is recorded as a candidate correspondence. Exemplary,

Indicates the number of all possible permutations and combinations of d selected arbitrarily from M. Unused candidate correspondences are limited. For example, for the case of M=100, d=2, there are a total of candidate correspondences

One, that is, when k=50, that is, when 50 correspondences satisfying the aforementioned first condition have been generated, there are 4900 unused candidate correspondences left, and the size of the set of unused candidate relations

It is easy to understand that a corresponding relationship is generated, and the size of the unused candidate corresponding relationship set is reduced by one. The embodiment of the present application does not limit other ways of calculating S.

Operation 440: Select one candidate correspondence from the set of S unused candidate correspondences, and the corresponding S=S-1.

It can be understood that a candidate correspondence relationship is selected in operation 440, and k+1 sequences (k candidate first sequences and a sequence generated according to the candidate correspondence relationship selected in operation 440) will be determined in the subsequent operation 450. And whether the M candidate second sequences meet the aforementioned first condition, if they are satisfied, the number of candidate first sequences is updated to k+1.

Operation 450: Determine whether the aforementioned first condition is satisfied. The number of groups of the generated correspondence is min(0,k), that is, the min(0,k) (k>0 when min(0,k)=k) candidate first sequence and M candidates The second sequence satisfies the aforementioned first condition.

Let the candidate first sequence numbered k use the candidate correspondence relationship, and the min(s,k+1) candidate first sequences in the k+1 candidate first sequence correspond to d×min(s,k+1) Candidate second sequence, judge that there are at least d×(1-ε)×min(s,k+1) candidate second sequences in the d×min(s,k+1) candidate second sequences Whether the probability of the sequence is greater than or equal to P. If the probability is greater than or equal to P, then k=k+1, and proceed to operation 420. If the probability is not greater than or equal to P, then go to operation 460.

Operation 460: Determine whether the size S of the unused candidate correspondence set is greater than 0, and if it is greater than 0, proceed to operation 440. If it is not greater than 0, then ε is set to ε+1/(d×s), and operation 430 is performed. Wherein, S in operation 460 is not greater than 0, which can be understood as having traversed the unused candidate correspondence relationship and none of them satisfy the aforementioned first condition.

It is easy to understand that the terminal can obtain the correspondence between the M candidate second sequences and the K candidate first sequences according to the method described in the method 400, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first sequence. One condition. It can be understood that the network device can also obtain the correspondence between the M candidate second sequences and the K candidate first sequences according to the method described in the method 400, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first sequence. One condition.

FIG. 4B is another schematic diagram of the process for obtaining the correspondence between the candidate second sequence and the candidate first sequence in an embodiment of the present application. The following will combine FIG. 4B in the embodiment of the present application on how to generate the above-mentioned correspondence based on the M candidate second sequences The method that meets the aforementioned first condition will be described in detail. It can be understood that the method introduced in this embodiment can be implemented on both the terminal and the network side. In this embodiment, the terminal is used as an execution subject for introduction. The method illustrated in FIG. 4B includes:

Operation 810: Determine the parameters of the first sequence and the second sequence. The parameters include: the first sequence set contains the number K of candidate first sequences, the second sequence set contains the number M of candidate second sequences, and the number d of candidate first sequences corresponding to the candidate second sequences. Optionally, the parameter may be pre-defined or specified, for example, configured through the configuration information of operation 310 in FIG. 3.

The maximum allowable gap g is initialized to 1, and the number k of the determined candidate first sequences is initialized to 0.

Operation 820: Determine whether k has reached K, if operation 830 has not been performed, if it is reached, the process ends.

Operation 830: reset the size of the unused candidate correspondence set

The size of the unused candidate correspondence set is reset according to the value of k. The unused candidate correspondence relationship set includes all possible correspondence relationships that are not used by the determined k first sequences. It should be noted that the unused candidate correspondences are limited. For example, for the case of M=100 and d=2, there are a total of candidate correspondences

One, that is, when k=50, that is, when 0 to 49 correspondences that meet the conditions have been used, there are 4900 unused candidate correspondences left, and the size of the set of unused candidate relations

It is easy to understand that each time a candidate correspondence is used, the size of the unused candidate correspondence set is reduced by one.

Operation 840: Select a candidate correspondence from the set of S unused candidate correspondences, and the corresponding S=S-1.

Operation 850: Determine whether the candidate corresponding relationship selected in operation 840 satisfies the condition.

Let the candidate first sequence number k use the candidate correspondence relationship, and count the total number of times each candidate second sequence is corresponding to the candidate first sequences numbered 0 to k. The difference between the maximum value and the minimum value of the total number of times the candidate second sequence is corresponding is calculated. If the difference is less than or equal to g, then k+1, and go to operation 820. If the difference is greater than g, then go to operation 860.

Operation 860: Determine whether the size S of the unused candidate correspondence set is greater than 0, and if it is greater than 0, proceed to operation 840. If it is not greater than 0, g is set to g+1, and operation 830 is performed.

It is easy to understand that the terminal can obtain the correspondence between M candidate second sequences and K candidate first sequences according to the method described in method 800, and the M candidate second sequences and K candidate first sequences satisfy the aforementioned first sequence. One condition. It can be understood that the network device may also obtain the correspondence between the M candidate second sequences and the K candidate first sequences according to the method described in the method 800, and the M candidate second sequences and the K candidate first sequences satisfy the aforementioned first sequence. One condition.

Corresponding to the methods given in the foregoing method embodiments, the embodiments of the present application also provide corresponding devices, including corresponding modules for executing the foregoing embodiments. The module can be software, hardware, or a combination of software and hardware.

Figure 5 shows a schematic diagram of the structure of a device. The device 500 may be a network device, a terminal device, a chip, a chip system, or a processor that supports the network device to implement the above method, or a chip, a chip system, or a chip that supports the terminal device to implement the above method. Or processor, etc. The device can be used to implement the method described in the foregoing method embodiment, and for details, please refer to the description in the foregoing method embodiment.

The device 500 may include one or more processors 501, and the processor 501 may also be referred to as a processing unit, which may implement certain control functions. The processor 501 may be a general-purpose processor or a special-purpose processor. For example, it can be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processor can be used to control communication devices (such as base stations, baseband chips, terminals, terminal chips, DU or CU, etc.), execute software programs, and process The data of the software program.

In an optional design, the processor 501 may also store instructions and/or data 503, and the instructions and/or data 503 may be executed by the processor, so that the apparatus 500 executes the above method embodiments. Described method.

In another alternative design, the processor 501 may include a transceiver unit for implementing receiving and sending functions. For example, the transceiver unit may be a transceiver circuit, or an interface, or an interface circuit. The transceiver circuits, interfaces, or interface circuits used to implement the receiving and transmitting functions can be separated or integrated. The foregoing transceiver circuit, interface, or interface circuit may be used for code/data reading and writing, or the foregoing transceiver circuit, interface, or interface circuit may be used for signal transmission or transmission.

In another possible design, the apparatus 500 may include a circuit, which may implement the sending or receiving or communication functions in the foregoing method embodiments.

Optionally, the device 500 may include one or more memories 502, on which instructions 504 may be stored, and the instructions may be executed on the processor, so that the device 500 executes the foregoing method embodiments. Described method. Optionally, data may also be stored in the memory. Optionally, instructions and/or data may also be stored in the processor. The processor and the memory can be provided separately or integrated together. For example, the corresponding relationship described in the foregoing method embodiment may be stored in a memory or in a processor.

Optionally, the device 500 may further include a transceiver 505 and/or an antenna 506. The processor 501 may be referred to as a processing unit, and controls the apparatus 500. The transceiver 505 may be called a transceiver unit, a transceiver, a transceiver circuit, a transceiver device, or a transceiver module, etc., for implementing the transceiver function.

Optionally, the apparatus 500 in the embodiment of the present application may be used to execute the method described in FIG. 3 in the embodiment of the present application.

In a possible design, the apparatus 500 may correspond to the terminal device in the above method embodiment, and may also correspond to a chip, a chip system, or a processor that supports the terminal device to implement the above method.

In a possible implementation manner, the apparatus 500 includes a processor 501 and a transceiver 505. The processor 501 is used to obtain the first sequence {x(n), n=0,1,...,N-1}, (abbreviated as: {x(n)}), and the transceiver 505 is used to output the first sequence A sequence {x(n)}, where the first sequence {x(n)} and d second sequences {{s ₁ (n),n=0,1,...,N-1},{s ₂ (n),n=0,1,…,N-1,…,sdn,n=0,1,…,N-1 (abbreviated as: {s1n,s2n,…,{sdn}}) . The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is An integer greater than M.

The above device 500 selects d second sequences according to the correspondence relationship between K candidate first sequences and M candidate second sequences to generate or calculate the first sequence, where the candidate first sequence and the candidate second sequence meet the corresponding conditions, increase Therefore, the capacity of the sequence corresponding to the terminal signal can be expanded in limited physical resources to meet the needs of a large number of terminals for accessing the network or sending signals. In addition, since the first sequence and the second sequence in the above method both have low cross-correlation characteristics, it is possible to expand the sequence capacity corresponding to the terminal signal while ensuring good detection performance for the sequence corresponding to the terminal signal.

In some possible implementation manners of the foregoing apparatus 500, the correspondence relationship may be implemented in the form of a table, or may be implemented in the form of a function, or may be implemented in other data structures, such as arrays, queues, containers, and stacks. , Linear table, pointer, linked list, tree, graph, structure, class, heap, hash table or hash table etc.

In some possible implementations of the foregoing apparatus 500, the transceiver 505 is also used to receive configuration information, which configures d second sequences {{s ₁ (n)}, {s ₂ (n)},..., {s _d (n)}}, or the configuration information configures the first sequence {x(n)} and d second sequences {{s ₁ (n)},{s ₂ (n)},...,{ s _d (n)}} corresponding relationship. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.

In some possible implementation manners of the foregoing apparatus 500, the processor 501 is further configured to obtain d second sequences {{s ₁ (n)}, {s ₂ (n)}, according to the foregoing configuration information received by the transceiver 505, …,{S _d (n)}}.

In some possible implementation manners of the foregoing apparatus 500, the transceiver 505 and/or the processor 501 are further configured to obtain the correspondence between the K candidate first sequences and the M candidate second sequences, and the processor 501 is further configured to This correspondence relationship obtains the aforementioned d second sequences {{s ₁ (n)}, {s ₂ (n)},..., {s _d (n)}}.

In some possible implementation manners of the foregoing apparatus 500, the processor 501 is further configured to perform according to the foregoing d second sequences {{s ₁ (n)}, {s ₂ (n)},..., {s _d (n) }} Generate or calculate the above-mentioned first sequence {x(n)}.

In some possible implementation manners of the foregoing apparatus 500, the foregoing first sequence is one of the following: preamble sequence, DMRS sequence, PTRS sequence, SRS sequence, synchronization signal sequence, measurement reference signal sequence, or discovery signal the sequence of. Optionally, when the first sequence is the sequence of the preamble signal, the value of M can be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8. , Or 4, the value of K can be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a DMRS sequence, the value of M may be 6, 8, 12, 16, 18, 24, or 32, and the value of K may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.

In some possible implementation manners of the foregoing apparatus 500, the foregoing second sequence is a ZC sequence or a sequence obtained from the ZC sequence through the first processing, and the first processing includes one or more of the following: Discrete Fourier Transform DFT, or cyclic shift.

Optionally, the apparatus 500 in the embodiment of the present application may be used to execute the method described in FIG. 4A in the embodiment of the present application.

In a possible implementation manner, the apparatus 500 includes a processor 501. The processor 501 is further configured to determine the parameters of the candidate first sequence and the candidate second sequence. This parameter includes: the number of groups K of the corresponding relationship to be generated (also can be understood as the number of candidate first sequences), the number of candidate second sequences M, the number of candidate second sequences corresponding to a candidate first sequence d, Parameter s, and probability P. Optionally, the apparatus 500 may include a memory 502, and the aforementioned parameters may be predefined in the memory 502. Or, optionally, the apparatus 500 may include a transceiver 505, and the foregoing parameters may be received by the transceiver 505 from a network device.

Optionally, the processor 501 is further configured to initialize ε to 0, and initialize the number of groups k of the generated correspondence to 0.

Optionally, the processor 501 is further configured to determine whether k has reached K, if operation 430 is not performed, and if it is reached, the process ends.

Optionally, the processor 501 is further configured to reset the size S of the unused candidate correspondence set according to the value of k.

Optionally, the processor 501 is further configured to select a candidate correspondence from the set of S unused candidate correspondences, and the corresponding S=S-1.

Optionally, the processor 501 is further configured to determine whether the aforementioned first condition is satisfied. . If the probability is greater than or equal to P, then k=k+1, and proceed to operation 420. If the probability is not greater than or equal to P, then go to operation 460.

Optionally, the processor 501 is further configured to determine whether the size S of the unused candidate correspondence set is greater than zero. If it is greater than 0, proceed to operation 440. If it is not greater than 0, then ε is set to ε+1/(d×s), and operation 430 is performed.

Optionally, the apparatus 500 in the embodiment of the present application may be used to execute the method described in FIG. 4B in the embodiment of the present application.

In a possible implementation manner, the apparatus 500 includes a processor 501. The processor 501 is further configured to determine the parameters of the candidate first sequence and the candidate second sequence. The parameters include: the number of groups K of the corresponding relationship to be generated (also can be understood as the number of candidate first sequences), the number of candidate second sequences M, and the number of candidate second sequences corresponding to one candidate first sequence d. Optionally, the apparatus 500 may include a memory 502, and the aforementioned parameters may be predefined in the memory 502. Or, optionally, the apparatus 500 may include a transceiver 505, and the foregoing parameters may be received by the transceiver 505 from a network device.

Optionally, the processor 501 is further configured to initialize g to 1, and initialize the number of groups k of the generated correspondence to 0.

Optionally, the processor 501 is further configured to determine whether k has reached K, if operation 830 is not performed, and if it is reached, the process ends.

Optionally, the processor 501 is further configured to determine whether the aforementioned first condition is satisfied. The difference between the maximum value and the minimum value of the total number of times the candidate second sequence is corresponding is calculated. If the difference is less than or equal to g, then k=k+1, and go to operation 820. If the difference is greater than g, then go to operation 860.

Optionally, the processor 501 is further configured to determine whether the size S of the unused candidate correspondence set is greater than zero. If it is greater than 0, go to operation 840. If it is not greater than 0, g is set to g+1, and operation 830 is performed.

In a possible design, the apparatus 500 may correspond to the network device in the above method embodiment, and may also correspond to a component of the network device (for example, an integrated circuit, a chip, or a processor, etc.).

In a possible implementation manner, the apparatus 500 includes a transceiver 505 and a processor 501. The transceiver 505 is used to receive the first sequence {x(n), n=0,1,...,N-1}, (abbreviated as: {x(n)}), and the processor 501 is used to process the first sequence {x(n), n=0,1,...,N-1} A sequence {x(n)}, where the first sequence {x(n)} and d second sequences {{s ₁ (n),n=0,1,...,N-1},{s ₂ (n),n=0,1,…,N-1,…,sdn,n=0,1,…,N-1 (abbreviated as: {s1n,s2n,…,{sdn}}) . The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is An integer greater than M.

Through the above-mentioned device 500, d second sequences are selected to generate or calculate the first sequence according to the correspondence between the K candidate first sequences and the M candidate second sequences, where the candidate first sequence and the candidate second sequence satisfy the corresponding conditions , Increase the capacity of the sequence corresponding to the terminal signal, so that the capacity of the sequence corresponding to the terminal signal can be expanded in the limited physical resources, and meet the needs of a large number of terminals to access the network or send signals. In addition, since the first sequence and the second sequence in the above method both have low cross-correlation characteristics, it is possible to expand the sequence capacity corresponding to the terminal signal while ensuring good detection performance for the sequence corresponding to the terminal signal.

In some possible implementation manners of the foregoing apparatus 500, the transceiver 505 is further configured to send configuration information to the terminal, and the configuration information configures d second sequences {{s ₁ (n)}, {s ₂ (n)}, …,{S _d (n)}}, or the configuration information configures the first sequence {x(n)} and d second sequences {{s ₁ (n)},{s ₂ (n)},... ,{s _d (n)}} corresponding relationship. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.

In some possible implementation manners of the foregoing apparatus 500, the foregoing first sequence is one of the following: preamble sequence, DMRS sequence, PTRS sequence, SRS sequence, synchronization signal sequence, measurement reference signal sequence, or discovery signal the sequence of. Optionally, when the first sequence is a preamble sequence, the value of M can be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4. The value of K can be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a DMRS sequence, the value of M may be 6, 8, 12, 16, 18, 24, or 32, and the value of K may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.

By configuring the parameters related to the first sequence to the terminal through the above-mentioned apparatus 500, different devices can use different first sequence parameters through configuration, thereby reducing interference between devices.

In a possible design, the apparatus 500 may correspond to the network device in the above method embodiment, and may also correspond to a component of the network device (for example, an integrated circuit, a chip, or a processor, etc.) for executing the present invention. Apply the method described in Figure 4A or 4B in the Examples.

The processor and transceiver described in this application can be implemented in integrated circuit (IC), analog IC, radio frequency integrated circuit RFIC, mixed signal IC, application specific integrated circuit (ASIC), printed circuit board ( printed circuit board, PCB), electronic equipment, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductor (CMOS), nMetal-oxide-semiconductor (NMOS), and P-type Metal oxide semiconductor (positive channel metal oxide semiconductor, PMOS), bipolar junction transistor (BJT), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.

The device described in the above embodiment may be a network device or a terminal device, but the scope of the device described in this application is not limited to this, and the structure of the device may not be limited by FIG. 5. The device can be a stand-alone device or can be part of a larger device. For example, the device may be:

(1) Independent integrated circuit IC, or chip, or, chip system or subsystem;

(2) A collection with one or more ICs. Optionally, the IC collection may also include storage components for storing data and/or instructions;

(3) ASIC, such as modem (MSM);

(4) Modules that can be embedded in other equipment;

(5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handhelds, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, etc.;

(6) Others, etc.

Figure 6 provides a schematic structural diagram of a terminal. The terminal device can be applied to the scenario shown in FIG. 1. For ease of description, FIG. 6 only shows the main components of the terminal device. As shown in FIG. 6, the terminal device 600 includes a processor, a memory, a control circuit, an antenna, and an input and output device. The processor is mainly used to process the communication protocol and communication data, and to control the entire terminal, execute the software program, and process the data of the software program. The memory is mainly used to store software programs and data. The radio frequency circuit is mainly used for the conversion of baseband signal and radio frequency signal and the processing of radio frequency signal. The antenna is mainly used to send and receive radio frequency signals in the form of electromagnetic waves. Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly used to receive data input by users and output data to users.

When the terminal device is turned on, the processor can read the software program in the storage unit, parse and execute the instructions of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor performs baseband processing on the data to be sent, and outputs the baseband signal to the radio frequency circuit. The radio frequency circuit processes the baseband signal to obtain a radio frequency signal and sends the radio frequency signal out in the form of electromagnetic waves through the antenna. . When data is sent to the terminal equipment, the radio frequency circuit receives the radio frequency signal through the antenna, the radio frequency signal is further converted into a baseband signal, and the baseband signal is output to the processor, and the processor converts the baseband signal into data and performs processing on the data. deal with.

For ease of description, FIG. 6 only shows a memory and a processor. In an actual terminal device, there may be multiple processors and memories. The memory may also be referred to as a storage medium or a storage device, etc., which is not limited in the embodiment of the present invention.

As an optional implementation, the processor may include a baseband processor and a central processing unit. The baseband processor is mainly used to process communication protocols and communication data. The central processing unit is mainly used to control the entire terminal device and execute Software program, processing the data of the software program. The processor in FIG. 6 integrates the functions of the baseband processor and the central processing unit. Those skilled in the art can understand that the baseband processor and the central processing unit may also be independent processors and are interconnected by technologies such as a bus. Those skilled in the art can understand that the terminal device may include multiple baseband processors to adapt to different network standards, the terminal device may include multiple central processors to enhance its processing capabilities, and the various components of the terminal device may be connected through various buses. The baseband processor can also be expressed as a baseband processing circuit or a baseband processing chip. The central processing unit can also be expressed as a central processing circuit or a central processing chip. The function of processing the communication protocol and the communication data may be built in the processor, or stored in the storage unit in the form of a software program, and the processor executes the software program to realize the baseband processing function.

In an example, an antenna and a control circuit with a transceiving function can be regarded as the transceiving unit 611 of the terminal device 600, and a processor with a processing function can be regarded as the processing unit 612 of the terminal device 600. As shown in FIG. 6, the terminal device 600 includes a transceiving unit 611 and a processing unit 612. The transceiving unit may also be referred to as a transceiver, a transceiver, a transceiving device, and so on. Optionally, the device for implementing the receiving function in the transceiving unit 611 can be regarded as the receiving unit, and the device for implementing the sending function in the transceiving unit 611 can be regarded as the sending unit, that is, the transceiving unit 611 includes a receiving unit and a sending unit. Exemplarily, the receiving unit may also be called a receiver, a receiver, a receiving circuit, etc., and the sending unit may be called a transmitter, a transmitter, or a transmitting circuit, etc. Optionally, the foregoing receiving unit and sending unit may be an integrated unit or multiple independent units. The above-mentioned receiving unit and sending unit may be in one geographic location, or may be scattered in multiple geographic locations.

As shown in FIG. 7, another embodiment of the present application provides an apparatus 700. The device can be a terminal or a component of the terminal (for example, an integrated circuit, a chip, etc.). Alternatively, the device may be a network device, or a component of a network device (for example, an integrated circuit, a chip, etc.). The device may also be another communication module, which is used to implement the method in the method embodiment of the present application. The apparatus 700 may include: a processing module 702 (processing unit). Optionally, it may also include a transceiving module 701 (transceiving unit) and a storage module 703 (storage unit).

In a possible design, one or more modules in Figure 7 may be implemented by one or more processors, or by one or more processors and memories; or by one or more processors It may be implemented with a transceiver; or implemented by one or more processors, memories, and transceivers, which is not limited in the embodiment of the present application. The processor, memory, and transceiver can be set separately or integrated.

The device has the function of implementing the terminal described in the embodiment of the application. For example, the device includes a module or unit or means corresponding to the terminal to execute the steps described in the embodiment of the application. The function or unit is Means can be implemented through software, or through hardware, or through hardware executing corresponding software, or through a combination of software and hardware. For details, reference may be made to the corresponding description in the foregoing corresponding method embodiment. Alternatively, the device has the function of implementing the network device described in the embodiment of this application. For example, the device includes the module or unit or means corresponding to the network device executing the steps involved in the network device described in the embodiment of this application. The functions or units or means (means) can be realized by software, or by hardware, or by hardware executing corresponding software, or by a combination of software and hardware. For details, reference may be made to the corresponding description in the foregoing corresponding method embodiment.

Optionally, the apparatus 700 in the embodiment of the present application may be used to execute the method described in FIG. 3 in the embodiment of the present application.

In a possible design, the apparatus 700 may correspond to the terminal device in the foregoing method embodiment, for example, may be a terminal device, or a chip, a chip system, or a processor that supports the terminal device to implement the foregoing method.

In a possible implementation manner, the apparatus 700 includes a processing module 702 and a transceiver module 701. The processing module 702 is used to obtain the first sequence {x(n),n=0,1,...,N-1}, (abbreviated as: {x(n)}), and the transceiver module 701 is used to output the first sequence A sequence {x(n)}, where the first sequence {x(n)} and d second sequences {{s ₁ (n),n=0,1,...,N-1},{s ₂ (n),n=0,1,…,N-1},…,{s _d (n),n=0,1,…,N-1}} (abbreviated as: {{s ₁ ( n)},{s ₂ (n)},…,{s _d (n)}}) are related. The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is An integer greater than M.

The above-mentioned apparatus 700 selects d second sequences according to the correspondence relationship between K candidate first sequences and M candidate second sequences to generate or calculate the first sequence, where the candidate first sequence and the candidate second sequence meet the corresponding conditions, increase Therefore, the capacity of the sequence corresponding to the terminal signal can be expanded in limited physical resources to meet the needs of a large number of terminals for accessing the network or sending signals. In addition, since the first sequence and the second sequence in the above method both have low cross-correlation characteristics, it is possible to expand the sequence capacity corresponding to the terminal signal while ensuring good detection performance for the sequence corresponding to the terminal signal.

In some possible implementation manners of the foregoing apparatus 700, the correspondence relationship may be implemented in the form of a table, or may be implemented in the form of a function, or may be implemented in other data structures, such as arrays, queues, containers, and stacks. , Linear table, pointer, linked list, tree, graph, structure, class, heap, hash table or hash table etc.

In some possible implementations of the foregoing apparatus 700, the transceiver module 701 is also used to receive configuration information that configures d second sequences {{s ₁ (n)}, {s ₂ (n)},... ,{s _d (n)}}, or the configuration information configures the first sequence {x(n)} and d second sequences {{s ₁ (n)},{s ₂ (n)},..., {s _d (n)}} corresponding relationship. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.

In some possible implementation manners of the foregoing apparatus 700, the processing module 702 is further configured to obtain d second sequences {{s ₁ (n)}, {s ₂ (n)}, according to the foregoing configuration information received by the transceiver module 701, …,{S _d (n)}}.

In some possible implementation manners of the foregoing apparatus 700, the transceiver module 701 and/or the processing module 702 are further configured to obtain the correspondence between the K candidate first sequences and the M candidate second sequences, and the processing module 702 is further configured to This correspondence relationship obtains the aforementioned d second sequences {{s ₁ (n)}, {s ₂ (n)},..., {s _d (n)}}.

In some possible implementations of the foregoing apparatus 700, the processing module 702 is further configured to perform according to the foregoing d second sequences {{s ₁ (n)}, {s ₂ (n)},..., {s _d (n) }} Generate or calculate the above-mentioned first sequence {x(n)}.

In some possible implementation manners of the foregoing apparatus 700, the foregoing first sequence is one of the following: preamble sequence, DMRS sequence, PTRS sequence, SRS sequence, synchronization signal sequence, measurement reference signal sequence, or discovery signal the sequence of. Optionally, when the first sequence is the sequence of the preamble signal, the value of M can be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8. , Or 4, the value of K can be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a DMRS sequence, the value of M may be 6, 8, 12, 16, 18, 24, or 32, and the value of K may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.

In some possible implementation manners of the foregoing apparatus 700, the foregoing second sequence is a ZC sequence, or a sequence obtained from the ZC sequence through the first processing, and the first processing includes one or more of the following: Discrete Fourier Transform DFT, or cyclic shift.

Optionally, the apparatus 700 in the embodiment of the present application may be used to execute the method described in FIG. 4A in the embodiment of the present application.

In a possible implementation manner, the apparatus 700 includes a processing module 702. The processing module 702 is used to determine the parameters of the candidate first sequence and the candidate second sequence. This parameter includes: the number of groups K of the corresponding relationship to be generated (also can be understood as the number of candidate first sequences), the number of candidate second sequences M, the number of candidate second sequences corresponding to a candidate first sequence d, Parameter s, and probability P. Optionally, the device 700 includes a storage module 703, and the aforementioned parameters may be predefined in the storage module 703. Or, optionally, the apparatus 700 includes a transceiver module 701, and the foregoing parameters may be received by the transceiver module 701 from a network device.

Optionally, the processing module 702 is further configured to initialize ε to 0, and initialize the number of groups k of the generated correspondence to 0.

Optionally, the processing module 702 is also used to determine whether k has reached K, if operation 430 is not performed, and if it is reached, the process ends.

Optionally, the processing module 702 is further configured to reset the size S of the unused candidate correspondence set according to the value of k.

Optionally, the processing module 702 is further configured to select a candidate correspondence from the set of S unused candidate correspondences, and the corresponding S=S-1.

Optionally, the processing module 702 is further configured to determine whether the aforementioned first condition is satisfied. . If the probability is greater than or equal to P, then k=k+1, and proceed to operation 420. If the probability is not greater than or equal to P, then go to operation 460.

Optionally, the processing module 702 is further configured to determine whether the size S of the unused candidate correspondence set is greater than zero. If it is greater than 0, proceed to operation 440. If it is not greater than 0, then ε is set to ε+1/(d×s), and operation 430 is performed.

Optionally, the apparatus 700 in the embodiment of the present application may be used to execute the method described in FIG. 4B in the embodiment of the present application.

In a possible implementation manner, the apparatus 700 includes a processing module 702. The processing module 702 is used to determine the parameters of the candidate first sequence and the candidate second sequence. The parameters include: the number of groups K of the corresponding relationship to be generated (also can be understood as the number of candidate first sequences), the number of candidate second sequences M, and the number of candidate second sequences corresponding to one candidate first sequence d. Optionally, the device 700 includes a storage module 703, and the aforementioned parameters may be predefined in the storage module 703. Or, optionally, the apparatus 700 includes a transceiver module 701, and the foregoing parameters may be received by the transceiver module 701 from a network device.

Optionally, the processing module 702 is further configured to initialize g to 1, and initialize the number of groups k of the generated correspondence to 0.

Optionally, the processing module 702 is also used to determine whether k has reached K, if operation 830 is not performed, and if it is reached, the process ends.

Optionally, the processing module 702 is further configured to determine whether the aforementioned first condition is satisfied. The difference between the maximum value and the minimum value of the total number of times the candidate second sequence is corresponding is calculated. If the difference is less than or equal to g, then k=k+1, and go to operation 820. If the difference is greater than g, then go to operation 860.

Optionally, the processing module 702 is further configured to determine whether the size S of the unused candidate correspondence set is greater than zero. If it is greater than 0, go to operation 840. If it is not greater than 0, g is set to g+1, and operation 830 is performed.

In a possible design, the apparatus 700 may correspond to the network device in the above method embodiment, and may also correspond to a component of the network device (for example, an integrated circuit, a chip, or a processor, etc.).

In a possible implementation manner, the apparatus 700 includes a transceiver module 701 and a processing module 702. The transceiver module 701 is also used to receive the first sequence {x(n),n=0,1,...,N-1}, (abbreviated as: {x(n)}), and the processing module 702 is also used to To process the first sequence {x(n)}, where the first sequence {x(n)} and d second sequences {{s ₁ (n),n=0,1,...,N-1 },{s ₂ (n),n=0,1,…,N-1},…,{s _d (n),n=0,1,…,N-1}} (abbreviated as: { {s ₁ (n)},{s ₂ (n)},…,{s _d (n)}}) are related. The d second sequences are included in M candidate second sequences, and the first sequence is included in K candidate first sequences, where d is an integer greater than 1, M is an integer greater than or equal to d, and K is An integer greater than M.

Through the above-mentioned device 700, d second sequences are selected to generate or calculate the first sequence according to the correspondence between the K candidate first sequences and the M candidate second sequences, where the candidate first sequence and the candidate second sequence satisfy the corresponding conditions , Increase the capacity of the sequence corresponding to the terminal signal, so that the capacity of the sequence corresponding to the terminal signal can be expanded in the limited physical resources, and meet the needs of a large number of terminals to access the network or send signals. In addition, since the first sequence and the second sequence in the above method both have low cross-correlation characteristics, it is possible to expand the sequence capacity corresponding to the terminal signal while ensuring good detection performance for the sequence corresponding to the terminal signal.

In some possible implementation manners of the foregoing apparatus 700, the transceiver module 701 is further configured to send configuration information to the terminal, where the configuration information configures d second sequences {{s ₁ (n)}, {s ₂ (n)} ,…,{S _d (n)}}, or the configuration information configures the first sequence {x(n)} and d second sequences {{s ₁ (n)},{s ₂ (n)}, …, {s _d (n)}} correspondence. Optionally, the configuration information is predefined, or the configuration information is carried by one or more of the following: system information, RRC signaling, MAC CE, or control channel.

In some possible implementation manners of the foregoing apparatus 700, the foregoing first sequence is one of the following: preamble sequence, DMRS sequence, PTRS sequence, SRS sequence, synchronization signal sequence, measurement reference signal sequence, or discovery signal the sequence of. Optionally, when the first sequence is a preamble sequence, the value of M can be 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4. The value of K can be 640, 512, 320, 256, 160, or 128, but this application does not limit other values of N and M. Optionally, when the first sequence is a DMRS sequence, the value of M may be 6, 8, 12, 16, 18, 24, or 32, and the value of K may be 24, 32, 48, 64, 96, or 128, but this application does not limit other values of N and M.

By configuring the parameters related to the first sequence to the terminal through the above-mentioned apparatus 700, different devices can use different first sequence parameters through configuration, thereby reducing interference between devices.

In a possible design, the apparatus 700 may correspond to the network device in the above method embodiment, and may also correspond to a component of the network device (for example, an integrated circuit, a chip, or a processor, etc.) for executing the method. Apply the method described in Figure 4A or 4B in the Examples.

It is understandable that some optional features in the embodiments of the present application, in some scenarios, may not depend on other features, such as the solutions they are currently based on, but can be implemented independently to solve the corresponding technical problems and achieve the corresponding The effect can also be combined with other features according to requirements in certain scenarios. Correspondingly, the devices given in the embodiments of the present application can also implement these features or functions accordingly, which will not be repeated here.

Those skilled in the art may also understand that various illustrative logical blocks and steps listed in the embodiments of the present application can be implemented by electronic hardware, computer software, or a combination of the two. Whether such a function is implemented by hardware or software depends on the specific application and the design requirements of the entire system. Those skilled in the art can use various methods to implement the described functions for each specific application, but such implementation should not be construed as going beyond the protection scope of the embodiments of the present application.

In the various embodiments and implementations of this application, if there are no special instructions and logical conflicts, the terms and/or descriptions between different embodiments and between different implementations are consistent and can be mutually cited. The technical features in the embodiments and implementations can be combined to form new embodiments or new implementations according to their inherent logical relationships.

It should be understood that the processor in the embodiment of the present application may be an integrated circuit chip with signal processing capability. In the implementation process, the steps of the foregoing method embodiments can be completed by hardware integrated logic circuits in the processor or instructions in the form of software. The above-mentioned processor may be a general-purpose processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (ASIC), a field programmable gate array (field programmable gate array, FPGA) or other Programming logic devices, discrete gates or transistor logic devices, discrete hardware components.

The technology described in this application can be implemented in various ways. For example, these technologies can be implemented in hardware, software, or a combination of hardware. For hardware implementation, the processing unit used to execute these technologies at a communication device (for example, a base station, a terminal, a network entity, or a chip) can be implemented in one or more general-purpose processors, DSPs, digital signal processing devices, ASICs, Programmable logic device, FPGA, or other programmable logic device, discrete gate or transistor logic, discrete hardware component, or any combination of the above. The general-purpose processor may be a microprocessor. Alternatively, the general-purpose processor may also be any traditional processor, controller, microcontroller, or state machine. The processor can also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors combined with a digital signal processor core, or any other similar configuration. achieve.

It can be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory can be read-only memory (ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), and electrically available Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory. The volatile memory may be random access memory (RAM), which is used as an external cache. By way of exemplary but not restrictive description, many forms of RAM are available, such as static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), and synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (synchlink DRAM, SLDRAM) ) And direct memory bus random access memory (direct rambus RAM, DR RAM). It should be noted that the memories of the systems and methods described herein are intended to include, but are not limited to, these and any other suitable types of memories.

The present application also provides a computer-readable medium on which a computer program is stored, and when the computer program is executed by a computer, the function of any of the foregoing method embodiments is realized.

This application also provides a computer program product, which, when executed by a computer, realizes the functions of any of the foregoing method embodiments.

In the above-mentioned embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented by software, it can be implemented in the form of a computer program product in whole or in part. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on the computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center. Transmission to another website, computer, server, or data center via wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or a data center integrated with one or more available media. The usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, and a magnetic tape), an optical medium (for example, a high-density digital video disc (digital video disc, DVD)), or a semiconductor medium (for example, a solid state disk, SSD)) etc.

A person of ordinary skill in the art can understand that the various digital numbers such as first and second involved in the present application are only for easy distinction for description, and are not used to limit the scope of the embodiments of the present application, but also indicate a sequence.

The corresponding relationships shown in the tables in this application can be configured or pre-defined. The value of the information in each table is only an example, and can be configured to other values, which is not limited in this application. When configuring the correspondence between the information and each parameter, it is not necessarily required to configure all the correspondences indicated in the tables. For example, in the table in this application, the corresponding relationship shown in some rows may not be configured. For another example, appropriate deformation adjustments can be made based on the above table, such as splitting, merging, and so on. The names of the parameters shown in the titles in the above tables may also adopt other names that can be understood by the communication device, and the values or expressions of the parameters may also be other values or expressions that can be understood by the communication device. When the above tables are implemented, other data structures can also be used, such as arrays, queues, containers, stacks, linear tables, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables. Wait.

The pre-definition in this application can be understood as definition, pre-definition, storage, pre-storage, pre-negotiation, pre-configuration, curing, or pre-fired.

A person of ordinary skill in the art may realize that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed by hardware or software depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.

Those skilled in the art can clearly understand that, for the convenience and conciseness of description, the specific working process of the system, device and unit described above can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, device, and method may be implemented in other ways. For example, the device embodiments described above are merely illustrative, for example, the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or It can be integrated into another system, or some features can be ignored or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.

In addition, the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.

If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, the technical solution of the present application essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disks or optical disks and other media that can store program codes. .

The same or similar parts between the various embodiments in this application can be referred to each other. In each embodiment of this application, and each implementation method/implementation method/implementation method in each embodiment, if there is no special description and logical conflict, between different embodiments and each implementation manner/implementation method in each embodiment/ The terms and/or descriptions between the implementation methods/implementation methods are consistent and can be cited each other. The technical features in different embodiments and various implementation modes/implementation methods/implementation methods in each embodiment are based on their inherent The logical relationship can be combined to form a new embodiment, implementation, implementation method, or implementation method. The implementations of the application described above do not constitute a limitation on the protection scope of the application.

The above are only specific implementations of this application, but the protection scope of this application is not limited to this. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in this application. Should be covered within the scope of protection of this application.

Claims

A communication method, characterized in that it comprises:

Obtaining a first sequence, the first sequence being related to d second sequences;

The d second sequences are included in M candidate second sequences, the d is an integer greater than 1, and the M is an integer greater than or equal to d;

The first sequence is included in K candidate first sequences, and the K is an integer greater than M;

And, output the first sequence;

Wherein, the s candidate first sequences in the K candidate first sequences correspond to d×s candidate second sequences, and there is at least d×(1-ε)×s in the d×s candidate second sequences Candidate second sequences that are different from each other, the ε is a real number greater than 0 and less than 1, and the s is an integer greater than 1 and less than K.
The method according to claim 1, wherein the method further comprises: obtaining configuration information, wherein the configuration information configures the d second sequences, or the configuration information configures the first sequence and all The corresponding relationship of the d second sequences.
The method according to claim 2, wherein the method further comprises: obtaining the d second sequences according to the configuration information.
The method according to any one of claims 1 to 3, wherein the first sequence is a sequence of a preamble signal.
The method according to claim 4, wherein the M is equal to 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, The K is equal to 640, 512, 320, 256, 160, or 128.
The method according to any one of claims 1 to 3, wherein the first sequence is a sequence of a demodulation reference signal DMRS.
The method according to claim 6, wherein the M is equal to 6, 8, 12, 16, 18, 24, or 32, and the K is equal to 24, 32, 48, 64, 96, or 128.
The method according to any one of claims 1 to 3, wherein the first sequence is a sequence of a phase tracking reference signal PTRS, a sequence of a sounding reference signal SRS, a sequence of a synchronization signal, a sequence of a measurement reference signal , Or the sequence of the discovery signal.
The method according to any one of claims 1 to 8, wherein the second sequence is a ZC sequence or a sequence obtained by performing a first process on the ZC sequence, and the first process includes the following One or more: Discrete Fourier Transform, DFT, or cyclic shift.
A communication method, characterized in that it comprises:

Receiving a first sequence, the first sequence being related to d second sequences;

The d second sequences are included in M candidate second sequences, the d is an integer greater than 1, and the M is an integer greater than or equal to d;

The first sequence is included in K candidate first sequences, and the K is an integer greater than M;

And, processing the first sequence;

Wherein, the s candidate first sequences in the K candidate first sequences correspond to d×s candidate second sequences, and there is at least d×(1-ε)×s in the d×s candidate second sequences Candidate second sequences that are different from each other, the ε is a real number greater than 0 and less than 1, and the s is an integer greater than 1 and less than K.
The method according to claim 10, wherein the method further comprises: sending configuration information, the configuration information configures the d second sequences, or the configuration information configures the first sequence and all The corresponding relationship of the d second sequences.
The method according to claim 10 or 11, wherein the first sequence is a sequence of a preamble signal.
The method according to claim 12, wherein the M is equal to 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, The K is equal to 640, 512, 320, 256, 160, or 128.
The method according to claim 10 or 11, wherein the first sequence is a sequence of a demodulation reference signal DMRS.
The method according to claim 14, wherein the M is equal to 6, 8, 12, 16, 18, 24, or 32, and the K is equal to 24, 32, 48, 64, 96, or 128.
The method according to claim 10 or 11, wherein the first sequence is a sequence of a phase tracking reference signal PTRS, a sequence of a sounding reference signal SRS, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a discovery signal the sequence of.
The method according to any one of claims 10 to 16, wherein the second sequence is a ZC sequence or a sequence obtained from the ZC sequence through a first process, and the first process includes the following One or more: Discrete Fourier Transform, DFT, or cyclic shift.
A device, characterized in that it comprises:

A processing unit, configured to obtain a first sequence, the first sequence being related to d second sequences;

The d second sequences are included in M candidate second sequences, the d is an integer greater than 1, and the M is an integer greater than or equal to d;

The first sequence is included in K candidate first sequences, and the K is an integer greater than M;

And, the transceiver unit is configured to output the first sequence;

Wherein, the s candidate first sequences in the K candidate first sequences correspond to d×s candidate second sequences, and there is at least d×(1-ε)×s in the d×s candidate second sequences Candidate second sequences that are different from each other, the ε is a real number greater than 0 and less than 1, and the s is an integer greater than 1 and less than K.
The device according to claim 18, wherein the transceiver unit is further configured to obtain configuration information, the configuration information configures the d second sequences, or the configuration information configures the first sequence Correspondence with the d second sequences.
The device according to claim 19, wherein the processing unit is further configured to: obtain the d second sequences according to the configuration information.
The apparatus according to any one of claims 18 to 20, wherein the first sequence is a sequence of a preamble signal.
The device according to claim 21, wherein the M is equal to 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, The K is equal to 640, 512, 320, 256, 160, or 128.
The method according to any one of claims 18 to 20, wherein the first sequence is a sequence of a demodulation reference signal DMRS.
The device of claim 23, wherein the M is equal to 6, 8, 12, 16, 18, 24, or 32, and the K is equal to 24, 32, 48, 64, 96, or 128.
The apparatus according to any one of claims 18 to 20, wherein the first sequence is a sequence of a phase tracking reference signal PTRS, a sequence of a sounding reference signal SRS, a sequence of a synchronization signal, a sequence of a measurement reference signal , Or the sequence of the discovery signal.
The device according to any one of claims 18 to 25, wherein the second sequence is a ZC sequence or a sequence obtained by performing a first process on the ZC sequence, and the first process includes the following One or more: Discrete Fourier Transform, DFT, or cyclic shift.
A device, characterized in that it comprises:

A transceiver unit, configured to receive a first sequence, where the first sequence is related to d second sequences;

The d second sequences are included in M candidate second sequences, the d is an integer greater than 1, and the M is an integer greater than or equal to d;

The first sequence is included in K candidate first sequences, and the K is an integer greater than M;

And, a processing unit, configured to process the first sequence;

Wherein, the s candidate first sequences in the K candidate first sequences correspond to d×s candidate second sequences, and there is at least d×(1-ε)×s in the d×s candidate second sequences Two different candidate second sequences, the ε is a real number greater than 0 and less than 1, and the s is an integer greater than 1 and less than K.
The device according to claim 27, wherein the transceiver unit is further configured to send configuration information, the configuration information configures the d second sequences, or the configuration information configures the first sequence Correspondence with the d second sequences.
The device according to claim 27 or 28, wherein the first sequence is a sequence of a preamble signal.
The device of claim 29, wherein the M is equal to 64, 60, 56, 52, 48, 44, 40, 36, 32, 28, 24, 20, 16, 12, 8, or 4, The K is equal to 640, 512, 320, 256, 160, or 128.
The apparatus according to claim 27 or 28, wherein the first sequence is a sequence of a demodulation reference signal DMRS.
The device according to claim 31, wherein the M is equal to 6, 8, 12, 16, 18, 24, or 32, and the K is equal to 24, 32, 48, 64, 96, or 128.
The apparatus according to claim 27 or 28, wherein the first sequence is a sequence of a phase tracking reference signal PTRS, a sequence of a sounding reference signal SRS, a sequence of a synchronization signal, a sequence of a measurement reference signal, or a discovery signal the sequence of.
The device according to any one of claims 27 to 33, wherein the second sequence is a ZC sequence or a sequence obtained from the ZC sequence through a first process, and the first process includes the following One or more: Discrete Fourier Transform, DFT, or cyclic shift.
A device, characterized by comprising: a processor, the processor is coupled with a memory, the memory is used to store a program or instruction, when the program or instruction is executed by the processor, the device is executed The method according to any one of claims 1 to 9.
A device, characterized by comprising: a processor, the processor is coupled with a memory, the memory is used to store a program or instruction, when the program or instruction is executed by the processor, the device is executed The method of any one of claims 10-17.
A storage medium having a computer program or instruction stored thereon, wherein the computer program or instruction is executed to cause a computer to execute the method according to any one of claims 1 to 9.
A storage medium having a computer program or instruction stored thereon, wherein the computer program or instruction is executed to cause a computer to execute the method according to any one of claims 10 to 17.
A communication system, comprising: the device described in any one of claims 18 to 26, and/or the device described in any one of claims 27 to 34.
A communication system, comprising: the device described in claim 35, and/or, the device described in claim 36.