Wireless cooperative signal transmission method and system based on robust exponential soliton distribution

Abstract

The invention discloses a wireless cooperative signal transmission method and system based on robust index soliton distribution, and the method comprises the steps: a main node transmitting end obtains a digital signal, carries out the coding of the digital signal based on the robust index soliton distribution, so as to obtain an output sequence after the coding of robust index solitons, and the main node transmitting end carries out the coding of the robust index solitons based on a hash function; generating a transmission symbol sequence according to the output sequence after robust index soliton coding, converting the transmission symbol sequence into a sending signal by the master node sending end, receiving the sending signal by the channel and performing power amplification on the sending signal to obtain a radio frequency signal, receiving the radio frequency signal by the slave node receiving end through the channel, and sending the radio frequency signal to the slave node receiving end. The slave node receiving end demodulates the radio frequency signal to obtain demodulated information, the slave node receiving end decodes the demodulated information to obtain a decoded information sequence, and the slave node receiving end performs robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence. And ensuring information transmission through robust exponential soliton distribution.

Description

Technical Field

[0001] The present application relates to the technical field of wireless cooperative networking, and specifically to a wireless cooperative signal transmission method and system based on robust exponential soliton distribution. Background Art

[0002] Ensuring faster, more reliable, and more stable signal transmission between nodes in wireless ad hoc networks is a key goal of wireless ad hoc communication technology. While cooperative communication technology can improve the system's ability to resist interference, it can be difficult to guarantee inter-node communication quality in complex wireless environments, such as those characterized by multipath, fading, and interference. Furthermore, the coordinated transmission of multiple nodes in a cooperative communication system can introduce additional transmission errors or noise accumulation, limiting the quality and stability of inter-node signal communication. Summary of the Invention

[0003] In order to solve the above technical problems, the present application is proposed. The embodiments of the present application provide a wireless cooperative signal transmission method and system based on robust exponential soliton distribution, which solves the problem of data not being able to be transmitted quickly and securely during cooperative communication in wireless ad hoc networks.

[0004] According to one aspect of the present application, a wireless cooperative signal transmission method based on robust exponential soliton distribution is provided, comprising:

[0005] The master node transmitting end obtains a digital signal and encodes the digital signal based on a robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding;

[0006] The master node transmitter generates a transmission symbol sequence based on a hash function and an output sequence after the robust exponential soliton coding;

[0007] The master node transmitting end converts the transmission symbol sequence into a transmission signal;

[0008] The channel receives the transmission signal and performs power amplification on the transmission signal to obtain a radio frequency signal;

[0009] receiving the radio frequency signal from a receiving node through a channel;

[0010] Demodulating the radio frequency signal from the receiving end of the node to obtain demodulated information;

[0011] Decoding the demodulated information from the receiving node to obtain a decoded information sequence;

[0012] The slave node receiving end performs robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence.

[0013] In one embodiment, generating a transmission symbol sequence based on a hash function and an output sequence after robust exponential soliton coding includes:

[0014] Dividing the output sequence after the robust exponential soliton coding into a plurality of groups based on the number of bits in each group and the length of each group; wherein each group corresponds to a sequence block;

[0015] generating a state value of the group based on a hash function according to a sequence block corresponding to the group and a state value of a previous group of the group, so as to obtain a plurality of state values;

[0016] The plurality of state values are hashed into a transmission symbol sequence based on a RNG.

[0017] In one embodiment, encoding the digital signal based on the robust exponential soliton distribution to obtain a robust exponential soliton-encoded output sequence includes:

[0018] Determine the degree based on the degree distribution function of the robust exponential soliton distribution;

[0019] Selecting target information that meets the degree from the digital signal;

[0020] A modulo-2 sum operation is performed on the target information to obtain an output sequence after robust exponential soliton coding.

[0021] In one embodiment, the calculation formula of the degree distribution function of the robust exponential soliton distribution includes:

[0022] ;in, is the binary exponential degree distribution function, is the robust soliton degree distribution function, represents the scaling coefficient of the binary exponential degree distribution function, The proportional coefficient representing the robust soliton degree distribution function is the weighted sum of the binary exponential degree distribution function and the robust soliton degree distribution function, K is the length of the digital signal, and d represents the degree.

