Data transmission method and device and storage medium

Abstract

The embodiment of the invention provides a data transmission method and device and a storage medium, relates to the technical field of communication, and at least can improve the performance of code division multiple access. The method comprises the following steps: acquiring a first pilot frequency sequence; generating a first data symbol, wherein the first data symbol is obtained by carrying out coding processing and modulation processing on first data to be sent by utilizing the extension sequence; and sending the first symbol sequence, wherein the first symbol sequence consists of the first pilot frequency sequence and the first data symbol.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a data transmission method, device and storage medium. Background Art

[0002] 6G has put forward higher requirements for connection density and proposed massive communication scenarios. The number of potential access terminals is huge, and traditional access solutions are difficult to meet such massive connection scenarios. Therefore, grant-free transmission came into being.

[0003] In the CDMA scheduling-free transmission process, since the base station does not know which user terminals are currently accessing and transmitting data, the base station generally uses the orthogonality or cross-correlation between the extended sequences to detect the extended sequences to separate and analyze the data transmitted by each user terminal. However, the current transmission process will affect the orthogonality or cross-correlation of the extended sequences at the transmitting end, resulting in the base station being unable to correctly separate the transmission data of each user terminal, which will reduce the performance of CDMA. Summary of the invention

[0004] The embodiments of the present disclosure provide a data transmission method, device, and storage medium, which can at least improve the performance of code division multiple access.

[0005] On the one hand, a data transmission method is provided, which is applied to a first node, and the method includes: obtaining a first pilot sequence; generating a first data symbol, wherein the first data symbol is obtained by encoding and modulating a first data to be transmitted using an extended sequence; and sending a first symbol sequence, wherein the first symbol sequence is composed of a first pilot sequence and the first data symbol.

[0006] On the other hand, a data transmission method is provided, which is applied to a second node, and the method includes: receiving a second symbol sequence, the second symbol sequence consisting of a second pilot sequence and a second data symbol; the second symbol sequence includes a first symbol sequence sent by at least one first node; preprocessing the second data symbol based on a channel estimation result to obtain a third data symbol; the channel estimation result is obtained by performing channel estimation based on the second pilot sequence and a pilot sequence set; and parsing the third data symbol to obtain first data of at least one of the first nodes.

[0007] In another aspect, a communication device is provided, comprising: an acquisition module, a generation module and a sending module. The acquisition module is used to acquire a first pilot sequence; the generation module is used to generate a first data symbol, the first data symbol is obtained by encoding and modulating the first data to be sent using an extended sequence; the sending module is used to send a first symbol sequence, the first symbol sequence consists of the first pilot sequence and the first data symbol.

[0008] In another aspect, a communication device is provided, comprising: a receiving module and a processing module. The receiving module is used to receive a second symbol sequence, the second symbol sequence is composed of a second pilot sequence and a second symbol; the second symbol sequence includes a first symbol sequence sent by at least one first node; the processing module is used to pre-process the second data symbol based on a channel estimation result to obtain a third data symbol; the channel estimation result is obtained by performing channel estimation based on the second pilot sequence and the pilot sequence set; the processing module is also used to parse the third data symbol to obtain the first data of at least one first node.

[0009] On the other hand, a computer-readable storage medium is provided, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the method described in any of the above embodiments is implemented.

[0010] On the other hand, a computer program product is provided. The computer program product includes computer program instructions. When the computer program instructions are executed by a processor, the method described in any one of the above embodiments is implemented.

[0011] An embodiment of the present disclosure provides a data transmission method, which includes: a first node jointly sends a pilot sequence and a data symbol so that a second node can perform channel estimation based on the pilot symbol, and pre-processes the received data symbol based on the channel estimation result to ensure the orthogonality or cross-correlation of the extended sequence in the received data symbol, so that the second node can correctly separate and parse the data transmitted by each first node from the received symbol sequence, thereby improving the performance of code division multiple access. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] In order to more clearly illustrate the technical solutions in the present disclosure, the drawings required for use in some embodiments of the present disclosure will be briefly introduced below. Obviously, the drawings described below are only drawings of some embodiments of the present disclosure, and a person skilled in the art can also obtain other drawings based on these drawings.

[0013] Figure 1 A schematic diagram of a system architecture of a communication system provided in some embodiments of the present disclosure;

[0014] Figure 2A flowchart of a data transmission method provided in some embodiments of the present disclosure;

[0015] Figure 3 A flowchart of another data transmission method provided in some embodiments of the present disclosure;

[0016] Figure 4 A schematic diagram of the structure of a communication device provided in some embodiments of the present disclosure;

[0017] Figure 5 A schematic diagram of the structure of another communication device provided in some embodiments of the present disclosure;

[0018] Figure 6 A schematic diagram of the composition of a communication device provided in some embodiments of the present disclosure. DETAILED DESCRIPTION

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

[0020] It should be noted that, in the present disclosure, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the present disclosure should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0021] In the following, the terms "first" and "second" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features.

[0022] In the description of the present disclosure, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "at least one" means one or more, and "a plurality" means two or more.

[0023] 6G has put forward higher requirements for connection density and proposed massive communication scenarios. The potential number of access terminals is huge, reaching more than 10 million terminals per square kilometer. In the traditional access and transmission scheme, before transmitting data, the terminal first enters the connection state through random access, and then applies to the base station for uplink transmission resources. After obtaining the authorization (grant) of the base station, information is transmitted on the uplink transmission resources authorized by the base station. In the massive connection scenario, this traditional access and transmission scheme faces problems such as high signaling overhead, high terminal power consumption, and large latency, and it is difficult to efficiently support massive terminal access. To address this problem, scheduling-free transmission came into being. In scheduling-free transmission, by using code division multiple access, that is, different terminals use different coding sequences or extension sequences to transmit data, so that the base station can distinguish the data transmitted by different terminals.

