Network flow beacon coding and decoding method based on RaptorQ fountain code

By using the cascading encoding structure of RaptorQ fountain code and dynamic redundant verification code in network stream beacon transmission, combined with the cyclic incremental synchronization code, the interference problem of data transmission in encrypted multi-hop network is solved, and data efficiency is achieved. Reliable transmission and anti-interference capability.

CN119011090AActive Publication Date: 2024-11-22NANJING UNIV OF INFORMATION SCI & TECH
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202411493141.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-24
Publication Date
2024-11-22
Estimated Expiration
2044-10-24

AI Technical Summary

Technical Problem

In complex and changeable network environments, especially in encrypted multi-hop network scenarios, the reliable transmission of data faces interference such as bit flip, insertion, deletion and replacement, resulting in data corruption and unstable transmission.

Method used

Using the network stream beacon encoding and decoding method based on RaptorQ fountain code, the cascade encoding structure is formed through RaptorQ encoding, dynamic redundant verification code (DRCC) and cyclic incremental synchronization code to ensure the integrity and resistance of data in channel transmission. Interference capability, and accurately locate the data start bit through the synchronization code marking function.

Benefits of technology

Effectively respond to interference in the channel environment, improve the reliability and anti-interference ability of data transmission, ensure the integrity and accuracy of data, and realize the stability and traceability of beacon transmission in encrypted multi-hop networks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119011090A_ABST
    Figure CN119011090A_ABST
Patent Text Reader

Abstract

The invention provides a network flow beacon coding and decoding method based on a RaptorQ fountain code, which comprises the following steps of: 1, carrying out RaptorQ coding processing on a network flow beacon to form a continuous beacon bit sequence stream; step 2, adding a specific dynamic redundancy check code DRCC behind each code segment in the beacon bit sequence stream, so that each code segment carries check information; step 3, a beacon receiving end carries out beacon detection; 4, starting the detection of the synchronous code in each code segment; and 5, converting the synchronous code and the RaptorQ code segment into a byte form, and sending the byte form into a RaptorQ decoder for decoding. According to the method, the design of the RaptorQ fountain code is adopted, the network environment prone to interference is effectively dealt with, interference errors such as synchronization loss and delay jitter which are prone to occurring on a transmission channel are effectively dealt with, and the method provides a reliable solution for achieving beacon-based tracing in the encrypted network environment.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of data encoding and decoding, and in particular to a network stream beacon encoding and decoding method based on RaptorQ fountain code. Background Art

[0002] With the development of modern communication technology, the transmission of network information has become an indispensable part of daily life and industrial applications. However, the complexity and variability of the network environment, especially in encryption and multi-hop network scenarios, poses a huge challenge to the reliable transmission of data. In this context, how to effectively encode, transmit and decode data to ensure the integrity and correctness of the data has become an urgent problem to be solved.

[0003] Traditional coding and transmission methods often seem to be unable to cope with various interferences in network environments. Common interferences include bit flipping, insertion, deletion, and substitution, which may cause serious damage to data or even make it impossible to recover. Therefore, it is of great practical significance to develop a coding and decoding method with strong robustness and high anti-interference ability. Summary of the invention

[0004] Purpose of the invention: The purpose of the present invention is to provide a network stream beacon encoding and decoding method based on RaptorQ fountain code, thereby effectively coping with interference effects such as network environment susceptible to interference and synchronization loss and delay jitter on the beacon transmission channel by adopting the design of RaptorQ fountain code. This method provides a reliable solution for realizing beacon-based tracking and tracing in encrypted multi-hop networks.