[0023] In one embodiment, the calculation formula of the binary exponential distribution function includes:

[0024] , where d represents the degree and K is the length of the digital signal.

[0025] In one embodiment, the calculation formula of the robust soliton degree distribution function includes:

[0026] ,in, is the soliton degree distribution function, The soliton distribution under ideal conditions is: ;

[0027] Among them, the calculation formula of the soliton degree distribution function is:

[0028] , Indicates the average value of the output symbol node degree 1, represents the failure probability of the soliton degree distribution function, and c is a free variable less than 1.

[0029] In one embodiment, decoding the demodulated information to obtain a decoded information sequence includes:

[0030] Obtaining a decoding tree; wherein the decoding tree includes multiple paths;

[0031] Calculating a path distance metric value between the demodulated information and each path;

[0032] Expanding the root node of the decoding tree to the next level to obtain child nodes;

[0033] Push the child node into stack SS and delete the root node; wherein stack SS represents the next level search stack;

[0034] Sort the nodes in the pushed stack SS in ascending order according to the path distance metric;

[0035] Determine whether the top node of the sorted stack is a leaf node;

[0036] If the sorted top node is a leaf node, the source information corresponding to the top node is obtained; wherein the decoded information sequence includes the source information corresponding to the top node.

[0037] In one embodiment, obtaining the information source information corresponding to the top node of the stack includes:

[0038] Transferring a preset number of sorted top nodes in stack SS to stack SR to obtain a transferred stack SR; wherein the stack SR stores the root node of the initial decoding tree, and stack SR represents the current search stack;

[0039] Expanding the nodes in the transferred stack SR and transferring the expanded nodes to the stack SS;

[0040] Obtain the source information corresponding to the top node in the stack SS.

[0041] In one embodiment, performing robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence includes:

[0042] Determining a target check node from a plurality of check nodes; wherein the target check node is connected to only one target input symbol in the decoded information sequence;

[0043] Obtaining a value corresponding to the target input symbol;

[0044] Determining other check nodes connected to the target input symbol;

[0045] Based on the determined target check node and the value corresponding to the target input symbol, the value of the input symbol connected to the other check nodes is determined; wherein the decoded sequence includes the value of the target input symbol and the value of the input symbol connected to the other check nodes.

[0046] According to another aspect of the present invention, a wireless cooperative signal transmission system based on robust exponential soliton distribution is provided, comprising:

[0047] The master node transmitting end is configured to obtain a digital signal and encode the digital signal based on a robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding; generate a transmission symbol sequence based on the output sequence after robust exponential soliton encoding based on a hash function; and convert the transmission symbol sequence into a transmission signal;

[0048] a channel for receiving the transmission signal and performing power amplification on the transmission signal to obtain a radio frequency signal;

[0049] The slave node receiving end is used to receive the radio frequency signal through a channel; demodulate the radio frequency signal to obtain demodulated information; decode the demodulated information to obtain a decoded information sequence; and perform robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence.

[0050] The present application provides a wireless cooperative signal transmission method and system based on robust exponential soliton distribution, including: a master node transmitting end obtains a digital signal and encodes the digital signal based on robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding; the master node transmitting end generates a transmission symbol sequence based on the output sequence after robust exponential soliton encoding based on a hash function; the master node transmitting end converts the transmission symbol sequence into a transmission signal; a channel receives the transmission signal and power amplifies the transmission signal to obtain a radio frequency signal; a slave node receiving end receives the radio frequency signal through a channel; the slave node receiving end demodulates the radio frequency signal to obtain demodulated information; the slave node receiving end decodes the demodulated information to obtain a decoded information sequence; and the slave node receiving end performs robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence. The master node transmitter performs robust exponential soliton coding and Spinal coding, and after QAM modulation, the generated symbols are RF modulated and transmitted. The transmitted signal reaches each slave node after being transmitted through different channels. The slave node receiver converts the RF signal into a baseband signal, and performs Spinal decoding and robust exponential soliton decoding after QAM demodulation. Through robust exponential soliton distribution and Spinal coding, high-speed signal transmission can be guaranteed under conditions close to the channel capacity. In addition, the technical solution of the present application can greatly improve the transmission stability of wireless cooperative signals on the basis of ensuring reliable transmission of wireless cooperative signals under low signal-to-noise ratio conditions. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] The above and other purposes, features, and advantages of the present application will become more apparent through a more detailed description of the embodiments of the present application in conjunction with the accompanying drawings. The accompanying drawings are intended to provide a further understanding of the embodiments of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the present application and do not constitute a limitation of the present application. In the drawings, the same reference numerals generally represent the same components or steps.

