Data processing method, apparatus, first communication node, and second communication node

Abstract

This application proposes a data processing method, apparatus, a first communication node, and a second communication node. The method includes acquiring N first sequences; determining a second sequence based on at least one of the N first sequences; processing data based on the second sequence to obtain data symbols; and sending the N first sequences and the data symbols; wherein N is an integer greater than or equal to 2.

Description

Technical Field

[0001] This application relates to the field of communications, specifically to data processing methods, apparatus, a first communication node, and a second communication node. Background Technology

[0002] Scheduling-free transmission terminals can send data autonomously without sending scheduling requests or waiting for dynamic scheduling. Therefore, scheduling-free transmission can reduce 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 access users.

[0003] Scheduling-free transmission includes two schemes: pre-configured scheduling-free and contention-based scheduling-free. In the contention-based scheduling-free transmission scheme using multiple pilots, the transmitter randomly selects multiple pilot sequences, and the receiver uses these multiple pilots for user identification and detection. In this scheme, digitally modulated symbols can be extended using an extension sequence before resource mapping and transmission. However, when combining multi-pilot-based scheduling-free transmission with extension, how to perform data processing to enable communication between the communicating parties remains a critical technical problem to be solved. Summary of the Invention

[0004] This application provides a data processing method, an apparatus, a first communication node, and a second communication node.

[0005] In a first aspect, embodiments of this application provide a data processing method applied to a first communication node, comprising:

[0006] Obtain N first sequences;

[0007] The second sequence is determined based on at least one of the N first sequences;

[0008] The data is processed based on the second sequence to obtain data symbols;

[0009] Send the N first sequences and the data symbols;

[0010] Where N is an integer greater than or equal to 2.

[0011] Secondly, embodiments of this application provide a data processing method applied to a second communication node, comprising:

[0012] Receive signals and data symbols, the signals being generated based on N first sequences;

[0013] The signal is detected to obtain M sequences that generated the signal, and a second sequence corresponding to the data symbol is determined based on the M sequences.

[0014] The data symbols are detected according to the second sequence, and the detection results are obtained;

[0015] Where N is an integer greater than or equal to 2, and M is an integer greater than or equal to 1.

[0016] Thirdly, embodiments of this application provide a data processing apparatus configured at a first communication node, comprising:

[0017] The module is configured to retrieve N first sequences.

[0018] The determining module is configured to determine the second sequence based on at least one of the N first sequences;

[0019] The processing module is configured to process the data based on the second sequence to obtain data symbols;

[0020] The sending module is configured to send the N first sequences and the data symbols, where N is an integer greater than or equal to 2.

[0021] Fourthly, embodiments of this application provide a data processing apparatus configured at a second communication node, comprising:

[0022] The receiving module is configured to receive signals and data symbols, wherein the signals are generated based on N first sequences, where N is an integer greater than or equal to 2;

[0023] The detection module is configured to detect the signal, obtain M sequences that generated the signal, and determine a second sequence corresponding to the data symbol based on the M sequences, wherein M is an integer greater than or equal to 1;

[0024] The acquisition module is configured to detect the data symbols based on the second sequence and acquire the detection results.

[0025] Fifthly, embodiments of this application provide a first communication node, including:

[0026] One or more processors;

[0027] Storage device for storing one or more programs;

[0028] When the one or more programs are executed by the one or more processors, the one or more processors perform the method as described in the first aspect of this application.

[0029] Sixthly, embodiments of this application provide a second communication node, including:

[0030] One or more processors;

[0031] Storage device for storing one or more programs;

[0032] When the one or more programs are executed by the one or more processors, the one or more processors perform the method as described in the second aspect of this application.

[0033] In a seventh aspect, embodiments of this application provide a storage medium storing a computer program, which, when executed by a processor, implements any of the methods described in the embodiments of this application.

[0034] Further details regarding the above embodiments and other aspects of this application, as well as their implementations, are provided in the accompanying drawings, detailed description, and claims. Attached Figure Description

[0035] Figure 1 A flowchart illustrating a data processing method provided in this application;

[0036] Figure 1a This is a schematic diagram of a traditional contention-free scheduling scheme based on "pilot + data" for transmission frames.

[0037] Figure 1b This is a schematic diagram of a transmission frame structure based on a contention-free scheduling scheme using "multiple pilots + data".

[0038] Figure 1c A schematic diagram of the CDF distribution of sequence cross-correlation values ​​provided in this application;

[0039] Figure 1d This application provides another schematic diagram of the CDF distribution of sequence cross-correlation values;

[0040] Figure 2 A flowchart illustrating yet another data processing method provided in this application;

[0041] Figure 3 A schematic diagram of the structure of a data processing device provided in this application;

[0042] Figure 4 A schematic diagram of another data processing device provided in this application;

[0043] Figure 5 A schematic diagram of the structure of a first communication node provided in this application;

[0044] Figure 6 This is a schematic diagram of the structure of a second communication node provided in this application. Detailed Implementation

[0045] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in detail below with reference to the accompanying drawings. It should be noted that, unless otherwise specified, the embodiments and features described in these embodiments can be arbitrarily combined with each other.

[0046] The steps illustrated in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases the steps shown or described may be performed in a different order than that presented here.

[0047] In one exemplary implementation Figure 1 This application provides a flowchart illustrating a data processing method, which is applicable at least to data processing in the context of a combination of multi-pilot-based scheduling-free transmission and extended transmission. The method can be executed by the data processing apparatus provided in this application. The data processing apparatus can be implemented in software and / or hardware and is generally integrated on a first communication node, which can be any type of wireless user equipment.

[0048] For a contention-free, scheduling-free transmission scheme based on multiple pilots, multiple independent or randomly selected pilot sequences are designed on the transmitting side (e.g., the first communication node side). The receiving side (e.g., the second communication node side) uses these multiple pilots for user identification and detection. When combined with spreading, using a single spreading sequence to spread the data modulation symbols before transmission, it is necessary to address how to design the pilot sequences, establish the correlation between the pilot sequences and the spreading sequences, and how the receiver determines the spreading sequence used by the transmitter based on the identified pilot sequences, thereby achieving data detection.

[0049] This application realizes contention-free scheduling transmission based on a combination of multiple pilots and extensions.

[0050] like Figure 1 As shown, the data processing method provided in this application includes S110, S120, S130 and S140.

[0051] S110, Obtain N first sequences.

[0052] In multi-pilot transmission, a first sequence can correspond to one pilot, or it can be a pilot sequence used by one pilot. N is an integer greater than or equal to 2.

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

[0054] Each first sequence can be randomly obtained.

[0055] The value of N is not limited here; in one example, the value of N includes 2 or 3.

[0056] In one example, the length of each of the N first sequences is L, where L is an integer greater than or equal to 2.

[0057] S120. Determine the second sequence based on at least one of the N first sequences.

[0058] When processing data, such as performing extended processing, a relationship between N first sequences and second sequences can be constructed. The second sequence is used to process the data. The second sequence can be a sequence determined based on at least one of the N first sequences.

[0059] After obtaining N first sequences, this step can determine the merged sequence based on the N first sequences, and then determine the second sequence based on the merged sequence. The merged sequence is the sequence obtained by merging the N first sequences. The merging process includes, but is not limited to, superposition or concatenation. Superposition can be considered as adding the N first sequences together. Concatenation includes directly concatenating the first sequences (sequence concatenation) or concatenating the elements of each first sequence in a certain order (element concatenation). For example, when concatenating, first extract the first element of each first sequence, then extract the second element of each first sequence, and so on, to complete the concatenation.

[0060] After obtaining N first sequences, this step can determine the second sequence based on one of the N first sequences. When determining the second sequence from one of the N first sequences, the second sequence can be determined based on the first sequence and the correspondence between the first and second sequences. The first sequence can be considered the first sequence among the N first sequences used to determine the second sequence. The correspondence between the first and second sequences can be pre-constructed. For example, the correspondence between the first and second sequences can be determined based on the set of first sequences to which the first sequence belongs and the set of second sequences to which the second sequence belongs. The relationship between the first sequence in the set of first sequences and the second sequence in the set of second sequences can be one-to-one or many-to-one.

[0061] After obtaining N first sequences, this step can determine the second sequence based on multiple first sequences among the N first sequences. When determining the second sequence based on multiple first sequences among the N first sequences, a merged sequence can be determined based on the multiple first sequences. Then, based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence is determined. The merged sequence can be the sequence obtained by merging multiple first sequences. The correspondence between the merged sequence and the second sequence can be pre-constructed, such as determined based on the correspondence between the set of merged sequences and the set of second sequences. The set of merged sequences can be determined based on the sequence set to which the multiple first sequences belong. For example, multiple first sequences can be extracted from the sequence set to which the multiple first sequences belong, merged, and then a set of merged sequences can be obtained.

[0062] In one example, to achieve extended transmission, or equivalent extended transmission, or diversity transmission of data, the length of the second sequence can be T, where T is an integer greater than or equal to 2.

[0063] S130. The data is processed based on the second sequence to obtain data symbols.

[0064] After determining the second sequence, the data is processed based on the second sequence to obtain data symbols. The processing method is not limited and can be determined based on the function of the second sequence. In one example, the data can be extended, modulated, or mapped based on the second sequence. These processes can achieve extended transmission, equivalent extended transmission, or diversity transmission of the data.

[0065] S140, Send the N first sequences and the data symbols.

[0066] After obtaining the data symbols, this step can send N first sequences and data symbols for the second communication node to receive and process.

[0067] When sending N first sequences, the N first sequences can be directly mapped to different transmission resources; alternatively, the N sequences can be merged and then mapped to transmission resources.

[0068] This application provides a data processing method applied to a first communication node, comprising: acquiring N first sequences; determining a second sequence based on at least one of the N first sequences; processing data based on the second sequence to obtain data symbols; and transmitting the N first sequences and the data symbols; wherein N is an integer greater than or equal to 2. This method can combine multi-pilot and extended transmission, which is beneficial for improving user transmission performance and system performance.