[0024] Taking the passive Internet of Things as an example, the passive Internet of Things is a typical massive communication scenario. Considering the minimalist design of passive devices, in the passive Internet of Things, a code division multiple access method based on on-off keying (OOK) waveform is generally adopted. This method encodes the transmission data of each terminal through an extended sequence (or called an extended code), and then modulates the data to be sent onto the carrier signal through the OOK waveform and backscatters it to the base station. Due to the scheduling-free transmission, the base station does not know which user terminals are currently accessing and transmitting data. Therefore, the base station can use the orthogonality or cross-correlation between the extended sequences to perform active user detection on the extended sequences, so as to separate and parse the received aliased data to obtain the transmission data of each terminal.

[0025] However, under the influence of the OOK waveform, the spread sequence at the transmitter becomes non-orthogonal or the cross-correlation deteriorates, which affects the subsequent balanced demodulation and decoding of the data, causing the base station to be unable to correctly separate the transmission data of each user terminal, which will reduce the performance of code division multiple access.

[0026] Based on this, an embodiment of the present disclosure provides a data transmission method, in which the transmitting end jointly sends a pilot sequence and a data symbol so that the receiving end can perform channel estimation based on the pilot symbol, and pre-process the received data symbols based on the channel estimation result to ensure the orthogonality or cross-correlation of the extended sequence in the received data symbol, so that the receiving end can correctly separate and parse the data transmitted by each transmitting end from the received data symbol, thereby improving the performance of code division multiple access.

[0027] In some embodiments, the technical solution of the present disclosure includes: the first node obtains a first pilot sequence, and uses an extended sequence to encode and modulate the first data to be sent to obtain a first data symbol. Then, the first node sends a first symbol sequence including the first pilot sequence and the first data symbol to the second node. The second node receives the second symbol sequence, pre-processes the second data symbol based on the channel estimation result, obtains a third data symbol, and then parses the third data symbol to obtain the first data of at least one first node.

[0028] It should be understood that the pilot in the embodiments of the present disclosure may refer to a pilot sequence, a pilot symbol, a reference signal, a preamble, a random access signal, etc.

[0029] The network architecture of the communication network (including but not limited to 3G, 4G, 5G, 6G and future mobile communication networks) in the embodiments of the present disclosure may include at least one transmitting end (for example, including but not limited to a terminal, an Internet of Things device, etc.) and at least one receiving end (for example, including but not limited to a base station, a reader / writer, etc.).

[0030] Exemplarily, taking the example that the transmitting end includes at least one terminal and the receiving end is a base station, Figure 1 FIG. 1 is a schematic diagram showing a system architecture of a communication system provided by an embodiment of the present disclosure. Figure 1 As shown, the communication system 10 includes a base station 11 and at least one terminal 12 (two terminals are shown as an example in the figure). The base station 11 and the terminal 12 can be connected in communication. In multiple access transmission, the terminal can perform channel coding, waveform coding, extension code coding, modulation and other processing on the first data to be sent to form a data symbol, and then map the selected pilot sequence and the data symbol to the time-frequency resource and send them to the base station. The base station processes the data symbol based on the pilot sequence to obtain the first data.

[0031] In some embodiments, the base station 11 is used to provide wireless access services for at least one terminal 12. Specifically, one base station 11 provides a service coverage area (also referred to as a cell). The terminal 12 entering the area can communicate with the base station 11 through wireless signals to receive the wireless access service provided by the base station 11. The service coverage areas of the base stations 11 may overlap, and the terminal 12 in the overlapping area can receive wireless signals from multiple base stations 11.

[0032] In some embodiments, the base station 11 may be connected to multiple terminal 12 devices, for example, the base station 11 is connected to the first terminal 12 and the second terminal 12. The first terminal 12 and the second terminal 12 may be located in the same cell, or the first terminal 12 and the second terminal 12 may be located in different cells. That is, one base station 11 may provide network services to a terminal 12 in one cell, or may provide network services to terminals 12 in multiple cells at the same time.

[0033] In some embodiments, the base station 11 can be a base station or an evolved base station (eNB or eNodeB) in long term evolution (LTE), long term evolution advanced (LTEA), a base station in a 5G network, or a base station in a future communication system, etc. The base station may include various macro base stations, micro base stations, home base stations, wireless remote stations, reconfigurable intelligent surfaces (RISs), routers, wireless fidelity (WIFI) devices, or various network side devices such as primary cells and collaborative cells (secondary cells).

[0034] In some embodiments, the terminal 12 may be a device with wireless transceiver function, which may be deployed on land, including indoors or outdoors, handheld, wearable or vehicle-mounted; it may also be deployed on the water surface (such as a ship, etc.); it may also be deployed in the air (such as an airplane, a balloon, and a satellite, etc.). The terminal may be a mobile phone, a tablet computer (Pad), a computer with wireless transceiver function, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. The embodiments of the present disclosure do not limit the application scenarios. A terminal may sometimes also be referred to as a user, user equipment (UE), access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE terminal, wireless communication equipment, UE agent or UE device, etc., but the embodiments of the present disclosure are not limited to this.

[0035] Figure 2 The flowchart of a data transmission method provided by the embodiment of the present disclosure is shown in FIG. Figure 1 In the system architecture shown, it can be specifically applied to a first node (such as a terminal).

[0036] like Figure 2 As shown, the data transmission method provided by the present disclosure may specifically include the following steps:

[0037] S201. A first node obtains a first pilot sequence.

[0038] Among them, the pilot sequence is usually used for channel estimation, synchronization and frequency offset correction.

[0039] In some embodiments, acquiring the first pilot sequence includes: the first node selecting the first pilot sequence from a pilot sequence set, wherein the pilot sequence set includes mutually orthogonal pilot sequences and / or pilot sequences with mutual correlation.

[0040] In some embodiments, the pilot sequence set is known to both the transmitting and receiving ends (the first node and the second node).

[0041] In some embodiments, selecting the first pilot sequence from the pilot sequence set includes at least one of the following methods:

[0042] selecting a first pilot sequence from a set of pilot sequences according to the signaling;