[0052] Figure 1 It is a flowchart of a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by an exemplary embodiment of the present application.

[0053] Figure 2 It is a flowchart of a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by another exemplary embodiment of the present application.

[0054] Figure 3 This is a schematic diagram of the BER performance results of slave node robust exponential soliton coding and Spinal coding in a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by an exemplary embodiment of the present application.

[0055] Figure 4This is a schematic diagram of the BER performance results of different slave nodes in a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by an exemplary embodiment of the present application.

[0056] Figure 5 It is a structural diagram of a wireless cooperative signal transmission system based on robust exponential soliton distribution provided by an exemplary embodiment of the present application.

[0057] Figure 6 It is a structural diagram of an electronic device provided by an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0058] Below, the exemplary embodiments according to the present application will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application, and it should be understood that the present application is not limited to the exemplary embodiments described herein.

[0059] Figure 1 It is a flowchart of a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by an exemplary embodiment of the present application. Figure 2 FIG is a flow chart of a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by another exemplary embodiment of the present application. Figure 1-2 As shown, the wireless cooperative signal transmission method based on robust exponential soliton distribution includes:

[0060] Step 110: The master node transmitter obtains a digital signal and encodes the digital signal based on the robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding.

[0061] In an embodiment of the present invention, the channels between nodes of a wireless ad hoc network are all Gaussian channels or flat fading channels, whose channel parameters are h and the additional noise is n. The wireless ad hoc network includes one master node and n slave nodes. The master node includes a robust exponential soliton coding module, a Spinal coding module, a QAM modulation module, and a radio frequency transceiver module; the slave node includes a radio frequency transceiver module, a QAM demodulation module, a Spinal decoding module, and a robust exponential soliton decoding module.

[0062] The robust exponential soliton encoding module acquires a digital signal and encodes it based on the robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding. The robust exponential soliton encoding module generates a coding sequence storage space to store the output sequence after robust exponential soliton encoding and the digital signal.

[0063] The digital signal in this application is denoted as u, and its length is K, and the length of the output sequence after robust exponential soliton coding is N. This application uses robust exponential soliton coding to ensure that the coding sequence is short and consumes less storage space.

[0064] Step 120: The master node transmitter generates a transmission symbol sequence based on a hash function and the output sequence after the robust exponential soliton coding.

[0065] In the embodiment of the present application, while slightly increasing the coding complexity, Spinal coding can effectively improve the error correction capability of robust exponential soliton coding introduced by different channels between communication nodes in a wireless cooperative network, thereby improving the reliability of data transmission from nodes under different channel conditions. Step 120 may include the following steps:

[0066] Step 121: Divide the output sequence after the robust exponential soliton coding into multiple groups based on the number of bits in each group and the length of each group, wherein each group corresponds to a sequence block.

[0067] In the embodiment of the present invention, the output sequence after robust exponential soliton coding is recorded as m, and its length is N. The output sequence m after robust exponential soliton coding is grouped, and the length of each group is set to , each group bits, then the output sequence m can be divided into . Each sequence is recorded as ,in, , is a sequence block, .

[0068] Preferably, the number of bits is 6.

[0069] Step 122: Based on a hash function, a state value of the group is generated according to the sequence block corresponding to the group and the state value of the previous group of the group to obtain multiple state values.

[0070] In the embodiment of the present application, each group corresponds to a Spine value (state value). Input into the hash function to generate a string of binary bits, the operation is as follows: , As the spine value of the next group. Start again to divide the output sequence of the robust exponential soliton coding into multiple groups based on the number of bits in each group and the length of each group; each group corresponds to a sequence block. Until the state value of each group is calculated, finally get Spine value.