[0069] Based on the above embodiments, extended embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the extended embodiments.

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

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

[0072] Obtain N first sequences from a sequence set, wherein any two sequences in the N first sequences are different, or, T sequences in 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;

[0073] Obtain N first sequences from different sets of sequences;

[0074] Obtain N first sequences from different subsets of the same sequence set.

[0075] In one embodiment, the sequence set includes one or more of the following: a Hada code sequence set; a sequence set obtained from the Hada code sequence set; a ZC sequence set; and a four-phase sequence set.

[0076] In one embodiment, determining the second sequence based on at least one of the N first sequences includes:

[0077] Based on the N first sequences, determine the merge sequence;

[0078] The second sequence is determined based on the merged sequence and the correspondence between the merged sequence and the second sequence.

[0079] When determining the merge sequence based on N first sequences, the N first sequences can be merged to obtain the merge sequence. Merging processes include, but are not limited to, superposition or concatenation. Other merging methods can also be used to obtain the merge sequence. For example, assuming there are two first sequences, the elements of these two first sequences can be used as the real and imaginary parts, respectively, to obtain the merge sequence.

[0080] In one embodiment, determining the merge sequence based on the N first sequences includes:

[0081] The N first sequences are combined in series or superimposed to obtain a merged sequence.

[0082] In one example, the length of the merged sequence is L or N*L. For instance, when using superposition, the length of the merged sequence is L; when using cascade combination, the length of the merged sequence is N*L.

[0083] In one embodiment, determining the second sequence based on at least one of the N first sequences includes:

[0084] The second sequence is determined based on one of the N first sequences and the correspondence between the first sequence and the second sequence.

[0085] In one embodiment, the processing of data based on the second sequence includes one of the following: expansion processing; modulation processing; mapping processing.

[0086] In one embodiment, sending the N first sequences includes one of the following:

[0087] The N first sequences are mapped to different transmission resources to generate signals and send them;

[0088] The N first sequences are merged and mapped onto transmission resources to generate signals and send them.

[0089] The merging process includes either cascaded combination processing or superposition processing.

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

[0091] In one embodiment, the transmission resources used by the pilots corresponding to the N first sequences include one of the following: time-division resources; frequency-division resources; time-frequency-division resources; code-division resources; or randomly selected resources. When one first sequence corresponds to one pilot, the pilots corresponding to the N first sequences include N pilots.

[0092] In one embodiment, the data carries information, which includes one or more of the following:

[0093] The identification information of the N first sequences; the energy information of at least one of the N first sequences; the identification information of the second sequence; and the identification information of the first communication node.

[0094] The identification information for N first sequences is used to identify the corresponding first sequence, and the identification information for the second sequence is used to identify the second sequence. The identification information for the first communication node is used to identify the first communication node. The specific content of each 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, number, or identification code.

