Signal processing method, device, first communication node and second communication node

Abstract

The present application proposes a signal processing method, device, first communication node and second communication node. The method includes: obtaining N first sequences; merging the N first sequences to obtain a second sequence; generating a signal according to the second sequence; wherein N is an integer greater than or equal to 2.

Description

Technical Field

[0001] The present application relates to the field of communications, and in particular to a signal processing method, device, first communication node, and second communication node. Background Art

[0002] Schedule-free transmission allows terminals to autonomously send data without sending scheduling requests or waiting for dynamic scheduling. Therefore, schedule-free transmission reduces signaling overhead and transmission latency, as well as terminal power consumption. Furthermore, it can be combined with non-orthogonal transmission to increase the number of connected users.

[0003] There are two schemes for scheduling-free transmission: pre-configured scheduling-free and contention-free scheduling. For contention-free transmission based on pilots (including reference signals or preambles), due to the limited number of pilots, pilot collisions are severe when there are a large number of connected users, affecting scheduling-free transmission performance. Reducing pilot collisions and improving the performance of contention-free transmission is a pressing technical issue. Summary of the Invention

[0004] The present application provides a signal processing method, an apparatus, a first communication node, and a second communication node.

[0005] In a first aspect, an embodiment of the present application provides a signal processing method, applied to a first communication node, comprising:

[0006] Get N first sequences;

[0007] Merging the N first sequences to obtain a second sequence;

[0008] generating a signal according to the second sequence;

[0009] Wherein, N is an integer greater than or equal to 2.

[0010] In a second aspect, an embodiment of the present application provides a signal processing method, applied to a second communication node, including:

[0011] receiving a signal from a transmission resource, wherein the signal is generated based on a second sequence;

[0012] detecting the signal to obtain M sequences generating the signal;

[0013] The second sequence is obtained by combining N first sequences, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.

[0014] In a third aspect, an embodiment of the present application provides a signal processing device, configured at a first communication node, comprising:

[0015] An acquisition module is configured to acquire N first sequences;

[0016] a merging module, configured to merge the N first sequences to obtain a second sequence;

[0017] a generating module, configured to generate a signal according to the second sequence;

[0018] Wherein, N is an integer greater than or equal to 2.

[0019] In a fourth aspect, an embodiment of the present application provides a signal processing device, configured at a second communication node, comprising:

[0020] a receiving module, configured to receive a signal from a transmission resource, wherein the signal is generated based on a second sequence;

[0021] a detection module, configured to detect the signal and obtain M sequences that generate the signal;

[0022] The second sequence is obtained by combining N first sequences, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.

[0023] In a fifth aspect, an embodiment of the present application provides a first communication node, including:

[0024] one or more processors;

[0025] a storage device for storing one or more programs;

[0026] When the one or more programs are executed by the one or more processors, the one or more processors implement any one of the methods applied to the first communication node in the embodiments of the present application.

[0027] In a sixth aspect, an embodiment of the present application provides a second communication node, including:

[0028] one or more processors;

[0029] a storage device for storing one or more programs;

[0030] When the one or more programs are executed by the one or more processors, the one or more processors implement any one of the methods applied to the second communication node in the embodiments of the present application.

[0031] In a seventh aspect, an embodiment of the present application provides a storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, any one of the methods in the embodiments of the present application is implemented.

[0032] With respect to the above embodiments and other aspects of the present application and their implementation, further description is provided in the accompanying drawings, detailed description and claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Figure 1 A flowchart of a signal processing method provided in an embodiment of the present application;

[0034] Figure 1a Schematic diagram of a transmission frame structure of a traditional "pilot + data" contention-free scheduling scheme;

[0035] Figure 1b Schematic diagram of a transmission frame structure based on a contention-free scheduling scheme of "multi-pilot + data";

[0036] Figure 1c A schematic diagram of the time-frequency resources occupied by two pilot signals provided in an embodiment of the present application;

[0037] Figure 1d Another schematic diagram of the time-frequency resources occupied by two pilot signals provided in an embodiment of the present application;

[0038] Figure 1e A schematic diagram of a time division multi-pilot system provided in an embodiment of the present application;

[0039] Figure 1f A schematic diagram of another time division multi-pilot system provided in an embodiment of the present application;

[0040] Figure 1g A schematic diagram of a frequency division multiple pilot provided in an embodiment of the present application;

[0041] Figure 1h A schematic diagram of a time-frequency division multiple pilot provided in an embodiment of the present application;

[0042] Figure 1i A schematic diagram of a code division multiple pilot provided in an embodiment of the present application;

[0043] Figure 1j A schematic diagram of a code division multiple pilot provided in an embodiment of the present application;

[0044] Figure 1k A schematic diagram of generating a non-orthogonal sequence set provided in an embodiment of the present application;

[0045] Figure 11 Schematic diagram of the CDF distribution of sequence cross-correlation values ​​provided in an embodiment of the present application;

[0046] Figure 1m A schematic diagram of generating another non-orthogonal sequence set provided in an embodiment of the present application;

[0047] Figure 1n A schematic diagram of generating another non-orthogonal sequence set provided in an embodiment of the present application;

[0048] Figure 1o A schematic diagram of CDF distribution of another sequence cross-correlation value provided in an embodiment of the present application;

[0049] Figure 2 A flowchart of another signal processing method provided in an embodiment of the present application;

[0050] Figure 3 A schematic structural diagram of a signal processing device provided in an embodiment of the present application;

[0051] Figure 4 A schematic structural diagram of another signal processing device provided in an embodiment of the present application;

[0052] Figure 5 A schematic diagram of the structure of a first communication node provided in an embodiment of the present application;

[0053] Figure 6 A schematic structural diagram of a second communication node provided in an embodiment of the present application. DETAILED DESCRIPTION

[0054] To make the purpose, technical solutions and advantages of this application more clear, the embodiments of this application will be described in detail below with reference to the accompanying drawings. It should be noted that, unless there is a conflict, the embodiments and features in the embodiments of this application can be combined with each other in any way.

[0055] The steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions. Also, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be performed in an order different from that shown here.

[0056] In an exemplary embodiment, Figure 1 This is a flow chart of a signal processing method provided in an embodiment of the present application. The method can be performed by a signal processing device provided in the present application, which can be implemented by software and / or hardware and integrated on a first communication node, which can be any type of wireless user equipment.

[0057] Because the number of pilots in traditional pilot-based contention-free transmission schemes is limited, pilot collisions are severe when a large number of users are connected, affecting the performance of contention-free transmission. Therefore, enhanced pilot design (including reference signals or preambles) can be considered to reduce pilot collisions and thus improve the performance of contention-free transmission.

[0058] like Figure 1 As shown, the present application provides a signal processing method, including S110, S120 and S130.

[0059] S110: Obtain N first sequences.

[0060] Wherein, N is an integer greater than or equal to 2.

[0061] Each first sequence may be obtained from the same sequence set or from different sequence sets. Any two of the N first sequences may be different, or T sequences may be the same, where T is an integer greater than or equal to 2 and less than or equal to N.

[0062] Each first sequence may be obtained randomly.

[0063] The value of N is not limited here. In one example, the value of N includes 2 or 3.

[0064] In an example, the lengths of the N first sequences are all L, where L is an integer greater than or equal to 2.

[0065] S120: Merge the N first sequences to obtain a second sequence.

[0066] After obtaining N first sequences, this step may combine the N first sequences to obtain a second sequence.

[0067] The second sequence may be a sequence in a set of non-orthogonal sequences.

[0068] The means of combining are not limited herein. In one example, the means of combining include but are not limited to superposition processing or series combination.

[0069] The superposition process can be considered as superimposing, i.e., adding, N first sequences. The series combination includes directly concatenating the first sequences (sequence concatenation), or concatenating the elements in the first sequences in a certain order (element concatenation). For example, when concatenating, the first element of each first sequence is first extracted, followed by the second element of each first sequence, and so on, to complete the series combination.

[0070] S130. Generate a signal according to the second sequence.

[0071] After obtaining the second sequence, this step can further process the second sequence to generate a signal. The means of further processing are not limited, including but not limited to designated processing and mapping to time-frequency resources.

[0072] In a scheduling-free scenario, the signal may be a reference signal. In a random access scenario, the signal may be a random access signal.

[0073] After generating the signal, the present application may also transmit the signal on a transmission resource for reception and detection by a second communication node.

[0074] This application provides a signal processing method, applied to a first communication node, comprising: obtaining N first sequences; combining the N first sequences to obtain a second sequence; and generating a signal based on the second sequence, wherein N is an integer greater than or equal to 2. This method can effectively reduce the probability of pilot collisions, thereby improving the performance of contention-free scheduling transmission.

[0075] In one example, a signal processing method provided herein can be used to implement multi-pilot transmission. This method first obtains N first sequences, which can indicate or correspond to N pilots. The N first sequences are then combined to obtain a second sequence, and a signal is generated based on the second sequence, thereby implementing code division multiple pilots. This method uses N pilots, thereby reducing the probability of collisions occurring on all N pilots. By using code division multiple pilots, each first sequence can be obtained from a relatively large set of sequences, expanding the selection space for each first sequence and further reducing the probability of collisions occurring on the N pilots.

[0076] In one example, the present application provides a signal processing method that can be used to implement non-orthogonal pilot transmission. This method first obtains N first sequences, then combines the N first sequences to obtain a second sequence, where the second sequence corresponds to a pilot, and finally generates a signal based on the second sequence. The second sequence can be one of a set of non-orthogonal sequences, thereby implementing non-orthogonal pilots. By using non-orthogonal pilots, this method increases the number of available pilots, thereby reducing the probability of pilot collisions.

[0077] On the basis of the above embodiment, an extended embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the extended embodiment.

[0078] In one embodiment, the combining of the N first sequences includes:

[0079] superimposing the N first sequences; or,

[0080] The N first sequences are respectively subjected to designated processing and then superimposed.

[0081] In one embodiment, the combining of the N first sequences includes:

[0082] Combining the N first sequences in series; or,

[0083] The N first sequences are respectively processed as specified and then combined in series.

[0084] In one embodiment, the combining of the N first sequences includes:

[0085] Mapping the N first sequences to different time-frequency resources respectively; or,

[0086] The N first sequences are respectively subjected to designated processing and then mapped onto different time-frequency resources.

[0087] In one embodiment, generating a signal according to the second sequence includes:

[0088] The second sequence is subjected to designated processing and then mapped onto time-frequency resources to generate a signal.

[0089] In one embodiment, the designated process includes one or more of the following:

[0090] Mask processing, scrambling processing, precoding processing, energy adjustment, power adjustment, amplitude adjustment, and phase adjustment.

[0091] In one embodiment, the second sequence is a sequence in a non-orthogonal sequence set, and the second sequence corresponds to a pilot.

[0092] In one embodiment, one first sequence corresponds to one pilot.

[0093] In one embodiment, obtaining N first sequences includes one of the following:

[0094] Obtaining N first sequences from a sequence set, where any two of the N first sequences are different, or T sequences of the N first sequences are the same, where T is an integer greater than or equal to 2 and T is less than or equal to N;

[0095] Obtain N first sequences from different sequence sets;

[0096] N first sequences are obtained from different subsets of the same sequence set.

[0097] In one embodiment, the sequence set includes one or more of the following: a Hadamard sequence set; a sequence set obtained according to the Hadamard sequence set; a ZC sequence set; and a four-phase sequence set.

[0098] In one embodiment, the N first sequences are obtained randomly.

[0099] In one embodiment, the method further includes: generating data, wherein the data carries information, wherein the information includes one or more of the following:

[0100] Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence; identity identification information of the first communication node.

[0101] The identification information of the N first sequences is used to identify the corresponding first sequences, and the identification information of the second sequence is used to identify the second sequence. The identity information of the first communication node is used to identify the first communication node. The specific content of each piece of identification information is not limited here, as long as it can identify the corresponding content. In one example, the above identification information includes an index, a number, or an identification code.

[0102] The energy information may be information identifying the energy of a corresponding sequence (such as the first sequence or the second sequence). The specific content of the energy information is not limited here, as long as it can identify the energy of the corresponding sequence. In one example, the energy information includes energy level or energy ratio.

[0103] The present application is described below as an example. The signal processing method provided in the present application can be considered as a reference signal generation method. In a random access scenario, the signal processing method can be considered as a random access signal generation method.

[0104] Grant-free transmission allows terminals to autonomously send data without sending scheduling requests or waiting for dynamic scheduling. This reduces signaling overhead, transmission latency, and terminal power consumption. Furthermore, it can be combined with non-orthogonal transmission to increase the number of connected users.

[0105] Scheduling-free transmission includes two schemes: pre-configured (semi-persistent scheduling or configured grant)-free scheduling and contention-based (contention-based)-free scheduling. For pre-configured-free scheduling, the base station can pre-configure or semi-statically configure time-frequency resources and pilot sequences for each terminal. This configuration ensures that the time-frequency resources and / or pilot sequences used by multiple terminals are different, thus avoiding collisions and facilitating user identification and detection. Available time-frequency resources are typically periodic, making them suitable for periodic services. However, using them for random burst services results in lower transmission efficiency and higher latency. For contention-free scheduling, when a service arrives at a terminal, it randomly selects time-frequency resources and pilot sequences for access and transmission. Time-frequency resources and pilot sequences used by multiple terminals may collide, requiring the receiver to implement more complex or advanced blind detection algorithms for user identification and detection. Contention-free scheduling is more suitable for random burst services, offering better transmission efficiency and lower latency.

[0106] Contention-free scheduling can be implemented based on a "pilot + data" channel structure, where the base station implements multi-user detection through pilots, which include at least preambles and reference signals.

[0107] Figure 1aFigure 1 is a schematic diagram of a transmission frame structure based on a traditional "pilot + data" contention-free scheduling scheme. Figure 1a As shown, the traditional solution uses a pilot signal, which can be composed of a sequence. The receiver uses the pilot signal to identify and detect users. If two users select different pilot signals, then both users may be correctly received and detected. When two users select the same pilot signal, a collision occurs. At this time, the receiver can only identify one user and obtain only one channel estimation result, which is the sum of the channels of the two users. In this case, if the power of the two user equipment (UE) is similar, it is likely that neither user will be correctly decoded. Due to the limited number of pilot signals, the collision situation will deteriorate rapidly as the number of users increases, which will affect the number of access users supported by the system.

[0108] Therefore, for pilot-based contention-free transmission, due to the limited number of pilots, when the number of accessing users is large, pilot collisions are more serious, which will affect the performance of contention-free transmission. This application provides a reference signal generation method that is conducive to reducing pilot collisions, thereby improving the performance of contention-free transmission.

[0109] In one embodiment, Figure 1b Schematic diagram of a transmission frame structure based on a contention-free scheduling scheme of "multi-pilot + data", as shown in FIG. Figure 1b As shown in Figure 1, the key concept of the multi-pilot scheme is to design multiple independent or randomly selected pilots with the same resource overhead. The receiver uses each of these pilots for user identification and detection. If two users collide on pilot 1 but not on pilot 2, user identification and detection can still be achieved using pilot 2. Interference cancellation is then performed, thereby improving detection performance for other users.

[0110] for Figure 1a The scheme shown in FIG. 1 assumes that the candidate pilot set contains N orthogonal pilot sequences. Taking two users competing for access as an example, the collision rate is 1 / N. Figure 1bIn the scheme shown, assuming two independent pilots, that is, w = 2, and assuming the pilot overhead remains constant, each pilot can be randomly selected from a candidate pilot set consisting of N / 2 orthogonal pilot sequences. The collision rate for two users competing for access is (2 / N)^2 = 4 / N^2. As can be seen, the collision rate of the latter is 4 / N of that of the former. That is, when N is greater than 4, the collision rate of the latter is lower, and as N increases, the collision rate of the latter decreases relative to the former. For example, when N = 24, the collision rate of the latter is 1 / 6 of that of the former; when N = 48, the collision rate of the latter is 1 / 12 of that of the former. Therefore, the contention-free scheduling scheme based on "multi-pilot + data" can significantly reduce the collision rate, which helps increase the number of accessible users.

[0111] Regarding the configuration or structure of multiple pilots, one case is that the multiple pilots occupy different time-frequency resources.

[0112] Take the use of two pilots as an example. Figure 1c A schematic diagram of the time-frequency resources occupied by two pilot signals provided in an embodiment of the present application. Figure 1c The time-frequency resources occupied by the two pilots P1 and P2 occupy the same frequency domain resource position in the frequency domain, but occupy different symbols in the time domain, and the different symbols can be continuous or discontinuous. This situation can be called time-division multi-pilot.

[0113] Figure 1d Another schematic diagram of the time-frequency resources occupied by the two pilot signals provided in the embodiment of the present application. Figure 1d As shown, the time-frequency resources occupied by the two pilots P1 and P2 occupy the same symbol position in the time domain (the two symbols can be continuous or discontinuous), and occupy different frequency domain resources in the frequency domain, and different frequency domain resources can be continuous or discontinuous. This situation can be called frequency division multiple pilots.

[0114] In specific implementation, there may be different implementation methods. Figure 1e A schematic diagram of a time division multi-pilot system provided in an embodiment of the present application. Figure 1f This is another schematic diagram of time division multi-pilot provided in an embodiment of the present application. Figure 1e and 1f As shown in , for time-division multiple pilots, the time-frequency resources occupied by the two pilots P1 and P2 occupy different symbols in the time domain and are randomly selected from the available frequency domain resources in the frequency domain, and may use the same or different frequency domain resource positions. Figure 1e, assuming that the frequency domain resources contain 12 resource elements (REs), which are divided into three groups, each containing 4 REs. The pilot P1 randomly selects a group of resources from the three groups of frequency domain resources of the first symbol, and the pilot P2 randomly selects a group of resources from the three groups of frequency domain resources of the second symbol. Figure 1f , the 12 frequency domain REs are divided into six groups, each containing two REs. Pilot P1 randomly selects one resource from the six frequency domain resource groups of the first symbol, and pilot P2 randomly selects one resource from the six frequency domain resource groups of the second symbol. This structure is also called a comb structure, with each group of resources being called a comb. Therefore, it can also be considered that a comb is randomly selected for each pilot.

[0115] For frequency division multiple pilots, similar implementations can be performed, for example, Figure 1g This is a schematic diagram of a frequency division multiple pilot provided in an embodiment of the present application. Figure 1g As shown in the figure, the time-frequency resources occupied by the two pilots P1 and P2 occupy the same symbol position in the time domain and are randomly selected from the available frequency domain resources in the frequency domain. Here, the 12 frequency domain REs can be divided into two groups, each containing 6 REs, used by pilots P1 and P2 respectively. Each group of resources is further divided into three subgroups, each containing 2 REs. For a UE, pilot P1 randomly selects a subgroup of resources from the three subgroups of the first group of resources, and pilot P2 randomly selects a subgroup of resources from the three subgroups of the second group of resources.

[0116] It is also possible to adopt the time-frequency division multiple pilot implementation method. Figure 1h This is a schematic diagram of a time-frequency division multiple pilot provided in an embodiment of the present application. Figure 1h As shown, the time-frequency resources containing 12 REs in the frequency domain and 2 symbols in the time domain are divided into two groups in the frequency domain. Each group contains 6 REs, which are used by pilot P1 and pilot P2 respectively. Each group of resources is further divided into time and frequency to obtain six subgroups. Each subframe contains 2 REs in the frequency domain and 1 symbol in the time domain. For a UE, pilot P1 randomly selects a subgroup resource from the six subgroups of the first group of resources, and pilot P2 randomly selects a subgroup resource from the six subgroups of the second group of resources.

[0117] In the above example, the frequency domain resources ultimately used by each pilot are continuous, but may actually be discontinuous.

[0118] When multiple pilots of a user occupy different time-frequency resources, the same pilot sequence set can be used for different pilots Px, x=1,...,w. For example, P1, P2,..., Pw are all randomly selected from the pilot sequence set S.

[0119] The pilot sequence set may be an orthogonal sequence set. Figure 1c As shown in the time division multiple pilot, assuming that the frequency domain contains 12 REs, then the pilot sequence set can be a set of 12 orthogonal Hadamard code sequences with a length of 12, and each pilot selects a pilot sequence with a length of 12 from the set. Figure 1d Assume that the frequency domain contains 12 REs, two pilots occupy 6 REs each, and the time domain occupies 2 symbols. The pilot sequence set can be a set of 12 orthogonal Hadamard code sequences of length 12. Each pilot selects a pilot sequence of length 12 from this set and maps it to the corresponding 6 REs in the frequency domain and 2 symbols in the time domain. In this case, for any pilot Px, the pilots of multiple users are code-divided. When multiple users select the same pilot sequence, a collision occurs. As shown above, the probability that both pilots of two UEs collide is (1 / 12)^2 = 1 / 144.

