Data communication method, device, equipment, and processor-readable storage medium

Abstract

The present application provides a data communication method, apparatus, device, and processor-readable storage medium, the method comprising: obtaining a reference sequence; using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N 1. Performing a spread spectrum operation on the data to be transmitted using the spreading sequence to obtain target data; and transmitting the target data. Because the spreading sequence is obtained entirely by encoding the reference sequence, the spreading sequence can reduce correlation and thus reduce the complexity of target data detection at the receiving end.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a data communication method, apparatus, device, and processor-readable storage medium. Background Art

[0002] Non-orthogonal access technology was proposed to meet the access needs of a large number of devices. The basic concept of non-orthogonal multiple access technology (Pattern Division Multiple Access, abbreviated as PDMA) is based on the joint design of the transmitter and receiver. At the transmitter, the data of multiple users are spread with unequal diversity and mapped to shared time-frequency resources. In essence, each user uses a different amount of time-frequency resources, and different spreading patterns are used to distinguish multiple users. At the receiver, high-performance interference cancellation technology is used to achieve non-orthogonal multi-user data transmission.

[0003] With the development and evolution of mobile communications, multiple organizations have begun researching new wireless communication systems, namely 6G. The growing number of connected devices is a key driver of 6G. However, PDMA technology currently lacks sufficient PDMA sequences to support the massive number of devices. For example, with a length of four, the total number of possible PDMA sequences is 5 to the fourth power minus 1, which equals 624. However, these PDMA sequences may be highly correlated and therefore cannot be used simultaneously. To meet the massive number of connected devices required by 6G wireless communication systems, PDMA technology itself needs to evolve to generate more and longer PDMA sequences.

[0004] To obtain more and longer PDMA sequences, one existing approach involves directly copying multiple copies of the original PDMA sequence and concatenating the copies. However, the correlation between the multiple extended sequences obtained using this method and the existing PDMA sequences remains unchanged, which can affect system detection performance for a large number of terminals. Another existing approach reuses the design principles of PDMA, directly increasing the length of the PDMA sequences and using a computer to search for PDMA sequences with lower correlation. However, this approach requires joint detection of the entire length of the sequence, resulting in higher detection complexity at the receiving end. Summary of the Invention

[0005] The present application provides a data communication method, apparatus, device and processor-readable storage medium, which are used to solve the technical problems of high correlation and high detection complexity in existing sequence expansion methods.

[0006] In a first aspect, the present application provides a data communication method, applied to a terminal device, comprising:

[0007] Get the benchmark sequence;

[0008] Using a generator matrix corresponding to the reference sequence, the reference sequence is encoded to obtain an extended sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0009] Performing a spread spectrum operation on the data to be transmitted using the spread sequence to obtain target data;

[0010] The target data is sent.

[0011] The data communication method provided in this embodiment first obtains a reference sequence and then encodes it using a generator matrix corresponding to the reference sequence to obtain a spread sequence. This spread sequence is then used to spread the target data, and the spread target data is then transmitted. Because the spread sequence is derived entirely from encoding the reference sequence, it reduces correlation and, therefore, reduces the complexity of target data detection at the receiving end.

[0012] Furthermore, before encoding the reference sequence using a generator matrix corresponding to the reference sequence, the method further includes:

[0013] According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0014] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0015] Furthermore, the determining of the generator matrix composed of M binary sequences including N elements includes: when M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0016] Furthermore, the using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes:

[0017] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0018] Furthermore, the using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes:

[0019] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0020] Furthermore, the using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes:

[0021] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0022] Furthermore, the method further comprises:

[0023] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0024] Furthermore, the obtaining of the reference sequence includes:

[0025] Obtaining an identifier of a reference sequence sent by a network-side device, and locating and obtaining the reference sequence in a pre-stored reference sequence table according to the identifier of the reference sequence; or,

[0026] obtaining the reference sequence sent by the network side device; or,

[0027] A row of reference sequences is randomly selected from a pre-stored reference sequence table as the reference sequence.

[0028] In a second aspect, the present application provides a data communication method, applied to a base station, comprising:

[0029] Obtain target data sent by a terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is obtained by the terminal device after performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0030] The target data is despread using the spread sequence or a preceding portion of the spread sequence to obtain the data to be transmitted.

[0031] The data communication method provided in this embodiment reduces data detection complexity when the base station performs a despreading operation on the target data, as the target data is obtained by spreading the target data using a spreading matrix. Furthermore, by despreading the target data using the spreading sequence or the preceding portion of the spreading sequence, reception processing latency is reduced.

[0032] Furthermore, the step of performing a despreading operation on the target data using the spreading sequence or a preceding portion of the spreading sequence to obtain the data to be transmitted includes:

[0033] Obtaining a preceding element of the spread sequence having the same length as the target data to form a despread subsequence;

[0034] performing a despreading operation on a front portion of the target data using the despreading subsequence to obtain a detection result;

[0035] If the detection result is a detection failure, the data size of the previous portion of the target data is increased to obtain new previous portion of the target data, and the despreading subsequence is used to perform a despreading operation on the new previous portion of the target data to obtain a new detection result, until the new detection result is a detection success.

[0036] Furthermore, before performing a despreading operation on the target data using the spreading sequence or a preceding portion of the spreading sequence, the method further includes:

[0037] Determine the benchmark sequence;

[0038] A generator matrix corresponding to the reference sequence is used to perform an encoding operation on the reference sequence to obtain an extended sequence.

[0039] Furthermore, before the step of using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence, the step further includes:

[0040] According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0041] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0042] Furthermore, forming the generator matrix according to the M binary sequences including N elements includes:

[0043] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0044] Furthermore, the using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes:

[0045] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0046] Furthermore, the using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes:

[0047] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0048] Furthermore, encoding the reference sequence using a generator matrix corresponding to the reference sequence includes:

[0049] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0050] Furthermore, the method further comprises:

[0051] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0052] Furthermore, after determining the reference sequence to be extended, the method further includes:

[0053] determining an identifier of a reference sequence corresponding to the reference sequence;

[0054] sending the identifier of the reference sequence to the terminal device; or,

[0055] The reference sequence is sent to the terminal device.

[0056] In a third aspect, the present application provides a data communication device, applied to a terminal device, including a memory, a transceiver, and a processor:

[0057] A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations:

[0058] Get the benchmark sequence;

[0059] Using a generator matrix corresponding to the reference sequence, the reference sequence is encoded to obtain an extended sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0060] Performing a spread spectrum operation on the data to be transmitted using the spread sequence to obtain target data;

[0061] The target data is sent.

[0062] Furthermore, before performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, the processor is further configured to:

[0063] According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0064] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0065] Furthermore, when determining that the generator matrix is ​​composed of M binary sequences including N elements, the processor is configured to:

[0066] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0067] Furthermore, when the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to:

[0068] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0069] Furthermore, when the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to:

[0070] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0071] Furthermore, when the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to:

[0072] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0073] Furthermore, the processor further includes:

[0074] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0075] Furthermore, when acquiring the reference sequence, the processor is configured to:

[0076] Obtaining an identifier of a reference sequence sent by a network-side device, and locating and obtaining the reference sequence in a pre-stored reference sequence table according to the identifier of the reference sequence; or,

[0077] obtaining the reference sequence sent by the network side device; or,

[0078] A row of reference sequences is randomly selected from a pre-stored reference sequence table as the reference sequence.

[0079] In a fourth aspect, the present application provides a data communication device, applied to a base station, comprising a memory, a transceiver, and a processor:

[0080] A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations:

[0081] Obtain target data sent by a terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is obtained by the terminal device after performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0082] The target data is despread using the spread sequence or a preceding portion of the spread sequence to obtain the data to be transmitted.

[0083] Furthermore, when the processor uses the spreading sequence or a preceding portion of the spreading sequence to perform a despreading operation on the target data to obtain the data to be transmitted, the processor is configured to:

[0084] Obtaining a preceding element of the spread sequence having the same length as the target data to form a despread subsequence;

[0085] performing a despreading operation on a front portion of the target data using the despreading subsequence to obtain a detection result;

[0086] If the detection result is a detection failure, the data size of the previous portion of the target data is increased to obtain new previous portion of the target data, and the despreading subsequence is used to perform a despreading operation on the new previous portion of the target data to obtain a new detection result, until the new detection result is a detection success.

[0087] Furthermore, before performing a despreading operation on the target data using the spreading sequence or a preceding portion of the spreading sequence, the processor is further configured to:

[0088] Determine the benchmark sequence;