[0095] Energy information can be information that identifies the energy of a corresponding sequence (such as at least one first 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 mentioned above includes energy level or energy ratio.

[0096] The following is an exemplary description of this application, and the data processing method described in this application can be considered as a data transmission method.

[0097] In grant-free transmission, terminals can send data autonomously without needing to send scheduling requests or wait for dynamic scheduling. Therefore, grant-free transmission reduces signaling overhead and transmission latency, and also lowers terminal power consumption. Furthermore, it can be combined with non-orthogonal transmission to increase the number of users that can access the network.

[0098] Scheduling-free transmission includes two schemes: semi-persistent scheduling (or configured grant) and contention-based scheduling. For semi-persistent scheduling, the base station can pre-configure or semi-statically configure time-frequency resources and pilot sequences for each terminal. This configuration ensures that multiple terminals use different time-frequency resources and / or pilot sequences, thus avoiding collisions and facilitating user identification and detection. Available time-frequency resources are typically periodic, making it suitable for periodic services, but less efficient and more delayed for random burst services. For contention-based scheduling, when a terminal receives a service request, it can randomly select time-frequency resources and pilot sequences for contention-based access and transmission. Collisions may occur when multiple terminals use the same resources and sequences, requiring the receiver to use more complex or advanced blind detection algorithms for user identification and detection. Contention-based scheduling is more suitable for random burst services, offering better transmission efficiency and lower latency.

[0099] Contention-free scheduling can be implemented based on a "pilot + data" channel structure, where the base station uses pilots to achieve multi-user detection. Pilots include at least a preamble and a reference signal.

[0100] Figure 1a This is a schematic diagram of a traditional contention-based, scheduling-free transmission frame structure. (Example:) Figure 1aAs shown, a traditional scheme uses a single pilot, which can consist of a sequence. The receiver uses the pilot for user identification and detection. If two users select different pilots, both users may be correctly received and detected. When two users select the same pilot, a collision occurs. In this case, the receiver can only identify one user and obtain only one channel estimate, which is the sum of the channels of both users. If the two User Equipment (UE) devices have comparable power, it is possible that neither user can be correctly decoded. Due to the limited number of pilots, the collision situation worsens rapidly with the increase in the number of users, thus affecting the number of users the system can support.

[0101] Figure 1b This is a schematic diagram of a transmission frame structure based on a contention-free scheduling scheme using "multi-pilot + data", as shown below. Figure 1b As shown, the main idea of ​​the multi-pilot scheme is to design multiple independent or randomly selected pilots with the same resource overhead. The receiver uses multiple 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 through pilot 2, followed by interference cancellation, thereby improving the detection performance of other users.

[0102] for Figure 1a The scheme shown assumes that the candidate pilot set contains N pilot sequences. Taking two users competing for access as an example, the collision rate is 1 / N. Figure 1b The scheme shown assumes two independent pilots, w = 2, and that the pilot overhead remains constant. Each pilot can be randomly selected from a candidate pilot set containing N / 2 pilot sequences. Therefore, the collision rate for two users competing for access is (2 / N)^2 = 4 / N^2. It can be seen that the collision rate of the latter is 4 / N 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 relative to the former becomes increasingly lower. For example, when N = 24, the collision rate of the latter is 1 / 6 of the former; when N = 48, the collision rate of the latter is 1 / 12 of the former. Therefore, the competition-free scheduling scheme based on "multi-pilot + data" can significantly reduce the collision rate, thereby increasing the number of users accessing the system.

[0103] For contention-free scheduling transmission, the "data" portion can still utilize traditional processing procedures, including channel coding, digital modulation, resource mapping, and transmission. Furthermore, it can be combined with extension, expanding the digitally modulated symbols using an extension sequence before resource mapping and transmission. This is similar to extension-based multiple access or code division multiple access. The extension sequence used can come from orthogonal or non-orthogonal sets of extension sequences. Expanding symbols with extension sequences can obtain diversity gain to improve user transmission performance, increase the number of access users through code domain multiplexing, and also improve inter-cell interference suppression, thereby enhancing system performance.

[0104] Traditional single-pilot contention-free scheduling schemes are relatively easy to combine with spread sequences. For example, a one-to-one or many-to-one relationship can be established between the pilot sequence and the spread sequence. Each terminal determines the corresponding spread sequence based on the selected pilot sequence and then uses this spread sequence to spread the modulation symbols. When two terminals select the same pilot sequence, they also use the same spread sequence. The receiver performs pilot identification and determines the spread sequence used by the terminal based on the identified pilot sequence for data detection.

[0105] For a competition-based scheduling-free transmission scheme based on multiple pilots, the transmitter randomly selects multiple pilot sequences, and the receiver uses multiple pilots for user identification and detection. However, when combined with extension, since multiple independent or randomly selected pilot and extension sequences cannot be directly correlated as in the traditional scheme, it is necessary to solve how to design pilot sequences, establish the correlation between pilot sequences and extension sequences, and how the receiver determines the extension sequence based on the identified pilot sequences.

[0106] In one embodiment, a data processing method provided by this application includes: acquiring two pilot sequences (i.e., a first sequence); jointly determining an extended sequence (i.e., a second sequence) to be used based on the two pilot sequences; processing data using the extended sequence to generate data symbols to be transmitted; and transmitting the two pilot sequences and the data symbols. The data processing method may further include: acquiring two pilot sequences P1 and P2 (i.e., the first sequence); determining an extended sequence (i.e., the second sequence) to be used based on either pilot sequence P1 or pilot sequence P2; processing data using the extended sequence to generate data symbols to be transmitted; and transmitting the two pilot sequences and the data symbols.

[0107] In this embodiment, the total time-frequency resource overhead occupied by the pilots is 24 resource elements (REs). Taking two pilots P1 and P2 as an example, the pilot sequences of the two pilots both come from a sequence set A, which includes 12 orthogonal sequences of length 12. The resources occupied by the two pilots can be time-division, frequency-division, or time-frequency-division.

[0108] In this embodiment, the terminal first acquires two pilot sequences (i.e., the first sequence). Specifically, the terminal randomly selects two sequences from sequence set A as pilot sequence P1 and pilot sequence P2. Then, pilot sequences P1 and P2 are each a sequence of length 12.

[0109] Combining two pilot sequences is equivalent to obtaining a sequence of length 24. Since sequence set A contains 12 orthogonal sequences of length 12, arbitrarily selecting two sequences from A and combining them yields a sequence of length 24. Therefore, a total of 144 sequences of length 24 can be obtained. That is, a sequence set B can be obtained, containing 144 sequences of length 24. Furthermore, sequence set B is a non-orthogonal sequence set. Combining two sequences includes: concatenating the two sequences, or combining the elements of the two sequences in a specified order.

[0110] Furthermore, the extended sequence (i.e. the second sequence) used by the terminal comes from a set of extended sequences C.

[0111] In one scenario, assuming the extended sequence set C contains 144 extended sequences, then the 144 sequences in the sequence set B can be made to correspond one-to-one with the 144 extended sequences in the extended sequence set C.

[0112] In another scenario, the relationship between sequences in sequence set B and sequences in extended sequence set C can be many-to-one. For example, assuming extended sequence set C contains 36 sequences, then four sequences in sequence set B can correspond to one sequence in extended sequence set C.

[0113] Therefore, assuming sequence set B contains M sequences and extended sequence set C contains N sequences, we can assign X sequences from sequence set B to one sequence from extended sequence set C, where X = ceil(M / N), ceil() represents rounding up, M, N, and X are positive integers, and N is less than or equal to M. Thus, X is greater than or equal to 1, meaning there is a one-to-one or many-to-one relationship between the sequences in sequence set B and the sequences in extended sequence set C.

[0114] In addition, mixed correspondences can be considered. For example, there is an X-to-1 relationship between (MN(X-1))*X sequences in sequence set B and MN(X-1) sequences in sequence set C, and there is an (X-1)-to-1 relationship between (N*XM)*(X-1) sequences in sequence set B and N*XM sequences in sequence set C.

[0115] In one scenario, suppose the extended sequence set C contains 12 extended sequences. Then, we can assign a correspondence between the 12 sequences in sequence set B and one sequence in extended sequence set C. Since sequence set A also contains 12 sequences, we can select a specific sequence from sequence set A as the pilot sequence P1, and then select any sequence from sequence set A as the pilot sequence P2. Pilot sequence P2 has 12 possibilities. Combining these two sequences can generate 12 sequences in sequence set B, and these 12 sequences can be assigned a correspondence with one sequence in extended sequence set C. Therefore, this is effectively equivalent to a correspondence between pilot sequence P1 and one sequence in extended sequence set C. Thus, in this case, the number of sequences in extended sequence set C is the same as the number of sequences in sequence set A. We can establish a correspondence between sequences in sequence set A and sequences in extended sequence set C, or between pilot sequence P1 or pilot sequence P2 and sequences in extended sequence set C.

[0116] The terminal further performs the following operations: The terminal jointly determines the extended sequence (i.e., the second sequence) to be used based on the two pilot sequences obtained. Specifically, the terminal determines the extended sequence to be used based on the association or correspondence between the long sequence formed by the two pilot sequences and the extended sequences in the extended sequence set C. The terminal can determine the index of the long sequence formed by the two pilot sequences obtained from the sequence set A in the sequence set B. Then, based on the index and the association or correspondence between the sequences in the sequence set B and the sequences in the extended sequence set C, the terminal determines the index of the corresponding extended sequence, thereby determining the extended sequence to be used.

[0117] When two terminals randomly select the same two pilot sequences, the two terminals will also use the same extended sequence.

[0118] Alternatively, the terminal may further perform the following operation: the terminal determines the extended sequence to be used based on the acquired pilot sequence P1 or pilot sequence P2.

[0119] Specifically, when there is a correlation or correspondence between the pilot sequence P1 and the extended sequences in the extended sequence set C, the terminal determines the extended sequence to be used based on the pilot sequence P1; when two terminals randomly select the same pilot sequence P1, the extended sequences used by the two terminals are also the same.

[0120] Alternatively, when there is a correlation or correspondence between the pilot sequence P2 and the extended sequences in the extended sequence set C, the terminal determines the extended sequence to be used based on the pilot sequence P2; when two terminals randomly select the same pilot sequence P2, the two terminals also use the same extended sequence.

[0121] The extended sequence set C mentioned above contains sequences that can be mutually orthogonal or non-orthogonal; sequences that can be real or complex; sequences that can be non-sparse or sparse; and so on. Furthermore, to improve transmission efficiency and reduce receiver complexity, shorter extended sequences, such as those with a length of 4, can be used.

[0122] Then, the terminal processes the data using the determined extended sequence to generate data symbols to be sent.

[0123] In one scenario, the terminal uses a determined spreading sequence to spread the modulation symbols (i.e., data symbols) to generate data symbols to be transmitted. In another scenario, the determined spreading sequence is a sequence pattern used to indicate the location of the modulation symbols mapped onto transmission resources. Still another scenario involves the determined spreading sequence being a sequence pattern, which the terminal uses to determine or generate a sequence set or codebook, and then uses this sequence set or codebook to modulate or map data bits to generate data symbols to be transmitted.

[0124] Finally, the terminal sends the two acquired pilot sequences and the generated data symbols to be transmitted.

[0125] Specifically, the terminal maps the two acquired pilot sequences and the generated data symbols to be transmitted onto the transmission resources, and then generates a transmission signal for transmission.

[0126] In this embodiment, Table 1 is a set table of sequence set A, which can be a set of 12 orthogonal Hadamard 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 containing 144 non-orthogonal sequences of length 24 can be constructed. Figure 1c A schematic diagram of the CDF distribution of sequence cross-correlation values ​​provided in this application. See also... Figure 1c Approximately 85% of the sequences had a cross-correlation value of 0, and approximately 15% had a cross-correlation value of 0.5.

[0127] Table 1. Set table of a sequence set A

[0128]

[0129]

[0130] In this embodiment, Table 2 is a set table of another sequence set A. The pilot sequence set, i.e., sequence set A, can also be the sequence set shown in Table 2. This sequence set also contains 12 orthogonal sequences of length 12. Each sequence is sparse and can be regarded as a combination of a comb-like structure containing 3 combs and a set of orthogonal Hada code 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 its sequences are the same as described above. Figure 1c The characteristics shown are the same, that is, the cross-correlation characteristics are the same as those of the non-orthogonal sequence set B constructed based on the sequence set A shown in Table 1.

[0131] Table 2 is a set table of another type of sequence set A.

[0132] In this embodiment, the nonorthogonal sequence set B is obtained by combining two (identical) orthogonal sequence sets. Most of the sequences are still orthogonal to each other, and the cross-correlation value of the sequences is generally low. Overall, the nonorthogonal sequence set B has good sequence structure and cross-correlation characteristics.

[0133] For the pilot sequence set A shown in Table 2, it can be considered that the candidate pilot set includes candidate pilot resources and sequences from the orthogonal sequence set. Therefore, in this embodiment, pilot sequences and pilots are generally considered equivalent, and the description of pilot sequences in the above description can generally be replaced with the description of pilots. This embodiment does not impose any restrictions.

[0134] In this embodiment, the sequence set A can also be other orthogonal sequence sets or non-orthogonal sequence sets. For example, it can be a sequence set composed of a comb-shaped resource structure containing 6 combs and a set of two orthogonal Hada code sequences of length 2; or a ZC (Zadoff-Chu) sequence set; or a four-phase sequence set. For example, the sequence elements come 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 4 phase values, so it can be called a four-phase sequence set.

[0135] In this embodiment, the UE uses multiple pilot sequences. When multiple UEs use the same time-frequency resources for transmission, the pilot collision rate is low. Furthermore, this embodiment, through the design of multiple pilot sequences and the design of the association or correspondence between these multiple pilot sequences and the extended sequence, allows the UE to determine its extended sequence based on the multiple pilot sequences it uses. This supports the UE in using the extended sequence to extend and transmit data symbols, thereby obtaining diversity gain and improving user transmission performance. The receiver can identify and detect the joint pilot sequence used by the UE and correspondingly determine the extended sequence used by the UE to achieve data reception detection. Moreover, in this embodiment, the joint pilot sequence (i.e., the merged sequence) composed of multiple pilot sequences can be considered to originate from a non-orthogonal sequence set with a larger number of sequences. This non-orthogonal sequence set has good sequence structure and cross-correlation characteristics. In other words, the joint pilot sequences used by each UE originate from this non-orthogonal sequence set, are non-orthogonal, and have a low collision probability. The receiver can then utilize this non-orthogonal sequence set and its good sequence structure and cross-correlation characteristics for reception detection, achieving better reception detection performance. From a system perspective, in this embodiment, the extended data symbols of multiple UEs can be transmitted on the same time-frequency resources, which can realize code domain reuse, which is beneficial to increasing the number of access users and also beneficial to inter-cell interference suppression, thereby improving system performance.

[0136] In one embodiment, the total time-frequency resource overhead occupied by the pilots is 24 resource elements. Taking two pilots, P1 and P2, as an example, the pilot sequences P1 and P2 (i.e., the first sequence) come from sequence set A1 and sequence set A2, respectively. Sequence set A1 includes 12 orthogonal sequences of length 12, and sequence set A2 includes 12 orthogonal sequences of length 12. The resources occupied by the two pilots can be time-division, frequency-division, or a combination of both.

[0137] In this embodiment, the terminal first acquires two pilot sequences (i.e., the first sequence). Specifically, the terminal randomly selects one sequence from sequence set A1 as pilot sequence P1, and randomly selects one sequence from sequence set A2 as pilot sequence P2. Therefore, pilot sequences P1 and P2 are each a sequence of length 12.

[0138] Combining any sequence from sequence set A1 with any sequence from sequence set A2 yields a sequence set B, which contains 144 sequences of length 24. Furthermore, sequence set B is a non-orthogonal sequence set.

[0139] Furthermore, the extended sequence (i.e., the second sequence) used by the terminal comes from an extended sequence set C. A one-to-one correspondence can be established between sequences in sequence set B and sequences in extended sequence set C, or a many-to-one relationship can be established between sequences in sequence set B and sequences in extended sequence set C. Alternatively, a correspondence can be established between sequences in sequence set A1 or A2 and sequences in extended sequence set C, or between pilot sequence P1 or pilot sequence P2 and sequences in extended sequence set C.

[0140] Then, the terminal further performs the following operations: the terminal jointly determines the extended sequence to be used based on the two acquired pilot sequences; or, the terminal determines the extended sequence to be used based on the acquired pilot sequence P1 or pilot sequence P2.

[0141] Then, the terminal processes the data using the determined spreading sequence to generate the data symbols to be transmitted. Finally, the terminal transmits the two acquired pilot sequences and the generated data symbols to be transmitted.

[0142] In one embodiment, the total time-frequency resource overhead occupied by the pilots is 24 resource elements. Taking two pilots, P1 and P2, as an example, pilot sequence P1 comes from sequence set A1, and pilot sequence P2 comes from sequence set A2. Sequence sets A1 and A2, respectively, contain half and the other half of the sequences from sequence set A. For example, sequence set A includes 24 orthogonal sequences of length 24. Sequence set A1 consists of the first 12 sequences from sequence set A, and sequence set A2 consists of the last 12 sequences from 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.

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

[0144] In this embodiment, the length of both pilot sequences is 24, so the two pilots can occupy the same time-frequency resources, and they are code-divided.

[0145] In this embodiment, the terminal first acquires two pilot sequences (i.e., the first sequence). This includes the terminal randomly selecting one sequence from sequence set A1 as pilot sequence P1, and randomly selecting one sequence from sequence set A2 as pilot sequence P2. Therefore, pilot sequences P1 and P2 are each a sequence of length 24.

[0146] Since the two pilot signals are code-division multiplexed and use the same time-frequency resources, they can be superimposed and then mapped onto the corresponding time-frequency resources for transmission. In other words, the final transmitted sequence is the sum of pilot sequences P1 and P2, which is also a sequence of length 24. It should be noted that specific processing can be applied to the two pilot sequences before or after superposition. This specific processing includes energy adjustment, energy normalization, power adjustment, amplitude adjustment, phase adjustment, precoding, and scrambling.

[0147] Since sequence set A1 contains 12 orthogonal sequences of length 24, and sequence set A2 also contains 12 orthogonal sequences of length 24, if we arbitrarily choose one sequence from each set A1 and A2, and then superimpose them to obtain a sequence of length 24, then we can obtain a total of 144 sequences of length 24. In other words, we can obtain a sequence set B containing 144 sequences of length 24. Furthermore, sequence set B is a non-orthogonal sequence set.

[0148] Furthermore, the extended sequences used by the terminal come from an extended sequence set C. A one-to-one correspondence can be established between sequences in sequence set B and sequences in extended sequence set C, or a many-to-one relationship can be established between sequences in sequence set B and sequences in extended sequence set C. Alternatively, a correspondence can be established between sequences in sequence set A1 or A2 and sequences in extended sequence set C, or between pilot sequence P1 or pilot sequence P2 and sequences in extended sequence set C.

[0149] Then, the terminal further performs the following operations: the terminal jointly determines the extended sequence (i.e., the second sequence) to be used based on the two acquired pilot sequences (i.e., the first sequence); or, the terminal determines the extended sequence to be used based on the acquired pilot sequence P1 or pilot sequence P2.

[0150] Then, the terminal processes the data using the determined spreading sequence to generate the data symbols to be transmitted. Finally, the terminal transmits the two acquired pilot sequences and the generated data symbols to be transmitted.

[0151] In this embodiment, Table 3 is another set table of sequence set A. Sequence set A can be a set of 24 orthogonal Hada code sequences of length 24, as shown in Table 3. According to the above description of this embodiment, sequence set A1 can contain the first 12 sequences in sequence set A, and sequence set A2 can contain the last 12 sequences in 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. Furthermore, the cross-correlation characteristics between the sequences in sequence set B are as described above. Figure 1c The features shown are the same.

[0152] Table 3 is a set table of another type of sequence set A.

[0153]

[0154] In this embodiment, Table 4 is another set of sequence sets A. Sequence set A can also be a sequence set as shown in Table 4, which also contains 24 orthogonal sequences of length 24. These sequences are sparse and can be considered as a combination of a comb-like structure containing 3 combs and a set of 8 orthogonal Hadamard sequences of length 8. According to the above description of this embodiment, sequence set A1 can contain the first 12 sequences in sequence set A, and sequence set A2 can contain the last 12 sequences in 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. Furthermore, the cross-correlation characteristics between the sequences in sequence set B are the same as described above. Figure 1c The characteristics shown are also the same.

[0155] Table 4. Set table of another sequence set A

[0156]

[0157] In this embodiment, if the total overhead of time-frequency resources occupied by the pilot is 48 resource elements, and the length of the two pilot sequences obtained by the terminal is 24, then the resources occupied by the two pilots can be time-division, frequency-division, or time-frequency-division.

[0158] Any sequence from sequence set A1 can be combined with any sequence from sequence set A2 to obtain a sequence set B, which contains 144 sequences of length 48. Furthermore, sequence set B is a non-orthogonal sequence set.

[0159] The extended sequence (i.e., the second sequence) used by the terminal comes from an extended sequence set C. A one-to-one correspondence can be established between sequences in sequence set B and sequences in extended sequence set C, or a many-to-one relationship can be established between sequences in sequence set B and sequences in extended sequence set C. A correspondence can also be established between sequences in sequence set A1 or A2 and sequences in extended sequence set C, or between pilot sequence P1 or pilot sequence P2 and sequences in extended sequence set C.

[0160] Then, the terminal further performs the following operations: the terminal jointly determines the extended sequence (i.e., the second sequence) to be used based on the two acquired pilot sequences (i.e., the first sequence); or, the terminal determines the extended sequence to be used based on the acquired pilot sequence P1 or pilot sequence P2.

[0161] Then, the terminal processes the data using the determined spreading sequence to generate the data symbols to be transmitted. Finally, the terminal transmits the two acquired pilot sequences and the generated data symbols to be transmitted.

[0162] In this case, sequence set A can be a set of 24 orthogonal Hada code sequences of length 24, as shown in Table 3. Then, sequence set A1 can contain the first 12 sequences from sequence set A, and sequence set A2 can contain the last 12 sequences from sequence set A. Based on sequence sets A1 and A2, a non-orthogonal sequence set B containing 144 sequences of length 48 can be constructed. Furthermore, the cross-correlation characteristics between the sequences in sequence set B are as described above. Figure 1c The features shown are the same.

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

[0164] In one embodiment, the total time-frequency resource overhead occupied by the pilots is 24 resource elements. Taking two pilots, P1 and P2, as an example, pilot P1 consists of a sequence S1 and a sequence Y1, and pilot P2 consists of a sequence S2 and a sequence Y2. Sequences S1 and S2 come from sequence set S, and sequences Y1 and Y2 come from sequence set Y. For example, sequence set S 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 for pilot P1, and the second sequence in sequence set Y is used as sequence Y2 for pilot P2.

[0165] In this embodiment, the terminal first acquires two pilot signals P1 and P2. This includes: randomly selecting a sequence from the sequence set S as sequence S1, acquiring the first sequence Y1 from the sequence set Y, and obtaining pilot signal P1 based on sequence S1 and sequence Y1. Sequence S1 is a sequence of length 12, which can be represented as a 12*1 vector, and sequence Y1 is a sequence of length 2, which can be represented as a 1*2 vector. Performing matrix multiplication on sequence S1 and sequence Y1 yields a 12*2 matrix, which serves as pilot signal P1. This matrix can then be converted into a sequence of length 24, which serves as the pilot sequence used by pilot signal P1 (i.e., the first sequence). Similarly, pilot signal P2 and the pilot sequence used by pilot signal P2 can also be obtained. Therefore, pilot sequences P1 and P2 are both sequences of length 24.

[0166] In this embodiment, sequences Y1 and Y2 can be referred to as orthogonal masks, and the sequence set Y can be referred to as the orthogonal mask set.

[0167] In this embodiment, both pilot sequences are 24 in length, so they can occupy the same time-frequency resources and are code-divided. The two pilot sequences can be superimposed and then mapped onto the corresponding time-frequency resources for transmission.

[0168] As described above, each sequence in sequence set S can be operated on with the first sequence Y1 in sequence set Y to obtain a new sequence set A1, which is equivalent to containing 12 orthogonal sequences of length 24. Similarly, each sequence in sequence set S can be operated on with the second sequence Y2 in sequence set Y to obtain a new sequence set A2, which is also equivalent to containing 12 orthogonal sequences of length 24. Therefore, it can be equivalently considered that pilot sequence P1 comes from sequence set A1, and pilot sequence P2 comes from sequence set A2.

[0169] In fact, in this embodiment, performing operations on any sequence in sequence set S and any sequence in sequence set Y can yield a sequence of length 24. A total of 24 orthogonal sequences of length 24 can be obtained, which can constitute sequence set A. Then, the above sequence set A1 and sequence set A2 can be regarded as coming from sequence set A, and respectively contain half of the sequence set A and the other half of the sequence set A.

[0170] In this embodiment, when the terminal acquires two pilot signals P1 and P2, it can also randomly select a sequence from half of the sequence set S as sequence S1, and randomly select a sequence from the sequence set Y as sequence Y1, and acquire pilot signal P1 based on sequence S1 and sequence Y1; similarly, it can randomly select a sequence from the other half of the sequence set S as sequence S2, and randomly select a sequence from the sequence set Y as sequence Y2, and acquire pilot signal P2 based on sequence S2 and sequence Y2.

[0171] Overlaying any sequence from sequence set A1 with any sequence from sequence set A2 yields a sequence set B, which contains 144 sequences of length 24. Furthermore, sequence set B is a non-orthogonal sequence set.

[0172] Furthermore, the extended sequences used by the terminal come from an extended sequence set C. A one-to-one correspondence can be established between sequences in sequence set B and sequences in extended sequence set C, or a many-to-one relationship can be established between sequences in sequence set B and sequences in extended sequence set C. Alternatively, a correspondence can be established between sequences in sequence set A1 or A2 and sequences in extended sequence set C, or between pilot sequence P1 or pilot sequence P2 and sequences in extended sequence set C.

[0173] Then, the terminal further performs the following operations: the terminal jointly determines the extended sequence to be used based on the two acquired pilot sequences; or, the terminal determines the extended sequence to be used based on the acquired pilot sequence P1 or pilot sequence P2.

[0174] Then, the terminal processes the data using the determined spreading sequence to generate the data symbols to be transmitted. Finally, the terminal transmits the two acquired pilot sequences and the generated data symbols to be transmitted.

[0175] In this embodiment, the sequence set S can be either the set of 12 orthogonal Hada code sequences of length 12 shown in Table 1, or the set of 12 orthogonal sequences of length 12 shown in Table 2. Table 5 is a set table of sequence set Y, as shown in Table 5.

[0176] According to the above description of this embodiment, sequence set A1 and sequence set A2 each contain 12 sequences of length 24; further, a non-orthogonal sequence set B containing 144 sequences of length 24 can be constructed based on sequence set A1 and sequence set A2, and the cross-correlation characteristics between the sequences in sequence set B are the same as described above. Figure 1c The features shown are the same.

[0177] Table 5. Set of sequence set Y

[0178]

[0179] In this embodiment, if the total overhead of time-frequency resources occupied by the pilot is 48 resource elements, and the length of the two pilot sequences obtained by the terminal is 24, then the resources occupied by the two pilots can be time-division, frequency-division, or time-frequency-division.

[0180] Any sequence from sequence set A1 can be combined with any sequence from sequence set A2 to obtain a sequence set B, which contains 144 sequences of length 48. Furthermore, sequence set B is a non-orthogonal sequence set.

[0181] Furthermore, the extended sequences used by the terminal come from an extended sequence set C. A one-to-one correspondence can be established between sequences in sequence set B and sequences in extended sequence set C, or a many-to-one relationship can be established between sequences in sequence set B and sequences in extended sequence set C. Alternatively, a correspondence can be established between sequences in sequence set A1 or A2 and sequences in extended sequence set C, or between pilot sequence P1 or pilot sequence P2 and sequences in extended sequence set C.

[0182] Then, the terminal further performs the following operations: the terminal jointly determines the extended sequence (i.e., the second sequence) to be used based on the two acquired pilot sequences (i.e., the first sequence); or, the terminal determines the extended sequence to be used based on the acquired pilot sequence P1 or pilot sequence P2.

[0183] Then, the terminal processes the data using the determined spreading sequence to generate the data symbols to be transmitted. Finally, the terminal transmits the two acquired pilot sequences and the generated data symbols to be transmitted.

[0184] In this case, the sequence set S can be either the set of 12 orthogonal Hada code sequences of length 12 shown in Table 1, or the set of 12 orthogonal sequences of length 12 shown in Table 2. The sequence set Y is shown in Table 5. Therefore, according to the above description of this embodiment, equivalent sequence sets A1 and A2 can be obtained from sequence sets S and Y, each containing 12 sequences of length 24. Furthermore, a non-orthogonal sequence set B containing 144 sequences of length 48 can be constructed from sequence sets A1 and A2, and the cross-correlation characteristics between the sequences in sequence set B are the same as described above. Figure 1c The features shown are the same.

[0185] In one embodiment, the total time-frequency resource overhead occupied by the pilot is 48 resource elements. Taking two pilots P1 and P2 as an example, the pilot sequences (i.e., the first sequences) of the two pilots both come from a sequence set A, which includes 24 orthogonal sequences of length 24.

[0186] In this embodiment, the resources occupied by the two pilots can be time-division, frequency-division, or time-frequency-division.

[0187] In this embodiment, the terminal first acquires two pilot sequences. Specifically, the terminal randomly selects two sequences from sequence set A as pilot sequence P1 and pilot sequence P2. Then, pilot sequences P1 and P2 are each a sequence of length 24.

[0188] Combining any two sequences in sequence set A yields a sequence set B, which contains 576 sequences of length 48. Furthermore, sequence set B is a non-orthogonal set of sequences.

[0189] Furthermore, the extended sequences used by the terminal come from an extended sequence set C. A one-to-one correspondence can be established between sequences in sequence set B and sequences in extended sequence set C, or a many-to-one relationship can be established between sequences in sequence set B and sequences in extended sequence set C. Alternatively, a correspondence can be established between sequences in sequence set A and sequences in extended sequence set C, or between pilot sequence P1 or pilot sequence P2 and sequences in extended sequence set C.

[0190] Then, the terminal further performs the following operations: the terminal jointly determines the extended sequence to be used based on the two acquired pilot sequences; or, the terminal determines the extended sequence to be used based on the acquired pilot sequence P1 or pilot sequence P2.

[0191] Then, the terminal processes the data using the determined extended sequence to generate data symbols to be sent.

[0192] Finally, the terminal sends the two acquired pilot sequences and the generated data symbols to be transmitted.

[0193] In this embodiment, sequence set A can be a set of 24 orthogonal Hada code sequences of length 24, as shown in Table 3. Based on the above description of this embodiment, for sequence set A shown in Table 3, a set B containing 576 non-orthogonal sequences of length 48 can be constructed. Figure 1d This application provides another schematic diagram of the CDF distribution of sequence cross-correlation values, where the CDF distribution of cross-correlation values ​​between the sequences is shown in the figure. Figure 1d As shown, based on the cumulative distribution function (CDF) and cross-correlation values, it can be seen that 92% of the sequences have a cross-correlation value of 0, and 8% of the sequences have a cross-correlation value of 0.5.

[0194] In this embodiment, sequence set A can also be the sequence set shown in Table 4, which also contains 24 orthogonal sequences of length 24. Based on the above description of this embodiment, for sequence set A shown in Table 4, a non-orthogonal sequence set B containing 576 sequences of length 48 can be constructed, and the cross-correlation characteristics between the sequences in sequence set B are the same as described above. Figure 1d The features shown are the same.

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

[0196] In one embodiment, the data processing method provided in this application includes the following steps:

[0197] Obtain multiple pilot sequences (i.e., N first sequences);

[0198] The second sequence is determined based on multiple pilot sequences, or based on one of the pilot sequences.

[0199] The second sequence is used to process the data and generate data symbols to be sent;

[0200] Multiple pilot sequences and data symbols are transmitted.

[0201] Multiple pilot sequences are pilot sequences used by multiple pilots.

[0202] Obtain multiple pilot sequences, including one of the following:

[0203] Randomly select or randomly generate multiple pilot sequences;

[0204] Multiple sequences are randomly selected or randomly generated, and the multiple sequences are subjected to specified processing to obtain multiple pilot sequences.

[0205] The multiple pilot sequences may originate from a sequence set, or from multiple sequence sets, or from multiple sub-sequence sets of a sequence set, or be generated according to a preset rule.

[0206] The sequence set includes: a Hada code sequence set; or a sequence set obtained from the Hada code sequence set; or a ZC sequence set; or a four-phase sequence set.

[0207] Determining a second sequence based on multiple pilot sequences includes: obtaining a joint pilot sequence (i.e., a merged sequence) based on multiple pilot sequences, and determining the second sequence based on the correlation or correspondence between the joint pilot sequence set and the second sequence set using the obtained joint pilot sequence.

[0208] Obtaining a joint pilot sequence from multiple pilot sequences includes: performing cascaded combination or superposition of multiple pilot sequences to obtain a joint pilot sequence.

[0209] The process of concatenating and combining multiple pilot sequences includes: concatenating multiple pilot sequences, or concatenating and combining the elements of multiple pilot sequences in a specified order.

[0210] Determining a second sequence based on one of the pilot sequences includes: determining the second sequence based on the association or correspondence between the sequence set to which the pilot sequence belongs and the second sequence set; or, determining the second sequence based on the association or correspondence between the pilot sequence and the sequences in the second sequence set.

[0211] The data is processed using a second sequence to generate data symbols to be transmitted, including: using the second sequence to perform expansion processing, modulation processing, or mapping processing on data bits or data symbols to generate data symbols to be transmitted.

[0212] Send multiple pilot sequences, including:

[0213] The multiple pilot sequences are mapped to transmission resources and then transmitted; or...

[0214] The multiple pilot sequences are merged and then mapped onto the transmission resources; or...

[0215] The multiple pilot sequences are processed in a specified manner and then mapped onto the transmission resources for transmission.

[0216] The merging process includes at least a series combination process or a superposition process;

[0217] The specified processing includes at least one of the following: scrambling processing, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, and precoding processing.

[0218] The transmission resources used by the multiple pilot sequences are time-division, frequency-division, time-frequency-division, or code-division.

[0219] The transmission resources used by the multiple pilots are randomly selected or preset.

[0220] Transmitted data symbols, including:

[0221] The data symbols are mapped to transmission resources and then sent; or...

[0222] The data symbols are processed and mapped onto the transmission resources for transmission;

[0223] The specified processing includes at least one of the following: scrambling processing, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, and precoding processing.

[0224] The method further includes carrying information in the data, including identification information of multiple pilot sequences, such as generation information, index information, etc.; identification information of a second sequence; identification information of a first communication node; and may also include energy information of multiple pilot sequences or energy information of at least one pilot sequence.

[0225] This application provides a data processing method. Figure 2 This is a flowchart illustrating another data processing method provided in this application. The method can be integrated into a data processing device, which can be implemented by software and / or hardware, and is generally integrated on a second communication node, which can be a base station.

[0226] like Figure 2 As shown, the data processing apparatus provided in this application includes S210, S220 and S230.

[0227] S210, Receive signals and data symbols, the signals being generated based on N first sequences.

[0228] The signal can be generated by mapping N first sequences onto different transmission resources; or it can be generated by merging N first sequences and then mapping them onto transmission resources.

[0229] Signals and data symbols can be sent by the first communication node.

[0230] S220. Detect the signal to obtain M sequences that generated the signal, and determine the second sequence corresponding to the data symbol based on the M sequences.

[0231] In this step, when detecting the signal, the signal can be detected based on a set of merged sequences or a sequence set to which at least one of the N first sequence sets belongs, to obtain M sequences that generate the signal. The M sequences can be a merged sequence obtained from the N first sequences; they can also be a single first sequence; or they can be M first sequences.

[0232] When determining the second sequence, it can be based on the correspondence between the M sequences and the second sequence.

[0233] S230. Detect the data symbols according to the second sequence and obtain the detection result.

[0234] After determining the second sequence, the data symbols are detected, and the identity of the first communication node is determined based on the detection results, and interference cancellation is performed.

[0235] For details not covered in this embodiment, please refer to the above embodiments; they will not be repeated here.

[0236] This application provides a data processing method, comprising: receiving a signal and data symbols, wherein the signal is generated based on N first sequences; detecting the signal to obtain M sequences that generated the signal, and determining a second sequence corresponding to the data symbols based on the M sequences; detecting the data symbols based on the second sequence to obtain a detection result; wherein N is an integer greater than or equal to 2, and M is an integer greater than or equal to 1. This method can combine multi-pilot and extended transmission, which is beneficial for improving user transmission performance and system performance.

[0237] Based on the above embodiments, extended embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the extended embodiments.

[0238] In one embodiment, detecting the signal to obtain M sequences that generated the signal, and determining a second sequence corresponding to the data symbol based on the M sequences, includes:

[0239] The signal is detected based on the merged sequence set to obtain M sequences that generate the signal, wherein the merged sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include a merged sequence obtained from the N first sequences;

[0240] Based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

[0241] The method for determining the merged sequence set can refer to the technical means by which the first communication node determines the sequence set B, and is not limited here.

[0242] When detecting the signal based on a set of merged sequences, M sequences can be combined into one merged sequence. This applies to each UE. If there are multiple UEs, the merged sequence obtained by the receiver includes the sequences of multiple UEs, meaning it can obtain a merged sequence corresponding to each UE. Therefore, overall, the receiver can detect multiple merged sequences.

[0243] In one embodiment, detecting the signal to obtain M sequences that generated the signal, and determining a second sequence corresponding to the data symbol based on the M sequences, includes:

[0244] The signal is detected based on the merged sequence set to obtain M sequences that generate the signal, wherein the merged sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include a merged sequence obtained from the N first sequences;

[0245] Based on the merged sequence, determine the N first sequences;

[0246] Based on one of the N first sequences and the correspondence between the first sequence and the second sequence, determine the second sequence corresponding to the data symbol.

[0247] The set of merged sequences is determined based on the set of sequences described in the N first sequences. Accordingly, the correspondence between the merged sequence and the N first sequences can be determined. After determining the merged sequence, the N first sequences corresponding to the merged sequence can be directly determined, and the merged sequence can be generated for the N first sequences.

[0248] After determining N first sequences, the second sequence can be determined based on one of the N first sequences and the correspondence between the first sequence and the second sequence.

[0249] In one embodiment, detecting the signal to obtain M sequences that generated the signal, and determining a second sequence corresponding to the data symbol based on the M sequences, includes:

[0250] The signal is detected based on the sequence set to which one of the N first sequences belongs, resulting in M ​​sequences that generate the signal, wherein the M sequences include the first sequence;

[0251] Based on the first sequence and the correspondence between the first sequence and the second sequence, a second sequence corresponding to the data symbol is determined. The first sequence can be understood as a first sequence in a set of sequences used for signal detection. Due to channel influences, this first sequence may not be the same as the first sequence actually used by the transmitter.

[0252] When detecting the signal based on the sequence set to which one of the N first sequences belongs, M sequences can be that first sequence. This is for each UE. If there are multiple UEs, the receiver can obtain the first sequence corresponding to each of the multiple UEs through a similar detection method. Therefore, overall, the receiver can detect multiple first sequences.

[0253] In one embodiment, detecting the signal to obtain M sequences that generated the signal, and determining a second sequence corresponding to the data symbol based on the M sequences, includes:

[0254] The signal is detected based on the sequence set to which the N first sequences belong, resulting in M ​​sequences that generate the signal, wherein the M sequences include the M first sequences;

[0255] Based on the M first sequences, determine the merge sequence;

[0256] Based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

[0257] For a single UE, in one scenario, M equals N, meaning N sequences are obtained to generate the signal. The merging sequence is determined based on these N sequences, similar to the description above. In another scenario, M is less than N, and the method for determining the merging sequence based on the N sequences can be referenced, using M first sequences to obtain all possible merging sequences. If there are multiple UEs, the receiver can obtain M first sequences corresponding to each UE using a similar detection method.

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

[0259] Channel estimation is performed using at least one of the M sequences; or...

[0260] In the case where the M sequences include a merged sequence obtained from the N first sequences, the N first sequences are determined based on the merged sequence, and channel estimation is performed using at least one of the N first sequences.

[0261] When the M sequences include a merged sequence obtained from the N first sequences, the merged sequence can be used for channel estimation; when the M sequences include a first sequence, the first sequence can be used for channel estimation; when the M sequences include M first sequences, at least one of the M first sequences can be used for channel estimation, or the merged sequence obtained from the M first sequences can be used for channel estimation.

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

[0263] Information is obtained from the detection results, including one or more of the following: identification information of the N first sequences; energy information of at least one of the N first sequences; identification information of the second sequence; and identification information of the first communication node.

[0264] The following is an exemplary description of this application, using two pilots P1 and P2 as an example. The receiver acquires the symbols of the two received pilots, as well as the received data symbols.

[0265] The receiver constructs a non-orthogonal sequence set B in a similar manner to the transmitter. It uses each sequence in sequence set B to detect the symbols of the two acquired pilots, identifies the joint pilot sequence (i.e., the merge sequence) used by the transmitter, and then determines the extended sequence (i.e., the second sequence) used by the transmitter based on the identified joint pilot sequence, which is used to detect the received data symbols.

[0266] The receiver uses two pilots to identify and detect the user and determine the spreading sequence used by the user. Then, it uses the pilot sequences identified on the two pilots to perform channel estimation, or uses the joint pilot sequence to perform channel estimation. Based on the channel estimation results and the determined spreading sequence, the receiver detects the received data symbols and then performs demodulation and decoding.

[0267] When multiple users compete for scheduling-free access and transmission, the receiver also uses interference cancellation technology to reconstruct the transmitted symbols of users that have been correctly demodulated and decoded, and then cancel the interference before continuing to detect other users.

[0268] In this embodiment, the specific implementation steps of the receiver include:

[0269] (1) Pilot identification to determine the extended sequence used by the user: Pilot identification can also be called user activation identification. Blind detection is performed using a constructed set of non-orthogonal pilot sequences B. Through correlation detection, joint pilot sequences with correlation values ​​greater than a specified threshold and / or several joint pilot sequences with relatively large correlation values ​​are obtained as the identified joint pilot sequences. Then, based on the correlation or correspondence between the joint pilot sequences and the extended sequences, the extended sequence used by the user is determined using the identified joint pilot sequences. Alternatively, blind detection is performed using the sequence sets to which pilot sequences P1 and / or P2 belong. Through correlation detection, pilot sequences with correlation values ​​greater than a specified threshold and / or several pilot sequences with relatively large correlation values ​​are obtained as the identified pilot sequences P1 and / or P2. Then, based on the correlation or correspondence between pilot sequences P1 or P2 and the extended sequences, the extended sequence used by the user is determined. It is important to note that if an association or correspondence is established between the pilot sequence P1 and the extended sequence, then when using the pilot sequence P1 for detection, the extended sequence used by the user can be determined based on the pilot sequence P1. When using the pilot sequence P2 for detection, the extended sequence used by the user can be determined based on the joint pilot sequence, or based on the combination or superposition of the pilot sequences P1 and P2.

[0270] (2) Channel estimation: Based on the identified joint pilot sequence, pilot sequence P1 and / or pilot sequence P2 are determined, and channel estimation is performed using pilot sequence P1 and / or pilot sequence P2; alternatively, pilot identification can be performed directly on pilot P1 / pilot P2, and channel estimation can be performed using the pilot sequences identified on pilot P1 / pilot P2; or channel estimation can be performed using the identified joint pilot sequence. Since the joint pilot sequence is obtained by combining or superimposing two pilot sequences, and the two pilot sequences can come from orthogonal or non-orthogonal sets of pilot sequences, the receiver can determine these two pilot sequences based on the identified joint pilot sequence. For example, based on the joint pilot sequence index and the size of the pilot sequence set, the two pilot sequences constituting the joint pilot sequence can be determined through division or modulo operations.

[0271] (3) Detect the received data symbols: Based on the channel estimation results of the identified users and the corresponding extended sequences, detect them using, for example, the minimum mean square error (MMSE) detection method, and obtain the data detection results.

[0272] (4) Demodulation and decoding: The detected user data is demodulated and decoded. The cyclic redundancy check (CRC) result determines whether the decoding is correct. Since it is a contention-free, scheduling-free transmission, the data portion can carry the user's identification information. After the receiver correctly decodes the data, it can obtain the user's identification information and the transmitted data.

[0273] (5) Symbol Reconstruction and Interference Cancellation: For users with correct decoding, the decoded output bits are re-encoded, modulated, and expanded to obtain the user's transmitted symbols. The received symbols are then reconstructed using the channel estimation results and subtracted from the received signal to achieve interference cancellation. Symbol reconstruction and interference cancellation include reconstruction and interference cancellation on data symbols and two pilot symbols. Therefore, information from the two pilot symbols can be carried in the data portion, such as the index information and energy information of the two pilot symbols. Furthermore, information from the extended sequence can also be carried in the data portion. For the channel estimation results, the channel estimation results obtained based on the pilots in step (2) can be used. Alternatively, least squares (LS) channel estimation can be performed using the reconstructed transmitted symbols from all users with correct decoding to obtain updated channel estimation results. Interference cancellation is then performed based on these updated channel estimation results.

[0274] (6) Perform the next round of identification and detection: Return to step (1) and perform the next round of identification and detection. Iterate in this way until no user can be identified or detected, or until the specified number of iterations is reached.

[0275] It should be noted that for the two pilots, namely pilot P1 and pilot P2, some of the processing steps described above can be performed separately on the two pilots, and can be performed in parallel or sequentially. If executed in parallel, after pilot identification, channel estimation, and data detection using pilot P1 and pilot P2 respectively, correctly decoded users can be identified. Then, interference cancellation is performed on all users correctly decoded on both pilots. It is possible that a user is correctly decoded on both pilots, requiring only one interference cancellation. If executed sequentially, pilot identification, channel estimation, and data detection can be performed first using pilot P1 to identify correctly decoded users, and interference cancellation can be performed on all correctly decoded users. Then, pilot identification, channel estimation, and data detection can be performed using pilot P2 to identify correctly decoded users, and interference cancellation can be performed on all correctly decoded users. Then, the reception detection and interference cancellation can be performed again using pilot P1 and pilot P2 sequentially, and this process can be iterated.

[0276] In one embodiment, the data processing method provided in this application includes the following steps:

[0277] Acquire the symbols of multiple received pilot signals, and acquire the received data symbols;

[0278] The symbols of the acquired pilot signals are detected to identify the joint pilot sequence used by the transmitter;

[0279] The second sequence used by the transmitter is determined based on the joint pilot sequence;

[0280] The received data symbols are detected based on the determined second sequence.

[0281] The method further includes:

[0282] The pilot sequence used by the transmitter on multiple pilots is determined based on the identified combined pilot sequence (i.e., merged sequence); or, the symbols of the acquired multiple pilots are detected to determine the pilot sequence used by the transmitter on multiple pilots.

[0283] The symbols on the acquired pilots are detected to identify the joint pilot sequence used by the transmitter, including:

[0284] Based on the sequence sets used by multiple pilots respectively, a merged sequence set is obtained. By combining the merged sequences, the symbols of the obtained multiple pilots are detected, and the joint pilot sequence used by the first communication node is identified.

[0285] Based on the sequence sets used by multiple pilots, obtain the merged sequence set, including:

[0286] From the sequence sets used by multiple pilots, select one sequence at random to obtain multiple sequences. Then, combine or superimpose these multiple sequences to obtain a merged sequence set.

[0287] The second sequence used by the transmitter is determined based on the joint pilot sequence, including:

[0288] Based on the correlation or correspondence between the joint pilot sequence set and the second sequence set, the extended sequence, i.e. the second sequence, is determined by the identified joint pilot sequence.

[0289] The method further includes:

[0290] The second sequence used by the transmitter is determined based on the pilot sequence used on one of the pilots; or,

[0291] The second sequence used by the transmitter is determined based on the pilot sequences used by the transmitter on multiple pilots; or,

[0292] When using one of the pilots for detection, the second sequence used by the transmitter is determined based on the pilot sequence used on that pilot. When using other pilots for detection, the second sequence used by the transmitter is determined based on the combined pilot sequence.

[0293] The method further includes:

[0294] Channel estimation is performed using pilot sequences on at least one of the determined pilot frequencies used by the transmitter to detect received data symbols; or, channel estimation is performed using a joint pilot sequence used by the determined transmitter to detect received data symbols.

[0295] The method further includes:

[0296] After detecting the received data symbols according to the determined second sequence and obtaining the detection result, the detection result is demodulated and decoded to obtain the data sent by the transmitter.

[0297] Furthermore, the method also includes:

[0298] From the data transmitted by the transmitter, obtain the transmitter's identification information (i.e., the first communication node's identification information), the information of the pilot sequences used by the transmitter on multiple pilot frequencies (i.e., the identification information of N first sequences), and the information of the second sequence used by the transmitter (i.e., the identification information of the second sequence).