[0005] Technical solution: The network stream beacon encoding and decoding method based on RaptorQ fountain code described in the present invention comprises the following steps: Step 1: Place the The network flow beacon of bit length is RaptorQ encoded. The value of is a multiple of 8, and the binary data obtained after encoding is processed in segments, each encoding segment consists of bits, The value range is (8,10), add before each coding segment bits of cyclic increasing synchronization code, The value range of is (4,8), then each code segment consists of bits, The value range of is (12,18), forming a continuous beacon bit sequence stream; Step 2: Add a unique bits of Dynamic Redundancy Check Code (DRCC), The value range of is (8,10), so that each code segment has check information and is extended to bits in length; added at the front of the beacon bit sequence stream bits of start marker code, The value range is (24,30); the beacon bit sequence stream with checksum information and start mark code is repeatedly copied The bit sequence stream after X , sent into the channel for transmission; The value range of is (2,5), Step 3, the beacon receiver monitors the beacon bit sequence stream after being transmitted through the channel and performs beacon detection; Step 4, after detecting the start mark code, start detecting the synchronization code in each code segment; Step 5, for the code segments marked as valid data after verification, after removing the dynamic redundancy check code, the synchronization code and RaptorQ code segment are converted into byte form and sent to the RaptorQ decoder for decoding; during the decoding process, the integrity of each code segment is first verified; after decoding is completed, the beacon information corresponding to the code stream composed of the code segments is output.

[0006] Step 2 contains the following steps: Step 2-1, each code segment in the beacon bit sequence code stream bits, by Bit synchronization code and The basic unit segment is composed of a RaptorQ coding segment; The bit information is represented as , in Indicates the first bit of information, Indicates bits of information, Each bit of information in the bits represents the bit information of the basic unit segment 0 or 1, and the bit information of the basic unit segment is used as a polynomial The coefficients of each code segment bits of data are represented as polynomials ; x is a mathematical variable with no actual physical meaning. It is only used to indicate the position of a data bit in a polynomial, and x^i is used to indicate the power position of the bit.

[0007] Step 2-2, use dynamic redundancy check code, set The bit check information is ,in Indicates bits of checksum information, Indicates the first bit check information. Each bit check information indicates bit check information 0 or 1. The bit check information is also expressed as a polynomial The coefficients of the check information are expressed as polynomials ; Step 2-3, each code segment to be sent bits of information shifted left bits, equivalent to multiplying by in the polynomial representation , the polynomial becomes Polynomial of bits ; Steps 2-4, using polynomial Divide by polynomial Perform the operation to get the required remainder , used to determine data integrity, the specific calculation is: , in, is the quotient produced during the division of a polynomial; is the remainder, indicating the dynamic redundancy check code; Step 2-5, the remainder Append to polynomial After that, each code segment bits of data to complete the addition of dynamic redundancy check code; finally, each code segment includes the original bits of information and additional bits of dynamic redundancy check code, forming a length of bits of code segment data; Step 2-6, create a dynamic redundancy check code table for storage bits of information to generate a dynamic redundancy check code; The dynamic redundancy check code generated by the information in all cases of bits is stored in it to form a Dynamic redundancy check code table of elements; Step 2-7, for each bits, and use a dynamic redundancy check code table to perform dynamic table lookup operations; The corresponding dynamic redundancy check code is searched for each bit of information, and the dynamic redundancy check code is added to each basic unit code segment to ensure that each segment of data carries the check information; Step 2-8, add in front of the sequence code stream The start mark code composed of bits 0 and 1 generates a beacon bit sequence code stream, and the new code stream with check information and the start mark code is copied repeatedly After that, the obtained beacon bit sequence stream X sent into the channel for transmission.

