A CDD multi-node cooperation information sharing method, system, device and medium based on RS erasure decoding

Abstract

A method, system, device, and medium for CDD multi-node cooperative information sharing based on RS erasure decoding are disclosed. The method involves: each network node sequentially broadcasting its own information, buffering received shared information and CRC check results, and determining whether sharing was successful based on the CRC check results; nodes that failed to share send a cooperation request within the network; all nodes that successfully shared capture the cooperation request; cooperating nodes prepare cooperation information and broadcast it within the network; nodes that failed to share perform RS erasure decoding based on the cooperation information to recover erroneous shared information, thus achieving distributed network information sharing; the system, device, and medium implement CDD multi-node cooperative information sharing based on the above method. This invention improves the reliability of the cooperative information transmission process and enhances the ability of nodes that failed to share to recover erroneous information during cooperative information sharing; furthermore, it reduces the channel link state calculation and interaction overhead in the cooperative node selection process, thereby reducing the complexity of the scheme.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, and in particular to a CDD multi-node cooperative information sharing method, system, device and medium based on RS erasure decoding. Background Technology

[0002] Distributed multi-user networks, leveraging the collaborative advantages of nodes within the network, can accomplish complex tasks that a single node cannot complete or cannot complete efficiently. However, distributed networks are often deployed in harsh communication environments, where shared data transmission is susceptible to adverse factors such as multipath fading, path loss, and narrow channel bandwidth. Furthermore, distributed networks are limited by resources and power consumption, resulting in relatively low communication and computing capabilities for individual nodes. These issues pose significant challenges to achieving reliable information sharing in distributed networks.

[0003] Current research on physical layer wireless transmission schemes for reliable information sharing mainly focuses on low-rate channel coding schemes. Channel coding, as one of the core technologies for reliable digital communication, has developed rapidly in the digital communication era. Turbo codes, with their excellent performance and low hardware resource consumption, have been widely used in mobile wireless communication systems and resource-constrained distributed communication systems. Selecting a suitable channel coding scheme by considering factors such as communication network topology, user distribution, channel characteristics, and communication requirements can effectively improve the reliability and resource utilization of the communication system. Although existing channel coding techniques have good error correction performance, continuous errors may occur when the transmission channel conditions of a distributed network are poor. In such cases, even low-rate channel coding schemes may struggle to guarantee reliable information sharing.

[0004] MIMO technology uses multiple antennas to achieve multiple-transmit, multiple-receive communication, making full use of space resources to increase channel capacity. However, many mobile devices cannot meet the requirements of antenna spacing and cost, thus limiting the application of MIMO in distributed multi-user networks. Applying OFDM technology to multi-user cooperative communication forms a cooperative OFDM communication system, which effectively resists narrowband interference and phase deflection, overcoming the practicality problem of MIMO systems in small mobile terminal devices. However, it still suffers from the drawback of high complexity in selecting cooperative nodes. Summary of the Invention

[0005] To overcome the shortcomings of the existing technology, the present invention aims to provide a CDD multi-node cooperative information sharing method, system, device, and medium based on RS erasure decoding. Considering the communication characteristics of short messages, short distances, and narrow bandwidth between distributed network nodes, Turbo codes are chosen as the channel coding scheme. This cleverly combines distributed reception and verification of shared information with RS erasure decoding, ensuring transmission reliability while also maximizing hardware resource utilization. The invention eliminates the cooperative node selection step, reducing the complexity of the scheme. Furthermore, the invention introduces Cyclic Delay Diversity (CDD) technology to address the problem of random changes in distributed cooperative nodes, achieving diversity gain without increasing the complexity of received signal detection, thereby improving the reliability of cooperative information and enhancing the information sharing performance of the distributed network system.

[0006] To achieve the above objectives, the technical solution adopted by the present invention is as follows:

[0007] A CDD multi-node collaborative information sharing method based on RS erasure decoding specifically includes the following steps:

[0008] Step 1: Each node in the distributed network broadcasts its own information in sequence, and each node caches the received shared information and CRC check results;