[0299] This application provides a data processing apparatus. Figure 3 This is a schematic diagram of a data processing device provided in this application. The device is configured at a first communication node, such as... Figure 3 As shown, the device includes: an acquisition module 31 configured to acquire N first sequences; a determination module 32 configured to determine a second sequence based on at least one of the N first sequences; a processing module 33 configured to process data based on the second sequence to obtain data symbols; and a sending module 34 configured to send the N first sequences and the data symbols, wherein N is an integer greater than or equal to 2.

[0300] The data processing device provided in this embodiment is used to achieve, for example... Figure 1 The data processing method of the illustrated embodiment, and the data processing device provided in this embodiment, are implemented in the same principle and have the same technical effects. Figure 1 The data processing method in the illustrated embodiment is similar and will not be described again here.

[0301] Based on the above embodiments, extended embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the extended embodiments.

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

[0303] In one embodiment, the acquisition module 31 includes one of the following:

[0304] Obtain N first sequences from a sequence set, wherein any two sequences in the N first sequences are different, or, T sequences in 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;

[0305] Obtain N first sequences from different sets of sequences;

[0306] Obtain N first sequences from different subsets of the same sequence set.

[0307] In one embodiment, the sequence set includes one or more of the following: a Hada code sequence set; a sequence set obtained from the Hada code sequence set; a ZC sequence set; and a four-phase sequence set.