[0120] for Figure 1e As shown in the time division multiple pilot, each pilot occupies 4 REs in the frequency domain. Then, the pilot sequence set can be a set of 4 orthogonal Hadamard code sequences with a length of 4, and each pilot selects a pilot sequence with a length of 4 from the set. Similarly, for Figure 1f In the time division multiple pilot shown, each pilot occupies 2 REs in the frequency domain. Then, the pilot sequence set can be a set of 2 orthogonal Hadamard code sequences with a length of 2, and each pilot selects a pilot sequence with a length of 2 from the set.

[0121] for Figure 1g In the frequency-division multi-pilot system shown, each pilot occupies 2 REs in the frequency domain and 2 symbols in the time domain. Therefore, the pilot sequence set can be a set of 4 orthogonal Hadamard code sequences of length 4. Each pilot selects a pilot sequence of length 4 from the set and then maps it to the corresponding 2 REs in the frequency domain and 2 symbols in the time domain. The pilot sequence set can also include a sequence set A and an orthogonal mask set B, where sequence set A can be a set of 2 orthogonal Hadamard code sequences of length 2, and orthogonal mask set B can be a set of 2 orthogonal Hadamard code sequences of length 2. A 2*1 sequence is obtained by randomly selecting a column from sequence set A, and a 1*2 sequence is obtained by randomly selecting a row from orthogonal mask set B. The two sequences are then matrix multiplied to obtain a 2*2 matrix, which is mapped as a pilot to the corresponding 2 REs in the frequency domain and 2 symbols in the time domain.

[0122] for Figure 1h The time-frequency division multiple pilot shown is Figure 1fSimilarly, each pilot occupies 2 REs in the frequency domain and 1 symbol in the time domain. Then, the pilot sequence set can be a set of 2 orthogonal Hadamard code sequences with a length of 2. Each pilot selects a pilot sequence with a length of 2 from the set and then maps it to the corresponding 2 REs in the frequency domain and 1 symbol in the time domain.

[0123] for Figure 1e-Figure 1h In the case shown, the pilot set can be considered to include candidate (comb-shaped) pilot resources and a set of shorter orthogonal pilot sequences. This case can also be equivalent to a set of longer sparse orthogonal pilot sequences. That is, the pilot sequence elements at the positions corresponding to the pilot resources are elements of the shorter orthogonal pilot sequence, and the pilot sequence elements at other resource positions are 0. Ultimately, 12 sparse orthogonal sequences of length 12 can be obtained.

[0124] for Figure 1e-Figure 1h In the case shown, for any pilot Px, the pilots of multiple users are frequency-divided, time-frequency-divided, or code-divided. Of course, if they are equivalent to sparse pilot sequences, they can all be considered to be code-divided.

[0125] The available pilots (including time-frequency resources and / or pilot sequences) in the above example can also correspond to antenna ports, with each available pilot corresponding to one port. When a UE uses multiple antenna ports, the UE can use multiple groups of pilots (or consider any of the above pilots Px as a group of pilots). Each group of pilots includes multiple pilots corresponding to multiple ports, and these multiple pilots can be randomly selected.

[0126] A UE can transmit multiple layers of data or multiple data streams. The UE can use multiple pilot groups, each containing multiple pilots corresponding to the multiple layers of data or multiple data streams. These pilots can be randomly selected. Alternatively, each layer of data or each data stream of the UE can be considered a virtual UE, with each virtual UE using multiple pilots as described above.

[0127] Furthermore, the UE can also perform power allocation for multiple antenna ports, or multiple layers of data, or multiple data streams, or adjust the amplitude of the transmitted symbols, and can also perform phase adjustment, precoding processing and other operations.

[0128] In one embodiment, the technical means for merging the N first sequences may be superposition processing.

[0129] Regarding the configuration or structure of multiple pilots, there is another situation where the multiple pilots occupy the same time-frequency resources.

[0130] Take the use of two pilots as an example. Figure 1i A schematic diagram of a code division multiple pilot provided in an embodiment of the present application is shown in FIG. Figure 1i The two pilots P1 and P2 occupy the same time-frequency resources, but can be distinguished in the code domain, that is, by the pilot sequence. This situation can be called code division multiple pilot.

[0131] CDMA can be divided into the following three cases:

[0132] (1) The pilot sequences of the multiple pilots (ie, N first sequences) are from different pilot sequence sets (ie, sequence sets). For example, the pilot sequences used by the two pilots P1 and P2 are randomly selected from the pilot sequence sets S1 and S2, respectively.

[0133] (2) The pilot sequences of multiple pilots come from the same pilot sequence set and are guaranteed to be different. For example, two different pilot sequences are randomly selected from the pilot sequence set S and used as the pilot sequences of the two pilots P1 and P2 respectively.

[0134] (3) The pilot sequences of multiple pilots are from the same pilot sequence set. The same pilot sequence can be selected, which means that two or more pilot sequences may be identical. For example, the pilot sequences used by two pilots P1 and P2 are randomly selected from the pilot sequence set S, respectively, and may be identical. When two pilots use the same pilot sequence, they are equivalent to a single pilot.

[0135] Figure 1j A schematic diagram of a code division multiple pilot provided in an embodiment of the present application. Figure 1j , assuming that the available pilot resources contain 12 REs in the frequency domain and 2 symbols in the time domain, the resources are divided into six groups in the frequency domain, that is, each group of pilot resources (or each comb resource) contains 2 REs in the frequency domain and 2 symbols in the time domain.

[0136] Furthermore, the pilot sequence set S used on each group of pilot resources may include four orthogonal Hadamard code sequence sets of length 4. The pilot sequence set may also include a sequence set A and an orthogonal mask code set B, where the sequence set A may include two orthogonal Hadamard code sequence sets of length 2, and the orthogonal mask code set B may include two orthogonal Hadamard code sequence sets of length 2.

[0137] In this case, it can be considered that the pilot set includes candidate pilot resources and a set of orthogonal pilot sequences of shorter length. Of course, this case can also be equivalent to the pilot set being a set of sparse orthogonal pilot sequences of longer length.

[0138] In this example, multiple pilots can come from different pilot sets, or from the same pilot set while ensuring that the multiple pilots are different, or from the same pilot set while any two pilots may be identical. Taking two pilots as an example, for example, the pilot sequence set S used on each group of pilot resources is divided into two subsets, S1 and S2. Pilot P1 randomly selects one pilot resource from the six groups of pilot resources, and then selects a pilot sequence from subset S1. Pilot P2 randomly selects one pilot resource from the six groups of pilot resources, and then selects a pilot sequence from subset S2. Alternatively, two different combinations are randomly selected from all combinations of candidate pilot resources and candidate pilot sequences as pilots P1 and P2. Alternatively, two combinations are randomly selected from all combinations of candidate pilot resources and candidate pilot sequences as pilots P1 and P2. In this case, pilots P1 and P2 may be identical. If they are identical, they are equivalent to a single pilot.

[0139] Under the condition of total energy limitation, when multiple pilots are used, the energy of each pilot will be reduced, which will affect the channel estimation and the ability to suppress noise.

[0140] For CDMA, the energy allocation of multiple pilots can consider the following two situations:

[0141] (1) The total energy is evenly distributed among multiple pilots, that is, the energy of multiple pilots is the same.

[0142] (2) The total energy is unevenly distributed across multiple pilots, i.e., the energy of multiple pilots can be different. For example, the total energy is divided into multiple energy levels, and the energy indicated by each energy level is equal or unequal. Multiple pilots randomly select one of the energy levels, and the energy level indexes of the multiple pilots are different, ensuring that the total energy remains unchanged, or is equal to or does not exceed the preset total energy. In one example, one of the multiple energy levels can be 0, which is equivalent to not sending the pilot, and the saved energy can be used to send other pilots. In the case where the UE uses two pilots, if the energy of one pilot is not 0 and the energy of one pilot is 0, it is equivalent to the UE actually using one pilot.

[0143] For uneven energy distribution, to reconstruct pilot symbols and eliminate interference, the UE can carry energy allocation information for multiple pilots in the data payload it transmits. For example, it can carry an energy allocation indication for each of the multiple pilots, or it can carry the energy level index of one of the multiple pilots. In this case, multiple energy levels can be used sequentially and cyclically across the multiple pilots. Once the energy level index of one pilot is determined, the energy levels of the remaining pilots can be determined in turn.

[0144] For multiple pilots occupying different time-frequency resources, energy can be distributed among the multiple pilots, with the total energy being evenly or unevenly distributed across the multiple pilots. For time-division multiple pilots, due to power control, in some cases (e.g., when the UE reaches maximum transmit power), the energy of the multiple pilots should be the same.

[0145] It should also be noted that the energy distribution described here can be achieved through operations such as power distribution, power control, amplitude adjustment, and energy normalization.

[0146] In one example, for example Figure 1i For code division multiple pilots, from the perspective of a UE's transmitting end, the UE first obtains multiple pilot sequences, then performs superposition processing on the multiple pilot sequences to obtain the sequence after superposition processing, and then generates a pilot or reference signal according to the sequence after superposition processing for transmission.

[0147] Taking two pilots as an example, the UE first obtains two pilot sequences (i.e., first sequences) C1 and C2. Then, the UE performs superposition processing on the two pilot sequences C1 and C2 to obtain a sequence C after superposition processing: C=C1+C2. Then, the UE generates a pilot or reference signal based on the sequence C after superposition processing.

[0148] If the pilot sequences of multiple pilots come from different pilot sequence sets, or if the pilot sequences of multiple pilots come from the same pilot sequence set and the multiple pilot sequences are different, the UE can first adjust the energy of the two pilot sequences C1 and C2, and then perform superposition processing to obtain the sequence C after superposition processing. For example, assuming that the lengths of pilot sequences C1 and C2 are both L, and the element energies are normalized to 1, then the total energy of the two sequences is L. After energy adjustment of the two pilot sequences C1 and C2, and Then, the sequence C after superposition processing can be The total energy of the sequence C obtained after the superposition process is still L.