[0008] Step 3 includes the following steps: Step 3-1, monitor the code stream after transmission through the channel, and use the length The dynamic window records the passing code stream and records it as a sequence code stream C ; The value range is (20,32); Step 3-2, create a The matrix D ,matrix D Each element in Indicates that the first l bits into the first j bits of the start marker code T, and initialize the matrix D The zeroth row and zeroth column of Indicates the first part of the received sequence code stream C l The number of required insertion, deletion, and replacement operations between bits and empty bits; the zeroth row element Represents the number of insertion, deletion, and replacement operations required between the first j bits of the transition from the null bit code to the start mark code; Step 3-3, for each bit in the sequence code stream C and each bit in the start marker code T, l The value is 1 ~ , j takes the value of 1 ~ If the sequence code stream The bits in the code are not equal to the start marker code bits in, then the intermediate parameter , otherwise the intermediate parameter ; Calculate and record ; Step 3-4, find the matrix D The minimum value of the last line, the minimum value is the sequence code stream C With the start tag code T Minimum number of operations between ;if , that is, it is determined that the start mark code is found T ; Step 3-5: If the start marker code is not detected at the end of the sequence code stream C T , then the beacon detection fails.

[0009] Step 4 includes the following steps: Step 4-1, start the detection of the preamble of each code segment, and preset a value that increases from 0 Bit binary number N; Step 4-2, compare the preset number N with the first synchronization code after the start mark code, if they are consistent, the synchronization code is determined to be correct; if they are inconsistent, the preset number N is increased by one, and the synchronization code is continued in the code stream. The next synchronization code is detected within the bit range. If they are consistent, the synchronization code is determined to be correct. If they are inconsistent, the preset number N is increased by one again, and the synchronization code is continued in the bit stream. The next synchronization code is detected within the range of bits until the correct synchronization code is found; the relationship between the code stream and the preset number detection is: ; Step 4-3, the pre-correct synchronization code and the pre-correct synchronization code bits, and use a dynamic mapping method of a dynamic redundancy check code table to obtain the check bit value of the code segment through mapping; Step 4-4, compare the check bit value with the first bits to The code segments composed of bits are compared. If they are consistent, it means that the code segments in the code stream are complete and correct. The code segments are retained and marked as valid data. If they are inconsistent, the code segments are discarded. Step 4-5: When the total number of bits in the code segment reaches the threshold When the threshold , stop detection; if the number of all bits in the code segment does not reach the threshold before the next start marker code is detected , then continue to detect the synchronization code after the next start mark code, and repeat steps 4-1 to 4-4; Step 4-6: After the detection is completed, the number of all bits in the code segment still does not reach the threshold , then the beacon detection fails.

[0010] Step 5 includes the following steps: Step 5-1: For the code segments marked as valid data after verification, use the synchronization code to distinguish each code segment and remove the last bits of dynamic redundancy check code; Step 5-2: retain the first bits, of which the first bits are synchronization codes, followed by bits are RaptorQ coded segments; the synchronization code and the RaptorQ coded segment are converted into a byte form that can be decoded; Step 5-3, inputting the code segment converted into byte form into a RaptorQ decoder for RaptorQ decoding; Step 5-4, decode and restore the complete network stream beacon.

[0011] The present invention also provides a computer storage medium on which a computer program is stored, and the method described above is implemented when the computer program is executed.

[0012] The present invention also provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the method described is implemented when the processor executes the computer program.

[0013] Beneficial effects: Compared with the prior art, the present invention has the following advantages: 1. The design uses RaptorQ fountain code as the inner code and DRCC code as the cascade coding structure of the outer code, which can effectively deal with interference such as bit flipping, replacement, and insertion caused by poor channel environment. RaptorQ fountain code has the characteristics of cumulative restoration, and as an indefinite length code, it can achieve efficient data recovery. Dynamic redundancy check DRCC code is used as the outer code, and the correctness of the data is verified by using a new polynomial, which further improves the reliability and anti-interference ability of data transmission.

[0014] 2. The design adopts the method of adding synchronization code. In the case of poor channel environment, it can accurately locate the correct starting position of each piece of information to ensure the integrity and accuracy of data transmission. Through the marking function of the synchronization code, it can effectively deal with different types of interference in the channel and maintain the stability of data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 The present invention is a flowchart of the steps of the method.

[0016] Figure 2 Added process diagram for RaptorQ encoding and synchronization code.

[0017] Figure 3 This is a diagram of the dynamic redundancy check encoding process.