[0308] In one embodiment, the determining module 32 is specifically configured as follows:

[0309] Based on the N first sequences, determine the merge sequence;

[0310] The second sequence is determined based on the merged sequence and the correspondence between the merged sequence and the second sequence.

[0311] In one embodiment, the determining module 32 is specifically configured as follows:

[0312] The N first sequences are combined in series or superimposed to obtain a merged sequence.

[0313] In one embodiment, the determining module 32 is specifically configured as follows:

[0314] The second sequence is determined based on one of the N first sequences and the correspondence between the first sequence and the second sequence.

[0315] In one embodiment, the processing of data based on the second sequence includes one of the following: expansion processing; modulation processing; mapping processing.

[0316] In one embodiment, the sending module 34 includes one of the following:

[0317] The N first sequences are mapped to different transmission resources to generate signals and send them;

[0318] The N first sequences are merged and mapped onto transmission resources to generate signals and send them.

[0319] The merging process includes either cascaded combination processing or superposition processing.

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

[0321] In one embodiment, the transmission resources used by the pilots corresponding to the N first sequences include one of the following: time-division resources; frequency-division resources; time-frequency-division resources; code-division resources; and randomly selected resources.

[0322] In one embodiment, the data carries information, which includes one or more of the following:

[0323] The identification information of the N first sequences; the energy information of at least one of the N first sequences; the identification information of the second sequence; and the identification information of the first communication node.