[0149] Alternatively, assuming that the lengths of pilot sequences C1 and C2 are both L, the element energies are normalized to 1, and the target total energy of the pilots is E, then the target total energy of each pilot sequence can be E / 2. After energy adjustment of the two pilot sequences C1 and C2, we can obtain and Then, the sequence C after superposition processing can be The total energy of the sequence C obtained after the superposition process is E.

[0150] If the pilot sequences of multiple pilots come from the same pilot sequence set, and any two of the pilot sequences may be the same, then before generating a pilot or reference signal based on sequence C, sequence C may be energy normalized to obtain sequence D, and then a pilot or reference signal may be generated based on sequence D, for example Where, assuming C is a sequence of L*1, ()* represents conjugate transposition, according to C * C can obtain the total energy of sequence C. This process is intended to ensure that the total pilot energy remains unchanged, or is equal to or does not exceed the preset total energy E, especially when two pilot sequences for a UE are identical. Of course, this method of energy adjustment of the sequence C obtained after superposition can also be used when the pilot sequences of multiple pilots come from different pilot sequence sets, or when the pilot sequences of multiple pilots come from the same pilot sequence set and are different.

[0151] In one example, for example Figure 1j For code division multiple pilots, from the perspective of a UE's transmitting end, the UE first obtains multiple pilots, then performs superposition processing on the multiple pilots to obtain the pilots after superposition processing, and then generates a reference signal based on the pilots after superposition processing for transmission.

[0152] Taking the use of two pilots as an example, the UE (i.e., the first communication node) first obtains two pilots P1 and P2, and then the UE superimposes the two pilots P1 and P2 to obtain the pilot P after superposition processing: P=P1+P2, and then the UE generates a reference signal based on the pilot P after superposition processing.

[0153] If multiple pilots (corresponding to N first sequences) come from different pilot sets, or multiple pilots come from the same pilot set and ensure that the multiple pilots are different. In this case, the UE can first adjust the energy of the two pilots P1 and P2, and then perform superposition processing to obtain the pilot P after superposition processing. For example, assuming that the pilot sequence used by pilot P1 is C1, the pilot sequence used by pilot P2 is C2, the length of the two sequences is L, the element energy is normalized to 1, and the target total energy of the pilot is E, then the target total energy of each pilot can be E / 2, and after energy adjustment of the pilot sequences used by the two pilots P1 and P2, the following can be obtained: and Furthermore, if the comb-shaped time-frequency resources used by the two pilots are different, then the pilot sequences used by the pilots P1 and P2 after energy adjustment can be mapped to their respective time-frequency resources. Since the pilot sequence used by a pilot will be mapped to the time-frequency resource used by the pilot, and the other time-frequency resource positions not used by the pilot can be equivalently considered to carry 0 elements, when the time-frequency resources used by the two pilots are different, mapping the pilot sequences to their respective time-frequency resources is equivalent to performing a superposition process. If the comb-shaped time-frequency resources used by the two pilots are the same, the pilot sequences used by the two pilots P1 and P2 can be energy adjusted and then superimposed to obtain The sequence C is then mapped to corresponding time-frequency resources to generate a reference signal.

[0154] If multiple pilots come from the same pilot set, and any two of them may be the same. In this case, when the two pilots P1 and P2 of the UE are the same, the time-frequency resources and pilot sequences they use are the same. Similar to the above, the pilot sequences used by the two pilots can be superimposed to obtain the superimposed sequence C = C1 + C2, and then the sequence C can be energy normalized to obtain the sequence The total pilot energy is ensured to be constant, or equal to or not exceeding a preset total energy E, and then the sequence D is mapped to the corresponding time-frequency resources for reference signal generation. Of course, this method of energy adjustment of the sequence C obtained after superposition can also be used when multiple pilots come from different pilot sets, or when multiple pilots come from the same pilot set and are ensured to be different.

[0155] Regarding the collision of CDMA, Figure 1iIn the case shown, assuming the pilot resources consist of 12 REs in the frequency domain and 2 symbols in the time domain, if an orthogonal pilot sequence set is used, the set can be a set S consisting of 24 orthogonal Hadamard code sequences of length 24. Taking two pilots as an example, if the pilot sequences of a UE's two pilots come from two sets S1 and S2, respectively—for example, set S1 contains half of the sequences in set S and set S2 contains the other half, that is, sets S1 and S2 each contain 12 sequences of length 24—the probability that both pilots of the two UEs will collide is 1 / 144. This collision probability is the same as the collision rate of time-division / frequency-division multiple pilots. If both pilot sequences of a UE come from set S, the probability that both pilots of the two UEs will collide is 1 / (C(24,2)+24)=1 / 300, where C(24,2) represents the number of combinations of selecting two different sequences from the 24 pilot sequences. It can be seen that by using CDMA, each first sequence can be obtained from a relatively large sequence set, so that the selection space of each first sequence is larger, thereby further reducing the probability of collision on multiple pilots.

[0156] However, for the case where the pilot sequences of the two pilots of a UE are both from the set S and the same sequence is allowed to be selected, there is a problem that when the pilot sequences used by the two pilots are different or orthogonal, the energy normalization factor is When the two pilots use the same pilot sequence, the energy normalization factor is 1 / 2. As you can see, the energy normalization factor is not unique. This has a certain impact on the receiver's reception detection. When the receiver performs blind detection using two pilots, it does not know the pilot sequence selected by the UE and cannot use the corresponding energy normalization factor. One way is to use a unified energy normalization factor, considering that the proportion of two pilots using the same pilot sequence is lower. For a UE, the pilot sequences of the two pilots come from two sets S1 and S2 respectively, or the pilot sequences of the two pilots come from the set S and the two pilot sequences are guaranteed to be different, then this problem does not exist and the energy normalization factor can be used uniformly.

[0157] for Figure 1j In the case shown, the pilot set includes candidate pilot resources and a set of shorter orthogonal pilot sequences. The collision situation and energy normalization problem can be analyzed similarly. The specific energy normalization factors may be different, but the principles are similar.

[0158] In one embodiment, the technical means for merging the N first sequences may be combined processing.

[0159] In this embodiment, it is assumed that the total time-frequency resource overhead occupied by the pilot is 24 resource elements. In this embodiment, the terminal (UE) first obtains two sequences (i.e., first sequences). The terminal randomly selects two sequences C1 and C2 from sequence set A, where sequence set A includes 12 orthogonal sequences of length 12. Therefore, sequences C1 and C2 are each a sequence of length 12.

[0160] The terminal then combines (e.g., concatenates) the two sequences C1 and C2 to obtain a sequence C (i.e., the second sequence) with a length of 24. Since sequence set A includes 12 orthogonal sequences of length 12, arbitrarily selecting two sequences and combining them to obtain a sequence of length 24 yields a total of 144 sequences of length 24. This results in a sequence set B that includes 144 sequences of length 24. Furthermore, sequence set B is a non-orthogonal sequence set. Figure 1k This is a schematic diagram of generating a non-orthogonal sequence set provided in an embodiment of the present application. Figure 1k Then, it can be considered that the combined sequence C (ie, the second sequence) comes from the non-orthogonal sequence set B.

[0161] Furthermore, the terminal generates a reference signal based on the obtained sequence C, including: mapping the sequence C to a time-frequency resource for a pilot to generate the reference signal; or mapping the sequence C to a time-frequency resource for a pilot after performing specified processing to generate the reference signal, wherein the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling processing, etc.

[0162] In this embodiment, Table 1 is a set table of sequence set A. Sequence set A may be a set of 12 orthogonal Hadamard code sequences of length 12, as shown in Table 1. Based on the above description of this embodiment, for sequence set A shown in Table 1, a set B of 144 non-orthogonal sequences of length 24 can be constructed.

[0163] Table 1 A set table of sequence set A

[0164]

[0165] Figure 11 For a CDF distribution diagram of the sequence cross-correlation values ​​provided in the embodiment of the present application, see Figure 11 Based on the Cumulative Distribution Function (CDF) and the cross-correlation value, it can be seen that about 85% of the sequence cross-correlation values ​​are 0, and about 15% of the sequence cross-correlation values ​​are 0.5.

[0166] In this embodiment, Table 2 is a set table of another sequence set A. Sequence set A can also be a sequence set as shown in Table 2, which also contains 12 orthogonal sequences of length 12. Each sequence is sparse and can be regarded as a combination of a comb resource structure containing 3 combs and a set of orthogonal Hadamard sequences of length 4. According to the above description of this embodiment, for the sequence set A shown in Table 2, a non-orthogonal sequence set B containing 144 sequences of length 24 can also be constructed. The cross-correlation characteristics between the sequences are the same as those mentioned above. Figure 11 The characteristics shown are the same, that is, the cross-correlation characteristics are the same as those of the non-orthogonal sequence set B composed based on the sequence set A shown in Table 1.

[0167] Table 2 Set table of another sequence set A

[0168]

[0169] In this embodiment, the sequence set A may also be other orthogonal sequence sets or non-orthogonal sequence sets, for example, a sequence set consisting of a comb resource structure including 6 combs and a combination of two orthogonal Hadamard code sequence sets of length 2; or, a ZC (Zadoff-Chu) sequence set; or, a four-phase sequence set, for example, sequence elements are from the set {1+1i, -1+1i, -1-1i, 1-1i} or {1, 1i, -1, -1i}. It can be seen that the candidate sequence elements have four phase values, so it can be called a four-phase sequence set.

[0170] In this embodiment, by acquiring and combining multiple sequences, a non-orthogonal sequence set with a larger number of sequences can be obtained. This non-orthogonal sequence set also has good sequence structure and cross-correlation characteristics. When multiple UEs transmit using the same time-frequency resources, the pilot sequences used by each UE are equivalent to those from this non-orthogonal sequence set. This means that the pilot sequences used by each UE are non-orthogonal and have a low collision probability. A receiver can then utilize this non-orthogonal sequence set and its sequence structure characteristics for reception detection.

[0171] In one embodiment, it is assumed that the total time-frequency resource overhead occupied by the pilot is 24 REs.

[0172] In this embodiment, the terminal (UE) first obtains two sequences (ie, first sequences), including randomly selecting a sequence C1 from the sequence set A1 and randomly selecting a sequence C2 from the sequence set A2.