[0018] Figure 4 Diagram of the process of detecting the start marker code.

[0019] Figure 5 This is a diagram of the synchronization code detection process.

[0020] Figure 6 This is a diagram of the RaptorQ decoding process. DETAILED DESCRIPTION

[0021] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments, and the above and / or other advantages of the present invention will become more clear.

[0022] like Figure 1 As shown, a specific embodiment of the present invention discloses a network stream beacon encoding and decoding method based on RaptorQ fountain code, including: step 1, The network flow beacon of bit length is RaptorQ encoded. The value of is a multiple of 8, and the binary data obtained after encoding is processed in segments, each encoding segment consists of bits, The value range is (8,10), add before each coding segment bits of cyclic increasing synchronization code, The value range of is (4,8), then each code segment consists of bits, The value range of is (12,18), forming a continuous beacon bit sequence stream; Step 2: Add a unique bits of Dynamic Redundancy Check Code (DRCC), The value range of is (8,10), so that each code segment has check information and is extended to bits in length; added at the front of the beacon bit sequence stream bits of start marker code, The value range is (24,30); the beacon bit sequence stream with checksum information and start mark code is repeatedly copied The bit sequence stream after X , sent into the channel for transmission; The value range of is (2,5), Step 3, the beacon receiver monitors the beacon bit sequence stream after being transmitted through the channel and performs beacon detection; Step 4, after detecting the start mark code, start detecting the synchronization code in each code segment; Step 5, for the code segments marked as valid data after verification, after removing the dynamic redundancy check code, the synchronization code and RaptorQ code segment are converted into byte form and sent to the RaptorQ decoder for decoding; during the decoding process, the integrity of each code segment is first verified; after decoding is completed, the beacon information corresponding to the code stream composed of the code segments is output.

[0023] In a specific embodiment of the present invention, Figure 2As shown, step 1 includes the following steps: Step 1-1, performing RaptorQ encoding processing on the network flow beacon with a size of 16 bits to be embedded; Step 1-2, set the redundancy size to 18, and obtain a total of 160 bits of data after RaptorQ encoding, which is divided into equal segments; each encoding segment consists of 8 bits; Step 1-3, add a 4-bit cyclic increasing synchronization code before each coding segment. The synchronization code starts from

[0000] and increases by 1 each time until it increases to

[1111] and starts a further cycle. At this time, each segment consists of 12 bits, forming a continuous beacon bit sequence stream.

[0024] In this embodiment, if Figure 3 As shown, step 2 includes the following steps: Step 2-1, the basic unit segment in the beacon bit sequence code stream consists of 4 bits of synchronization code and 8 bits of RaptorQ code, and each basic unit segment has a total of 12 bits; Step 2-2, each segment of 12 bits of information is represented as , and use this information as a polynomial The coefficients of ; For example, the basic unit code segment bit information is , the polynomial is ; Step 2-3, set 8 bits of check information to , as a polynomial in the dynamic redundancy check code The coefficients of , expressed as a generating polynomial ; Step 2-4, each 12-bit message to be sent is shifted 8 bits to the left, which is equivalent to multiplying the polynomial representation by , the polynomial becomes a 12+8=20-bit polynomial ; Steps 2-5, using polynomials Divide by the generator polynomial Perform the operation to get the required 8-bit remainder , used to determine data integrity; the specific calculation is ,in, is the quotient produced during the division of polynomials; is the remainder, i.e. the dynamic redundancy check code.