[0009] Step 2: Each node determines whether the sharing was successful based on the CRC check result from Step 1. Nodes that fail to share send a cooperation request within the distributed network.

[0010] Step 3: All nodes that successfully share data calculate the relevant peak value r(n) based on the cooperation request information sent by the nodes that failed to share data in Step 2, in order to distinguish whether the nodes that successfully shared data received noise signals or cooperation request information; and capture cooperation requests; after capturing cooperation requests, nodes that successfully shared data are regarded as cooperative nodes.

[0011] Step 4: Collaborating nodes prepare collaboration information and broadcast it within the distributed network;

[0012] Step 5: The nodes that failed to share data perform RS erasure decoding based on the collaboration information prepared by the collaborating nodes in Step 4, restore the erroneous shared information, and realize distributed network information sharing.

[0013] The specific method for step 1 is as follows:

[0014] In a distributed network, each node broadcasts its shared information sequentially according to the TDMA protocol. Other nodes in the same time slot receive and perform CRC checks on the shared information and cache it.

[0015] The specific method for step 2 is as follows:

[0016] Each node determines whether the sharing was successful based on the CRC check result of the received shared information. If all CRC check results pass, the sharing is successful. If there is a check failure in the CRC check result, it means that the receiving node has a receiving error or data loss in this round of information sharing, and the information sharing in this round fails. The node that fails to share initiates a cooperation request.

[0017] The collaboration request in step 2 uses a PN sequence as the collaboration request information.

[0018] The specific method for step 3 is as follows:

[0019] All nodes that have successfully shared data calculate the relevant peak value r(n) based on the received collaboration request information. The purpose is to distinguish whether the nodes that have successfully shared data have received noise signals or collaboration request information. A threshold is set based on the relevant peak value r(n). If the relevant peak value is greater than the set threshold, collaboration request capture is performed. After capturing a collaboration request, the nodes that have successfully shared data are regarded as collaboration nodes.

[0020]

[0021] Where s(n) is the sequence received by the node that successfully shares the sequence, l(nn) is the local PN sequence, and L is the length of the PN sequence.

[0022] The specific method for step 4 is as follows:

[0023] Step 4.1, the collaborating node uses each column of cached shared information as RS-encoded code elements in units of M bits of data;

[0024] Step 4.2: The cooperating nodes encode the cached shared information by row to obtain the RS code check information code elements; then, the check information code elements are grouped by column and processed sequentially by CRC encoding, Turbo encoding, constellation mapping, OFDM modulation, and cyclic delay, and then the cooperative information is broadcast in the distributed network.

[0025] The specific method for step 5 is as follows:

[0026] Step 5.1: The node that failed to share receives the broadcast cooperation information and obtains the RS code verification information through constellation mapping, Turbo decoding, and CRC check processing. Then, the RS code verification information is concatenated with the sharing information received by the node that failed to share. Let the concatenated RS codeword polynomial be:

[0027] R(x)=α n-1 x n-1 +α n-2 x n-2 +αn-3 x n-3 +…+α 1 x+α 0

[0028] Where, α n-1 α n-2 , ..., α 0 represents the coefficients of the RS codeword polynomial, and n is the number of RS codewords after concatenation;

[0029] The CRC check failure message provides deletion position information, sets the sign of the deleted position in the received codeword polynomial R(x) to 0, and calculates the deletion position polynomial σ. e (x) and the accompanying polynomial S(x):

[0030]

[0031] Where e is the number of symbols deleted; x j =α j ;s j =R * (α j ), j = 1, 2, ..., d min -1, R * (x) is the modified received codeword polynomial, d min Minimum code distance;

[0032] The companion polynomial S(x) and the deletion position polynomial σ e Combining (x) yields the modified adjoint T(x):

[0033]

[0034] Step 5.2: Construct the key equation based on the modified adjoint T(x) from Step 5.1:

[0035]

[0036] Where, σ t w(x) denotes the erroneous position polynomial, and w(x) denotes the deletion / erroneous estimate polynomial;