[0089] A generator matrix corresponding to the reference sequence is used to perform an encoding operation on the reference sequence to obtain an extended sequence.

[0090] Furthermore, before the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence, it is further configured to:

[0091] According to the number N of elements in the benchmark sequence, 2 N- a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0092] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0093] Furthermore, when the processor composes the generator matrix according to the M binary sequences including N elements, it is configured to:

[0094] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0095] Furthermore, when the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to:

[0096] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0097] Furthermore, when the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to:

[0098] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0099] Furthermore, when the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to:

[0100] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0101] Furthermore, the processor is further configured to:

[0102] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0103] Furthermore, after determining the reference sequence to be extended, the processor is further configured to:

[0104] determining an identifier of a reference sequence corresponding to the reference sequence;

[0105] sending the identifier of the reference sequence to the terminal device; or,

[0106] The reference sequence is sent to the terminal device.

[0107] In a fifth aspect, the present application provides a data communication apparatus, applied to a terminal device, comprising:

[0108] An acquisition module, used for acquiring a reference sequence;

[0109] An encoding module is configured to use a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than 2 N -1;

[0110] A spectrum spreading module, configured to perform a spectrum spreading operation on the data to be transmitted using the spreading sequence to obtain target data;

[0111] A sending module is used to send the target data.

[0112] In a sixth aspect, the present application provides a data communication device, applied to a base station, comprising:

[0113] A data acquisition module is configured to acquire target data sent by a terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is obtained by the terminal device after performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0114] The despreading module is configured to perform a despreading operation on the target data using the spread sequence or a preceding portion of the spread sequence to obtain the data to be transmitted.

[0115] In a seventh aspect, the present application provides a processor-readable storage medium, wherein the processor-readable storage medium stores a computer program, and the computer program is used to enable the processor to execute the method described in the first aspect or the second aspect.

[0116] The data communication method, apparatus, device, and processor-readable storage medium provided by this application first obtain a reference sequence to be extended. Using a generator matrix corresponding to the reference sequence, the reference sequence is encoded to obtain an extended sequence. This extended sequence can then be used to spread the data to be transmitted, and the spread target data is then transmitted. Because the extended sequence is entirely derived from encoding the reference sequence, it can reduce correlation and, therefore, reduce the complexity of target data detection at the receiving end.

[0117] It should be understood that the contents described in the above summary of the invention are not intended to limit the key or important features of the embodiments of the present application, nor are they intended to limit the scope of the present application. Other features of the present application will become easier to understand through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0118] In order to more clearly illustrate the technical solutions in the present application or the prior art, a brief introduction will be given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0119] Figure 1 Schematic diagram of the system architecture on which this application is based;

[0120] Figure 2A A schematic diagram of a PDMA mapping pattern matrix G provided in an embodiment of the present application;

[0121] Figure 2B A schematic diagram of resource mapping provided in an embodiment of the present application;

[0122] Figure 3 A flowchart of a data communication method according to the first embodiment of the present invention;

[0123] Figure 4 A flowchart of a data communication method according to the second embodiment of the present application;

[0124] Figure 5 A flowchart of a data communication method according to the third embodiment of the present application;

[0125] Figure 6 A schematic diagram of the structure of a data communication device provided in Example 4 of the present application;

[0126] Figure 7 A schematic diagram of the structure of a data communication device provided in Example 5 of the present application;

[0127] Figure 8 A schematic diagram of the structure of a data communication device provided in Example 6 of the present application;

[0128] Figure 9 This is a structural diagram of the data communication device provided in Example 7 of the present application. DETAILED DESCRIPTION

[0129] In this application, the term "and / or" describes the relationship between associated objects, indicating that three possible relationships exist. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone. The character " / " generally indicates that the associated objects are in an "or" relationship.

[0130] In the embodiments of the present application, the term "plurality" refers to two or more than two, and other quantifiers are similar.

[0131] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0132] The embodiments of the present application provide a data communication method, apparatus, device, and processor-readable storage medium to solve the technical problems of high correlation and high detection complexity in existing sequence expansion methods.

[0133] Among them, the method and the device are based on the same application concept. Since the principles of solving problems by the method and the device are similar, the implementation of the device and the method can refer to each other, and the repeated parts will not be repeated.

[0134] It should be noted that the test method, apparatus, terminal device and readable storage medium provided in this application can be used in various data spread spectrum scenarios.

[0135] Figure 1 This is a schematic diagram of the system architecture based on which this application is based, such as Figure 1 As shown, the system architecture based on this application includes at least: a terminal device 1 and a base station 2. The terminal device 1 and the base station 2 are both provided with a data communication device, which can be written in languages ​​such as C / C++, Java, Shell, or Python; the terminal device 1 can be, for example, a desktop computer, a tablet computer, etc.

[0136] In order to meet the requirements of 6G, including supporting the transmission of a large number of terminals, improving transmission efficiency, and reducing implementation complexity, it is necessary to generate more and longer PDMA sequences. On the one hand, the existing PDMA sequence acquisition method reuses the design concept of PDMA, directly increases the length of the PDMA sequence, and uses a computer to search for PDMA sequences with lower correlation. However, since the correlation is for the entire length of the sequence, the PDMA sequence obtained by the above method will cause the detection complexity to increase exponentially, which will increase the data transmission delay. On the other hand, the existing technology generally directly copies multiple PDMA sequences and then cascades them. However, the PDMA sequence obtained by the above method, since the correlation between the cascaded PDMA sequences does not change, the system detection performance will be affected in the case of a large number of terminals.

[0137] In solving the above technical problem, the inventors discovered through research that a PDMA spreading sequence can be selected as a reference sequence g, where the length of the reference sequence g is N. A generated sequence corresponding to the reference sequence g is then determined. The reference sequence is then encoded using the generated sequence to obtain an extended sequence. Because each element in the extended sequence is derived by modifying an element in the reference sequence, this reduces correlation, reduces detection complexity, and reduces latency.

[0138] The basic idea of ​​PDMA technology is based on the joint design of the transmitter and receiver. At the transmitter, the information of multiple users is encoded with unequal diversity and mapped to time / frequency / spatial resources. Different coding patterns are used to distinguish multiple users with overlapping resources. At the receiver, high-performance, low-complexity multi-user detection technologies such as the Belief Propagation (BP) algorithm are used to approach the detection performance of the Maximum A Posteriori (MAP) algorithm, achieving non-orthogonal uplink and downlink transmission and approaching the capacity limit of the multi-user channel.

[0139] PDMA creates unequal diversity by mapping each user's transmitted data onto a set of resources using a specific mapping pattern (PDMA coding pattern). The PDMA coding pattern defines the data-to-resource mapping rules, specifically how many resources the data is mapped to and which resources it is mapped to. The number of resources determines the data's transmit diversity, and different users achieve different transmit diversity using the resources mapped according to the PDMA coding pattern.

[0140] To reduce the complexity of the PDMA receiver, the design of PDMA draws on the concept of sparse coding in low-density spreading codes. The spreading codewords of the coding pattern contain a portion of zero elements, making the coding pattern sparse. This sparse property enables the receiver to implement the backpropagation algorithm with low complexity and achieve detection performance close to maximum a posteriori probability through multi-user joint iteration.

[0141] A pattern can be used to define a sparse mapping from data to a set of resources, represented by a binary vector. The dimension of the vector is equal to the number of resources in the set. Each element in the vector corresponds to a resource in the resource set. A "1" indicates that data is mapped to the corresponding resource. In practice, the number of "1s" in the pattern defines the transmission diversity. For example, the pattern {1,0,1,1} has a diversity of 3.

[0142] Figure 2A A schematic diagram of the PDMA mapping pattern matrix G provided in an embodiment of the present application is shown. Figure 2B The resource mapping diagram provided for the embodiments of this application, as shown in Figures 2-3, assumes that six users are multiplexed on four resource elements (REs). The PDMA mapping pattern matrix G is the mapping pattern, where an element "0" in the matrix indicates no data is being transmitted, and an element "1" indicates that data is mapped to the corresponding resource, i.e., data is being transmitted. The data of user 1 {1,1,1,1} is mapped to all four resources in the group, the data of user 2 {1,1,1,0} is mapped to the first three resources, and so on. The transmission diversity levels for the six users are 4, 3, 2, 2, 1, 1, respectively.

[0143] The overload ratio is defined as the ratio of the number of users to the number of resources used in non-orthogonal multiple access: α = K / N, where K is the number of users, expressed as the number of columns in the PDMA mapping pattern matrix, and N is the number of resources used, expressed as the number of rows in the PDMA mapping pattern matrix. For a given overload ratio, various PDMA mapping pattern matrices can be designed to achieve it. Assuming that the number of users multiplexed in the system is K, the PDMA mapping pattern matrix that satisfies the following conditions is Both can realize multi-user resource mapping:

[0144]

[0145]

[0146]

[0147] in, is the theoretical PDMA mapping pattern matrix, Represents the theoretical PDMA mapping pattern matrix The PDMA mapping pattern matrix of K users is formed by selecting K columns from the matrix. N-1 possible binary vectors, so we can choose from 2 N -1 candidates to select K patterns to construct the pattern matrix. The choice of pattern will also affect the performance and complexity.

[0148] Expand the PDMA mapping pattern matrix to obtain the PDMA coding pattern matrix, which is still expressed as The coding pattern matrix defines a pool of MA signatures with K extension sequences of length N.

[0149]

[0150] The elements of the extended sequence are selected from {0, 1, -1, j, -j}. 0 means no transmission on the corresponding resource, 1 means direct transmission on the corresponding resource, -1 means transmission on the corresponding resource with a phase rotation of 180 degrees, j means transmission on the corresponding resource with a phase rotation of 90 degrees, and -j means transmission on the corresponding resource with a phase rotation of 270 degrees. For each extended sequence, it can be sparse (i.e., there are elements with a value of '0') or non-sparse. For different extended sequences, the weights (i.e., the number of non-zero elements) may be different. As shown in Table 1, the PDMA pattern matrix 96 spreading sequences of length 4 are provided, and the large-scale MA signature pool helps reduce the probability of intra-cell / inter-cell collisions.

[0151]

[0152]

[0153] Table 1

[0154] Figure 3 This is a flow chart of the data communication method provided in Example 1 of the present application, as shown in FIG. Figure 3 As shown, the method includes:

[0155] Step 301: Acquire a reference sequence.

[0156] The execution subject of this embodiment is a data communication device, which can be coupled to a terminal device. The terminal device can be connected to a base station for communication, thereby being able to exchange information with the base station.

[0157] In this embodiment, in order to realize the generation of a longer spread sequence, it is necessary to first determine a reference sequence to be spread. Specifically, a PDMA spread spectrum sequence can be selected in the PDMA pattern matrix as the reference sequence g to be spread.

[0158] Step 302: Use a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than 2 N -1.

[0159] In this embodiment, after obtaining the reference sequence, a generator matrix corresponding to the reference sequence can be determined based on the reference sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1. For example, if the length of the reference sequence is 4, then the number of columns in the generator matrix is ​​4, and the number of rows in the generator matrix is ​​no more than 2. 4 -1=15.

[0160] After obtaining the generator matrix, it can be used to encode the reference matrix to obtain the extended sequence. After encoding the reference matrix using the generator matrix, the number of elements in the obtained extended sequence equals the number of rows in the generator matrix, enabling the acquisition of longer extended sequences. Furthermore, since each element in the extended matrix is ​​obtained by encoding an element in the reference sequence, the subsequent data detection complexity at the receiver is reduced.

[0161] Step 303: Use the spread sequence to perform a spread spectrum operation on the data to be transmitted to obtain target data.

[0162] In this embodiment, after a coding operation is performed on a reference matrix using a generator matrix to obtain a spread sequence, the spread sequence can be used to perform a spread spectrum operation on data to be transmitted to obtain target data.

[0163] Since the extended sequence is longer and has a lower correlation, more extended sequences are available. Therefore, a larger number of extended sequences can be used to distinguish users, realize non-orthogonal multi-user data transmission, and support simultaneous transmission of a large number of terminals.

[0164] Step 304: Send the target data.

[0165] In this embodiment, the spread target data can be transmitted. Specifically, the target data spread using the spreading sequence can be sent to a network-side device. The network-side device can then use a generator matrix corresponding to the reference sequence to generate a corresponding spreading sequence and despread the target data using the spreading sequence. Specifically, the network-side device can be a base station.

[0166] Furthermore, based on the first embodiment, step 201 specifically includes:

[0167] Obtaining an identifier of a reference sequence sent by a network-side device, and locating and obtaining the reference sequence in a pre-stored reference sequence table according to the identifier of the reference sequence; or,

[0168] obtaining the reference sequence sent by the network side device; or,

[0169] A row of reference sequences is randomly selected from a pre-stored reference sequence table as the reference sequence.

[0170] In this embodiment, the reference sequence may be determined by the terminal device according to an instruction from the network device. Specifically, the terminal device may obtain an identifier of the reference sequence sent by the network device and, based on the identifier of the reference sequence, determine a reference sequence corresponding to the identifier of the reference sequence in a pre-stored reference sequence table.

[0171] Optionally, after determining the reference sequence to be extended, the network-side device may directly send the reference sequence to the terminal device. After acquiring the reference sequence, the terminal device may perform an operation of generating an extended sequence according to the reference sequence.

[0172] Optionally, the reference sequence may also be randomly determined by the terminal device in a pre-stored reference sequence table. Specifically, a row of reference sequences may be randomly selected from the pre-stored reference sequence table as the reference sequence to be extended.

[0173] In practical applications, any one of the above implementations may be selected to acquire the reference sequence to be extended, and this application does not impose any limitation on this.

[0174] The data communication method provided in this embodiment first obtains a reference sequence to be spread. Using a generator matrix corresponding to the reference sequence, the reference sequence is encoded to obtain a spread sequence. This spread sequence is then used to spread the data to be transmitted, and the spread target data is then transmitted. Because the spread sequence is derived entirely from encoding the reference sequence, it can reduce correlation and, therefore, reduce the complexity of target data detection at the receiving end.

[0175] Furthermore, based on the first embodiment, before step 202, the following steps are further included:

[0176] According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0177] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0178] In this embodiment, after obtaining the reference sequence, 2 can be generated according to the number N of elements in the reference sequence. N -1 binary sequence containing N elements. According to the 2 N -1 binary sequence including N elements constitutes the generator matrix. N -1 binary sequence consisting of N elements determines M binary sequences to form a generator matrix, where M <= 2 N -1.

[0179] It should be noted that, since 0 indicates no transmission on the corresponding resource, the binary sequence includes at least one element 1, that is, the binary sequence with N elements all being 0 needs to be removed.

[0180] For example, the base sequence may contain four elements. Based on these four elements, 15 binary sequences containing four elements can be generated. Each binary sequence contains at least one 1 element, meaning that binary sequences with four elements all containing zero are eliminated. Therefore, the generator matrix corresponding to the base sequence is shown in Table 2:

[0181]

[0182]

[0183] Table 2

[0184] Optionally, based on the first embodiment, the method further includes:

[0185] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0186] In this embodiment, when M<2 N 1, the correlation between the binary sequence can be N -1 binary sequences to determine the generator matrix. Specifically, in all 2 N -1 selects M binary sequences with smaller inter-sequence correlation from the N-element binary sequences as the generator matrix.

[0187] Optionally, the binary sequences may be sorted according to the decimal numbers corresponding to the binary sequences, and M binary sequences with smaller decimal numbers are selected as the generator matrix.

[0188] Any method may be selected to determine the generator matrix, and this disclosure does not impose any limitation thereto.

[0189] Optionally, the generator matrix may also be pre-configured. Based on the first embodiment, step 202 specifically includes:

[0190] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0191] In this embodiment, in order to implement the encoding operation of the reference sequence, a generator matrix can be pre-configured, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix can be configured according to actual conditions, and the number of rows can be specifically M rows, where M<=2 N The pre-configured generator matrix can be used to perform encoding operations on the reference sequence.

[0192] The data communication method provided in this embodiment determines a generator matrix according to the number of elements in a reference sequence and controls each binary sequence in the generator matrix to include at least one 1, thereby providing a basis for subsequent expansion according to the generator matrix reference sequence.

[0193] Furthermore, based on the first embodiment, step 202 includes:

[0194] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0195] In this embodiment, after obtaining a generator matrix, an encoding operation can be performed on the reference matrix using the generator matrix. Specifically, a product operation can be performed on the elements in the reference sequence corresponding to the column position of element 1 in each row sequence of the generator matrix to obtain the products corresponding to all rows in the generator matrix. The products corresponding to all rows in the generator matrix are used to form an extended sequence, where the length of the extended sequence is equal to the number of rows in the generator matrix.

[0196] Optionally, based on the first embodiment, the encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence includes:

[0197] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0198] In this embodiment, all binary sequences in the generator matrix, except for the binary sequence containing N elements 1, contain the element 0. Therefore, during the vector product operation, if the column position corresponding to the reference sequence of element 1 in a row sequence does not contain a non-zero element, element 0 is used as the corresponding element in the extended sequence. Accordingly, for each element 1 in the generator matrix row sequence, a product operation is performed on that element 1 with the non-zero element in the reference sequence corresponding to the column position of element 1. The resulting product forms an extended sequence, where the length of the extended sequence is equal to the number of rows 0 in the generator matrix.

[0199] Taking a practical application as an example, the reference sequence may be the first sequence [1j-1-j] in Table 1. The number of elements in the reference sequence is 4, and its corresponding generator matrix may be shown in Table 2. For the first row of the generator matrix, the four elements are [0 0 0 1], and the position where the element is 1 is c4. Then the non-zero element of the reference sequence g at position c4 is -j, and the first element of the extended sequence S can be obtained as -j*1=-j; for the second row of the generator matrix, the four elements are [0 0 1 0], and the position where the element is 1 is c3. Then the non-zero element of the reference sequence g at position c3 is -1, and the second element of the extended sequence S can be obtained as -1*1=-1; for the third row of the generator matrix, the four elements are [0 0 1 0], and the position where the element is 1 is c3. Then the non-zero element of the reference sequence g at position c3 is -1, and the second element of the extended sequence S can be obtained as -1*1=-1. 1], the positions where the elements are 1 are c3 and c4, then the product of the non-zero elements of the reference sequence g at positions c3 and c4 is equal to (-1)*(-j)=j, and the third element of the extended sequence S is j; similarly, the fourth element of the extended sequence S is j, the fifth element is 1, the sixth element is -j, the seventh element is -1, the eighth element is 1, the ninth element is -j, the tenth element is -1, the eleventh element is j, the twelfth element is j, the thirteenth element is 1, the fourteenth element is -j, and the fifteenth element is -1. This method generates an extended sequence S = [-j -1 jj 1 –j -1 1 –j -1 jj 1 –j -1] from the PDMA reference sequence g = [1 j -1 -j], with a length of 15, corresponding to the first row of the extended matrix.

[0200] Furthermore, based on the first embodiment, step 202 includes:

[0201] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0202] In this embodiment, it is possible to detect whether the reference sequence includes target element 0. If the reference sequence includes element 0, to ensure that the extended sequence and the reference sequence have the same diversity, the position i of target element 0 in the reference sequence can be determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0203] Continuing with a practical example, the 65th PDMA extended sequence (sequence number 64) [1 -1 –j 0] in Table 1 can be selected as the reference sequence g. For a reference sequence g of length N = 4, the corresponding generator matrix is ​​shown in Table 2. The fourth element in reference sequence g is 0, so 0 elements need to be evenly spaced in the extended sequence S. For a reference sequence g of length N = 4, the fourth element, the 4th + 1*4 = 8th element, and the 4th + 2*4 = 12th element in the extended sequence S are all 0. For the first row of the generator matrix, the four elements are [0 0 0 1], and the position where the element is 1 is c4. Then the non-zero element of the base sequence g at position c4 is 0, and the first element of the extended sequence S is 0; for the second row of the generator matrix, the four elements are [0 0 10], and the position where the element is 1 is c3. Then the non-zero element of the base sequence g at position c3 is -j, and the second element of the extended sequence S is -j; for the third row of the generator matrix, the four elements are [0 0 1 1], and the positions where the element is 1 are c3 and c4. Then the product of the non-zero elements of the base sequence g at positions c3 and c4 is equal to -j, and the third element of the extended sequence S is -j; for the fifth row of the generator matrix, the four elements are [0 1 0 1], with elements 1 at positions c2 and c4. Therefore, the product of the nonzero elements of the reference sequence g at positions c2 and c4 equals -1, resulting in the fifth element of the spread sequence S being -1. Similarly, the sixth element of the spread sequence S is j, the seventh element is j, the ninth element is 1, the tenth element is -j, the eleventh element is -j, the twelfth element is 0, the thirteenth element is -1, the fourteenth element is j, and the fifteenth element is j. Thus, the PDMA reference sequence g = [1-1–j 0] generates the spread sequence S = [0–j –j 0 -1 jj 0 1 –j –j0 -1 jj], with a length of 15, corresponding to the 65th row of the spread matrix. The diversity degree of the reference sequence g is 3, and the diversity degree of the spread sequence S is 11, which is essentially the same as the length extension ratio (4 to 15).

[0204] Still taking a practical application as an example, the 96th PDMA extended sequence (sequence number 95) [0 0 1-1] in Table 1 can be selected as the reference sequence g. The first and second elements in the reference sequence g are both 0 elements, so it is necessary to set 0 elements at equal intervals in the extended sequence S. For the reference sequence g with a length of N=4, the first element, the 1st+1*4=5th element, the 1st+2*4=9th element, the 1st+3*4=13th element, the 2nd element, the 2nd+1*4=6th element, the 2nd+2*4=10th element, and the 2nd+3*4=14th element in the extended sequence S are all 0. For the third row of the generator matrix, the four elements are [0 0 1 1], and the positions where the elements are 1 are c3 and c4. Therefore, the product of the non-zero elements of the reference sequence g at positions c3 and c4 is -1, resulting in the third element of the extended sequence S being -1. For the fourth row of the generator matrix, the four elements are [0 1 0 0], and the position where the element is 1 is c2. Therefore, the product of the non-zero elements of the reference sequence g at position c2 is 0, resulting in the fourth element of the extended sequence S being 0. Similarly, the seventh element of the extended sequence S is -1, the eighth element is 0, the eleventh element is -1, the twelfth element is 0, and the fifteenth element is -1. Thus, the PDMA reference sequence g = [0 0 1 -1] generates the extended sequence S = [0 0 -1 0 0 0 -1 0 0 0 -1 0 0 0 -1], with a length of 15, corresponding to the 96th row of the extended matrix. The diversity degree of the reference sequence g is equal to 2, and the diversity degree of the extended sequence S is equal to 4, which is basically different from the length extension ratio (4 to 15), and a wider variety of diversity degrees can be obtained.

[0205] The data communication method provided in this embodiment performs vector product operations on each row of the generator matrix and the reference sequence, and the resulting products form the extended sequence. This ensures that each element in the extended sequence is encoded from the reference sequence, effectively reducing the complexity of data detection at the receiving end. Furthermore, since the reference sequence is encoded according to the generator matrix, the similarity between extended sequences is reduced, resulting in a larger number of available extended sequences. Furthermore, when it is determined that the reference sequence includes 0, the i+N*nth element in the extended sequence is set to the target element 0. This ensures that the diversity degree of the extended sequence is the same as that of the reference sequence. This effectively reduces serial interference and improves data transmission efficiency during subsequent data transmission.

[0206] Further, based on the first embodiment, Figure 4 As shown, after step 304, the following steps are further included:

[0207] A response instruction sent by the target base station is obtained, where the response instruction is used to indicate to the target base station whether detection of the target data is successful or failed.

[0208] According to the response instruction, if the response instruction indicates that the target base station fails to detect the target data, the target data is resent.

[0209] In this embodiment, after the terminal device sends the target data to the target base station, the target base station may perform data detection on the target data and obtain a detection result. The target base station may send a response instruction to the terminal device based on the detection result, wherein the response instruction is used to indicate whether the target base station has successfully or failed to detect the target data.

[0210] Accordingly, after the terminal device obtains the response instruction, if the response instruction indicates that the target base station has failed to detect the target data, in order to enable the base station to obtain valid data, the terminal device can send the target data to the target base station again according to the response instruction.

[0211] The data communication method provided in this embodiment ensures that the target base station receives every piece of target data and avoids failure in sending target data by resending target data after obtaining a response instruction when the response instruction indicates that the target base station has failed to detect the target data.

[0212] Figure 4 This is a flow chart of the data communication method provided in Example 2 of the present application, as shown in FIG. Figure 4 As shown, the method includes:

[0213] Step 401: Acquire target data sent by a terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is obtained by the terminal device after performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1.

[0214] Step 402: Use the spread sequence or a preceding portion of the spread sequence to perform a despreading operation on the target data to obtain the data to be transmitted.

[0215] The execution subject of this embodiment is a data communication device, which can be coupled to a base station. The base station can be connected to a terminal device for communication, thereby enabling information exchange with the terminal device.