[0043] Randomly selecting a first pilot sequence from a set of pilot sequences;

[0044] A first pilot sequence is selected from a pilot sequence set according to a preset setting.

[0045] In some embodiments, the first node may determine the pilot sequence set according to signaling, and / or the first node may determine the pilot sequence set according to a pre-setting.

[0046] It should be noted that in an actual communication system, pilot sequence processing is used for channel estimation and is also used to implement sampling frequency offset (SFO), timing offset (TO) estimation, collision probability reduction and other functions. Therefore, in some embodiments, the pilot sequence in the pilot sequence set satisfies at least one of the following:

[0047] The autocorrelation of each pilot sequence is normalized to 1;

[0048] The pilot sequences are mutually orthogonal;

[0049] The cross-correlations between the pilot sequences are the same;

[0050] The number of non-zero elements in each pilot sequence is the same.

[0051] S202. The first node generates a first data symbol.

[0052] The first data symbol is obtained by encoding and modulating the first data to be sent using an extended sequence.

[0053] In some embodiments, the first data is data to be sent, and may include at least one of the following: service data; node identification; first pilot sequence information, and extended sequence information.

[0054] In some embodiments, the encoding process includes at least one of the following:

[0055] Channel coding;

[0056] Waveform coding;

[0057] Spread code encoding (i.e. encoding using a spreading sequence).

[0058] The channel coding mentioned here can be convolutional code, polar code, low density parity check code (LDPC), Turbo code, etc.

[0059] The waveform coding mentioned here may be Manchester code, FM0 code, Miller code, etc.

[0060] In some embodiments, the modulation process includes at least one of the following: OOK, binary phase shift keying (BPSK).

[0061] In some embodiments, during the process of the first node using the extended sequence to perform extended code encoding, the first node may obtain the extended sequence based on at least one of the following methods:

[0062] Selecting an extended sequence from an extended sequence set according to the signaling;

[0063] Randomly select an extended sequence from the extended sequence set;

[0064] A spreading sequence is selected from a spreading sequence set according to a preset setting.

[0065] In some embodiments, the set of spreading sequences is known to both the transmitting and receiving ends (the first node and the second node).

[0066] In some embodiments, the spread sequence set may be an orthogonal spread sequence set, such as a Walsh sequence, a Hadamard sequence, etc. It may also be a non-orthogonal spread sequence set, such as a Barker sequence, etc.

[0067] In some embodiments, the first node may determine the extended sequence set according to signaling, and / or the first node may determine the extended sequence set according to a pre-setting.

[0068] S203: The first node sends a first symbol sequence.

[0069] The first symbol sequence consists of a first pilot sequence and a first data symbol.

[0070] After acquiring the first pilot sequence and the first data symbol, the first node may map the first pilot sequence and the first data symbol together to a transmission resource, and then send them to the second node.

[0071] Figure 3 Schematic diagram of another data transmission method provided by an embodiment of the present disclosure. Exemplarily, the data transmission method provided by the present disclosure can be applied to Figure 1 In the system architecture shown, it can be specifically applied to a second node (such as a base station).

[0072] like Figure 3 As shown, the data transmission method provided by the present disclosure may specifically include the following steps:

[0073] S301. A second node receives a second symbol sequence.

[0074] The second symbol sequence consists of a second pilot sequence and a second data symbol, and the second symbol sequence includes a first symbol sequence sent by at least one first node.

[0075] It should be understood that during the scheduling-free transmission process, the second node may simultaneously receive the first symbol sequences sent by multiple first nodes. For the second node, the received data is the second symbol sequence, which can also be called a signal of multiple first nodes aliasing (mixing, superposition). The second node can process the second symbol sequence to complete the process of active first node detection and data separation and demodulation, that is, perform the following S302-S303.

[0076] S302: The second node preprocesses the second data symbol based on the channel estimation result to obtain a third data symbol.

[0077] The channel estimation result is obtained by performing channel estimation based on the second pilot sequence and the pilot sequence set.

[0078] It should be understood that the second node detects the received pilot symbol using the pilot sequence set, identifies the pilot sequence sent by the first node, performs channel estimation, and obtains a channel estimation result. Then, after the second node preprocesses the second data symbol based on the channel estimation result, the orthogonality or cross-correlation of the extended sequence in the second data symbol can be restored, which can facilitate the subsequent analysis and processing process of the second node, thereby ensuring the performance of multiple access.

[0079] S303: The second node parses the third data symbol to obtain first data of at least one first node.

[0080] In some embodiments, the parsing process includes at least one of the following:

[0081] detecting and separating a third data symbol based on the set of spreading sequences;

[0082] Channel estimation;

[0083] Channel equalization;

[0084] demodulation;

[0085] Decoding.

[0086] Among them, the detection mentioned above means that the second node uses an extended sequence set to detect the preprocessed third data symbol, identifies the extended sequence selected by the first node when transmitting the first data, completes the detection process, and obtains the first data symbol sent by the first node.

[0087] The above-mentioned channel estimation and channel equalization refer to that the second node performs secondary channel estimation on the data symbols of the first node based on the constellation diagram characteristics of the modulation method, and uses the channel estimation result to perform channel equalization to obtain processed data symbols.

[0088] The above demodulation and decoding means that the second node demodulates and decodes the first data symbol of the first node, and determines whether the decoding is correct based on the cyclical redundancy check (CRC) result. Since it is a contention-free scheduling transmission, the data part of the first data symbol can carry the identity of the first node. After the second node correctly decodes the data, it can obtain the identity information of the first node and the data it transmits. In addition, the data part can also carry pilot sequence information, extended sequence information, etc.

[0089] In some embodiments, the data transmission method provided by the embodiments of the present disclosure further includes the following S304A-S306A:

[0090] S304A: Process the first data of at least one first node to obtain a first data symbol of at least one first node.

[0091] S305A, eliminate at least one first data symbol of the first node from the third data symbol.