[0324] This application also provides a data processing apparatus. Figure 4 This is a schematic diagram of another data processing device provided in this application, which is configured at a second communication node. See also... Figure 4 The device includes: a receiving module 41, configured to receive signals and data symbols, wherein the signals are generated based on N first sequences, where N is an integer greater than or equal to 2; a detection module 42, configured to detect the signals to obtain M sequences that generated the signals, and determine a second sequence corresponding to the data symbols based on the M sequences, where M is an integer greater than or equal to 1; and an acquisition module 43, configured to detect the data symbols based on the second sequence and acquire the detection result.

[0325] The data processing device provided in this embodiment is used to achieve, for example... Figure 2 The data processing method of the illustrated embodiment, and the data processing device provided in this embodiment, are implemented in the same principle and have the same technical effects. Figure 2 The data processing method in the illustrated embodiment is similar and will not be described again here.

[0326] Based on the above embodiments, extended embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the extended embodiments.

[0327] In one embodiment, the detection module 42 is specifically configured as follows:

[0328] The signal is detected based on the merged sequence set to obtain M sequences that generate the signal, wherein the merged sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include a merged sequence obtained from the N first sequences;

[0329] Based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

[0330] In one embodiment, the detection module 42 is specifically configured as follows:

[0331] The signal is detected based on the merged sequence set to obtain M sequences that generate the signal, wherein the merged sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include a merged sequence obtained from the N first sequences;