[0025] Step 2-6, convert the 8-digit remainder Append to polynomial After that, each basic unit code segment of 12 bits of data completes adding a dynamic redundancy check code to form a code segment data of bits in length; Step 2-7, create a Dynamic redundancy check code table; Step 2-8, for the basic unit code segment composed of 12 bits of information 01 in all cases, the calculated 8-bit DRCC code is added to the 12 bits of information, and the calculation process is the same as step 2-1 to step 2-6, and the calculated result is put into the dynamic redundancy check code table; Step 2-9, processing the bit information in the beacon bit sequence code stream, and performing a dynamic table lookup operation using a dynamic redundancy check code table for each basic unit code segment consisting of 12 bits; Step 2-10, searching for the corresponding dynamic redundancy check code according to the 12 bits of information; Step 2-11, adding the dynamic redundancy check code found after the search to each 12-bit basic unit code segment to ensure that each data segment carries the check information; Step 2-12, add a start marker consisting of 25 01 bits in front of the beacon bit sequence code stream ; Step 2-13, after duplicating the beacon bit sequence code stream with the check information and the start mark code three times, the resulting sequence code stream is X sent into the channel for transmission.

[0026] In this embodiment, if Figure 4 As shown, step 3 includes the following steps: Step 3-1, use The dynamic window with a bit length range of (20,30) records the sequence code stream after transmission through the channel, which is recorded as the sequence code stream C .

[0027] Step 3-2, create a The matrix D ,matrix D Each element in Indicates that the first l bits into the first j bits of the start marker code T, and initialize the matrix D The zeroth row and zeroth column of Indicates the first part of the received sequence code stream C l The number of insertion, deletion, and replacement operations required between bits and empty bits; row zero , represents the number of insertion, deletion, and replacement operations required between the first j bits of the conversion from the empty bit code to the start mark code; Step 3-3, for each bit in the sequence code stream C and each bit in the start marker code T, the value is 1 ~ , j ranges from 1 to 25. If the sequence code stream The bits in the code are not equal to the start marker code bits in, then the intermediate parameter , otherwise the intermediate parameter ; Calculate and record ; Step 3-4, find the matrix D The minimum value of the last line, which is the sequence code stream C With the start tag code T Minimum number of operations between ;if , that is, the start marker code is found ; Step 3-5, if the start marker code is still not detected at the end of the sequence code stream segment; , then the network flow beacon detection fails.

[0028] In this embodiment, if Figure 5 As shown, step 4 includes the following steps: Step 4-1, start detection of the preamble of each code segment, and preset a number N that increases from 0; Step 4-2, converting the preset number N into a four-bit binary number, and comparing it with the first synchronization code after the start mark code; Step 4-3, if the comparison is consistent, the synchronization code is considered to be correct; Step 4-4, if they are not consistent, then increase the preset number N by one and continue If the synchronization code is consistent, the preset number N is increased by one, and the next synchronization code is detected within the bit range; if the synchronization code is consistent, the synchronization code is considered to be correct; if the synchronization code is inconsistent, the preset number N is increased by one, and the synchronization code is continued in the bit stream. The next synchronization code is detected within the range of bits. If they are consistent, the synchronization code is considered to be correct. If they are inconsistent, the preset number N is increased by one again. The relationship between the code stream and the preset number detection is: , until the correct synchronization code is found; Step 4-5, the code segment consisting of the pre-corrected synchronization code and the 8 bits thereafter is mapped using a dynamic mapping method of a dynamic redundancy check code table to obtain a check value for the code segment; Step 4-6, compare the check value with the synchronization code and the 8 bits after the encoding segment in the code stream; if they are consistent, it means that this segment of information is complete and correct, and the code segment is retained and marked as valid data; if they are inconsistent, the code segment is discarded; Step 4-7, when the total number of bits in the code segment reaches the threshold of 36 bits, stop the detection; if the number of bits does not reach the threshold before the next start marker code is detected, continue to detect the synchronization code after the next start marker code, and repeat the above process; Step 4-8: If the threshold is still not reached after all code streams in the code segment are detected, the beacon detection fails.

[0029] In this embodiment, if Figure 6 As shown, step 5 includes the following steps: Step 5-1, for the code segments marked as valid data after verification, use the synchronization code to distinguish each code segment. Remove the last 8 bits of dynamic redundancy check code in the code segment; Step 5-2, retain the first 12 bits in each code segment, of which the first 4 bits are the synchronization code and the last 8 bits are the RaptorQ coding segment; convert the synchronization code and the RaptorQ coding segment into a decodable byte form, wherein the 4-bit synchronization code is filled with 4 0 bits in front and converted into a byte form.