[0037] The error location polynomial σ is obtained by solving the critical equation using the BM algorithm. t (x), combined with the deletion position polynomial σ in step 5.1 e (x) yields the total deletion / error position polynomial σ(x):

[0038] σ(x)=σ e (x)σ t (x)

[0039] Use the Chien search algorithm to find the root of the above equation:

[0040]

[0041] X j Indicates the deletion / error position, where e is the number of deleted symbols and t is the number of error symbols; if all deletion / error positions are known through CRC checksum, then X j The deletion location is provided by the CRC check result;

[0042] Step 5.3: Obtain the deletion / error estimation polynomial w(x) based on the deletion / error position polynomial σ(x) in Step 5.2 and the modified adjoint T(x) in Step 5.1;

[0043]

[0044] Differentiating σ(x) and solving the above equation using the Forney algorithm yields the value of the deleted sign:

[0045]

[0046] The erroneous pattern polynomial was calculated as follows:

[0047]

[0048] The corrected codewords are output, restoring the shared information:

[0049]

[0050] A CDD multi-node collaborative information sharing system based on RS erasure decoding includes:

[0051] The information caching module is used in step 1, where each node in the distributed network performs CRC verification on the received information and caches the received information and the CRC verification result.

[0052] The collaboration information request module is used in step 2, where each node determines whether the sharing was successful based on the CRC check result, and the node that failed to share sends a collaboration request.

[0053] The collaboration node selection module is used in step 3 to calculate relevant peak values ​​based on the received collaboration request information and capture collaboration requests from all successfully shared nodes. All successfully shared nodes within the system are considered collaboration nodes after capturing a collaboration request.

[0054] The collaboration information preparation module is used in step 4, where collaborating nodes perform RS encoding on cached shared information by row to obtain RS code check information symbols. Then, the check information symbols are grouped by column and sequentially processed with CRC encoding, Turbo encoding, constellation mapping, OFDM modulation, and cyclic delay before being broadcast within the distributed network.

[0055] The error information recovery module is used in step 5. The node that failed to share receives the broadcast cooperation information, obtains RS code verification information through deconstellation mapping, Turbo decoding, CRC check, etc., and performs RS erasure decoding in combination with the RS code verification information and the information cached in step 1 to restore the erroneous shared information and realize distributed network information sharing.

[0056] A CDD multi-node collaborative information sharing device based on RS erasure decoding includes:

[0057] Memory, used to store computer programs;

[0058] A processor is used to implement the CDD multi-node collaborative information sharing method based on RS erasure decoding as described in steps 1 to 5 when executing the computer program.

[0059] A computer-readable storage medium for storing a computer program, characterized in that, when executed by a processor, the computer program is capable of performing CDD multi-node collaborative information sharing based on the CDD multi-node collaborative information sharing method based on RS erasure decoding as described in any one of steps 1 to 5.

[0060] Compared with the prior art, the advantages and positive effects of the present invention are as follows:

[0061] 1. This invention eliminates the distributed cooperative node selection process, reducing channel link state calculations and interaction overhead, and lowering the complexity of the scheme. All nodes that have successfully shared the resource, upon receiving a cooperation request, prepare cooperation information as cooperative nodes, thus improving the reliability of the cooperation information.

[0062] 2. This invention introduces Cyclic Delay Diversity (CDD) technology during the cooperative information sharing phase, eliminating the need for the receiving end to modify existing distributed network communication modules based on the number of antennas. Furthermore, diversity gain is achieved without increasing the complexity of received signal detection, further improving the reliability of cooperative information transmission.

[0063] 3. The main idea of ​​collaborative information sharing and recovery is that the collaborative information sent by the collaborating nodes assists the nodes that failed to share in recovering erroneous data. This is consistent with the efficient error recovery method of erasure coding, with RS codes being a representative example. The deletion location information on which RS codes achieve efficient erasure decoding can be provided by the CRC check result of the received information. Furthermore, based on the development of RS decoding algorithms, the erasure decoding implementation of RS codes has low complexity, meeting the complexity requirements of distributed networks, and ensuring both transmission reliability and efficient utilization of hardware resources.