[0173] In this embodiment, sequence set A1 and sequence set A2 are from sequence set A and contain half and the other half of the sequences in sequence set A, respectively. For example, sequence set A includes 24 orthogonal sequences of length 24. Sequence set A1 is a sequence set consisting of the first 12 sequences in sequence set A, and sequence set A2 is a sequence set consisting of the last 12 sequences in sequence set A. Therefore, sequence set A1 contains 12 orthogonal sequences of length 24, and sequence set A2 also contains 12 orthogonal sequences of length 24. Sequences C1 and C2 are each a sequence of length 24.

[0174] In this embodiment, sequence set A1 and sequence set A2 include half of the sequences in sequence set A and the other half of the sequences, respectively. They are not limited to the first half of the sequences and the second half of the sequences in sequence set A, and can be any half of the sequences and the other half of the sequences.

[0175] In this embodiment, it is not limited that the sequence set A1 and the sequence set A2 are both from the sequence set A. The sequence set A1 and the sequence set A2 may also be two independent sequence sets.

[0176] The terminal then superimposes the two sequences C1 and C2 to obtain a sequence C (i.e., the second sequence) with a length of 24. Since sequence set A1 includes 12 orthogonal sequences of length 24, and sequence set A2 also includes 12 orthogonal sequences of length 24, a sequence is randomly selected from sequence set A1 and sequence set A2, and then superimposed to obtain a sequence of length 24. Thus, a total of 144 sequences of length 24 are obtained. This results in a sequence set B that includes 144 sequences of length 24. Furthermore, sequence set B is a non-orthogonal sequence set. Figure 1m This is a schematic diagram of generating another non-orthogonal sequence set provided in an embodiment of the present application. Figure 1m As shown, it can be considered that sequence C comes from the sequence set B.

[0177] Furthermore, the terminal generates a reference signal based on the obtained sequence C (i.e., the second sequence), including: mapping the sequence C to a time-frequency resource for a pilot to generate a reference signal; or mapping the sequence C to a time-frequency resource for a pilot after performing specified processing to generate a reference signal, wherein the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling processing, etc.

[0178] In this embodiment, Table 3 is a set table of another sequence set A provided by this application. The sequence set A may be a set of 24 orthogonal Hadamard code sequences with a length of 24.

[0179] As shown in Table 3. According to the above description of this embodiment, sequence set A1 may include the first 12 sequences in the sequence set A, and sequence set A2 may include the last 12 sequences in the sequence set A. Based on sequence set A1 and sequence set A2, a non-orthogonal sequence set B containing 144 sequences of length 24 can be constructed. Moreover, the mutual correlation characteristics between the sequences in the sequence set B are the same as those in the above sequence set B. Figure 11 The features shown are the same.

[0180] Table 3: Another set of sequence sets A provided by this application

[0181]

[0182] In this embodiment, Table 4 is a set table of another sequence set A provided by the present application. Sequence set A can also be a sequence set as shown in Table 4, which also contains 24 orthogonal sequences of length 24. Each sequence is sparse and can be regarded as a combination of a comb resource structure containing 3 combs and a set of orthogonal Hadamard sequences of length 8. According to the above description of this embodiment, sequence set A1 can include the first 12 sequences in the sequence set A, and sequence set A2 can include the last 12 sequences in the sequence set A. Based on sequence set A1 and sequence set A2, a non-orthogonal sequence set B containing 144 sequences of length 24 can be constructed, and the cross-correlation characteristics between the sequences in the sequence set B are the same as those described above. Figure 11 The features shown are also the same.

[0183] Table 4: Another set of sequence sets A provided by this application

[0184]

[0185] In this embodiment, by acquiring and superimposing multiple sequences, a non-orthogonal sequence set with a larger number of sequences can be obtained. This non-orthogonal sequence set also has good sequence structure and cross-correlation characteristics. When multiple UEs transmit using the same time-frequency resources, the pilot sequences used by each UE are equivalent to those from this non-orthogonal sequence set. This means that the pilot sequences used by each UE are non-orthogonal and have a low collision probability. A receiver can then utilize this non-orthogonal sequence set and its sequence structure characteristics for reception detection.

[0186] In this embodiment, if the total time-frequency resource overhead occupied by the pilot is 48 REs, then any sequence in sequence set A1 can be combined with any sequence in sequence set A2 to obtain a sequence set B. Sequence set B includes 144 sequences of length 48. Furthermore, sequence set B is a non-orthogonal sequence set. Figure 1nThis is a schematic diagram of generating another non-orthogonal sequence set provided in an embodiment of the present application. Figure 1n , the non-orthogonal sequence set B can be obtained by combining the sequence set A1 and the sequence combination A2.

[0187] In this case, the sequence set A can be a set of 24 orthogonal Hadamard sequences with a length of 24, as shown in Table 3. Then, the sequence set A1 can include the first 12 sequences in the sequence set A, and the sequence set A2 can include the last 12 sequences in the sequence set A. Based on the sequence set A1 and the sequence set A2, a non-orthogonal sequence set B with a length of 48 can be constructed, and the cross-correlation characteristics between the sequences in the sequence set B are the same as those in the above. Figure 11 The features shown are the same.

[0188] In this case, the sequence set A can also be the sequence set shown in Table 4, which also contains 24 orthogonal sequences of length 24. Then, the sequence set A1 can contain the first 12 sequences in the sequence set A, and the sequence set A2 can contain the last 12 sequences in the sequence set A. Based on the sequence set A1 and the sequence set A2, a non-orthogonal sequence set B containing 144 sequences of length 48 can be constructed. In addition, the cross-correlation characteristics between the sequences in the sequence set B are the same as those in the above. Figure 11 The features shown are also the same.

[0189] In one embodiment, it is assumed that the total time-frequency resource overhead occupied by the pilot is 24 REs.

[0190] In this embodiment, the terminal (UE) first obtains two sequences (i.e., first sequences) C1 and C2. Sequence C1 consists of a sequence X1 and a sequence Y1, and sequence C2 consists of a sequence X2 and a sequence Y2. Sequences X1 and X2 are from sequence set X, and sequences Y1 and Y2 are from sequence set Y. For example, sequence set X includes 12 orthogonal sequences of length 12, and sequence set Y includes 2 orthogonal sequences of length 2. The first sequence in sequence set Y is used as sequence Y1 to obtain sequence C1, and the second sequence in sequence set Y is used as sequence Y2 to obtain sequence C2.

[0191] The terminal then obtains two sequences C1 and C2 by randomly selecting a sequence from sequence set X as sequence X1, obtaining the first sequence Y1 from sequence set Y, and obtaining sequence C1 based on sequences X1 and Y1. Sequence X1 is a sequence of length 12 and can be represented as a 12*1 vector. Sequence Y1 is a sequence of length 2 and can be represented as a 1*2 vector. Matrix multiplication is performed on sequences X1 and Y1 to obtain a 12*2 matrix, which can be further converted into a sequence of length 24 as sequence C1. Similarly, sequence C2 can be obtained. Therefore, sequences C1 and C2 are each a sequence of length 24.

[0192] In this embodiment, sequence Y1 and sequence Y2 may be referred to as orthogonal mask codes, and sequence set Y may be referred to as an orthogonal mask code set.

[0193] Based on the above description, we can see that by operating each sequence in sequence set X with the first sequence Y1 in sequence set Y, we can obtain a new sequence set A1, which equivalently contains 12 orthogonal sequences of length 24. Similarly, by operating each sequence in sequence set X with the second sequence Y2 in sequence set Y, we can obtain a new sequence set A2, which also equivalently contains 12 orthogonal sequences of length 24. Therefore, we can equivalently assume that sequence C1 comes from sequence set A1, and sequence C2 comes from sequence set A2.

[0194] In fact, in this embodiment, a sequence of length 24 can be obtained by operating any sequence in sequence set X with any sequence in sequence set Y. A total of 24 orthogonal sequences of length 24 can be obtained. These 24 sequences can constitute sequence set A. Therefore, the above sequence set A1 and sequence set A2 can be regarded as coming from sequence set A, respectively containing half and the other half of the sequences in sequence set A.

[0195] In this embodiment, when the terminal obtains two sequences C1 and C2, it may also randomly select a sequence from half of the sequences in sequence set X as sequence X1, randomly select a sequence from sequence set Y as sequence Y1, and obtain sequence C1 based on sequences X1 and Y1. Similarly, it may randomly select a sequence from the other half of the sequences in sequence set X as sequence X2, randomly select a sequence from sequence set Y as sequence Y2, and obtain sequence C2 based on sequences X2 and Y2.

[0196] The terminal then superimposes the two sequences C1 and C2 to obtain a sequence C (i.e., the second sequence) with a length of 24. By superimposing any sequence in sequence set A1 with any sequence in sequence set A2, a sequence set B is obtained. This sequence set B includes 144 sequences with a length of 24. Furthermore, sequence set B is a non-orthogonal sequence set. Therefore, sequence C can be considered to come from sequence set B.

[0197] Furthermore, the terminal generates a reference signal based on the obtained sequence C, including: mapping the sequence C to a time-frequency resource for a pilot to generate a reference signal; or mapping the sequence C to a time-frequency resource for a pilot after performing specified processing to generate a reference signal, wherein the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling processing, etc.

[0198] In this embodiment, the sequence set X may be a set of 12 orthogonal Hadamard sequences of length 12 as shown in Table 1, or a set of 12 orthogonal sequences of length 12 as shown in Table 2. Table 5 is a set table of sequence set Y, as shown in Table 5.

[0199] Table 5 Set table of sequence set Y

[0200]

[0201] According to the above description of this embodiment, the sequence set A1 and the sequence set A2 each contain 12 sequences of length 24. Then, a non-orthogonal sequence set B containing 144 sequences of length 24 can be constructed based on the sequence set A1 and the sequence set A2. Moreover, the cross-correlation characteristics between the sequences in the sequence set B are the same as those in the above sequence set B. Figure 11 The characteristics are the same.

[0202] In this embodiment, if the total time-frequency resource overhead occupied by the pilot is 48 REs, then any sequence in sequence set A1 can be combined with any sequence in sequence set A2 to obtain a sequence set B. Sequence set B includes 144 sequences of length 48. Furthermore, sequence set B is a non-orthogonal sequence set.