[0092] S306A: parse and process the eliminated third data symbol to obtain first data of other first nodes.

[0093] In some embodiments, the data transmission method provided by the embodiments of the present disclosure further includes the following S304B-S306B:

[0094] S304B: Process the first data of at least one first node to obtain a first symbol sequence of at least one first node.

[0095] S305B, eliminate the first symbol sequence of at least one first node from the second symbol sequence.

[0096] S306B: pre-process and parse the eliminated second symbol sequence to obtain first data of other first nodes.

[0097] It should be understood that for the data that is decoded correctly, the second node can re-encode, modulate, extend code encode, waveform modulate and other steps on the decoded output data to generate the first data symbol sent by the first node, and generate the pilot symbol sent by the first node according to the pilot information. The pilot symbol and the first data symbol together constitute the first symbol sequence sent by the first node. In the process of extending the code encoding, the second node determines the extended sequence of the first node for encoding according to the extended sequence information. Then, the second node uses the secondary channel estimation result to reconstruct the received data symbol, and then eliminates the reconstructed data symbol from the third data symbol to achieve interference elimination. Then the second node can identify and detect the first data transmitted by other first nodes from the eliminated third data symbol (i.e., execute S306A). The second node can also use the first symbol sequence reconstructed by all correctly decoded nodes to perform least squares (LS) channel estimation to obtain an updated channel estimation result, and reconstruct the received symbol sequence based on the updated channel estimation result to perform interference elimination. Then the second node can identify and detect the first data transmitted by other first nodes from the eliminated second symbol sequence (i.e., execute S306B).

[0098] It should be understood that the above S304A-S306A or S304B-S306B may be repeatedly executed until no new active first node can be identified, or until a specified number of iterations is reached.

[0099] The data transmission method provided by the embodiment of the present disclosure is described in detail below in combination with specific embodiments and formulas.

[0100] In the scheduling-free transmission, the second node allows multiple first nodes to transmit data in the same time-frequency resources, that is, the aliased signals of multiple first nodes received by the second node can be expressed as:

[0101]

[0102] Among them, x u Represents the data symbol sent by the first node u. d represents the aliased data symbols of U first nodes received by the second node, h u represents the channel experienced by the first node u, n d Represents additive white Gaussian noise (AWGN).

[0103] In one implementation, when the first node modulates the data symbol to be sent onto the carrier signal using the BPSK waveform for transmission, the data symbols superimposed by multiple first nodes received by the second node can be further expressed as:

[0104]

[0105] Among them, c u represents the extended sequence selected by the first node u, that is, the extended sequence determined by the first node u from the extended sequence set C according to a preset method or configured according to signaling or randomly selected. u is the data symbol after encoding and modulating at the first node u.

[0106] Exemplarily, the extended sequence set C may be an orthogonal extended sequence set, such as a Walsh sequence, a Hadamard sequence, etc., and satisfies: for any two different extended sequences c in the set C i and c j ,have

[0107] As another example, the extended sequence set C may also be a non-orthogonal extended sequence set, such as a Barker sequence, and satisfy the following conditions: for any two different extended sequences c in the set C, i and c j ,have That is, the extended sequences in the set have higher autocorrelation peaks and lower cross-correlation peaks.

[0108] Since the first node modulates the data symbol to be sent to the carrier signal with a BPSK waveform for transmission, the data symbols of multiple first nodes received by the second node can effectively retain the properties of the extended sequence set, so the second node can use it for detection and recovery. To simplify the analysis, take the example of two first nodes transmitting data simultaneously with non-colliding extended sequences. The first node 1 and the first node 2 select different extended sequences c 1 and c 2 , then the above formula (2) can be written as

[0109] y d =h 1 c 1 5 1 +h 2 c 2 s 2 +n d Formula (3)

[0110] In the scheduling-free transmission, since the second node does not know which first nodes are currently connected and transmitting data, the second node can detect the active first nodes through the extended sequence, and then perform channel equalization and subsequent data separation and demodulation. The second node can use the extended sequence set C to receive the data symbol y of multiple first nodes. d Perform active first node detection. Then the estimated value of the data symbol can be expressed as

[0111]

[0112] In the embodiment of the present disclosure, the decorrelation algorithm is taken as an example. If the decorrelation algorithm is adopted, Then there is Other receiving algorithms may also be used, such as minimum mean squared error (MMSE) equalization, maximum likelihood (ML) algorithm, zero force (ZF) algorithm, etc. Then the second node Perform equalization demodulation and decoding to complete the detection of multiple first nodes.

[0113] However, when the first node modulates the data symbol to be sent onto the carrier signal with an OOK waveform for transmission, the data symbols superimposed by the first nodes received by the second node are expressed as

[0114]

[0115] Among them, s uis the data symbol after BPSK modulation. It can be seen that due to the OOK waveform, the originally orthogonal extension codes in each first node are no longer orthogonal, making it difficult for the receiving end to demodulate and recover the data. For example, two first nodes simultaneously transmit data using non-collision extension sequences. First node 1 and first node 2 select different extension sequences c1 and c2, then the above formula (2) can be written as

[0116]

[0117] Then, the estimated symbol of the data symbol obtained by the second node can be expressed as

[0118]

[0119] as well as

[0120]

[0121] It can be seen that due to the OOK waveform, the originally orthogonal extended sequences in each first node are no longer orthogonal, and the second node introduces interference terms of the data symbols of other first nodes into the data symbol estimation of each first node, which are respectively and Therefore, compared with the estimated symbols under the BPSK waveform, the estimated symbols at this time have a lower signal to interference noise ratio, which further reduces the performance of subsequent equalization demodulation and decoding, and ultimately causes the deterioration of multiple access performance.

[0122] In view of the above problems, the present disclosure proposes a data transmission method in combination with a pilot sequence. Under this method, the base station can use the characteristics of the pilot sequence to perform channel estimation, and pre-process the aliased data symbols based on the channel estimation result to restore the orthogonality (or, cross-correlation) of the extended sequence in the data symbols, thereby ensuring the performance of multiple access based on the OOK waveform.