[0064] In summary, this invention improves the ability of nodes that fail to share information to recover from errors during the collaborative information sharing process, and reduces the channel link state calculation and interaction overhead in the collaborative node selection process, thereby reducing the complexity of the scheme. It is an effective method to improve the performance of distributed network information sharing. Attached Figure Description

[0065] To more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the embodiments of the present invention will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0066] Figure 1 This is a flowchart of a method according to an embodiment of the present invention.

[0067] Figure 2 This is a diagram illustrating the RS encoding process for shared information in an embodiment of the present invention.

[0068] Figure 3 This is a diagram illustrating the RS erasure decoding process for restoring shared information in a shared failure node according to an embodiment of the present invention.

[0069] Figure 4 This is a graph showing the information sharing failure rate of the information sharing scheme according to an embodiment of the present invention under different numbers of nodes; wherein, Figure 4 (a) is a graph showing the information sharing failure rate with 15 nodes. Figure 4 (b) is a graph showing the information sharing failure rate with 18 nodes. Figure 4 (c) is a graph showing the information sharing failure rate with 22 nodes. Figure 4 (d) is a graph showing the information sharing failure rate with 25 nodes.

[0070] Figure 5 This is a graph showing the information sharing failure rate of the information sharing scheme under different bitrates according to an embodiment of the present invention; wherein, Figure 5 (a) is a graph showing the information sharing failure rate when the channel coding rate is 1 / 3. Figure 5 (b) is a graph showing the information sharing failure rate when the channel coding rate is 1 / 2. Figure 5 (c) is a graph showing the information sharing failure rate when the channel coding rate is 3 / 5. Figure 5 (d) is a graph showing the information sharing failure rate when the channel coding rate is 2 / 3.

[0071] Figure 6 This is a graph showing the information sharing failure rate of the information sharing scheme according to an embodiment of the present invention under different amounts of collaborative information; wherein, Figure 6 (a) is a graph showing the failure rate of information sharing when the number of collaborative messages is 1. Figure 6 (b) is a graph showing the information sharing failure rate when the number of collaborative information items is 2. Figure 6 (c) is a graph showing the failure rate of information sharing when the number of collaborative information items is 3. Detailed Implementation

[0072] The technical solution of the present invention will be further described in detail below with reference to the accompanying drawings, but the scope of protection of the present invention is not limited to the following description.

[0073] To address the issues of low transmission efficiency and frequent decoding errors in harsh channel environments associated with low-rate channel coding schemes, this invention employs Turbo codes as the channel coding scheme. It cleverly combines distributed reception and verification of shared information with RS erasure decoding, ensuring transmission reliability while maintaining efficient hardware resource utilization. Furthermore, based on distributed multi-antenna cooperative diversity technology, this invention eliminates the cooperative node selection step, reducing the scheme's complexity. In addition, it utilizes OFDM technology to combat multipath effects caused by multi-antenna transmission and introduces CDD technology to address the problem of random changes in distributed cooperative nodes, achieving diversity gain without increasing the complexity of received signal detection, thus improving the reliability of cooperative information. Specifically, this includes:

[0074] like Figure 1 As shown in the figure, the CDD multi-node collaborative information sharing method based on RS erasure decoding provided by this embodiment of the invention specifically includes the following steps:

[0075] Step 1: Each node in the distributed network broadcasts its own information in sequence, and each node caches the received shared information and CRC check results; specifically: each node in the distributed network broadcasts its own shared information in sequence according to the TDMA protocol, and other nodes in the same time slot receive the shared information and perform CRC check, and cache this information.

[0076] Step 2: Each node determines whether the sharing was successful based on the CRC check result from Step 1. Nodes that failed to share send a cooperation request within the distributed network. Specifically, each node determines whether the sharing was successful based on the CRC check result of the received shared information. If all CRC check results pass, the sharing is successful. If there is a check failure in the CRC check result, it means that the receiving node has a receiving error or data loss during this round of information sharing, and this round of information sharing fails. Nodes that failed to share initiate a cooperation request.