[0216] In this embodiment, the base station can obtain target data sent by a terminal device. This target data is obtained after the terminal device performs a spread spectrum operation on the data to be transmitted using an extended sequence. The extended sequence is determined by the terminal device, after obtaining a reference sequence, by determining a generator matrix based on the number of elements in the reference sequence. The generator matrix is ​​determined based on the reference sequence. After encoding the reference matrix using the generator matrix, the number of elements in the obtained extended sequence is equal to the number of rows in the generator matrix, enabling the acquisition of a longer extended sequence. Furthermore, since each element in the extended matrix is ​​obtained by encoding an element in the reference sequence, the complexity of subsequent data detection by the receiver is reduced.

[0217] After acquiring the target data, the target data can be despread using the spreading sequence or the first part of the spreading sequence to obtain the data to be transmitted. The spreading sequence used by the base station is the same as the spreading sequence used by the terminal device.

[0218] The data communication method provided in this embodiment reduces data detection complexity when the base station performs a despreading operation on the target data, as the target data is obtained by spreading the target data using a spreading matrix. Furthermore, by despreading the target data using the spreading sequence or the preceding portion of the spreading sequence, reception processing latency is reduced.

[0219] Furthermore, based on the third embodiment, step 502 specifically includes:

[0220] The preceding element of the spread sequence having the same length as the target data is obtained to form a despread subsequence.

[0221] The despreading subsequence is used to perform a despreading operation on a front portion of the target data to obtain a detection result.

[0222] If the detection result is a detection failure, the data size of the previous portion of the target data is increased to obtain new previous portion of the target data, and the despreading subsequence is used to perform a despreading operation on the new previous portion of the target data to obtain a new detection result, until the new detection result is a detection success.

[0223] In this embodiment, since the extended sequence includes the reference sequence, each additional element is a code of an element in the reference sequence. Therefore, after detecting N elements corresponding to the reference sequence, some elements can be used for detection, and further detection is stopped after successful detection.

[0224] Specifically, the first element of the spreading sequence with the same length as the target data can be obtained to form a despreading subsequence. This despreading subsequence is used to perform a despreading operation on the first portion of the target data to obtain a detection result. If the detection result is a success, further detection of the remaining data can be discontinued. Conversely, if the detection result is a failure, more target data can be obtained for despreading. In this case, the amount of the first portion of the target data can be increased to obtain a new first portion of the target data. The despreading subsequence is then used to perform a despreading operation on the new first portion of the target data to obtain a new detection result, until the new detection result is a success.

[0225] The data communication method provided in this embodiment uses a partial spreading sequence to perform a despreading operation on a portion of the target data, thereby effectively reducing the detection complexity and the reception processing delay.

[0226] Figure 5 The flowchart of the data communication method provided in the third embodiment of the present application is based on the third embodiment. Figure 5 As shown, before step 402, the following steps are also included:

[0227] Step 501: Determine a reference sequence.

[0228] Step 502: Use a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence.

[0229] In this embodiment, after acquiring the target data, the base station needs to use the spreading sequence to perform a despreading operation on the target data. Therefore, the base station also needs to generate the spreading sequence.

[0230] Specifically, a PDMA spreading sequence can be selected from the PDMA pattern matrix as a reference sequence g. After obtaining the reference sequence, a generator matrix corresponding to the reference sequence can be determined based on the reference sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1. For example, if the length of the reference sequence is 4, then the number of columns in the generator matrix is ​​4, and the number of rows in the generator matrix is ​​no more than 2. 4 -1=15. After the generator matrix is ​​obtained, the generator matrix can be used to perform an encoding operation on the reference matrix to obtain an extended sequence.

[0231] In addition, after obtaining the spreading sequence, the base station can also use the spreading sequence to spread the data to be transmitted to the terminal device before transmission. Correspondingly, the terminal device can use the spreading sequence to despread the spread data transmitted by the base station.

[0232] Furthermore, based on any of the above embodiments, after step 601, the following steps may be further included:

[0233] determining an identifier of a reference sequence corresponding to the reference sequence;

[0234] sending the identifier of the reference sequence to the terminal device; or,

[0235] The reference sequence is sent to the terminal device.

[0236] In this embodiment, after determining the reference sequence, the base station may notify the terminal device of the reference sequence. Specifically, the base station may send an identifier of the reference sequence to the terminal device, so that the terminal device can obtain the identifier of the reference sequence sent by the target base station and, based on the identifier of the reference sequence, determine the reference sequence corresponding to the identifier of the reference sequence in a pre-stored reference sequence table.

[0237] Optionally, after determining the reference sequence, the base station may directly send the reference sequence to the terminal device. After acquiring the reference sequence, the terminal device may perform an operation of generating an extended sequence according to the reference sequence.

[0238] The data communication method provided in this embodiment uses a generator matrix to encode a reference matrix. The resulting extended sequence has the same number of elements as the number of rows in the generator matrix, enabling the acquisition of longer extended sequences. Furthermore, because each element in the extended matrix is ​​obtained by encoding an element in the reference sequence, the complexity of subsequent data detection at the receiving end is reduced.

[0239] Furthermore, based on any of the above embodiments, before step 602, the method further includes:

[0240] Before performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence to obtain an extended sequence, the method further includes:

[0241] According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0242] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0243] The generator matrix is ​​composed according to the M binary sequences including N elements.

[0244] In this embodiment, after obtaining the reference sequence, 2 can be generated according to the number N of elements in the reference sequence. N-1 binary sequence containing N elements. According to the 2 N -1 binary sequence including N elements constitutes the generator matrix. N -1 binary sequence consisting of N elements determines M binary sequences to form a generator matrix, where M <= 2 N -1.

[0245] It should be noted that, since 0 indicates no transmission on the corresponding resource, the binary sequence includes at least one element 1, that is, the binary sequence with N elements all being 0 needs to be removed.

[0246] Optionally, based on the first embodiment, the method further includes:

[0247] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0248] In this embodiment, when M<2 N 1, the correlation between the binary sequence can be N -1 binary sequences to determine the generator matrix. Specifically, in all 2 N -1 selects M binary sequences with smaller inter-sequence correlation from the N-element binary sequences as the generator matrix.

[0249] Optionally, the binary sequences may be sorted according to the decimal numbers corresponding to the binary sequences, and M binary sequences with smaller decimal numbers are selected as the generator matrix.

[0250] Any method may be selected to determine the generator matrix, and this disclosure does not impose any limitation thereto.

[0251] Optionally, the generator matrix may also be pre-configured. Based on the first embodiment, step 202 specifically includes:

[0252] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0253] In this embodiment, in order to implement the encoding operation of the reference sequence, a generator matrix can be pre-configured, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix can be configured according to actual conditions, and the number of rows can be specifically M rows, where M<=2 NThe pre-configured generator matrix can be used to perform encoding operations on the reference sequence.

[0254] The data communication method provided in this embodiment determines a generator matrix according to the number of elements in a reference sequence and controls each binary sequence in the generator matrix to include at least one 1, thereby providing a basis for subsequent expansion according to the generator matrix reference sequence.

[0255] Further, based on any of the above embodiments, step 602 includes:

[0256] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0257] In this embodiment, after obtaining a generator matrix, an encoding operation can be performed on the reference matrix using the generator matrix. Specifically, a product operation can be performed on the elements in the reference sequence corresponding to the column position of element 1 in each row sequence of the generator matrix to obtain the products corresponding to all rows in the generator matrix. The products corresponding to all rows in the generator matrix are used to form an extended sequence, where the length of the extended sequence is equal to the number of rows in the generator matrix.

[0258] Optionally, based on any of the foregoing embodiments, the encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence includes:

[0259] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0260] In this embodiment, all binary sequences in the generator matrix, except for the binary sequence containing N elements 1, contain the element 0. Therefore, during the vector product operation, if the column position corresponding to the reference sequence of element 1 in a row sequence does not contain a non-zero element, element 0 is used as the corresponding element in the extended sequence. Accordingly, for each element 1 in the generator matrix row sequence, a product operation is performed on that element 1 with the non-zero element in the reference sequence corresponding to the column position of element 1. The resulting product forms an extended sequence, where the length of the extended sequence is equal to the number of rows 0 in the generator matrix.

[0261] Further, based on any of the above embodiments, step 602 includes:

[0262] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0263] In this embodiment, it is possible to detect whether the reference sequence includes target element 0. If the reference sequence includes element 0, to ensure that the extended sequence and the reference sequence have the same diversity, the position i of target element 0 in the reference sequence can be determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0264] The data communication method provided in this embodiment performs vector product operations on each row of the generator matrix and the reference sequence, and the resulting products form the extended sequence. This ensures that each element in the extended sequence is encoded from the reference sequence, effectively reducing the complexity of data detection at the receiving end. Furthermore, since the reference sequence is encoded according to the generator matrix, the similarity between extended sequences is reduced, resulting in a larger number of available extended sequences. Furthermore, when it is determined that the reference sequence includes 0, the i+N*nth element in the extended sequence is set to the target element 0. This ensures that the diversity degree of the extended sequence is the same as that of the reference sequence. This effectively reduces serial interference and improves data transmission efficiency during subsequent data transmission.