[0123] Similarly, since multiple first nodes are allowed to perform data transmission in the same time-frequency resource, the pilot sequences of multiple first nodes superimposed and received by the second node can be expressed as

[0124]

[0125] Among them, p u represents the pilot sequence sent by the first node u, that is, the extended sequence determined by the first node u from the pilot sequence set P according to a preset method or configured according to signaling or randomly selected. p represents the pilot sequence of U first nodes superimposed and received by the second node, n p represents additive white Gaussian noise (AWGN).

[0126] Then, the second node performs channel estimation based on the pilot sequence. Assuming that the second node obtains the ideal channel estimation results of each first node based on the pilot sequence, it uses it to estimate the received data y d The process of preprocessing so that the extended sequences of each first node become orthogonal is as follows:

[0127]

[0128] Still taking the case that two first nodes simultaneously transmit data with non-collision extended sequences, and first node 1 and first node 2 select different extended sequences c1 and c2, the second node receives the data y based on the preprocessed data d The estimated symbol of the data symbol obtained by ′ can be expressed as

[0129]

[0130] as well as

[0131]

[0132] It can be seen that the signal to noise ratio of the current estimated symbol is improved, which can improve the performance of subsequent equalization demodulation and decoding, thereby improving the multiple access performance under the OOK waveform.

[0133] In a specific embodiment, the data transmission method proposed in the present disclosure is described by taking two first nodes as an example. It should be understood that on the same time-frequency resources, the present disclosure does not limit the number of first nodes that perform data transmission at the same time, nor does it limit the number of pilots that collide. For example, K (K is greater than or equal to 2) first nodes perform data transmission simultaneously on the same time-frequency resources, wherein the pilots of at least 2 first nodes collide, and the pilots of the remaining first nodes do not collide. For another example, the pilots of the first node 1 and the first node 2 collide, and the pilots of the first node 3 to the first node K do not collide with each other. For another example, the pilots of the first node 1 and the first node 2 collide, the pilots of the first node 3 and the first node 4 collide, and the pilots of the first node 5 to the first node K do not collide. For another example, the pilots of the first node 1, the first node 2 and the first node 3 collide, and the pilots of the first node 4 to the first node K do not collide with each other.

[0134] Embodiment 1

[0135] In this embodiment, the pilot sequence set has the following characteristics: the autocorrelation of each pilot sequence is normalized to 1; and each pilot sequence is orthogonal to each other. That is, for the pilot sequence set P known to both the transmitting and receiving ends, P = [p 1 , p 2 , ..., p |P| ] t , and for any 1≤i, j≤|P| and i≠j, we have Where |P| represents the size of the pilot sequence set P; [·] t Represents the transposition of a sequence.

[0136] For example, taking the pilot sequence length as 3 as an example, the pilot sequence set in this embodiment can be

[0137] For example, taking the pilot sequence length as 4 as an example, the pilot sequence set in this embodiment can be

[0138] Certainly.

[0139] For example, taking the pilot sequence length as 5 as an example, the pilot sequence set in this embodiment can be

[0140] Exemplarily, taking the pilot sequence length of 6 as an example, the pilot sequence set in this embodiment can be

[0141]

[0142] It can also be

[0143]

[0144] It can also be

[0145]

[0146] It can also be

[0147]

[0148] It can also be

[0149]

[0150] It can also be

[0151]

[0152] It can also be

[0153]

[0154] The embodiments of the present disclosure are not limited to this.

[0155] In this embodiment, the first node selects a pilot sequence from a pilot sequence set according to signaling configuration or according to a preset manner or randomly, and sends it together with the data symbol to be sent.

[0156] Specifically, when there is service data to be sent, the first node performs channel coding, waveform coding, modulation, and extension code coding on the service data to form data symbols to be sent, and then maps the pilot sequence and the data symbols to be sent to the transmission resource for sending.

[0157] In this embodiment, the second node receives a symbol sequence superimposed by multiple first nodes, the symbol sequence including pilot symbols and data symbols. Furthermore, the second node performs channel estimation based on the pilot symbols.

[0158] In one example, there is no pilot collision between the first node 1 and the first node 2. Then the pilot symbols of multiple first nodes superimposed and received by the second node can be expressed as

[0159] y p =h 1 p 1 +h 2 p 2 +n p

[0160] Then, the channel estimation of the second node based on the pilot symbol is

[0161]

[0162] By setting a suitable threshold, an effective channel estimation can be obtained as as well as Therefore, the preprocessing of the above formula (8) under this actual channel estimation is

[0163]

[0164] in, Then, the second node receives the preprocessed data y d The process of estimating the data symbol obtained by ′ is as described above and will not be repeated here.

[0165] In another example, a pilot collision occurs between the first node 1 and the first node 2. Then the pilot symbols of multiple first nodes superimposed and received by the second node can be expressed as

[0166] y p =h 1 p 1 +h 2 p 1 +n p

[0167] Then, the channel estimation of the second node based on the pilot symbol is

[0168]

[0169] By setting appropriate thresholds, effective channel estimates can be obtained as Therefore, the preprocessing of the above formula (8) under this actual channel estimation is

[0170]

[0171] in, Then, the second node receives the preprocessed data y d The process of estimating the data symbol obtained by ′ is as described above and will not be repeated here.

[0172] Embodiment 2

[0173] The characteristics of the pilot sequence set in the aforementioned first embodiment include: the autocorrelation of each pilot sequence is normalized to 1; and the pilot sequences are mutually orthogonal.

[0174] In this embodiment, the pilot sequence set has the following characteristics: the autocorrelation of each pilot sequence is normalized to 1; and the mutual correlations between pilot sequences are the same. That is, for the pilot sequence set P = [p 1 , p 2 , ..., p |P| ] t , and for any 1≤i, j≤|P| and i≠j, we have Where |P| represents the size of the pilot sequence set P; [·] t Indicates sequence transposition; 0<a<1.