[0071] Among them, the hash function, that is, the hash function (Hash Function) is a mathematical function that converts input data of any length (such as a string, file, etc.) into a fixed-length output (called a hash value).

[0072] Step 123: Based on the RNG, hash the multiple state values into a transmission symbol sequence.

[0073] In the embodiment of the present invention, according to different channel states, The Spine value is mapped into a channel transmission symbol through RNG , The length of the composition is The transmission symbol sequence (usually called pass or code block) is completed at this time.

[0074] Among them, RNG refers to the "Random Number Generator". RNG is a The bit state seed sequence is converted to a pseudo-random sequence of transmitted symbols as a function of:

[0075] ,in, Indicates length, Number of bits.

[0076] Table 1 Pass value generated after RNG hashing

[0077]

[0078] Step 130: The master node transmitter converts the transmission symbol sequence into a transmission signal.

[0079] In the embodiment of the present invention, the transmission symbol sequence Perform QAM modulation. For the lth Pass, the Spinal code outputs the i-th ( The specific steps of transmitting symbols through a channel include:

[0080] Step 131: Convert the channel transmission sequence into a binary bit sequence.

[0081] In the embodiment of the present application, the channel transmission sequence Expressed as .

[0082] Step 132: Map the binary bit sequence into transmission symbols based on the modulation mapping function.

[0083] In the embodiment of the present application, the binary bit sequence Mapping to transmission symbols , and then pass the transmission symbol sequence into the RF transceiver module.

[0084] Specifically, quadrature amplitude modulation (QAM) is a joint amplitude and phase keying, and a code element of this signal can be expressed as:

[0085] ,in, is the symbol output after QAM modulation, They are For the BSC channel, the role of constellation mapping is very small, so: , which is equivalent to Each bit in can be regarded as a , can be sent directly to the receiver. For AWGN channels (with or without fading), the encoding module needs to generate I and Q under the average power constraint. In this case, the constellation mapping function uses two separate RNGs. The bit output generates I and Q.

[0086] Table 2 QAM mapping symbols

[0087]

[0088] Step 133: Perform digital-to-analog conversion on the transmission symbol to convert it into an analog signal.

[0089] In the embodiment of the present application, the transmission symbol is recorded as , the analog signal is recorded as .

[0090] Step 134: Mix the analog signal with an intermediate frequency signal generated by a local oscillator to convert the analog signal into an intermediate frequency signal.

[0091] Step 135: Mix the intermediate frequency signal with the radio frequency signal generated by the local oscillator to convert the intermediate frequency signal into a signal near the radio frequency.

[0092] In the embodiment of the present application, the signal near the radio frequency is denoted as x.

[0093] Step 140: The channel receives the transmission signal and performs power amplification on the transmission signal to obtain a radio frequency signal.

[0094] In an embodiment of the present invention, the power of the radio frequency signal x is amplified to obtain an amplified signal, and then the electromagnetic wave converted from the amplified signal is radiated into the wireless channel through the antenna to obtain a radio frequency signal.

[0095] In the embodiments of this application, ,in, is the electromagnetic wave signal sent through the wireless channel to the i-th slave node, is the channel parameter, is the superimposed noise parameter. The master node transmitter continuously sends transmission symbols into the wireless channel. When all slave node receivers have received a sufficient number of symbols, or when a slave node receiver successfully completes decoding, it sends a command to the encoding module to terminate the encoding and transmission process. Conversely, if the slave node receiver is not yet ready for decoding, the master node transmitter continues to generate additional symbols in a loop until the slave node receiver can successfully decode.

[0096] Step 150: Receive the radio frequency signal from the node receiving end through the channel.

[0097] Step 160: demodulate the radio frequency signal from the receiving end of the node to obtain demodulated information.

[0098] In the embodiment of the present invention, the slave node receiving end receives the electromagnetic wave signal in the wireless channel through the antenna , and Perform low noise amplification; the calculation formula for the signal-to-noise ratio of each slave node is as follows:

[0099] ,in, is the signal power of the i-th slave node receiver, is the noise variance of the ith slave node. The spectrum becomes an intermediate frequency signal , the intermediate frequency signal Converted to baseband signal Each slave node receives the baseband signal Perform QAM demodulation and output demodulated information .

[0100] For example, the receiving end of the node receives the 2.4GHz electromagnetic wave signal in the wireless channel through the antenna , and Perform low noise amplification and amplify the signal The signal is mixed with the 2.2GHz signal generated by the local oscillator to The signal spectrum is moved to around 200MHz and becomes an intermediate frequency signal ,Will Mixed with the 200MHz intermediate frequency signal generated by the local oscillator, Converted to baseband signal , the demodulation module at the slave node receives the symbols sent by the master node through the wireless channel And demodulate and output the demodulated information.

[0101] Step 170: The slave node receiving end decodes the demodulated information to obtain a decoded information sequence.

[0102] Step 180: The slave node receiving end performs robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence.

[0103] In one embodiment, step 110 can be specifically implemented as follows: determining the degree based on the degree distribution function of the robust exponential soliton distribution; selecting target information that meets the degree from the digital signal; and performing a modulo-2 sum operation on the target information to obtain an output sequence after robust exponential soliton encoding.

[0104] In the embodiment of the present invention, the information sequence u transmitted from the master node to the slave node in the line ad hoc network has a length of K, and the length of the robust exponential soliton coding bit of the master node is , K bits of information are encoded based on the robust exponential soliton distribution, and the degree distribution function of the robust exponential soliton distribution is: ;in, is the binary exponential degree distribution function, is the robust soliton degree distribution function, represents the scaling coefficient of the binary exponential degree distribution function, The proportional coefficient representing the robust soliton degree distribution function is the weighted sum of the binary exponential degree distribution function and the robust soliton degree distribution function, K is the length of the digital signal, and d represents the degree.

[0105] The calculation formula of the binary exponential distribution function includes:

[0106] , where d represents the degree and K is the length of the digital signal.

[0107] The calculation formula of the robust soliton degree distribution function includes:

[0108] ,in, is the soliton degree distribution function, The soliton distribution under ideal conditions is: ;

[0109] Among them, the calculation formula of the soliton degree distribution function is:

[0110] , Indicates the average value of the output symbol node degree 1, represents the failure probability of the soliton degree distribution function, that is, the probability of not being able to decode correctly, is a free variable less than 1.

[0111] Use is the degree distribution function, from Select from the input symbols u The input symbols are summed modulo 2 to obtain the output symbol m, whose length is N.

[0112] Table 3 Example of output data m value

[0113]

[0114] Initialize the system parameters: Set the robust exponential soliton coding module packet information length K = 48 bits N = 72 sub-degree distribution function failure probability , scale factor Generate the bit u to be transmitted and convert it into decimal:

[0115] Table 4 Example of output data u value

[0116]

[0117] In one embodiment, the calculation formula of the degree distribution function of the robust exponential soliton distribution includes:

[0118] ;in, is the binary exponential degree distribution function, is the robust soliton degree distribution function, represents the scaling coefficient of the binary exponential degree distribution function, The proportional coefficient representing the robust soliton degree distribution function is the weighted sum of the binary exponential degree distribution function and the robust soliton degree distribution function, K is the length of the digital signal, and d represents the degree.

[0119] In one embodiment, the calculation formula of the binary exponential distribution function includes:

[0120] , where d represents the degree and K is the length of the digital signal.

[0121] In one embodiment, the calculation formula of the robust soliton degree distribution function includes:

[0122] ,in, is the soliton degree distribution function, The soliton distribution under ideal conditions is: ;

[0123] Among them, the calculation formula of the soliton degree distribution function is:

[0124] , Indicates the average value of the output symbol node degree 1, represents the failure probability of the soliton degree distribution function, where c is a free variable less than 1.

[0125] In one embodiment, step 170 can be specifically implemented as follows: obtaining a decoding tree; wherein the decoding tree includes multiple paths; calculating the path distance metric value between the demodulated information and each path; expanding the root node of the decoding tree to the next layer to obtain a child node; pushing the child node into a stack SS and deleting the root node; wherein the stack SS represents the next layer search stack; sorting the nodes in the pushed stack SS in ascending order according to the path distance metric value; determining whether the sorted top node of the stack is a leaf node; if the sorted top node of the stack is a leaf node, obtaining the source information corresponding to the top node of the stack; wherein the decoded information sequence includes the source information corresponding to the top node of the stack.

[0126] In this embodiment of the present invention, each slave node receives demodulated information and then performs bubble decoding of the Spinal code through its own Spinal decoding module. The decoding process consists of the following substeps: obtaining a decoding tree and initializing the root node of the decoding tree, pushing the root node into a stack SR; expanding the root node to the next level to obtain child nodes, merging the child nodes into a stack SS, and deleting the stored root node in SS; calculating the path distance metric between the demodulated information and each path in stack SS, and sorting the pushed nodes in stack SS in ascending order by the path distance metric; determining whether the top node of the SS stack is a leaf node. If so, output the top node of the SS stack; if not, transfer the top B nodes of the SS stack to the SR stack, clearing the SS stack; expanding all nodes in stack SR, adding them to stack SS, and clearing the SR stack; and outputting the source information corresponding to the top node of the SS stack. The preset number is B.

[0127] The bubble decoding module defines stacks SS and SR as storage modules to store the nodes of the decoding tree. Stack SS stores the extended nodes of the decoding tree, and SR stores the B nodes with the smallest path distance metric in SS. Output the information sequence after Spinal code decoding Table 5 shows the information sequence after decoding from node Spinal when the signal-to-noise ratio SNR=3dB. The specific value of .

[0128] Table 5 Spinal decoding from the node

[0129]

[0130] In one embodiment, step 170 can be specifically implemented as follows: transferring a preset number of sorted top nodes in stack SS to stack SR to obtain a transferred stack SR; wherein the stack SR stores the root node of the initial decoding tree, and stack SR represents the current search stack; expanding the nodes in the transferred stack SR and transferring the expanded nodes to the stack SS; and obtaining the source information corresponding to the top node in the stack SS.

[0131] In one embodiment, step 180 can be specifically implemented as follows: determining a target check node from a plurality of check nodes; wherein the target check node is connected to only one target input symbol in the decoded information sequence; obtaining a value corresponding to the target input symbol; determining other check nodes connected to the target input symbol; and determining values of input symbols connected to the other check nodes based on the determined target check node and the values corresponding to the target input symbol; wherein the decoded sequence includes the value of the target input symbol and the values of input symbols connected to the other check nodes.

[0132] In the embodiment of the present invention, a check node is searched among all check nodes for a node that matches only one input symbol. Connected check nodes, is a target input symbol in the decoded information sequence; if such a node exists, let , for all The connected check nodes perform the following assignment operations: ,in Is any one with Connected check nodes, Indicates that the result of the operation on the left is assigned to the variable on the right, and the result of the operation on the left is deleted. Repeat the above steps until all the edges are connected. is confirmed and decoding is completed.

[0133] Output decoded sequence , you can get the slave node Output sequence for:

[0134] Table 6 Robust exponential soliton decoding from node Output information sequence

[0135]

[0136] From the information sequence after robust exponential soliton decoding in Table 6, it can be seen that the decoding after descrambling at the slave node is consistent with the information sent by the master node.

[0137] For example, assuming the decoded sequence , the verification equation is: , , , find the check node with degree 1 (Connect only ), amplitude 1. 1 Substitution and , updated to: , , delete and Related edges. Continue processing Degree is 1), confirm , and finally solved .