[0203] In this case, the sequence set X can be a set of 12 orthogonal Hadamard sequences of length 12 as shown in Table 1, or a set of 12 orthogonal sequences of length 12 as shown in Table 2. The sequence set Y is shown in Table 5. Then, according to the above description of this embodiment, the equivalent sequence set A1 and sequence set A2 can be obtained based on the sequence set X and the sequence set Y, and both contain 12 sequences of length 24. Then, based on the sequence set A1 and the sequence set A2, a non-orthogonal sequence set B containing 144 sequences of length 48 can be constructed, and the cross-correlation characteristics between the sequences in the sequence set B are the same as those in the above embodiment. Figure 11 The features shown are the same.

[0204] In one embodiment, it is assumed that the total time-frequency resource overhead occupied by the pilot is 48 REs.

[0205] In this embodiment, the terminal (UE) first obtains two sequences (i.e., first sequences). The terminal randomly selects two sequences C1 and C2 from sequence set A, where sequence set A includes 24 orthogonal sequences of length 24. Therefore, sequences C1 and C2 are each a sequence of length 24.

[0206] The terminal combines (for example, concatenates) two sequences C1 and C2 to obtain a sequence C of length 48. Since sequence set A includes 24 orthogonal sequences of length 24, arbitrarily selecting two sequences and combining them to obtain a sequence of length 48 yields a total of 576 sequences of length 48. This results in a sequence set B that includes 576 sequences of length 48. Furthermore, sequence set B is a non-orthogonal sequence set. Therefore, sequence C can be considered to be from sequence set B.

[0207] Furthermore, the terminal generates a reference signal based on the obtained sequence C (i.e., the second sequence), including: mapping the sequence C to a time-frequency resource for a pilot to generate a reference signal; or mapping the sequence C to a time-frequency resource for a pilot after performing specified processing to generate a reference signal, wherein the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling processing, etc.

[0208] In this embodiment, the sequence set A may be a set of 24 orthogonal Hadamard sequences of length 24, as shown in Table 3. According to the above description of this embodiment, for the sequence set A shown in Table 3, a non-orthogonal sequence set B including 576 sequences of length 48 can be constructed. Figure 1o This is another CDF distribution diagram of the mutual correlation value of the sequence provided in the embodiment of the present application, wherein the CDF distribution of the mutual correlation value between each sequence is as follows: Figure 1o As shown, it can be seen that 92% of the sequence cross-correlation values ​​are 0, and 8% of the sequence cross-correlation values ​​are 0.5.

[0209] In this embodiment, the sequence set A may also be the sequence set shown in Table 4, which also includes 24 orthogonal sequences with a length of 24. According to the above description of this embodiment, for the sequence set A shown in Table 4, a non-orthogonal sequence set B containing 576 sequences with a length of 48 can also be constructed, and the cross-correlation characteristics between the sequences in the sequence set B are the same as those in the sequence set B. Figure 1o The features shown are the same.

[0210] Other extended embodiments can be derived based on this embodiment and the above embodiments, which are not limited here.

[0211] In one embodiment, the signal processing method provided by the present application may include the following steps:

[0212] Obtain multiple sequences (i.e., obtain N first sequences);

[0213] Performing superposition processing or combination processing on the multiple sequences to obtain a processed sequence (i.e., a second sequence);

[0214] generating a reference signal according to the processed sequence;

[0215] The reference signal is sent.

[0216] The multiple sequences represent multiple pilots; or the multiple sequences are sequences used by multiple pilots respectively.

[0217] The multiple sequences are from a sequence set, and any two of the sequences are allowed to be the same; or, the multiple sequences are from a sequence set and are different from each other; or, the multiple sequences are respectively from multiple sequence sets; or, the multiple sequences are respectively from multiple subsequence sets of a sequence set, or the multiple sequences are generated according to a preset rule.

[0218] The multiple sequences are randomly selected or randomly generated.

[0219] The superposition processing of the multiple sequences includes:

[0220] The multiple sequences are superimposed, or the multiple sequences are separately processed and then superimposed; or the multiple sequences are mapped to different time-frequency resources, or the multiple sequences are separately processed and then mapped to different time-frequency resources, to achieve equivalent superposition processing.

[0221] The combining of the multiple sequences includes:

[0222] The multiple sequences are combined in series, or the multiple sequences are individually processed and then combined in series; or the elements of the multiple sequences are combined in a specified order, or the elements of the multiple sequences that have been individually processed and then combined in a specified order. The specified order is not limited.

[0223] Generating a reference signal according to the processed sequence includes:

[0224] The processed sequence is subjected to designated processing and mapped to designated transmission resources for generating a reference signal.

[0225] The designated processing includes at least one of the following: mask processing, scrambling processing, precoding processing, energy normalization, energy adjustment, power adjustment, amplitude adjustment, and phase adjustment.

[0226] The energies of the multiple sequences are the same, or the multiple sequences use different energy levels or energy ratios.

[0227] In which, the signal processing method also includes: generating data, carrying information in the data, and the information includes one or more of the following: identification information of the multiple sequences or pilots; energy information of the multiple sequences or pilots, or energy information of one of the multiple sequences or pilots; identification information of the processed sequence; energy information of the processed sequence; identity information of the first communication node, or partial information of the identity information of the first communication node.

[0228] The present application also provides a signal processing method. Figure 2 A flowchart of another signal processing method provided in an embodiment of the present application. The method can be performed by a signal processing device provided in the present application, which can be implemented by software and / or hardware and integrated on a second communication node, which can be a base station.

[0229] like Figure 2 As shown, the signal processing method provided by the present application includes S210 and S220.

[0230] S210: Receive a signal from a transmission resource, where the signal is generated based on a second sequence.

[0231] The signal is based on Figure 1 The present application receives a signal from a transmission resource to detect the signal.

[0232] S220: Detect the signal to obtain M sequences for generating the signal, wherein the second sequence is obtained by combining N first sequences, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.

[0233] The step of detecting the signal may include acquiring received pilot symbols from a transmission resource of the signal, and then detecting the acquired pilot symbols to identify M sequences used by the first communication node.

[0234] Different detection methods correspond to different contents of the M sequences. For example, when detecting a signal based on the sequence set to which the first sequence belongs, M first sequences can be obtained. When detecting the signal based on the non-orthogonal sequence set to which the second sequence belongs, the M sequences can be one second sequence.

[0235] The non-orthogonal sequence set to which the second sequence belongs may be determined based on the sequence set to which the N first sequences belong. For the determination means, refer to the technical means for determining the sequence set B on the first communication node side, which will not be described in detail here.

[0236] After obtaining the M sequences for generating the signal, data detection and interference elimination can be performed based on the M sequences.

[0237] When detecting a signal based on the sequence set to which the first sequence belongs, M first sequences can be obtained. The size relationship between M and N is not limited here, and can be determined based on the number of first communication nodes. For a UE, the N first sequences it uses may all be detected, or some of the first sequences may be detected, that is, M is less than or equal to N. If there are multiple UEs, the first sequence detected by the receiver includes multiple UEs, that is, M sequences corresponding to each UE can be obtained, then, from a general perspective, the number of first sequences detected by the receiver can be greater than N. It should also be noted here that in the case of multiple UEs, the number of sequences corresponding to each UE detected by the receiver may be different.

[0238] When detecting the signal based on the non-orthogonal sequence set to which the second sequence belongs, the M sequences can be one second sequence. This applies to each UE. If there are multiple UEs, the second sequences detected by the receiver include those of multiple UEs, meaning that a second sequence corresponding to each UE can be obtained. Overall, the receiver can detect multiple second sequences.

[0239] The present application provides a signal processing method, applied to a second communication node, comprising: receiving a signal from a transmission resource, the signal being generated based on a second sequence; detecting the signal to obtain M sequences that generate the signal; wherein the second sequence is obtained by combining N first sequences, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2. This method performs reception detection based on the characteristics of multiple pilots or non-orthogonal pilots, thereby achieving better transmission performance.

[0240] On the basis of the above embodiment, an extended embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the extended embodiment.

[0241] In one embodiment, detecting the signal to obtain M sequences for generating the signal includes:

[0242] The signal is detected based on a sequence set to which the N first sequences belong, to obtain M sequences for generating the signal, where the M sequences include the M first sequences.

[0243] The second communication node may pre-store a sequence set corresponding to the N first sequences, and when detecting a signal, may perform blind detection on the signal based on the sequence set corresponding to the N first sequences. The first communication node and the second communication node may pre-agreed on a method for obtaining the first sequence, so that the second communication node can detect the signal based on the sequence set to which the N first sequences belong.

[0244] In one embodiment, detecting the signal to obtain M sequences for generating the signal includes:

[0245] The signal is detected based on a non-orthogonal sequence set to which the second sequence belongs, to obtain M sequences for generating the signal, where the M sequences include one second sequence, wherein the non-orthogonal sequence set is determined based on a sequence set to which the N first sequences belong.

[0246] The second communication node may perform blind detection on the signal based on the non-orthogonal sequence set to which the second sequence belongs to obtain a second sequence. The technical means for determining the non-orthogonal sequence set may refer to the technical means for determining the sequence set B by the first communication node, which will not be described in detail here.

[0247] In one embodiment, the method further includes:

[0248] Get data symbol;

[0249] The data symbols are detected based on the M sequences used to generate the signal to obtain a detection result.

[0250] The present application may perform channel estimation based on M sequences for reception detection of received data symbols.

[0251] In one embodiment, the method further includes: obtaining information from the detection result, wherein the information includes one or more of the following:

[0252] Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence; identity identification information of the first communication node.

[0253] The present application is described below as an example. In one embodiment, at a receiving end, a receiver first obtains received pilot symbols from a reference signal transmission resource, then detects the obtained pilot symbols to identify multiple pilot sequences used by the transmitter (i.e., all or part of the N first sequences).

[0254] Regarding the reference signal generation method described in the above example, where multiple pilots use different time-frequency resources, using two pilots as an example, the receiver detects pilot P1, identifies the pilot sequence used by the transmitter on pilot P1, performs channel estimation, and then detects the received data symbols. The receiver also detects pilot P2, identifies the pilot sequence used by the transmitter on pilot P2, performs channel estimation, and then detects the received data symbols. The receiver's detection processes for pilots P1 and P2 can be performed in parallel or serially. Furthermore, interference cancellation can be combined with reception detection. When parallel processing is used, it is possible that both pilot P1 and pilot P2 can successfully detect and decode the same UE. In this case, any correct decoding result for the UE is retained, and interference cancellation is performed on the pilot and data symbols of the UE. The next round of iterative detection is then performed, i.e., reception detection is repeated using pilots P1 and P2 based on the updated received symbols after interference cancellation. When serial processing is used, if a UE is successfully detected and decoded using pilot P1, the pilot and data symbols for that UE are reconstructed and interference canceled. Then, pilot P2 is used to continue receiving detection and interference cancellation for other UEs. The next round of iterative detection begins, repeating the process of receiving detection using pilot P1 and then pilot P2. This iterative process continues until no more users can be detected, or until the specified number of iterations is reached.