[0175] Exemplarily, taking the pilot sequence length of 3 as an example, the pilot sequence set in this embodiment can be at this time It can also be at this time It can also be at this time The embodiments of the present disclosure are not limited to this.

[0176] Exemplarily, taking the pilot sequence length as 4 as an example, the pilot sequence set in this embodiment can be at this time It can also be at this time It can also be at this time The embodiments of the present disclosure are not limited to this.

[0177] Exemplarily, taking the pilot sequence length of 5 as an example, the pilot sequence set in this embodiment can be

[0178] At this time, a=3 / 4;

[0179] It can also be At this time, a=2 / 3;

[0180] It can also be at this time

[0181] It can also be At this time, a=3 / 4;

[0182] It can also be At this time, a=2 / 3;

[0183] It can also be at this time

[0184] It can also be at this time The embodiments of the present disclosure are not limited to this.

[0185] Exemplarily, taking the pilot sequence length of 6 as an example, the pilot sequence set in this embodiment can be At this time, a=4 / 5;

[0186] It can also be At this time, a=3 / 4;

[0187] It can also be at this time

[0188] It can also be At this time, a=2 / 3;

[0189] It can also be At this time, a = 1 / 3;

[0190] It can also be At this time, a=1 / 2. This embodiment of the present disclosure does not limit this.

[0191] In this embodiment, the second node receives a symbol sequence superimposed by multiple first nodes, and the symbol sequence includes a pilot symbol and a data symbol. Then, the second node performs channel estimation based on the pilot symbol. The signal estimation based on the pilot symbol in this embodiment is a sum estimation of the effective channel, specifically:

[0192]

[0193] Among them, the channel estimates in the set M are satisfy |M| represents the size of the set M, and b is a threshold used to determine whether it is a valid channel estimate.

[0194] In one example, there is no pilot collision between the first node 1 and the first node 2. Then the pilot symbols of multiple first nodes superimposed and received by the second node can be expressed as

[0195] y p =h 1 p 1 +h 2 p 2 +n p

[0196] Then, the channel estimation of the base station based on the pilot symbol is

[0197]

[0198] By setting a suitable threshold b, we can obtain a valid channel estimation set and And |M|=2. Further, the effective channel estimate is

[0199] Therefore, the preprocessing of formula (8) under this actual channel estimation is

[0200]

[0201] in, Then, the second node receives the preprocessed data y d The process of estimating the data symbol obtained by ′ is as described above and will not be repeated here.

[0202] In another example, a pilot collision occurs between the first node 1 and the first node 2. Then the pilot symbols of multiple first nodes superimposed and received by the second node can be expressed as

[0203] y p =h 1 p 1 +h 2 p 1 +n p

[0204] Then, the channel estimation of the second node based on the pilot symbol is

[0205]

[0206] By setting a suitable threshold b, we can obtain a valid channel estimation set and

[0207] Open and And |M|=1. Further, the effective channel estimate is

[0208] Therefore, the preprocessing of the above formula (8) under this actual channel estimation is

[0209]

[0210] in, Furthermore, the process of estimating the data symbol obtained by the second node based on the preprocessed received data yd′ is as described above and will not be repeated here.

[0211] Embodiment 3

[0212] This embodiment is different from the previous embodiment in that the pilot sequence set has different characteristics.

[0213] In this embodiment, the pilot sequence set has the following characteristics: the number of non-zero elements of each pilot sequence is the same. That is, for the pilot sequence set P known to both the transmitting and receiving ends, P = [p 1 , p 2 , ..., p |P| ] t , and for any 1≤i, j≤|P| and i≠j, there is |p i | 0 =|p j | 0 =l, where |P| represents the size of the pilot sequence set P, |·| 0 It represents the L0 norm, that is, the number of non-zero elements in the sequence, where l is an integer.

[0214] Exemplarily, taking the pilot sequence length of 3 as an example, the pilot sequence set in this embodiment can be At this time, 1=1; it can also be At this time, l=2. This embodiment of the present disclosure does not limit this.

[0215] Exemplarily, taking the pilot sequence length as 4 as an example, the pilot sequence set in this embodiment can be At this time l = 3;

[0216] It can also be At this time l = 2;

[0217] It can also be At this time, l=1. This embodiment of the present disclosure does not limit this.

[0218] Exemplarily, taking the pilot sequence length of 5 as an example, the pilot sequence set in this embodiment can be At this time l = 1;

[0219] It can also be At this time l = 2;

[0220] It can also be At this time l = 3;

[0221] It can also be At this time, l=4. This embodiment of the present disclosure does not limit this.

[0222] Exemplarily, taking the pilot sequence length of 5 as an example, the pilot sequence set in this embodiment can be At this time l = 1;

[0223] It can also be At this time l = 2; it can also be At this time l = 3;

[0224] It can also be At this time l = 4;

[0225] It can also be At this time, l=5. This embodiment of the present disclosure does not limit this.

[0226] In this embodiment, the second node receives a symbol sequence superimposed by multiple first nodes, and the symbol sequence includes a pilot symbol and a data symbol. Then, the second node performs channel estimation based on the pilot symbol. The signal estimation based on the pilot symbol in this embodiment is a sum estimation of the effective channel, specifically:

[0227]

[0228] Wherein, L represents the length of the pilot sequence, l represents the number of non-zero elements in the pilot sequence; Represents the received pilot symbol y p The ith element of .

[0229] In one example, the length of each pilot sequence in the pilot sequence set P is L, and the number of non-zero elements in each pilot sequence is 1. No pilot collision occurs between the first node 1 and the first node 2. Then the pilot symbol superimposed by multiple first nodes received by the second node can be expressed as

[0230] y p =h 1 p 1 +h 2 p 2 +n p

[0231] but, L The element-by-element sum of the received pilot symbol sequence is

[0232]

[0233] Thus, the second node determines the sum of the received pilot symbols and the channel estimate as

[0234]