[0138] Figure 3 This is a schematic diagram of the BER performance results of slave node robust exponential soliton coding and Spinal coding in a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by an exemplary embodiment of the present application. Figure 4 FIG1 is a schematic diagram of BER performance results of different slave nodes in a wireless cooperative signal transmission method based on robust exponential soliton distribution provided by an exemplary embodiment of the present application. Figure 3-4 As shown, the input sequence u is compared with the output sequence from the node end after 1000 cycles. , calculate the slave node BER. Figure 3 It is shown that after robust exponential soliton coding, the receiving node can obtain a coding gain of 1dB, which improves the reliability of wireless collaborative data. Figure 4 The BER of information received by different slave nodes after the proposed robust exponential soliton coding is given. It can be seen that for slave nodes at different locations and with different channel characteristics, the BER performance of each slave node is not much different, and good reliability results can be achieved.

[0139] Figure 5 FIG is a schematic diagram of the structure of a wireless cooperative signal transmission system based on robust exponential soliton distribution provided by an exemplary embodiment of the present application. Figure 5 As shown, the wireless cooperative signal transmission system based on robust exponential soliton distribution includes: a master node transmitting end, used to obtain a digital signal and encode the digital signal based on the robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding; based on a hash function, a transmission symbol sequence is generated according to the output sequence after robust exponential soliton encoding; the transmission symbol sequence is converted into a transmission signal; a channel, used to receive the transmission signal and power amplify the transmission signal to obtain a radio frequency signal; a slave node receiving end, used to receive the radio frequency signal through a channel; demodulate the radio frequency signal to obtain demodulated information; decode the demodulated information to obtain a decoded information sequence; and perform robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence.