[0255] For contention-free scheduling transmission, since the information of the accessing UE is unknown, the identity identification information of the first communication node, such as UE ID information or part of the UE ID information, can be carried in the data payload. In this way, when the data of a certain UE is successfully detected and decoded, it can be known which UE's data is successfully received. In addition, in order to ensure the recognition and detection performance of other UEs, it is also necessary to eliminate interference from the pilot symbols. Since each transmitter uses multiple independent or random pilots, the receiver does not know the information of the multiple pilots used by each UE transmitter. The information of multiple pilots can be carried in the data payload, including identification information such as pilot composition information or pilot index information for identifying the pilot, as well as pilot energy information.

[0256] When eliminating interference, the channel estimation result obtained based on the pilot can be used for interference elimination. However, considering that the pilots of multiple UEs may collide, in order to improve the performance of contention-free scheduling transmission, the reconstructed transmitted symbols of all correctly decoded users can also be used to perform channel estimation based on the least squares algorithm to obtain an updated channel estimation result, and interference elimination is performed based on the updated channel estimation result.

[0257] For a reference signal generation method in which multiple pilots use the same time-frequency resources, taking two pilots as an example, if the two pilots of a UE come from different sets, then the receiver processing process can adopt a process similar to the above description. If the two pilots of a UE come from the same set, then when the receiver detects the received pilot symbols, it may simultaneously identify the two pilots of the UE and be unable to distinguish between pilot P1 and pilot P2. In this case, the receiver processing process is actually similar to the receiver processing process of the traditional solution. The difference is that in this solution, a UE uses two pilots. Although pilots of different UEs may collide, the probability of collision is reduced. The receiver will detect and identify relatively more pilots. The receiver further receives and detects data symbols based on these pilots, which can achieve better transmission performance.

[0258] In one embodiment, the M sequences obtained by detecting the signal may be a second sequence, ie, a joint pilot sequence.

[0259] At the receiving end, the receiver first obtains the received pilot symbols from the reference signal transmission resource, and then detects the obtained pilot symbols to identify the joint pilot sequence used by the transmitter.

[0260] The receiver can construct a non-orthogonal sequence set B in a similar manner to the transmitter, use each sequence in the sequence set B to perform blind detection on the obtained pilot symbols, identify the joint pilot sequence used by the transmitter, and then detect the received data symbols based on the identified joint pilot sequence.

[0261] When performing joint pilot identification or user identification, blind detection is performed using the constructed non-orthogonal pilot sequence set B. Through correlation detection, joint pilot sequences with correlation values ​​greater than a specified threshold and / or several joint pilot sequences with large correlation values ​​are obtained as identified joint pilot sequences.

[0262] Furthermore, the receiver may use the identified joint pilot sequences to perform channel estimation based on a least squares algorithm to obtain a channel estimation result for receiving and detecting received data symbols.

[0263] Since the joint pilot sequence is obtained by combining or superimposing multiple component sequences, and the multiple component sequences can come from orthogonal or non-orthogonal component sequence sets, the receiver can determine its component sequences or constituent sequences based on the identified joint pilot sequence. For example, based on the joint pilot sequence index and the size of the component sequence set, the multiple component sequences constituting the joint pilot sequence can be determined through division or modulo operation. The receiver can also directly use the component sequence set to detect and identify the multiple component sequences used by the transmitter to constitute the joint pilot sequence. Furthermore, the receiver can use the multiple component sequences determined to be used by the transmitter to perform channel estimation for receiving and detecting received data symbols.

[0264] For contention-free scheduling transmission, the receiver can use interference cancellation techniques to reconstruct the transmitted symbols of the correctly demodulated and decoded user, perform interference cancellation, and then continue detecting other users. This process repeats until no user can be detected or until a specified number of iterations is reached. The receiver can determine whether the decoding is correct based on the cyclic redundancy check (CRC) result after decoding.

[0265] Since the information of the connected UE is unknown, the data payload can carry the UE ID information or partial UE ID information. After the receiver correctly decodes the data, it can obtain the UE ID and the data it transmits. To ensure the identification and detection performance of other UEs, it is also necessary to eliminate interference from the pilot symbols. Since the pilot used by each UE transmitter is unknown, the data payload can carry information about the joint pilot sequence (i.e., the identification information of the second sequence) or information about multiple component sequences (i.e., the identification information of N first sequences). This includes identification information such as sequence composition information or sequence index information, as well as sequence energy information.

[0266] Regarding the channel estimation value used for interference cancellation, taking into account that the joint pilot sequence is non-orthogonal and that the pilots of multiple UEs may collide, in order to improve the performance of contention-free scheduling transmission, the reconstructed transmitted symbols of all correctly decoded users can be used to perform channel estimation based on the least squares algorithm to obtain an updated channel estimation result, and interference cancellation is performed based on the updated channel estimation result.

[0267] In this embodiment, when multiple UEs perform contention-free scheduling transmission, the pilot sequences used are from a non-orthogonal sequence set having a larger number of sequences, and the non-orthogonal sequence set has good sequence structure characteristics and cross-correlation characteristics. The pilot sequences used by each UE are non-orthogonal and have a low collision probability. By utilizing the non-orthogonal sequence set and its sequence structure characteristics for reception detection, the receiver can obtain better transmission performance.

[0268] In one embodiment, the signal processing method may include the following steps:

[0269] Get symbols from the transmission resource;

[0270] Detecting the acquired symbols to obtain M sequences used by the first communication node;

[0271] The symbol is a symbol sent by the first communication node and received by the second communication node, and is generated based on a second sequence; the second sequence is obtained by merging N first sequences, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.

[0272] The present application provides a signal processing device, Figure 3 This is a structural diagram of a signal processing device provided in an embodiment of the present application. The signal processing device can be configured in a first communication node, such as Figure 3 As shown, the signal processing device includes: an acquisition module 31, configured to acquire N first sequences; a merging module 32, configured to merge the N first sequences to obtain a second sequence; and a generation module 33, configured to generate a signal according to the second sequence; wherein N is an integer greater than or equal to 2.

[0273] The signal processing device provided in this embodiment is used to implement the following Figure 1 The signal processing method of the embodiment shown in the figure, the signal processing device provided in this embodiment realizes the same principle and technical effects as Figure 1 The signal processing method of the illustrated embodiment is similar and will not be described again here.

[0274] On the basis of the above embodiment, an extended embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the extended embodiment.

[0275] In one embodiment, the merging module 32 is specifically configured to:

[0276] superimposing the N first sequences; or,

[0277] The N first sequences are respectively subjected to designated processing and then superimposed.

[0278] In one embodiment, the merging module 32 is specifically configured to:

[0279] Combining the N first sequences in series; or,

[0280] The N first sequences are respectively processed as specified and then combined in series.

[0281] In one embodiment, the merging module 32 is specifically configured to:

[0282] Mapping the N first sequences to different time-frequency resources respectively; or,

[0283] The N first sequences are respectively subjected to designated processing and then mapped onto different time-frequency resources.

[0284] In one embodiment, the generating module 33 is specifically configured to:

[0285] The second sequence is subjected to designated processing and then mapped onto time-frequency resources to generate a signal.

[0286] In one embodiment, the designated processing includes one or more of the following:

[0287] Mask processing, scrambling processing, precoding processing, energy adjustment, power adjustment, amplitude adjustment, and phase adjustment.

[0288] In one embodiment, the second sequence is a sequence in a non-orthogonal sequence set, and the second sequence corresponds to a pilot.

[0289] In one embodiment, one first sequence corresponds to one pilot.

[0290] In one embodiment, the acquisition module 31 is specifically configured to include one of the following:

[0291] Obtaining N first sequences from a sequence set, where any two of the N first sequences are different, or T sequences of the N first sequences are the same, where T is an integer greater than or equal to 2 and T is less than or equal to N;

[0292] Obtain N first sequences from different sequence sets;

[0293] N first sequences are obtained from different subsets of the same sequence set.

[0294] In one embodiment, the sequence set includes one or more of the following: a Hadamard sequence set; a sequence set obtained according to the Hadamard sequence set; a ZC sequence set; and a four-phase sequence set.

[0295] In one embodiment, the N first sequences are obtained randomly.

[0296] In one embodiment, the apparatus further includes: a data generation module configured to generate data, wherein the data carries information, and the information includes one or more of the following:

[0297] Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence; identity identification information of the first communication node.

[0298] The present application also provides a signal processing device. Figure 4 This is a structural diagram of another signal processing device provided in an embodiment of the present application. The signal processing device can be configured in a second communication node, such as Figure 4 As shown, the signal processing device includes: a receiving module 41, configured to receive a signal from a transmission resource, wherein the signal is generated based on a second sequence; a detection module 42, configured to detect the signal and obtain M sequences for generating the signal; wherein the second sequence is obtained by combining N first sequences, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.

[0299] The signal processing device provided in this embodiment is used to implement the following Figure 2 The signal processing method of the embodiment shown in the figure, the signal processing device provided in this embodiment realizes the same principle and technical effects as Figure 2 The signal processing method of the illustrated embodiment is similar and will not be described again here.

[0300] On the basis of the above embodiment, an extended embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the extended embodiment.

[0301] In one embodiment, the detection module 42 is specifically configured to:

[0302] The signal is detected based on a sequence set to which the N first sequences belong, to obtain M sequences for generating the signal, where the M sequences include the M first sequences.

[0303] In one embodiment, the detection module 42 is specifically configured to:

[0304] The signal is detected based on a non-orthogonal sequence set to which the second sequence belongs, to obtain M sequences for generating the signal, where the M sequences include one second sequence, wherein the non-orthogonal sequence set is determined based on a sequence set to which the N first sequences belong.

[0305] In one embodiment, the device further includes: a data acquisition module configured to:

[0306] Get data symbol;