[0235] Therefore, the preprocessing of the above formula (8) under this actual channel estimation is

[0236]

[0237] in, Then, the second node receives the preprocessed data y d The process of estimating the data symbol obtained by ′ is as described above and will not be repeated here.

[0238] In another example, a pilot collision occurs between the first node 1 and the first node 2. Then the pilot symbols of multiple first nodes superimposed and received by the second node can be expressed as

[0239] y p =h 1 p 1 +h 2 p 1 +n p

[0240] Then, the element-by-element sum of the received pilot symbol sequence is

[0241]

[0242] Thus, the second node determines the sum channel estimate based on the received pilot symbol as

[0243]

[0244] Therefore, the preprocessing of the above formula (8) under this actual channel estimation is

[0245]

[0246] in, Then, the second node receives the preprocessed data y d The process of estimating the data symbol obtained by ′ is as described above and will not be repeated here.

[0247] The disclosed embodiment provides a data transmission method, in which a first node jointly sends a pilot sequence and a symbol sequence so that a second node can perform channel estimation based on the pilot symbol, and pre-processes the received data symbols based on the channel estimation result, thereby ensuring the orthogonality or cross-correlation of the extended sequence in the received data symbols, so that the second node can correctly separate and parse the data transmitted by each first node from the received symbol sequence, thereby improving the performance of code division multiple access.

[0248] It is understandable that, in order to implement the above functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments of the present disclosure, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present disclosure.

[0249] The embodiments of the present disclosure may divide the functional modules of the communication device according to the above method embodiments. For example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one functional module. The above integrated modules may be implemented in the form of hardware or software. It should be noted that the division of modules in the embodiments of the present disclosure is schematic and is only a logical function division. There may be other division methods in actual implementation. The following is an example of dividing each functional module corresponding to each function.

[0250] Figure 4 is a schematic diagram of the structure of a communication device provided by an embodiment of the present disclosure, and the communication device can execute the data transmission method provided by the above method embodiment. Figure 4 As shown, the communication device includes an acquisition module 401, a generation module 402 and a sending module 403.

[0251] The acquisition module 401 is used to acquire a first pilot sequence;

[0252] The generating module 402 is used to generate a first data symbol, where the first data symbol is obtained by encoding and modulating the first data to be transmitted using a spread sequence;

[0253] The sending module 403 is used to send a first symbol sequence, where the first symbol sequence consists of a first pilot sequence and a first data symbol.

[0254] In some embodiments, the acquisition module 401 is specifically configured to select a first pilot sequence from a pilot sequence set; wherein the pilot sequence set includes mutually orthogonal pilot sequences and / or pilot sequences with mutual correlation.

[0255] In some embodiments, selecting the first pilot sequence from the pilot sequence set includes at least one of the following methods: selecting the first pilot sequence from the pilot sequence set according to signaling; randomly selecting the first pilot sequence from the pilot sequence set; selecting the first pilot sequence from the pilot sequence set according to a pre-setting.

[0256] In some embodiments, the pilot sequences in the pilot sequence set satisfy at least one of the following: the autocorrelation of each pilot sequence is normalized to 1; the pilot sequences are mutually orthogonal; the mutual correlations between the pilot sequences are the same; and the number of non-zero elements in each pilot sequence is the same.

[0257] In some embodiments, the apparatus further includes: a determination module 404. The determination module 404 is configured to determine the pilot sequence set according to the signaling; and / or determine the pilot sequence set according to a preset setting.

[0258] In some embodiments, the encoding process includes at least one of: channel encoding; waveform encoding; spreading code encoding.

[0259] In some embodiments, the acquisition module 401 is further used to acquire the extended sequence based on at least one of the following methods: selecting an extended sequence from an extended sequence set according to signaling; randomly selecting an extended sequence from an extended sequence set; selecting an extended sequence from an extended sequence set according to a preset setting.

[0260] In some embodiments, the determination module 404 is further configured to determine the extended sequence set according to signaling; and / or determine the extended sequence set according to a preset setting.

[0261] In some embodiments, the first data includes at least one of the following: service data; node identification; first pilot sequence information; and extended sequence information.

[0262] Figure 5 is a schematic diagram of the structure of another communication device provided by an embodiment of the present disclosure, and the communication device can execute the data transmission method provided by the above method embodiment. Figure 5 As shown, the communication device includes a receiving module 501 and a processing module 502 .

[0263] The receiving module 501 is used to receive a second symbol sequence, where the second symbol sequence consists of a second pilot sequence and a second data symbol; the second symbol sequence includes a first symbol sequence sent by at least one first node;

[0264] The processing module 502 is used to pre-process the second data symbol based on the channel estimation result to obtain a third data symbol; the channel estimation result is obtained by performing channel estimation based on the second pilot sequence and the pilot sequence set;

[0265] The processing module 502 is further configured to parse the third data symbol to obtain first data of at least one first node.

[0266] In some embodiments, the processing module 502 is specifically configured to subtract the second data symbol from the channel estimation result to obtain a third data symbol.

[0267] In some embodiments, the parsing process includes at least one of: detecting and separating the third data symbol based on the spread sequence set; channel estimation; channel equalization; demodulation; and decoding.

[0268] In some embodiments, the processing module 502 is also used to process the first data of at least one first node to obtain the first data symbol of at least one first node; eliminate the first data symbol of at least one first node from the third data symbol; and parse the eliminated third data symbol to obtain the first data of other first nodes.

[0269] In some embodiments, the processing module 502 is also used to process the first data of at least one first node to obtain a first symbol sequence of at least one first node; eliminate the first symbol sequence of at least one first node from the second symbol sequence; and preprocess and parse the eliminated second symbol sequence to obtain first data of other first nodes.

[0270] In some embodiments, the first data includes at least one of the following: service data; node identification; first pilot sequence information; and extended sequence information.