[0332] Based on the merged sequence, determine the N first sequences;

[0333] Based on one of the N first sequences and the correspondence between the first sequence and the second sequence, determine the second sequence corresponding to the data symbol.

[0334] In one embodiment, the detection module 42 is specifically configured as follows:

[0335] The signal is detected based on the sequence set to which one of the N first sequences belongs, resulting in M ​​sequences that generate the signal, wherein the M sequences include the first sequence;

[0336] Based on the first sequence and the correspondence between the first sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

[0337] In one embodiment, the detection module 42 is specifically configured as follows:

[0338] The signal is detected based on the sequence set to which the N first sequences belong, resulting in M ​​sequences that generate the signal, wherein the M sequences include the M first sequences;

[0339] Based on the M first sequences, determine the merge sequence;

[0340] Based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

[0341] In one embodiment, the apparatus further includes: a channel estimation module configured to:

[0342] Channel estimation is performed using at least one of the M sequences; or...

[0343] In the case where the M sequences include a merged sequence obtained from the N first sequences, the N first sequences are determined based on the merged sequence, and channel estimation is performed using at least one of the N first sequences.

[0344] In one embodiment, the device further includes: an information acquisition module, configured to:

[0345] Information is obtained from the detection results, including one or more of the following: identification information of the N first sequences; energy information of at least one of the N first sequences; identification information of the second sequence; and identification information of the first communication node.

[0346] This application provides a first communication node, Figure 5 A schematic diagram of the structure of a first communication node provided in this application is shown below. Figure 5 As shown, the first communication node provided in this application includes one or more processors 51 and a storage device 52; the processors 51 in the first communication node may be one or more. Figure 5 Taking a processor 51 as an example; a 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, causing the one or more processors 51 to perform as described in the embodiments of this application. Figure 1 The method described.

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

[0348] The processor 51, storage device 52, communication device 53, input device 54, and output device 55 in the first communication node can be connected via a bus or other means. Figure 5 Taking the example of a connection between China and Israel via a bus.

[0349] The input device 54 can be used to receive input digital or character information, and to generate key signal inputs 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.

[0350] The communication device 53 may include a receiver and a transmitter. The communication device 53 is configured to perform information transmission and reception communication under the control of the processor 51. The information includes, but is not limited to, N first sequences and data symbols.