[0307] The data symbols are detected based on the M sequences used to generate the signal to obtain a detection result.

[0308] In one embodiment, the device further includes: an information acquisition module configured to: acquire information from the detection result, wherein the information includes one or more of the following:

[0309] Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence; identity identification information of the first communication node.

[0310] This application provides a first communication node, Figure 5 A schematic diagram of the structure of a first communication node provided in an embodiment of the present application is shown as follows: Figure 5 As shown, the first communication node provided by the present application includes one or more processors 51 and a storage device 52; the processor 51 in the first communication node can be one or more, Figure 5 In the embodiment, a processor 51 is used as an example; the storage device 52 is used to store one or more programs; the one or more programs are executed by the one or more processors 51, so that the one or more processors 51 implement the embodiment of the present application. Figure 1 The method described.

[0311] The first communication node further includes: a communication device 53 , an input device 54 and an output device 55 .

[0312] The processor 51, storage device 52, communication device 53, input device 54 and output device 55 in the first communication node can be connected through a bus or other means. Figure 5 The bus connection is taken as an example.

[0313] The input device 54 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the first communication node. The output device 55 may include a display device such as a display screen.

[0314] The communication device 53 may include a receiver and a transmitter. The communication device 53 is configured to transmit and receive information according to the control of the processor 51. The information includes but is not limited to signals and data.

[0315] The storage device 52 is a computer-readable storage medium that can be configured to store software programs, computer executable programs, and modules, such as those in the embodiment of the present application. Figure 1 The program instructions / modules corresponding to the method (for example, the acquisition module 31, the merging module 32 and the generation module 33 in the signal processing device). The storage device 52 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the first communication node, etc. In addition, the storage device 52 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the storage device 52 may further include a memory remotely arranged relative to the processor 51, and these remote memories may be connected to the first communication node via a network. Examples of the above-mentioned network include but are not limited to the Internet, an intranet, a local area network, a mobile communication network and a combination thereof.

[0316] This embodiment of the application also provides a second communication node, Figure 6 This is a schematic diagram of the structure of a second communication node provided in an embodiment of the present application. Figure 6 As shown, the second communication node provided by the present application includes one or more processors 61 and a storage device 62; the processor 61 in the second communication node can be one or more, Figure 6 In the embodiment, a processor 61 is used as an example; the storage device 62 is used to store one or more programs; the one or more programs are executed by the one or more processors 61, so that the one or more processors 61 implement the embodiment of the present application. Figure 2 The method described.

[0317] The second communication node further includes: a communication device 63 , an input device 64 and an output device 65 .

[0318] The processor 61, storage device 62, communication device 63, input device 64 and output device 65 in the second communication node can be connected through a bus or other means. Figure 6 The bus connection is taken as an example.

[0319] The input device 64 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the second communication node. The output device 65 may include a display device such as a display screen.

[0320] The communication device 63 may include a receiver and a transmitter. The communication device 63 is configured to perform information transmission and reception communication according to the control of the processor 61.

[0321] The storage device 62 is a computer-readable storage medium that can be configured to store software programs, computer executable programs, and modules, such as the embodiment of the present application. Figure 2 The program instructions / modules corresponding to the signal processing method (for example, the receiving module 41 and the detection module 42 in the signal processing device). The storage device 62 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the second communication node, etc. In addition, the storage device 62 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the storage device 62 may further include a memory remotely arranged relative to the processor 61, and these remote memories may be connected to the second communication node via a network. Examples of the above-mentioned network include but are not limited to the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof.

[0322] The present application also provides a storage medium storing a computer program, wherein when the computer program is executed by a processor, the signal processing method described in any one of the embodiments of the present application is implemented. For example, the signal processing method applied to a first communication node and the signal processing method applied to a second communication node, wherein the signal processing method applied to the first communication node includes: obtaining N first sequences;

[0323] Merging the N first sequences to obtain a second sequence;

[0324] generating a signal according to the second sequence;

[0325] Wherein, N is an integer greater than or equal to 2.

[0326] The signal processing method applied to the second communication node includes: receiving a signal from a transmission resource, wherein the signal is generated based on a second sequence;

[0327] detecting the signal to obtain M sequences generating the signal;

[0328] The second sequence is obtained by combining N first sequences, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.

[0329] The computer storage medium of the embodiment of the present application can adopt any combination of one or more computer-readable media.Computer-readable media can be computer-readable signal media or computer-readable storage media.Computer-readable storage media can be, for example, but not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or components, or any combination thereof.More specific examples (non-exhaustive list) of computer-readable storage media include: electrical connections with one or more wires, portable computer disks, hard disks, random access memories (RAM), read-only memories (ROM), erasable programmable read-only memories (EPROM), flash memories, optical fibers, portable CD-ROMs, optical storage devices, magnetic storage devices, or any suitable combination thereof.Computer-readable storage media can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0330] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0331] The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.

[0332] The computer program code for performing the operations of the present application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0333] The above description is merely an exemplary embodiment of the present application and is not intended to limit the scope of protection of the present application.

[0334] It will be appreciated by those skilled in the art that the term user equipment encompasses any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a car-mounted mobile station.

[0335] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.

[0336] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0337] The block diagram of any logical flow in the drawings of the present application may represent program steps, or may represent interconnected logical circuits, modules and functions, or may represent a combination of program steps and logical circuits, modules and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, a read-only memory (ROM), a random access memory (RAM), an optical storage device and system (a digital versatile disc (DVD) or a compact disk (CD)). Computer-readable media may include non-transient storage media. A data processor may be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and a processor based on a multi-core processor architecture.

[0338] The above description of exemplary embodiments of the present application has been provided by way of exemplary and non-limiting examples. However, various modifications and adaptations of the above embodiments will be apparent to those skilled in the art, when considered in conjunction with the accompanying drawings and the appended claims, without departing from the scope of the present application. Therefore, the proper scope of the present application will be determined by reference to the appended claims.

Claims

1. A signal processing method, characterized in that: Applied to a first communication node, comprising: Obtaining N first sequences; wherein the N first sequences are randomly obtained from different subsets of the same sequence set or different sequence sets; Merging the N first sequences to obtain a second sequence; generating a signal according to the second sequence; Wherein, N is an integer greater than or equal to 2; the signal includes a reference signal or a random access signal, and is sent to the second communication node on the transmission resource; The method further includes generating data, wherein the data carries information, the information including one or more of the following: Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence.

2. The method according to claim 1, characterized in that The merging of the N first sequences includes: superimposing the N first sequences; or, The N first sequences are respectively subjected to designated processing and then superimposed.

3. The method according to claim 1, characterized in that The merging of the N first sequences includes: Combining the N first sequences in series; or, The N first sequences are respectively processed as specified and then combined in series.

4. The method according to claim 1, wherein The merging of the N first sequences includes: Mapping the N first sequences to different time-frequency resources respectively; or, The N first sequences are respectively subjected to designated processing and then mapped onto different time-frequency resources.

5. The method according to claim 1, wherein Generating a signal according to the second sequence includes: The second sequence is subjected to designated processing and then mapped onto time-frequency resources to generate a signal.

6. The method according to any one of claims 2 to 5, characterized in that: The designated processing includes one or more of the following: Mask processing, scrambling processing, precoding processing, energy adjustment, power adjustment, amplitude adjustment, and phase adjustment.

7. The method according to claim 1, characterized in that The second sequence is a sequence in a non-orthogonal sequence set, and the second sequence corresponds to a pilot.

8. The method according to claim 1, characterized in that One first sequence corresponds to one pilot.

9. The method according to claim 1, characterized in that The sequence set includes one or more of the following: a Hadamard sequence set; a sequence set obtained according to the Hadamard sequence set; a ZC sequence set; and a four-phase sequence set.

10. A signal processing method, characterized in that: Applied to a second communication node, comprising: receiving a signal from a transmission resource, where the signal is sent by the first communication node and is generated based on the second sequence; the signal includes a reference signal or a random access signal; detecting the signal to obtain M sequences generating the signal; The second sequence is obtained by combining N first sequences, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2; the N first sequences are randomly obtained from different subsets of the same sequence set or different sequence sets; The method further includes: obtaining information from the detection result, the information including one or more of the following: Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence.

11. The method according to claim 10, characterized in that The detecting the signal to obtain M sequences for generating the signal includes: The signal is detected based on a sequence set to which the N first sequences belong, to obtain M sequences for generating the signal, where the M sequences include the M first sequences.

12. The method according to claim 10, characterized in that The detecting the signal to obtain M sequences for generating the signal includes: The signal is detected based on a non-orthogonal sequence set to which the second sequence belongs, to obtain M sequences for generating the signal, where the M sequences include one second sequence, wherein the non-orthogonal sequence set is determined based on a sequence set to which the N first sequences belong.

13. The method according to claim 10, characterized in that Also includes: Get data symbol; The data symbols are detected based on the M sequences used to generate the signal to obtain a detection result.

14. A signal processing device, characterized in that: Configured at the first communication node, including: an acquisition module, configured to acquire N first sequences; wherein the N first sequences are acquired randomly; a merging module, configured to merge the N first sequences to obtain a second sequence; a generating module, configured to generate a signal according to the second sequence; Wherein, N is an integer greater than or equal to 2; the signal includes a reference signal or a random access signal, and is sent to the second communication node on the transmission resource; Get the module, which can be configured as one of the following: Obtain N first sequences from different sequence sets; Obtain N first sequences from different subsets of the same sequence set; The apparatus further includes a data generation module configured to generate data, wherein the data carries information, and the information includes one or more of the following: Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence.

15. A signal processing device, characterized in that: Configured at the second communication node, including: a receiving module configured to receive a signal from a transmission resource, wherein the signal is sent by the first communication node and is generated based on the second sequence; the signal includes a reference signal or a random access signal; a detection module, configured to detect the signal and obtain M sequences that generate the signal; The second sequence is obtained by combining N first sequences, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2; the N first sequences are randomly obtained from different subsets of the same sequence set or different sequence sets; The device further includes an information acquisition module configured to acquire information from the detection result, wherein the information includes one or more of the following: Identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; identification information of the second sequence; energy information of the second sequence.

16. A first communication node, characterized in that: include: one or more processors; a storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 9.

17. A second communication node, characterized in that: include: one or more processors; a storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 10 to 13.

18. A storage medium, characterized in that The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 13 is implemented.

Images