[0271] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, the embodiments of the present disclosure provide another possible structure of the communication device involved in the above-mentioned embodiments. Figure 6 As shown, the communication device 60 includes: a processor 602 and a bus 604. Optionally, the communication device may further include a memory 601; optionally, the communication device may further include a communication interface 603.

[0272] The processor 602 may be a processor that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present disclosure. The processor 602 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of the present disclosure. The processor 602 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0273] The communication interface 603 is used to connect with other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0274] The memory 601 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0275] As a possible implementation, the memory 601 may exist independently of the processor 602, and the memory 601 may be connected to the processor 602 via a bus 604 to store instructions or program codes. When the processor 602 calls and executes the instructions or program codes stored in the memory 601, the method provided in the embodiment of the present disclosure can be implemented.

[0276] In another possible implementation, the memory 601 may also be integrated with the processor 602 .

[0277] The bus 604 may be an extended industry standard architecture (EISA) bus, etc. The bus 604 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 6 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0278] In some embodiments, executable instructions are stored in the memory 601. When the processor 602 executes the executable instructions, the communication device executes the method described in any of the above embodiments.

[0279] Some embodiments of the present disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium) having computer program instructions stored therein. When the computer program instructions are executed on a computer, the computer executes a method as described in any of the above embodiments.

[0280] Exemplarily, the above-mentioned computer-readable storage media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks or magnetic tapes, etc.), optical disks (e.g., compact disks (CD), digital versatile disks (DVD), etc.), smart cards and flash memory devices (e.g., erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.). The various computer-readable storage media described in the present disclosure may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing and / or carrying instructions and / or data.

[0281] An embodiment of the present disclosure provides a computer program product including instructions. When the computer program product is run on a computer, the computer is enabled to execute the method described in any one of the above embodiments.

[0282] The above is only a specific implementation of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present disclosure should be included in the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be based on the protection scope of the claims.

Claims

1. A data transmission method, characterized in that: Applied to the first node, the method comprises: Acquire a first pilot sequence; Generate a first data symbol, where the first data symbol is obtained by encoding and modulating first data to be transmitted using a spread sequence; A first symbol sequence is sent, where the first symbol sequence consists of the first pilot sequence and the first data symbol.

2. The method according to claim 1, characterized in that The acquiring of the first pilot sequence comprises: Selecting the first pilot sequence from a set of pilot sequences; The pilot sequence set includes mutually orthogonal pilot sequences and / or pilot sequences with mutual correlation.

3. The method according to claim 2, characterized in that The selecting the first pilot sequence from the pilot sequence set includes at least one of the following methods: Selecting the first pilot sequence from the pilot sequence set according to signaling; Randomly selecting the first pilot sequence from the pilot sequence set; The first pilot sequence is selected from the pilot sequence set according to a preset setting.

4. The method according to claim 2, characterized in that: The pilot sequence in the pilot sequence set satisfies at least one of the following: The autocorrelation of each pilot sequence is normalized to 1; The pilot sequences are mutually orthogonal; The cross-correlations between the pilot sequences are the same; The number of non-zero elements in each pilot sequence is the same.

5. The method according to claim 2, characterized in that: The method further comprises: Determine the pilot sequence set according to signaling; and / or, The pilot sequence set is determined according to a preset setting.

6. The method according to claim 1, characterized in that The encoding process includes at least one of the following: Channel coding; Waveform coding; Extension code encoding.

7. The method according to claim 1, characterized in that The method further comprises: The extended sequence is obtained based on at least one of the following methods: Selecting the extended sequence from an extended sequence set according to signaling; Randomly selecting the extended sequence from a set of extended sequences; The spreading sequence is selected from a spreading sequence set according to a preset setting.

8. The method according to claim 7, characterized in that The method further comprises: Determine the extended sequence set according to signaling; and / or, The extended sequence set is determined according to a preset setting.

9. The method according to claim 1, characterized in that: The first data includes at least one of the following: Business data; Node ID; First pilot sequence information; Extended sequence information.

10. A data transmission method, characterized in that: Applied to the second node, the method comprises: receiving a second symbol sequence, wherein the second symbol sequence is composed of a second pilot sequence and a second data symbol; the second symbol sequence includes a first symbol sequence sent by at least one first node; Preprocessing the second data symbol based on a channel estimation result to obtain a third data symbol; the channel estimation result is obtained by performing channel estimation based on the second pilot sequence and a pilot sequence set; The third data symbol is parsed to obtain first data of at least one of the first nodes.

11. The method according to claim 10, characterized in that The preprocessing the second data symbol based on the channel estimation result to obtain a third data symbol includes: The second data symbol is subtracted from the channel estimation result to obtain the third data symbol.

12. The method according to claim 10, characterized in that The analysis process includes at least one of the following: Detecting and separating the third data symbol based on the spread sequence set; Channel estimation; Channel equalization; demodulation; Decoding.

13. The method according to claim 10, characterized in that The method further comprises: Processing first data of at least one of the first nodes to obtain at least one first data symbol of the first node; Eliminate the first data symbol of the at least one first node from the third data symbol; The eliminated third data symbol is parsed to obtain the first data of other first nodes.

14. The method according to claim 10, characterized in that The method further comprises: Processing first data of at least one of the first nodes to obtain a first symbol sequence of at least one of the first nodes; Eliminate the first symbol sequence of the at least one first node from the second symbol sequence; The eliminated second symbol sequence is preprocessed and parsed to obtain first data of other first nodes.

15. The method according to claim 10, characterized in that The first data includes at least one of the following: Business data; Node ID; First pilot sequence information; Extended sequence information.

16. A communication device, characterized in that: include: a processor and a memory for storing instructions executable by the processor; The processor is configured to execute the instruction so that the communication device performs the data transmission method according to any one of claims 1 to 15.

17. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on the communication device, the communication device executes the data transmission method according to any one of claims 1 to 15.

18. A computer program product, characterized in that The computer program product comprises computer instructions, and when the computer instructions are executed on a computer, the computer is caused to execute the data transmission method according to any one of claims 1 to 15.

Images