[0265] Furthermore, based on any of the above embodiments, step 502 includes:

[0266] performing a despreading operation on the target data using the spread sequence or a preceding portion of the spread sequence to obtain a detection result;

[0267] A response instruction is sent to the terminal device according to the detection result, wherein the response instruction is used to indicate whether the target base station has successfully or failed to detect the target data.

[0268] In this embodiment, after performing a despreading operation on the target data, a detection result can be obtained, where the detection result can include detection success or detection failure. The base station can send a response instruction to the terminal device based on the detection result, where the response instruction is used to indicate whether the target base station has successfully or failed to detect the target data. Accordingly, after the terminal device obtains the response instruction, if the response instruction indicates that the base station has failed to detect the target data, in order to enable the base station to obtain valid data, the terminal device can send the target data to the base station again according to the response instruction.

[0269] The data communication method provided in this embodiment sends a response instruction to the terminal device based on the detection result, so that after the terminal device obtains the response instruction, it resends the target data when the response instruction indicates that the base station fails to detect the target data, thereby ensuring the validity of data transmission.

[0270] Figure 6 This is a structural diagram of a data communication device provided in Example 4 of the present application. The data communication device is applied to a terminal device, such as Figure 6 As shown, the data communication device includes a memory 61, a transceiver 62, and a processor 63:

[0271] The memory 61 is used to store computer programs; the transceiver 62 is used to send and receive data under the control of the processor; the processor 63 is used to read the computer program in the memory and perform the following operations:

[0272] Get the benchmark sequence;

[0273] Using a generator matrix corresponding to the reference sequence, the reference sequence is encoded to obtain an extended sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0274] Performing a spread spectrum operation on the data to be transmitted using the spread sequence to obtain target data;

[0275] The target data is sent.

[0276] Furthermore, based on the fifth embodiment, before the processor uses the generator matrix corresponding to the reference sequence to perform the encoding operation on the reference sequence, it is further configured to:

[0277] According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0278] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0279] Furthermore, based on the fifth embodiment, the processor is further configured to:

[0280] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0281] Furthermore, based on the fifth embodiment, when the processor uses the generator matrix corresponding to the reference sequence to perform the encoding operation on the reference sequence, it is configured to:

[0282] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0283] Furthermore, based on the fifth embodiment, when the processor uses the generator matrix corresponding to the reference sequence to perform the encoding operation on the reference sequence, it is configured to:

[0284] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0285] Furthermore, based on the fifth embodiment, when the processor uses the generator matrix corresponding to the reference sequence to perform the encoding operation on the reference sequence, it is configured to:

[0286] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0287] Furthermore, based on the fifth embodiment, the processor further includes:

[0288] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0289] Furthermore, based on the fifth embodiment, when acquiring the reference sequence, the processor is configured to:

[0290] Obtaining an identifier of a reference sequence sent by a network-side device, and locating and obtaining the reference sequence in a pre-stored reference sequence table according to the identifier of the reference sequence; or,

[0291] obtaining the reference sequence sent by the network side device; or,

[0292] A row of reference sequences is randomly selected from a pre-stored reference sequence table as the reference sequence.

[0293] Figure 7 This is a structural diagram of a data communication device provided in Example 5 of the present application, as shown in FIG. Figure 7 As shown, the data communication device is applied to a base station, and the data processing device includes a memory 71, a transceiver 72, and a processor 73:

[0294] The memory 71 is used to store computer programs; the transceiver 72 is used to send and receive data under the control of the processor; the processor 73 is used to read the computer program in the memory and perform the following operations:

[0295] Obtain target data sent by a terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is obtained by the terminal device after performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0296] The target data is despread using the spread sequence or a preceding portion of the spread sequence to obtain the data to be transmitted.

[0297] Further, based on the sixth embodiment, when the processor uses the spreading sequence or a preceding portion of the spreading sequence to perform a despreading operation on the target data to obtain the data to be transmitted, the processor is configured to:

[0298] Obtaining a preceding element of the spread sequence having the same length as the target data to form a despread subsequence;

[0299] performing a despreading operation on a front portion of the target data using the despreading subsequence to obtain a detection result;

[0300] If the detection result is a detection failure, the data size of the previous portion of the target data is increased to obtain new previous portion of the target data, and the despreading subsequence is used to perform a despreading operation on the new previous portion of the target data to obtain a new detection result, until the new detection result is a detection success.

[0301] Furthermore, based on the sixth embodiment, before the processor uses the spreading sequence or the preceding portion of the spreading sequence to perform a despreading operation on the target data, the processor is further configured to:

[0302] Determine the benchmark sequence;

[0303] A generator matrix corresponding to the reference sequence is used to perform an encoding operation on the reference sequence to obtain an extended sequence.

[0304] Furthermore, based on the sixth embodiment, before the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain the extended sequence, it is further configured to:

[0305] According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0306] Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0307] Furthermore, based on the sixth embodiment, when the processor forms the generator matrix according to the M binary sequences including N elements, it is configured to:

[0308] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0309] Furthermore, based on the sixth embodiment, when the processor uses the generator matrix corresponding to the reference sequence to perform the encoding operation on the reference sequence, it is configured to:

[0310] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0311] Furthermore, based on the sixth embodiment, when the processor uses the generator matrix corresponding to the reference sequence to perform the encoding operation on the reference sequence, it is configured to:

[0312] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0313] Furthermore, based on the sixth embodiment, when the processor uses the generator matrix corresponding to the reference sequence to perform the encoding operation on the reference sequence, it is configured to:

[0314] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0315] Furthermore, based on the sixth embodiment, the processor is further configured to:

[0316] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0317] Furthermore, based on the sixth embodiment, after determining the reference sequence to be extended, the processor is further configured to:

[0318] determining an identifier of a reference sequence corresponding to the reference sequence;

[0319] sending the identifier of the reference sequence to the terminal device; or,

[0320] The reference sequence is sent to the terminal device.

[0321] Figure 8 This is a structural diagram of a data communication device provided in Example 6 of the present application. The data communication device is applied to a terminal device, such as Figure 8 As shown, the device includes:

[0322] An acquisition module 81 is used to acquire a reference sequence;

[0323] The encoding module 82 is configured to use a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than 2 N -1;

[0324] A spectrum spreading module 83 is configured to perform a spectrum spreading operation on the data to be transmitted using the spreading sequence to obtain target data;

[0325] The sending module 84 is configured to send the target data.

[0326] Furthermore, based on the seventh embodiment, the device further includes:

[0327] A sequence generation module is used to generate 2 N- a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0328] A matrix generation module is used to determine the generation matrix composed of M binary sequences including N elements, M <= 2 N -1.

[0329] Furthermore, based on the seventh embodiment, the device is used for:

[0330] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0331] Furthermore, based on the seventh embodiment, the encoding module is used to:

[0332] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0333] Furthermore, based on the seventh embodiment, the encoding module is used to:

[0334] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0335] Furthermore, based on the seventh embodiment, the encoding module is used to:

[0336] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0337] Furthermore, based on the seventh embodiment, the acquisition module is used to:

[0338] Obtaining an identifier of a reference sequence sent by a network-side device, and locating and obtaining the reference sequence in a pre-stored reference sequence table according to the identifier of the reference sequence; or,

[0339] obtaining the reference sequence sent by the network side device; or,

[0340] A row of reference sequences is randomly selected from a pre-stored reference sequence table as the reference sequence.

[0341] Figure 9 This is a structural diagram of a data communication device provided in Example 7 of the present application, which is applied to a base station, such as Figure 9 As shown, the device includes:

[0342] The data acquisition module 901 is configured to acquire target data sent by a terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is obtained by the terminal device after performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, wherein the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1;

[0343] The despreading module 902 is configured to perform a despreading operation on the target data using the spreading sequence or a preceding portion of the spreading sequence to obtain the data to be transmitted.

[0344] Furthermore, based on the eighth embodiment, the despread spectrum module is configured to:

[0345] Obtaining a preceding element of the spread sequence having the same length as the target data to form a despread subsequence;

[0346] performing a despreading operation on a front portion of the target data using the despreading subsequence to obtain a detection result;