[0077] The collaboration request in step 2 uses a PN sequence as the collaboration request information.

[0078] Step 3: All nodes that successfully shared data calculate the relevant peak value r(n) based on the cooperation request information received from the nodes that failed to share data in Step 2, in order to distinguish whether the nodes that successfully shared data received noise signals or cooperation request information; and then capture the cooperation request; nodes that successfully shared data are regarded as cooperative nodes after capturing the cooperation request; specifically:

[0079] All nodes that have successfully shared data calculate the relevant peak value r(n) based on the received collaboration request information. The purpose is to distinguish whether the nodes that have successfully shared data have received noise signals or collaboration request information. A threshold is set based on the relevant peak value r(n). If the relevant peak value is greater than the set threshold, collaboration request capture is performed. After capturing a collaboration request, the nodes that have successfully shared data are regarded as collaboration nodes.

[0080]

[0081] Where s(n) is the sequence received by the node that successfully shares the sequence, l(n) is the local PN sequence, and L is the length of the PN sequence;

[0082] If the relevant peak value is less than the set threshold, it means that the collaboration request has failed, and this case will not be considered.

[0083] Step 4: The collaborating nodes prepare the collaboration information and broadcast it within the distributed network; specifically:

[0084] Step 4.1, the collaborating node uses 8 bits of data as RS-encoded symbols for each column of cached shared information;

[0085] Step 4.2: The cooperating nodes encode the cached shared information by row to obtain the RS code check information code elements; then, the check information code elements are grouped by column and processed sequentially by CRC encoding, Turbo encoding, constellation mapping, OFDM modulation, and cyclic delay, and then the cooperative information is broadcast in the distributed network.

[0086] Step 5: The nodes that failed to share data perform RS erasure decoding based on the collaboration information prepared by the collaborating nodes in Step 4, recover the erroneous shared information, and realize distributed network information sharing. Specifically:

[0087] Step 5.1: The node that failed to share receives the broadcast cooperation information and obtains the RS code verification information through constellation mapping, Turbo decoding, and CRC check processing. Then, the RS code verification information is concatenated with the sharing information received by the node that failed to share. Let the concatenated RS codeword polynomial be:

[0088] R(x)=α n-1 x n-1 +α n-2 x n-2 +α n-3 x n-3 +…+α 1 x+α 0

[0089] Where, α n-1 α n-2 , ..., α 0 represents the coefficients of the RS codeword polynomial, and n is the number of RS codewords after concatenation;

[0090] The CRC check failure message provides deletion position information, sets the sign of the deleted position in the received codeword polynomial R(x) to 0, and calculates the deletion position polynomial σ. e (x) and the accompanying polynomial S(x):

[0091]

[0092] Where e is the number of symbols deleted; x j =α j ;s j =R * (α j ), j = 1, 2, ..., d min -1, R * (x) is the modified received codeword polynomial, d min Minimum code distance;

[0093] The companion polynomial S(x) and the deletion position polynomial σ e Combining (x) yields the modified adjoint T(x):

[0094]

[0095] Step 5.2: Construct the key equation based on the modified adjoint T(x) from Step 5.1:

[0096]

[0097] Where, σ t w(x) denotes the erroneous position polynomial, and w(x) denotes the deletion / erroneous estimate polynomial;

[0098] The error location polynomial σ is obtained by solving the critical equation using the BM algorithm. t (x), combined with the deletion position polynomial σ in step 5.1 e (x) yields the total deletion / error position polynomial σ(x):

[0099] σ(x)=σ e (x)σ t (x)

[0100] Use the Chien search algorithm to find the root of the above equation:

[0101]

[0102] X j Indicates the deletion / error position, where e is the number of deleted symbols and t is the number of error symbols; if all deletion / error positions are known through CRC checksum, then X j The deletion location is provided by the CRC check result;

[0103] Step 5.3: Obtain the deletion / error estimation polynomial w(x) based on the deletion / error position polynomial σ(x) in Step 5.2 and the modified adjoint T(x) in Step 5.1;

[0104]