[0351] Storage device 52, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, as described in the embodiments of this application. Figure 1The method corresponds to program instructions / modules (e.g., acquisition module 31, determination module 32, processing module 33, and transmission module 34 in a data processing device). Storage device 52 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and applications required for at least one function; the data storage area may store data created based on the use of the first communication node, etc. Furthermore, storage device 52 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, storage device 52 may further include memory remotely located relative to processor 51, which can be connected to the first communication node via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0352] This application embodiment also provides a second communication node. Figure 6 This is a schematic diagram of the structure of a second communication node provided in this application. Figure 6 As shown, the second communication node provided in this application includes one or more processors 61 and a storage device 62; the processors 61 in the second communication node may be one or more. Figure 6 Taking a processor 61 as an example; a 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, causing the one or more processors 61 to perform the functions described in the embodiments of this application. Figure 2 The method described in [the document / article].

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

[0354] The processor 61, storage device 62, communication device 63, input device 64, and output device 65 in the second communication node can be connected via a bus or other means. Figure 6 Taking the example of a connection between China and Israel via a bus.

[0355] Input device 64 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the second communication node. Output device 65 may include display devices such as a display screen.

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

[0357] Storage device 62, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, as described in the embodiments of this application. Figure 2The data processing method corresponds to the program instructions / modules (e.g., the receiving module 41, detection module 42, and acquisition module 43 in the data processing device). The storage device 62 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and at least one application program required for a function; the data storage area may store data created based on the use of the second communication node, etc. Furthermore, the storage device 62 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, the storage device 62 may further include memory remotely located relative to the processor 61, and these remote memories can be connected to the second communication node via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0358] This application embodiment also provides a storage medium storing a computer program, which, when executed by a processor, implements any of the data processing methods described in this application embodiment. Examples include a data processing method applied to a first communication node and a data processing method applied to a second communication node. The data processing method applied to the first communication node includes: acquiring N first sequences;

[0359] The second sequence is determined based on at least one of the N first sequences;

[0360] The data is processed based on the second sequence to obtain data symbols;

[0361] Send the N first sequences and the data symbols;

[0362] Where N is an integer greater than or equal to 2.

[0363] The data processing method applied to the second communication node includes: receiving signals and data symbols, wherein the signals are generated based on N first sequences;

[0364] The signal is detected to obtain M sequences that generated the signal, and a second sequence corresponding to the data symbol is determined based on the M sequences.

[0365] The data symbols are detected according to the second sequence, and the detection results are obtained;

[0366] Where N is an integer greater than or equal to 2, and M is an integer greater than or equal to 1.

[0367] The computer storage medium in this application embodiment can be any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. For example, a computer-readable storage medium can be—but is not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fiber, portable CD-ROM, optical storage device, magnetic storage device, or any suitable combination thereof. The computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

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

[0369] Program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, radio frequency (RF), etc., or any suitable combination thereof.

[0370] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and 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 standalone 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 remote computers, the remote computer can be connected to the user's computer via 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).

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

[0372] Those skilled in the art will understand that the term user equipment covers any suitable type of wireless user equipment, such as mobile phones, portable data processing devices, portable web browsers, or vehicle-mounted mobile stations.

[0373] Generally, the various embodiments of this application can be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. For example, some aspects can be implemented in hardware, while others can be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although this application is not limited thereto.

[0374] Embodiments of this application can be implemented by executing computer program instructions through the data processor of a mobile device, for example, in a processor entity, or through hardware, or through a combination of software and hardware. The computer program instructions can be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0375] Any block diagram of logical flow in the accompanying drawings of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored on memory. Memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (Digital Video Disc (DVD) or Compact Disk (CD)), etc. Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable to the local technical environment, such as, but not limited to, general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), and processors based on multi-core processor architectures.

[0376] A detailed description of exemplary embodiments of this application has been provided above through exemplary and non-limiting examples. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, without departing from the scope of this application. Therefore, the proper scope of this application will be determined by the claims.

Claims

1. A data processing method, characterized in that, Applied to the first communication node, including: Obtain N independent first sequences; The second sequence is determined based on at least one of the N first sequences; The data is processed based on the second sequence to obtain data symbols; Send the N first sequences and the data symbols; Where N is an integer greater than or equal to 2; The step of determining the second sequence based on at least one of the N first sequences includes: Based on the N first sequences, determine the merge sequence; The second sequence is determined based on the merged sequence and the correspondence between the merged sequence and the second sequence.

2. The method according to claim 1, characterized in that, The N first sequences are randomly obtained.

3. The method according to claim 1, characterized in that, The acquisition of N first sequences includes one of the following: Obtain N first sequences from a sequence set, wherein any two sequences in the N first sequences are different, or, T sequences in 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; Obtain N first sequences from different sets of sequences; Obtain N first sequences from different subsets of the same sequence set.

4. The method according to claim 3, characterized in that, The sequence set includes one or more of the following: a Hada code sequence set; a sequence set obtained from the Hada code sequence set; a ZC sequence set; and a four-phase sequence set.

5. The method according to claim 1, characterized in that, The step of determining the merge sequence based on the N first sequences includes: The N first sequences are combined in series or superimposed to obtain a merged sequence.

6. The method according to claim 1, characterized in that, The step of determining the second sequence based on at least one of the N first sequences further includes: The second sequence is determined based on one of the N first sequences and the correspondence between the first sequence and the second sequence.

7. The method according to claim 1, characterized in that, The data processing based on the second sequence includes one of the following: expansion processing; modulation processing; mapping processing.

8. The method according to claim 1, characterized in that, Send the N first sequences, including one of the following: The N first sequences are mapped to different transmission resources to generate signals and send them; The N first sequences are merged and mapped onto transmission resources to generate signals and send them. The merging process includes either cascaded combination processing or superposition processing.

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

10. The method according to claim 9, characterized in that, The transmission resources used by the pilots corresponding to the N first sequences include one of the following: time-division resources; frequency-division resources; time-frequency-division resources; code-division resources; or randomly selected resources.

11. The method according to claim 1, characterized in that, The data carries information, which includes one or more of the following: The identification information of the N first sequences; the energy information of at least one of the N first sequences; The identification information of the second sequence; the identification information of the first communication node.

12. A data processing method, characterized in that, Applied to the second communication node, including: Receive signals and data symbols, the signals being generated based on N independent first sequences; The signal is detected to obtain M sequences that generated the signal, and a second sequence corresponding to the data symbol is determined based on the M sequences. The data symbols are detected according to the second sequence, and the detection results are obtained; Where N is an integer greater than or equal to 2, and M is an integer greater than or equal to 1; The step of detecting the signal to obtain M sequences that generated the signal, and determining a second sequence corresponding to the data symbol based on the M sequences, includes: The signal is detected based on the merged sequence set to obtain M sequences that generate the signal, wherein the merged sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include a merged sequence obtained from the N first sequences; Based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

13. The method according to claim 12, characterized in that, The step of detecting the signal to obtain M sequences that generate the signal, and determining the second sequence corresponding to the data symbol based on the M sequences, further includes: The signal is detected based on the merged sequence set to obtain M sequences that generate the signal, wherein the merged sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include a merged sequence obtained from the N first sequences; Based on the merged sequence, determine the N first sequences; Based on one of the N first sequences and the correspondence between the first sequence and the second sequence, determine the second sequence corresponding to the data symbol.

14. The method according to claim 12, characterized in that, The step of detecting the signal to obtain M sequences that generate the signal, and determining the second sequence corresponding to the data symbol based on the M sequences, further includes: The signal is detected based on the sequence set to which one of the N first sequences belongs, resulting in M ​​sequences that generate the signal, wherein the M sequences include the first sequence; Based on the first sequence and the correspondence between the first sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

15. The method according to claim 12, characterized in that, The step of detecting the signal to obtain M sequences that generate the signal, and determining the second sequence corresponding to the data symbol based on the M sequences, further includes: The signal is detected based on the sequence set to which the N first sequences belong, resulting in M ​​sequences that generate the signal, wherein the M sequences include the M first sequences; Based on the M first sequences, determine the merge sequence; Based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

16. The method according to claim 12, characterized in that, Also includes: Channel estimation is performed using at least one of the M sequences; or, In the case where the M sequences include a merged sequence obtained from the N first sequences, the N first sequences are determined based on the merged sequence, and channel estimation is performed using at least one of the N first sequences.

17. The method according to claim 12, characterized in that, Also includes: Information is obtained from the detection results, including one or more of the following: identification information of the N first sequences; Energy information of at least one of the N first sequences; The identification information of the second sequence; Identification information of the first communication node.

18. A data processing apparatus, characterized in that, Configured on the first communication node, including: The acquisition module is configured to acquire N independent first sequences; The determining module is configured to determine the second sequence based on at least one of the N first sequences; The processing module is configured to process the data based on the second sequence to obtain data symbols; The sending module is configured to send the N first sequences and the data symbols, where N is an integer greater than or equal to 2; The determining module is specifically configured as follows: Based on the N first sequences, determine the merge sequence; The second sequence is determined based on the merged sequence and the correspondence between the merged sequence and the second sequence.

19. A data processing apparatus, characterized in that, Configured on the second communication node, including: The receiving module is configured to receive signals and data symbols, wherein the signals are generated based on N independent first sequences, where N is an integer greater than or equal to 2; The detection module is configured to detect the signal, obtain M sequences that generated the signal, and determine a second sequence corresponding to the data symbol based on the M sequences, wherein M is an integer greater than or equal to 1; The acquisition module is configured to detect the data symbols based on the second sequence and acquire the detection results; The detection module is specifically configured as follows: The signal is detected based on the merged sequence set to obtain M sequences that generate the signal, wherein the merged sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include a merged sequence obtained from the N first sequences; Based on the merged sequence and the correspondence between the merged sequence and the second sequence, the second sequence corresponding to the data symbol is determined.

20. A first communication node, characterized in that, include: One or more processors; 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 as described in any one of claims 1-11.

21. A second communication node, characterized in that, include: One or more processors; 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 as described in any one of claims 12-17.

22. A storage medium, characterized in that, The storage medium stores a computer program that, when executed by a processor, implements the method described in any one of claims 1-17.

Images