[0140] Figure 6 The figure shows a block diagram of an electronic device according to an embodiment of the present application.

[0141] like Figure 6 As shown, the electronic device 10 includes one or more processors 11 and a memory 12 .

[0142] The processor 11 may be a central processing unit (CPU) or other forms of processing units having data processing capabilities and / or instruction execution capabilities, and may control other components in the electronic device 10 to perform desired functions.

[0143] The memory 12 may include one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may include, for example, random access memory (RAM) and / or cache memory. The non-volatile memory may include, for example, read-only memory (ROM), a hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium, and the processor 11 may execute the program instructions to implement the wireless cooperative signal transmission method based on robust exponential soliton distribution of the various embodiments of the present application described above and / or other desired functions. Various contents such as input signals, signal components, noise components, etc. may also be stored in the computer-readable storage medium.

[0144] In one example, the electronic device 10 may further include an input device 13 and an output device 14 , and these components are interconnected via a bus system and / or other forms of connection mechanisms (not shown).

[0145] When the electronic device 10 is a stand-alone device, the input device 13 may be a communication network connector, configured to receive collected input signals from the first device and the second device.

[0146] In addition, the input device 13 may also include, for example, a keyboard, a mouse, and the like.

[0147] The output device 14 can output various information to the outside, including determined distance information, direction information, etc. The output device 14 can include, for example, a display, a speaker, a printer, a communication network and a remote output device connected thereto, and the like.