[0105] Differentiating σ(x) and solving the above equation using the Forney algorithm yields the value of the deleted sign:

[0106]

[0107] The erroneous pattern polynomial was calculated as follows:

[0108]

[0109] The corrected codewords are output, restoring the shared information:

[0110]

[0111] Simulation Parameter Description

[0112] Consider a multi-user communication network system with N nodes. The amount of cooperative information is the number of check code information columns obtained by the cooperative nodes through RS coding of the correct globally shared information, which is equal to the number of check code elements (paritynum) of the selected RS(N+paritynum,N) code. Under the same spectral efficiency, the adjusted code rate after reducing the channel coding rate is:

[0113] R1 = R·N / (N + paritynum)

[0114] Where R is the channel coding rate of the proposed scheme, and R1 is the code rate used in the scheme to reduce the channel coding rate.

[0115] Simulation 1: As Figure 4 As shown in Table 1, under the same spectral efficiency and different number of nodes, the information sharing performance of the CDD multi-node cooperative information sharing scheme based on RS erasure decoding proposed in this invention and the existing code rate reduction scheme are compared with that of the RS code-based single-node information sharing scheme, using 8-bit data as RS coding symbols.

[0116] Table 1 Simulation parameters for different numbers of nodes

[0117]

[0118] The failure rate for distributed multi-user information sharing is 10%. -5 When the magnitude, the amount of collaborative information, and the number of nodes are 1, 15, 18, 23, and 26 respectively, the information sharing performance of the multi-node collaborative information sharing scheme proposed in this invention is improved by 1.6dB, 1.8dB, 1.8dB, and 1.6dB respectively compared with the reduced code rate scheme; and the information sharing performance is improved by 0.2dB, 0.2dB, 0.6dB, and 0.6dB respectively compared with the single-node scheme.

[0119] Simulation 2: As Figure 5 As shown in Table 2, under the same spectral efficiency and different code rates, the information sharing performance of the CDD multi-node cooperative information sharing scheme based on RS erasure decoding proposed in this invention and the existing code rate reduction scheme are compared, with 8-bit data as RS coding symbols. It is also compared with the single-node information sharing scheme based on RS codes.

[0120] Table 2 Simulation parameters at different bit rates

[0121]

[0122] The failure rate for distributed multi-user information sharing is 10%. -5When the magnitude, the amount of cooperative information is 1, and the channel coding code rate is 1 / 3, 1 / 2, 3 / 5, and 2 / 3 respectively, the information sharing performance of the distributed network system using the multi-node cooperative information sharing scheme proposed in this invention is improved by 1.1dB, 1.6dB, 1.3dB, and 1.1dB respectively compared with the code rate reduction scheme; and the information sharing performance is improved by 0.3dB, 0.6dB, 0.5dB, and 0.5dB respectively compared with the single-node scheme.

[0123] Simulation 3: As Figure 6 As shown in Table 3, under the same spectral efficiency and different amounts of cooperative information, the information sharing performance of the CDD multi-node cooperative information sharing scheme based on RS erasure decoding proposed in this invention and the existing reduced code rate scheme are compared, with 8 bits of data as RS coding symbols. It is also compared with the single-node information sharing scheme based on RS codes.

[0124] Table 3 Simulation parameters for different amounts of collaborative information

[0125]

[0126] The failure rate for distributed multi-user information sharing is 10%. -5 When the magnitude and the amount of collaborative information are 1, 2, and 3 respectively, the information sharing performance of the distributed network system using the multi-node collaborative information sharing scheme proposed in this invention is improved by 1.3dB, 1.6dB, and 1.3dB in signal-to-noise ratio gain, respectively, compared with the scheme with reduced code rate; and the information sharing performance is improved by 0.4dB, 0.4dB, and 0.3dB in signal-to-noise ratio gain, respectively, compared with the single-node scheme.