[0030] Step 5-3, inputting the code segment converted into byte form into a RaptorQ decoder for RaptorQ decoding; Step 5-4, decode and restore the complete network stream beacon.

[0031] The present invention provides a network stream beacon encoding and decoding method based on RaptorQ fountain code. There are many methods and ways to implement the technical solution. The above is only a preferred implementation of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present invention. These improvements and modifications should also be regarded as the protection scope of the present invention. All components not specified in this embodiment can be implemented by existing technologies.

Claims

1. A network stream beacon encoding and decoding method based on RaptorQ fountain code, characterized in that: The following steps are involved: Step 1: Place the The network flow beacon of bit length is RaptorQ encoded. The value of is a multiple of 8, and the binary data obtained after encoding is processed in segments, each encoding segment consists of bits, added before each coded segment bits of cyclic increasing synchronization code, each code segment consists of bits, forming a continuous beacon bit sequence stream; Step 2: Add a unique bits of dynamic redundancy check code, so that each code segment has check information and is extended to bits in length; added at the front of the beacon bit sequence stream bits of start marker code; Repeat the beacon bit sequence stream with checksum information and start marker code The bit sequence stream after X , sent into the channel for transmission; Step 3, the beacon receiver monitors the beacon bit sequence stream after being transmitted through the channel and performs beacon detection; Step 4, after detecting the start mark code, start detecting the synchronization code in each code segment; Step 5, for the code segments marked as valid data after verification, after removing the dynamic redundancy check code, the synchronization code and RaptorQ code segment are converted into byte form and sent to the RaptorQ decoder for decoding; during the decoding process, the integrity of each code segment is first verified; after decoding is completed, the beacon information corresponding to the code stream composed of the code segments is output.

2. The method according to claim 1, characterized in that Step 2 contains the following steps: Step 2-1, each code segment in the beacon bit sequence code stream bits, by Bit synchronization code and The basic unit segment is composed of a RaptorQ coding segment; The bit information is represented as , in Indicates the first bit of information, Indicates bits of information, Each bit of information in the bits represents the bit information of the basic unit segment 0 or 1, and the bit information of the basic unit segment is used as a polynomial The coefficients of each code segment bits of data are represented as polynomials ; Step 2-2, use dynamic redundancy check code, set The bit check information is ,in Indicates bits of checksum information, Indicates the first bit check information. Each bit check information indicates bit check information 0 or 1. The bit check information is also expressed as a polynomial The coefficients of the check information are expressed as polynomials ; Step 2-3, each code segment to be sent bits of information shifted left bits, equivalent to multiplying by in the polynomial representation , the polynomial becomes Polynomial of bits ; Steps 2-4, using polynomial Divide by polynomial Perform the operation to get the required remainder , used to determine data integrity, the specific calculation is: , in, is the quotient produced during the division of polynomials; is the remainder, indicating the dynamic redundancy check code; Step 2-5, the remainder Append to polynomial After that, each code segment bits of data to complete the addition of dynamic redundancy check code; finally, each code segment includes the original bits of information and additional bits of dynamic redundancy check code, forming a length of bits of code segment data; Step 2-6, create a dynamic redundancy check code table for storage bits of information to generate a dynamic redundancy check code; The dynamic redundancy check code generated by the information in all cases of bits is stored in it to form a Dynamic redundancy check code table of elements; Step 2-7, for each bits, and use a dynamic redundancy check code table to perform dynamic table lookup operations; The corresponding dynamic redundancy check code is searched for each bit of information, and the dynamic redundancy check code is added to each basic unit code segment to ensure that each segment of data carries the check information; Step 2-8, add in front of the sequence code stream The start mark code composed of bits 0 and 1 generates a beacon bit sequence code stream, and the new code stream with check information and the start mark code is copied repeatedly After that, the obtained beacon bit sequence stream X sent into the channel for transmission.