[0347] If the detection result is a detection failure, the data size of the previous portion of the target data is increased to obtain new previous portion of the target data, and the despreading subsequence is used to perform a despreading operation on the new previous portion of the target data to obtain a new detection result, until the new detection result is a detection success.

[0348] Furthermore, based on the eighth embodiment, the device further includes:

[0349] A determination module, configured to determine a reference sequence;

[0350] The processing module is configured to use a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence.

[0351] Furthermore, based on the eighth embodiment, the device further includes:

[0352] A generating module is used to generate 2 according to the number N of elements in the benchmark sequence. N- a binary sequence of N elements, wherein the binary sequence includes at least one element 1;

[0353] A composition module, used to determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

[0354] Furthermore, based on the eighth embodiment, the component modules are used for:

[0355] When M<2 N -1, the M binary sequences including N elements are in all 2 N -1 binary sequences of N elements have small inter-sequence correlation.

[0356] Furthermore, based on the eighth embodiment, the processing module is configured to:

[0357] The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference matrix, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

[0358] Furthermore, based on the eighth embodiment, the processing module is configured to:

[0359] A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

[0360] Furthermore, based on the eighth embodiment, the processing module is configured to:

[0361] A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

[0362] Furthermore, based on the eighth embodiment, the processing module is configured to:

[0363] If the reference sequence includes element 0, position i of element 0 in the reference sequence is determined, and the i+N*nth element in the extended sequence is set as target element 0, where n is a positive integer and i+N*n<=M.

[0364] Furthermore, based on the eighth embodiment, the despread spectrum module is configured to:

[0365] determining an identifier of a reference sequence corresponding to the reference sequence;

[0366] sending the identifier of the reference sequence to the terminal device; or,

[0367] The reference sequence is sent to the terminal device.

[0368] It should be noted that the division of units in the embodiments of the present application is schematic and is merely a logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0369] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a processor-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0370] It should be noted here that the above-mentioned device provided in this application can implement all the method steps implemented in the above-mentioned method embodiment and can achieve the same technical effects. The parts and beneficial effects of this embodiment that are the same as those in the method embodiment will not be described in detail here.

[0371] Another embodiment of the present application further provides a processor-readable storage medium, wherein the processor-readable storage medium stores a computer program, and the computer program is used to enable the processor to execute the method as described in any of the above embodiments.

[0372] The processor-readable storage medium can be any available medium or data storage device that can be accessed by the processor, including but not limited to magnetic storage (such as floppy disks, hard disks, magnetic tapes, magneto-optical disks (MO)), optical storage (such as CDs, DVDs, BDs, HVDs, etc.), and semiconductor storage (such as ROMs, EPROMs, EEPROMs, non-volatile memories (NANDFLASH), solid-state drives (SSDs)), etc.

[0373] The technical solution provided in the embodiment of the present application can be applicable to a variety of systems, especially 5G systems. For example, the applicable system can be a global system of mobile communication (GSM) system, a code division multiple access (CDMA) system, a wideband code division multiple access (WCDMA) general packet radio service (GPRS) system, a long term evolution (LTE) system, a LTE frequency division duplex (FDD) system, a LTE time division duplex (TDD) system, an advanced long term evolution (LTE-A) system, a universal mobile telecommunication system (UMTS), a world-wide interoperability for microwave access (WiMAX) system, a 5G new air interface (NR) system, etc. These various systems include terminal equipment and network equipment. The system may also include a core network part, such as an evolved packet system (EPS), a 5G system (5GS), etc.

[0374] The terminal device involved in the embodiments of the present application may be a device that provides voice and / or data connectivity to a user, a handheld device with wireless connection function, or other processing devices connected to a wireless modem. In different systems, the name of the terminal device may also be different. For example, in a 5G system, the terminal device may be called a user equipment (UE). A wireless terminal device can communicate with one or more core networks (CN) via a radio access network (RAN). The wireless terminal device can be a mobile terminal device, such as a mobile phone (or "cellular" phone) and a computer with a mobile terminal device. For example, it can be a portable, pocket-sized, handheld, computer-built-in or vehicle-mounted mobile device that exchanges language and / or data with a radio access network. For example, personal communication service (PCS) phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), and other devices. The wireless terminal device may also be referred to as a system, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, an access point, a remote terminal device, an access terminal device, a user terminal device, a user agent, or a user device, but is not limited in the embodiments of the present application.

[0375] The network device involved in the embodiments of the present application may be a base station, which may include multiple cells providing services to terminals. Depending on the specific application scenario, the base station may also be called an access point, or may be a device in an access network that communicates with a wireless terminal device through one or more sectors on an air interface, or may be named otherwise. The network device may be used to interchange received air frames with Internet Protocol (IP) packets, acting as a router between the wireless terminal device and the rest of the access network, wherein the rest of the access network may include an Internet Protocol (IP) communication network. The network device may also coordinate attribute management of the air interface. For example, the network device involved in the embodiments of the present application may be a network device (Base Transceiver Station, BTS) in the Global System for Mobile communications (GSM) or Code Division Multiple Access (CDMA), or a network device (NodeB) in Wide-band Code Division Multiple Access (WCDMA), or an evolutionary network device (eNB or e-NodeB) in the Long Term Evolution (LTE) system, a 5G base station (gNB) in the 5G network architecture (next generation system), or a home evolved Node B (HeNB), a relay node, a home base station (femto), a pico base station (pico), etc., and is not limited in the embodiments of the present application. In some network structures, the network device may include a centralized unit (CU) node and a distributed unit (DU) node, and the centralized unit and the distributed unit may also be geographically separated.

[0376] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage and optical storage, etc.) that contain computer-usable program code.

[0377] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer-executable instructions. These computer-executable instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the steps in the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0378] These processor-executable instructions may also be stored in a processor-readable memory that can direct a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the processor-readable memory produce an article of manufacture comprising an instruction device that implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0379] These processor-executable instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are performed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable device to implement the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0380] Obviously, those skilled in the art may make various changes and modifications to this application without departing from the spirit and scope of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalents, this application is intended to include these modifications and variations.

Claims

1. A data communication method, applied to a terminal device, characterized in that: The method includes: Get the benchmark sequence; According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1; Determine the generator matrix consisting of M binary sequences of N elements, M<=2 N -1; the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence; Performing a product operation on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and forming an extended sequence from the obtained product results, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; Performing a spread spectrum operation on the data to be transmitted using the spread sequence to obtain target data; The target data is sent.

2. The method according to claim 1, characterized in that The determining of forming the generator matrix from M binary sequences including N elements comprises: when When the correlation of binary sequence is N The M binary sequences including N elements are determined from -1 binary sequences including N elements.

3. The method according to claim 1, characterized in that The step of using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes: The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference sequence, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

4. The method according to claim 1, wherein The step of performing a product operation on the elements in the reference sequence corresponding to the column position of element 1 in each row sequence of the generator matrix and forming an extended sequence from the obtained product results comprises: A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results constitute the extended sequence; if the non-zero element in the reference sequence corresponding to the column position where the element 1 in a row sequence is located does not exist, the element 0 is used as the corresponding element in the extended sequence.

5. The method according to claim 1 or 4, characterized in that The method further comprises: If the reference sequence includes element 0, the position i of the element 0 in the reference sequence is determined, and the position i+N of the element 0 in the extended sequence is set to n elements are set to the target element 0, where n is a positive integer and i+N n<=M.

6. The method according to any one of claims 1 to 4, characterized in that The obtaining of the reference sequence comprises: Obtaining an identifier of a reference sequence sent by a network-side device, and locating and obtaining the reference sequence in a pre-stored reference sequence table according to the identifier of the reference sequence; or, obtaining the reference sequence sent by the network side device; or, A row of reference sequences is randomly selected from a pre-stored reference sequence table as the reference sequence.

7. A data communication method, applied to a base station, characterized in that: The method includes: Obtain target data sent by the terminal device, the target data being obtained after the terminal device performs a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is formed by the terminal device performing a product operation on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the product result is obtained; the generator matrix is ​​generated by the terminal device according to the number N of elements in the reference sequence. N -1 binary sequence including N elements, and then composed of M binary sequences including N elements; wherein the binary sequence includes at least one element 1, the number of columns of the generator matrix is ​​the same as the number of elements N in the reference sequence, the length of the extended sequence is equal to the number of rows of the generator matrix, and M<=2 N -1; The target data is despread using the spread sequence or a preceding portion of the spread sequence to obtain the data to be transmitted.