[0127] This invention discloses a CDD multi-node cooperative information sharing scheme based on RS erasure decoding. In this scheme, nodes within the system can flexibly share cooperative information as needed, improving the performance of information sharing in distributed networks. Combining the characteristics of node cooperation within a distributed network, CDD cooperative diversity technology is introduced. On the one hand, this improves the reliability of cooperative information transmission and enhances the ability of nodes that fail to share information to recover from errors during the cooperative information sharing process; on the other hand, it reduces the channel link state calculation and interaction overhead in the cooperative node selection process, thus lowering the complexity of the scheme. Large-scale simulations demonstrate that its performance is superior to information sharing schemes with reduced code rates and single-node information sharing schemes based on RS codes.

Claims

1. A multi-node collaborative information sharing method based on RS erasure decoding and CDD, characterized in that: Specifically, the following steps are included: Step 1: Each node in the distributed network broadcasts its own information in sequence, and each node caches the received shared information and CRC check results; Step 2: Each node determines whether the sharing was successful based on the CRC check result from Step 1. Nodes that fail to share send a cooperation request within the distributed network. Step 3: All nodes that successfully shared data calculated the relevant peak values ​​based on the collaboration request information received from the nodes that failed to share data in Step 2. The calculation formula is as follows: in, The sequence received by the node that successfully shared the data. For local PN sequences, L The length of the PN sequence; According to relevant peak values To distinguish whether a node that has successfully shared data receives noise signals or cooperation request information, and to capture cooperation requests; a node that has successfully shared data is regarded as a cooperation node after capturing a cooperation request. Step 4: The cooperating nodes encode the cached shared information by row to obtain the RS code check information code elements; then, the check information code elements are grouped by column and sequentially processed by CRC encoding, Turbo encoding, constellation mapping, OFDM modulation, and cyclic delay, and then the cooperative information is broadcast in the distributed network. Step 5: The node that failed to share receives the cooperation information broadcast in Step 4, obtains the RS code verification information through constellation mapping, Turbo decoding, and CRC check processing, and performs RS erasure decoding together with the information cached in Step 1 to recover the erroneous sharing information. To achieve distributed network information sharing: in, The concatenated RS codeword polynomial, This is an incorrect pattern polynomial.

2. The multi-node collaborative information sharing method based on RS erasure decoding and CDD as described in claim 1, characterized in that: The specific method for step 1 is as follows: In a distributed network, each node broadcasts its shared information sequentially according to the TDMA protocol. Other nodes in the same time slot receive and perform CRC checks on the shared information and cache it.

3. The multi-node collaborative information sharing method based on RS erasure decoding and CDD as described in claim 1, characterized in that: The specific method for step 2 is as follows: Each node determines whether the sharing was successful based on the CRC check result of the received shared information. If all CRC check results pass, the sharing is successful. If there is a check failure in the CRC check result, it means that the receiving node has a receiving error or data loss in this round of information sharing, and the information sharing in this round fails. The node that fails to share initiates a cooperation request.

4. The multi-node collaborative information sharing method based on RS erasure decoding and CDD as described in claim 1, characterized in that: The collaboration request in step 2 uses a PN sequence as the collaboration request information.

5. The multi-node collaborative information sharing method based on RS erasure decoding and CDD as described in claim 1, characterized in that: The specific method for step 3 is as follows: All nodes that successfully shared the collaboration information calculated the relevant peak values ​​based on the received collaboration request information. The purpose is to distinguish whether a successfully shared node receives a noise signal or a cooperation request message; based on relevant peak values... A threshold is set; if the relevant peak value exceeds the set threshold, a collaboration request is captured. Nodes that successfully share data are considered collaboration nodes after a collaboration request is captured. in, The sequence received by the node that successfully shared the data. For local PN sequences, L is the length of the PN sequence.

6. The multi-node collaborative information sharing method based on RS erasure decoding and CDD as described in claim 1, characterized in that: The specific method for step 4 is as follows: Step 4.1, the collaborating nodes will cache each column of shared information using... M Bit data is used as the unit of RS encoding symbol; Step 4.2: The cooperating nodes encode the cached shared information by row to obtain the RS code check information code elements; then, the check information code elements are grouped by column and sequentially encoded by CRC, Turbo, constellation mapping, OFDM modulation, and cyclic delay diversity technology is used to add cyclic delay before broadcasting the cooperative information in the distributed network.