3. The method according to claim 2, characterized in that Step 3 includes the following steps: Step 3-1, monitor the code stream after transmission through the channel, and use the length The dynamic window records the passing code stream and records it as a sequence code stream C ; Step 3-2, create a The matrix D ,matrix D Each element in Indicates that the first l bits into the first j bits of the start marker code T, and initialize the matrix D The zeroth row and zeroth column of Indicates the first part of the received sequence code stream C l The number of required insertion, deletion, and replacement operations between bits and empty bits; the zeroth row element Represents the number of insertion, deletion, and replacement operations required between the first j bits of the transition from the null bit code to the start mark code; Step 3-3, for each bit in the sequence code stream C and each bit in the start marker code T, l The value is 1 ~ , j takes the value of 1 ~ If the sequence code stream The bits in the code are not equal to the start marker code bits in, then the intermediate parameter , otherwise the intermediate parameter ; Calculate and record ; Step 3-4, find the matrix D The minimum value of the last line, the minimum value is the sequence code stream C With the start tag code T Minimum number of operations between ;if , that is, it is determined that the start mark code is found T ; Step 3-5: If the start marker code is not detected at the end of the sequence code stream C T , then the beacon detection fails.

4. The method according to claim 3, characterized in that Step 4 includes the following steps: Step 4-1, start the detection of the preamble of each code segment, and preset a value that increases from 0 Bit binary number N; Step 4-2, compare the preset number N with the first synchronization code after the start mark code, if they are consistent, the synchronization code is determined to be correct; if they are inconsistent, the preset number N is increased by one, and the synchronization code is continued in the code stream. The next synchronization code is detected within the bit range. If they are consistent, the synchronization code is determined to be correct. If they are inconsistent, the preset number N is increased by one again, and the synchronization code is continued in the bit stream. The next synchronization code is detected within the range of bits until the correct synchronization code is found; the relationship between the code stream and the preset number detection is: ; Step 4-3, the pre-correct synchronization code and the pre-correct synchronization code bits, and use a dynamic mapping method of a dynamic redundancy check code table to obtain the check bit value of the code segment through mapping; Step 4-4, compare the check bit value with the first bits to The code segments composed of bits are compared. If they are consistent, it means that the code segments in the code stream are complete and correct. The code segments are retained and marked as valid data. If they are inconsistent, the code segments are discarded. Step 4-5: When the total number of bits in the code segment reaches the threshold When the threshold , stop detection; if the number of all bits in the code segment does not reach the threshold before the next start marker code is detected , then continue to detect the synchronization code after the next start mark code, and repeat steps 4-1 to 4-4; Step 4-6: After the detection is completed, the number of all bits in the code segment still does not reach the threshold , then the beacon detection fails.

5. The method according to claim 4, characterized in that Step 5 includes the following steps: Step 5-1: For the code segments marked as valid data after verification, use the synchronization code to distinguish each code segment and remove the last bits of dynamic redundancy check code; Step 5-2: retain the first bits, of which the first bits are synchronization codes, followed by bits are RaptorQ coded segments; the synchronization code and the RaptorQ coded segment are converted into a byte form that can be decoded; Step 5-3, inputting the code segment converted into byte form into a RaptorQ decoder for RaptorQ decoding; Step 5-4, decode and restore the complete network stream beacon.

6. A computer storage medium having a computer program stored thereon, characterized in that: When the computer program is executed, the method according to any one of claims 1 to 5 is implemented.

7. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 5 is implemented.

Citation Information

Patent Citations

  • Establishment and maintenance method of cognitive radio communication link based on non-rate code

    CN102026247A

  • Data transmission method and communication device

    CN113381838A

  • Method and apparatus for wireless communication using flexible coding rate

    WO2021238665A1