8. The method according to claim 7, characterized in that The step of performing a despreading operation on the target data using the spreading sequence or a preceding portion of the spreading sequence to obtain the data to be transmitted includes: Obtaining a preceding element of the spread sequence having the same length as the target data to form a despread subsequence; performing a despreading operation on a front portion of the target data using the despreading subsequence to obtain a detection result; If the detection result is a detection failure, the data size of the previous portion of the target data is increased to obtain new previous portion of the target data, and the despreading subsequence is used to perform a despreading operation on the new previous portion of the target data to obtain a new detection result, until the new detection result is a detection success.

9. The method according to claim 7 or 8, characterized in that Before performing a despreading operation on the target data using the spreading sequence or a front part of the spreading sequence, the method further includes: Determine the benchmark sequence; A generator matrix corresponding to the reference sequence is used to perform an encoding operation on the reference sequence to obtain an extended sequence.

10. The method according to claim 9, characterized in that Before performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence to obtain an extended sequence, the method further includes: According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1; Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

11. The method according to claim 10, characterized in that The generating matrix is ​​formed according to the M binary sequences including N elements, comprising: When M<2 N -1, according to the correlation of the binary sequence in all 2 N The M binary sequences including N elements are determined from -1 binary sequences including N elements.

12. The method according to claim 9, characterized in that The step of using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes: The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference sequence, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

13. The method according to claim 9, characterized in that The step of using a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence includes: A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

14. The method according to claim 9, characterized in that Performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence includes: A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

15. The method according to claim 13 or 14, characterized in that The method further comprises: If the reference sequence includes element 0, the position i of the element 0 in the reference sequence is determined, and the position i+N of the element 0 in the extended sequence is set to n elements are set to the target element 0, where n is a positive integer and i+N n<=M.

16. The method according to claim 9, characterized in that After determining the reference sequence to be extended, the method further includes: determining an identifier of a reference sequence corresponding to the reference sequence; sending the identifier of the reference sequence to the terminal device; or, The reference sequence is sent to the terminal device.

17. A data communication device, applied to a terminal device, characterized in that: Including memory, transceiver, processor: A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations: Get the benchmark sequence; According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1; Determine the generator matrix consisting of M binary sequences of N elements, M<=2 N -1; Performing a product operation on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and forming an extended sequence from the obtained product results, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; Performing a spread spectrum operation on the data to be transmitted using the spread sequence to obtain target data; The target data is sent.

18. The device according to claim 17, characterized in that When determining that the generator matrix is ​​composed of M binary sequences including N elements, the processor is configured to: When M<2 N -1, according to the correlation of the binary sequence in all 2 N The M binary sequences including N elements are determined from -1 binary sequences including N elements.

19. The device according to claim 17, characterized in that When the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to: The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference sequence, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

20. The device according to claim 17, wherein When the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to: A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

21. The device according to claim 17 or 20, characterized in that The processor further includes: If the reference sequence includes element 0, the position i of the element 0 in the reference sequence is determined, and the position i+N of the element 0 in the extended sequence is set to n elements are set to the target element 0, where n is a positive integer and i+N n<=M.

22. The device according to any one of claims 17 to 20, characterized in that When acquiring the reference sequence, the processor is configured to: Obtaining an identifier of a reference sequence sent by a network-side device, and locating and obtaining the reference sequence in a pre-stored reference sequence table according to the identifier of the reference sequence; or, obtaining the reference sequence sent by the network side device; or, A row of reference sequences is randomly selected from a pre-stored reference sequence table as the reference sequence.

23. A data communication device, applied to a base station, characterized in that: Including memory, transceiver, processor: A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations: Obtain target data sent by a terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is obtained by the terminal device after performing an encoding operation on the reference sequence using a generator matrix corresponding to the reference sequence, the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence, and the number of rows of the generator matrix is ​​not greater than the number 2 N -1; The target data is despread using the spread sequence or a preceding portion of the spread sequence to obtain the data to be transmitted.

24. The device according to claim 23, characterized in that When the processor uses the spreading sequence or a preceding portion of the spreading sequence to perform a despreading operation on the target data to obtain the data to be transmitted, the processor is configured to: Obtaining a preceding element of the spread sequence having the same length as the target data to form a despread subsequence; performing a despreading operation on a front portion of the target data using the despreading subsequence to obtain a detection result; If the detection result is a detection failure, the data size of the previous portion of the target data is increased to obtain new previous portion of the target data, and the despreading subsequence is used to perform a despreading operation on the new previous portion of the target data to obtain a new detection result, until the new detection result is a detection success.

25. The device according to claim 23 or 24, characterized in that Before performing a despreading operation on the target data using the spreading sequence or a previous part of the spreading sequence, the processor is further configured to: Determine the benchmark sequence; A generator matrix corresponding to the reference sequence is used to perform an encoding operation on the reference sequence to obtain an extended sequence.

26. The device according to claim 25, characterized in that Before the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence to obtain an extended sequence, the processor is further configured to: According to the number N of elements in the benchmark sequence, 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1; Determine that the generator matrix is ​​composed of M binary sequences including N elements, M<=2 N -1.

27. The device according to claim 26, characterized in that When the processor composes the generator matrix according to the M binary sequences including N elements, the processor is configured to: When M<2 N -1, according to the correlation of the binary sequence in all 2 N The M binary sequences including N elements are determined from -1 binary sequences including N elements.

28. The device according to claim 25, characterized in that When the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to: The reference sequence is encoded using a preset generator matrix, wherein the number of columns of the generator matrix is ​​the same as the number of elements in the reference sequence, and the number of rows of the generator matrix is ​​M, where M<=2 N -1.

29. The device according to claim 25, characterized in that When the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to: A product operation is performed on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix.

30. The device according to claim 25, wherein When the processor uses a generator matrix corresponding to the reference sequence to perform an encoding operation on the reference sequence, the processor is configured to: A product operation is performed on the non-zero elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and the obtained product results form the extended sequence, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; if the non-zero element in the reference sequence corresponding to the column position where element 1 in a row sequence is located does not exist, element 0 is used as the corresponding element in the extended sequence.

31. The device according to claim 29 or 30, characterized in that The processor is further configured to: If the reference sequence includes element 0, the position i of the element 0 in the reference sequence is determined, and the position i+N of the element 0 in the extended sequence is set to n elements are set to the target element 0, where n is a positive integer and i+N n<=M.

32. The device according to claim 25, characterized in that After determining the reference sequence to be extended, the processor is further configured to: determining an identifier of a reference sequence corresponding to the reference sequence; sending the identifier of the reference sequence to the terminal device; or, The reference sequence is sent to the terminal device.

33. A data communication device, applied to a terminal device, characterized in that: The device includes: An acquisition module, used for acquiring a reference sequence; A sequence generation module is used to generate 2 N - a binary sequence of N elements, wherein the binary sequence includes at least one element 1; The matrix generation module is used to determine the generation matrix composed of M binary sequences with N elements, M<=2 N -1; the number of columns of the generator matrix is ​​the same as the number N of elements in the reference sequence; an encoding module, configured to perform a product operation on the elements in the reference sequence corresponding to the column position where element 1 in each row sequence of the generator matrix is ​​located, and to form an extended sequence from the obtained product results, wherein the length of the extended sequence is equal to the number of rows of the generator matrix; A spectrum spreading module, configured to perform a spectrum spreading operation on the data to be transmitted using the spreading sequence to obtain target data; A sending module is used to send the target data.

34. A data communication device, applied to a base station, characterized in that: The device includes: The data acquisition module is used to acquire the target data sent by the terminal device, wherein the target data is obtained by the terminal device after performing a spread spectrum operation on the data to be transmitted using an extended sequence, wherein the extended sequence is formed by the terminal device performing a product operation on the elements in the reference sequence corresponding to the column position where the element 1 in each row sequence of the generator matrix is ​​located, and the product result is obtained; the generator matrix is ​​generated by the terminal device according to the number N of elements in the reference sequence. N -1 binary sequence including N elements, and then composed of M binary sequences including N elements; wherein the binary sequence includes at least one element 1, the number of columns of the generator matrix is ​​the same as the number of elements N in the reference sequence, the length of the extended sequence is equal to the number of rows of the generator matrix, and M<=2 N -1; The despreading module is configured to perform a despreading operation on the target data using the spread sequence or a preceding portion of the spread sequence to obtain the data to be transmitted.

35. A processor-readable storage medium, characterized in that: The processor-readable storage medium stores a computer program, and the computer program is configured to cause the processor to execute the method according to any one of claims 1 to 6 or 7 to 16.

Images