[0148] Of course, to simplify, Figure 6 Only some of the components related to the present application in the electronic device 10 are shown, and components such as a bus, an input / output interface, etc. are omitted. In addition, the electronic device 10 may further include any other appropriate components according to specific application scenarios.

[0149] The computer program product may be written in any combination of one or more programming languages to implement the program code for performing the operations of the embodiments of the present application, including object-oriented programming languages such as Java, C++, and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0150] The computer-readable storage medium may be any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may include, for example, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0151] The above description has been provided for the purpose of illustration and description. Furthermore, this description is not intended to limit the embodiments of the present application to the forms disclosed herein. Although a number of example aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, alterations, additions, and sub-combinations thereof.

Claims

1. A wireless cooperative signal transmission method based on robust exponential soliton distribution, characterized in that: include: The master node transmitting end obtains a digital signal and encodes the digital signal based on a robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding; The master node transmitter generates a transmission symbol sequence based on a hash function and an output sequence after the robust exponential soliton coding; The master node transmitting end converts the transmission symbol sequence into a transmission signal; The channel receives the transmission signal and performs power amplification on the transmission signal to obtain a radio frequency signal; receiving the radio frequency signal from a receiving node through a channel; Demodulating the radio frequency signal from the receiving end of the node to obtain demodulated information; Decoding the demodulated information from the receiving node to obtain a decoded information sequence; The slave node receiving end performs robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence.

2. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 1, characterized in that: The generating of a transmission symbol sequence based on a hash function and an output sequence after robust exponential soliton coding comprises: Dividing the output sequence after the robust exponential soliton coding into a plurality of groups based on the number of bits in each group and the length of each group; wherein each group corresponds to a sequence block; generating a state value of the group based on a hash function according to a sequence block corresponding to the group and a state value of a previous group of the group, so as to obtain a plurality of state values; The plurality of state values are hashed into a transmission symbol sequence based on a RNG.

3. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 1, characterized in that: The step of encoding the digital signal based on the robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding comprises: Determine the degree based on the degree distribution function of the robust exponential soliton distribution; Selecting target information that meets the degree from the digital signal; A modulo-2 sum operation is performed on the target information to obtain an output sequence after robust exponential soliton coding.

4. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 3, characterized in that: The calculation formula of the degree distribution function of the robust exponential soliton distribution includes: ;in, is the binary exponential degree distribution function, is the robust soliton degree distribution function, represents the scaling coefficient of the binary exponential degree distribution function, The proportional coefficient representing the robust soliton degree distribution function is the weighted sum of the binary exponential degree distribution function and the robust soliton degree distribution function, K is the length of the digital signal, and d represents the degree.

5. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 4, characterized in that: The calculation formula of the binary exponential distribution function includes: , where d represents the degree and K is the length of the digital signal.

6. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 4, characterized in that: The calculation formula of the robust soliton degree distribution function includes: ,in, is the soliton degree distribution function, The soliton distribution under ideal conditions is: ; Among them, the calculation formula of the soliton degree distribution function is: , Indicates the average value of the output symbol node degree 1, represents the failure probability of the soliton degree distribution function, and c is a free variable less than 1.

7. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 1, characterized in that: Decoding the demodulated information to obtain a decoded information sequence includes: Obtaining a decoding tree; wherein the decoding tree includes multiple paths; Calculating a path distance metric value between the demodulated information and each path; Expanding the root node of the decoding tree to the next level to obtain child nodes; Push the child node into stack SS and delete the root node; wherein stack SS represents the next level search stack; Sort the nodes in the pushed stack SS in ascending order according to the path distance metric; Determine whether the top node of the sorted stack is a leaf node; If the sorted top node is a leaf node, the source information corresponding to the top node is obtained; wherein the decoded information sequence includes the source information corresponding to the top node.

8. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 7, characterized in that: The acquiring of the information source information corresponding to the top node of the stack includes: Transferring a preset number of sorted top nodes in stack SS to stack SR to obtain a transferred stack SR; wherein the stack SR stores the root node of the initial decoding tree, and stack SR represents the current search stack; Expanding the nodes in the transferred stack SR and transferring the expanded nodes to the stack SS; Obtain the source information corresponding to the top node in the stack SS.

9. The wireless cooperative signal transmission method based on robust exponential soliton distribution according to claim 1, characterized in that: The performing robust exponential soliton decoding on the decoded information sequence to obtain a decoded sequence includes: Determining a target check node from a plurality of check nodes; wherein the target check node is connected to only one target input symbol in the decoded information sequence; Obtaining a value corresponding to the target input symbol; Determining other check nodes connected to the target input symbol; Based on the determined target check node and the value corresponding to the target input symbol, the value of the input symbol connected to the other check nodes is determined; wherein the decoded sequence includes the value of the target input symbol and the value of the input symbol connected to the other check nodes.

10. A wireless cooperative signal transmission system based on robust exponential soliton distribution, characterized in that: include: A master node transmitting end is configured to obtain a digital signal and encode the digital signal based on a robust exponential soliton distribution to obtain an output sequence after robust exponential soliton encoding; Based on a hash function, generating a transmission symbol sequence according to the output sequence after the robust exponential soliton encoding; converting the transmission symbol sequence into a transmission signal; a channel for receiving the transmission signal and performing power amplification on the transmission signal to obtain a radio frequency signal; A slave node receiving end, configured to receive the radio frequency signal through a channel; Demodulating the radio frequency signal to obtain demodulated information; The demodulated information is decoded to obtain a decoded information sequence; and the decoded information sequence is subjected to robust exponential soliton decoding to obtain a decoded sequence.

Images