7. The multi-node collaborative information sharing method based on RS erasure decoding and CDD as described in claim 1, characterized in that: The specific method for step 5 is as follows: Step 5.1: The node that failed to share receives the broadcast cooperation information and obtains the RS code verification information through constellation mapping, Turbo decoding, and CRC check processing. Then, the RS code verification information is concatenated with the sharing information received by the node that failed to share. Let the concatenated RS codeword polynomial be: in, For the coefficients of the RS codeword polynomial, This represents the number of RS codewords after concatenation. CRC check failure information provides deletion location information, and the received codeword polynomial Set the sign of the corresponding deletion position to 0, and calculate the polynomial at the deletion position. and the accompanying polynomial : in, e Number of symbols to be deleted; ; , For the corrected received codeword polynomial, Minimum code distance; Accompanying polynomial With deletion position polynomial Combined, we obtain the modified adjoint. : Step 5.2, according to the modified syndrome in step 5.1 Constructing the key equations: against in, Represents the polynomial in the wrong position. w ( x () indicates the deletion / error-evaluation polynomial; The error location polynomial is obtained by solving the critical equation using the BM algorithm. Combined with the deletion position polynomial in step 5.1 Obtain the total deletion / error position polynomial : Use the Chien search algorithm to find the root of the above equation: Indicates the location of deletion / error. e To delete the number of symbols, t The number of error symbols; if all deletion / error locations are known via CRC check, then The deletion location is provided by the CRC check result; Step 5.3, based on the deletion / error position polynomial in step 5.2 and the modified synergy in step 5.1 T(x) Obtain the deleted / erroneous value polynomial w ( x ); against right By taking the derivative and solving the above equation using the Forney algorithm, we obtain the value of the deleted sign: The polynomial of the erroneous pattern is calculated as follows: The corrected codewords are output, restoring the shared information: 。 8. A multi-node collaborative information sharing system based on cyclic delay diversity, characterized in that, include: The information caching module is used in step 1, where each node in the distributed network performs CRC verification on the received information and caches the received information and the CRC verification result. The collaboration information request module is used in step 2, where each node determines whether the sharing was successful based on the CRC check result, and the node that failed to share sends a collaboration request. The collaboration node selection module is used in step 3 to calculate the relevant peak values ​​based on the received collaboration request information from all successfully shared nodes. The calculation formula is as follows: in, The sequence received by the node that successfully shared the data. For local PN sequences, L The length of the PN sequence; According to relevant peak values To distinguish whether a node that has successfully shared data receives noise signals or cooperation request information, and to capture cooperation requests; a node that has successfully shared data is regarded as a cooperation node after capturing a cooperation request. The collaboration information preparation module is used in step 4, where the collaboration nodes encode the cached shared information by row to obtain the RS code check information code element; then, the check information code element is grouped by column and sequentially processed by CRC encoding, Turbo encoding, constellation mapping, OFDM modulation, and cyclic delay, and then the collaboration information is broadcast in the distributed network. The error message recovery module is used in step 5, where the node that failed to share receives the broadcast cooperation information, obtains the RS code verification information through constellation mapping, Turbo decoding, and CRC check processing, and performs RS erasure decoding together with the information cached in step 1 to recover the erroneous sharing information. To achieve distributed network information sharing: in, The concatenated RS codeword polynomial, This is an incorrect pattern polynomial.

9. A multi-node collaborative information sharing device based on cyclic delay diversity, characterized in that, include: Memory, used to store computer programs; The processor is used to implement the multi-node cooperative information sharing method based on RS erasure decoding and cyclic delay diversity described in steps 1 to 5 when executing the computer program.

10. A computer-readable storage medium for storing a computer program, characterized in that, When the computer program is executed by the processor, it can perform cyclic delay diversity multi-node collaborative information sharing based on the multi-node collaborative information sharing method based on RS erasure decoding and CDD as described in any one of steps 1 to 5.

Images