An encoding method, apparatus, device and readable storage medium

Abstract

This application discloses an encoding method, apparatus, device, and readable storage medium. From each position of the bit sequence corresponding to a modulation symbol, positions satisfying preset conditions are obtained as first-class positions. The preset conditions include the top m positions based on misclassification probability, where m is a preset ranking threshold. A first-class bit set and a second-class bit set are obtained, where the remainder of the first-class bit position and the length of the bit sequence corresponding to the modulation symbol equals the value of the first-class position. The first-class bits are encoded to obtain first-class RS symbols, and the second-class bits are encoded to obtain second-class RS symbols. The first-class RS symbols and the second-class RS symbols are concatenated to obtain an interleaving result sequence of the substring to be interleaved. The correspondence between the bit positions in the substring to be interleaved and their positions in the interleaving result sequence is obtained, generating an interleaver pattern. This application centrally RS-encodes bits with a high misclassification probability, thereby improving the error correction capability of RS encoding.

Description

Technical Field

[0001] This application relates to the field of digital communication technology, and in particular to an encoding method, apparatus, device and readable storage medium. Background Technology

[0002] In digital communication systems, the channel encoder at the transmitting end is used to introduce redundant information into the information bits according to certain rules so that the channel decoder at the receiving end can correct bit errors that occur when the information is transmitted on the channel to a certain extent.

[0003] RS coding is a linear error-correcting code with strong error-correcting capabilities. It has a strong ability to correct random errors and certain burst errors. Therefore, RS coding is widely used in modern communication systems and data storage systems.

[0004] To fully utilize the error correction capabilities of channel coding, an interleaver is typically added at the transmitter. Traditional interleavers are used to disperse concentrated errors that occur burstily during channel transmission, making previously uncorrectable error patterns correctable and improving channel decoding performance. However, traditional interleavers cannot achieve the goal of enhancing the error correction capabilities of RS coding. Summary of the Invention

[0005] This application provides an encoding method, apparatus, device, and readable storage medium, as follows:

[0006] An encoding method, comprising:

[0007] The data to be encoded is concatenated and encoded to obtain the RS encoded sequence;

[0008] The interleaving substring is obtained based on the RS encoding sequence. The interleaving substring is a bit sequence with a length equal to a first preset value. The first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol.

[0009] From each position of the bit sequence corresponding to the modulation symbol, obtain the position that meets the preset conditions as the first type of position. The preset conditions include the top m positions in the misjudgment probability ranking, where m is a preset ranking threshold.

[0010] Obtain a first type of bit set and a second type of bit set. The first type of bit set includes multiple first type bits, which are bits located at the target position in the substring to be interleaved. The second type of bit set includes multiple second type bits, which are bits in the substring to be interleaved other than the first type bits. The target position satisfies the condition that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit.

[0011] RS encoding is performed on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol; RS encoding is performed on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol;

[0012] By concatenating the first type of RS symbols and the second type of RS symbols, the interleaving result sequence of the substring to be interleaved is obtained;

[0013] Obtain the correspondence between the position of each bit in the substring to be interleaved and the position of each bit in the interleaving result sequence of the substring to be interleaved, and generate the interleaver pattern corresponding to the substring to be interleaved.

[0014] Optionally, the data to be encoded is concatenated to obtain an RS-encoded sequence, including:

[0015] Obtain the bit sequence of the data to be encoded, and divide the bit sequence of the data to be encoded into multiple short frame bit sequences of the data to be encoded.

[0016] Convolutional encoding is performed on multiple short frame bit sequences of the data to be encoded to obtain multiple short frame bit sequences with convolutional encoding.

[0017] At least several short frame bit sequences of the convolutional encoding are subjected to RS encoding to obtain the RS encoded sequence.

[0018] Optionally, at least the multiple short frame bit sequences of the convolutional coding are subjected to RS coding to obtain the RS-coded sequence, including:

[0019] The multiple short frame bit sequences of the convolutional coding are grouped and interleaved to obtain interleaved coded short frame bit sequences;

[0020] The interleaved encoding of each short frame bit sequence is scrambled to obtain a scrambled encoded short frame bit sequence;

[0021] RS encoding is performed on all short frame bit sequences of the scrambling encoding to obtain the RS encoded sequence.

[0022] Optionally, obtaining the substring to be interleaved based on the RS-encoded sequence includes:

[0023] The RS-encoded sequence is mapped to a binary domain to obtain multiple bit sequences to be interleaved;

[0024] The bit sequence to be interleaved is segmented to obtain multiple first-type substrings, the length of which is the first preset value.

[0025] At least one of the multiple first-class substrings is taken as the substring to be interleaved.

[0026] Optionally, after generating the interleaver pattern corresponding to the substring to be interleaved, the method further includes:

[0027] Based on the interleaver pattern corresponding to the substring to be interleaved, other first-class substrings are interleaved and encoded to obtain the interleaving result sequence of the other first-class substrings. The other first-class substrings include first-class substrings other than the substring to be interleaved among the plurality of first-class substrings.

[0028] Based on the interleaving result sequence of each of the plurality of first-class substrings, the interleaving result of the bit sequence to be interleaved is generated;

[0029] Based on the interleaving results of each of the multiple bit sequences to be interleaved, the interleaving result of the RS encoded sequence is generated.

[0030] Optionally, from each bit position of the bit sequence corresponding to the modulation symbol, bits that satisfy preset conditions are obtained as the first type of bits, including:

[0031] Traverse each constellation point in the preset constellation diagram, and determine whether the target bit of the bit sequence corresponding to the modulation symbol indicated by the constellation point is misjudged if the constellation point is misjudged. If so, increment the count value of the target bit by 1. The target bit includes any bit of the bit sequence corresponding to the modulation symbol.

[0032] After traversal, the count value of each position of the bit sequence corresponding to the modulation symbol is obtained. The count value of the target position is used to indicate the misjudgment probability of the bit located at the target position. The positions are sorted from largest to smallest according to the count value. The positions that meet the counting conditions are selected as the first type of positions. The counting conditions include the first m in the sorting and the count value is greater than a preset quantity threshold.

[0033] Optionally, cases where constellation points are misjudged include:

[0034] The constellation point was incorrectly identified as a constellation point adjacent to the constellation point on the constellation map.

[0035] An encoding device, comprising:

[0036] Concatenated coding unit, used to concatenately encode the data to be encoded to obtain the RS encoded sequence;

[0037] The interleaving substring acquisition unit is used to acquire the substring to be interleaved based on the RS encoding sequence. The substring to be interleaved is a bit sequence with a length equal to a first preset value. The first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol.

[0038] The modulation sequence partitioning unit is used to obtain the sequence positions that meet the preset conditions from each sequence position of the bit sequence corresponding to the modulation symbol, and use them as the first type of sequence positions. The preset conditions include the top m in the misjudgment probability ranking, where m is a preset ranking threshold.

[0039] A bit classification unit is used to obtain a first type of bit set and a second type of bit set. The first type of bit set includes multiple first type bits, which are bits located at the target position in the substring to be interleaved. The second type of bit set includes multiple second type bits, which are bits in the substring to be interleaved other than the first type bits. The value of the target position satisfies that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit.

[0040] A bit encoding unit is used to perform RS encoding on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol; and to perform RS encoding on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol;

[0041] The first interleaving coding unit is used to concatenate the first type of RS symbols and the second type of RS symbols to obtain the interleaving result sequence of the substring to be interleaved;

[0042] The interleaving pattern generation unit is used to obtain the correspondence between the position of the bit in the substring to be interleaved and the position of the bit in the interleaving result sequence of the substring to be interleaved, and to generate the interleaver pattern corresponding to the substring to be interleaved.

[0043] An encoding device includes: a memory and a processor;

[0044] The memory is used to store programs;

[0045] The processor is used to execute the program and implement the various steps of the encoding method.

[0046] A readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the various steps of an encoding method.

[0047] As can be seen from the above technical solutions, the encoding method, apparatus, device, and readable storage medium provided in this application embodiment perform concatenated encoding on the data to be encoded to obtain an RS encoding sequence. Based on the RS encoding sequence, an interleaved substring is obtained, the length of which is a first preset value, which is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol. From each position of the bit sequence corresponding to the modulation symbol, positions satisfying preset conditions are obtained as first-type positions. A first-type bit set and a second-type bit set are obtained, the first-type bit set including multiple first-type bits and the second-type bit set including multiple second-type bits. RS encoding is performed on the multiple first-type bits in the first-type bit set to obtain first-type RS symbols. RS encoding is performed on the multiple second-type bits in the second-type bit set to obtain second-type RS symbols. The first-type RS symbols and the second-type RS symbols are concatenated to obtain an interleaving result sequence of the substring to be interleaved. The correspondence between the positions of bits in the substring to be interleaved and their positions in the interleaving result sequence of the substring to be interleaved is obtained, and an interleaver pattern corresponding to the substring to be interleaved is generated. Since the preset conditions include the top m bits in the misclassification probability ranking, and the first type of bits are the bits located at the target position in the substring to be interleaved, the target position satisfies that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of position. Therefore, the position of the first type of bits in the substring to be interleaved corresponds to the first type of position of a modulation symbol. That is, the position of the first type of bits in the substring to be interleaved belongs to the position with a higher misclassification probability. It can be seen that this application divides the first type of bits and the second type of bits according to the misclassification probability, and obtains two types of RS symbols by performing RS encoding based on the first type of bits and the second type of bits respectively, so that the bits located at the positions with a higher misclassification probability in the substring to be interleaved can be concentrated in the first type of RS symbols, thereby maximizing the error correction capability of RS encoding. Attached Figure Description

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

[0049] Figure 1 A flowchart illustrating a specific implementation of an encoding method provided in this application embodiment;

[0050] Figure 2 An encoding diagram illustrating an encoding method provided in an embodiment of this application;

[0051] Figure 3 This example illustrates the arrangement of constellation points in a constellation chart.

[0052] Figure 4 This is a schematic diagram of a constellation traversal result provided in an embodiment of this application;

[0053] Figure 5 A flowchart illustrating an encoding method provided in an embodiment of this application;

[0054] Figure 6 A schematic diagram of a grouping interleaving method provided in an embodiment of this application;

[0055] Figure 7 This is a schematic diagram illustrating the encoding effect provided in an embodiment of this application;

[0056] Figure 8 This is a schematic diagram of the structure of an encoding device provided in an embodiment of this application;

[0057] Figure 9 This is a schematic diagram of the structure of an encoding device provided in an embodiment of this application. Detailed Implementation

[0058] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0059] The transmitting end of a digital communication system typically includes components such as a source, source encoder, channel encoder, and modulator, while the receiving end typically includes a demodulator, channel decoder, source decoder, and sink.

[0060] Channel encoders are used to introduce redundant information into information bits according to certain rules so that the channel decoder at the receiving end can correct bit errors that occur during information transmission over the channel to a certain extent. Common channel coding methods include bit XOR codes, block codes, BCH codes, RS codes, fountain codes, LDPC codes, turbine codes, polar codes, and convolutional codes. Different channel coding methods typically have different applicable scenarios. Among them, RS codes are a type of linear error-correcting code with strong error-correcting capabilities, possessing a strong ability to correct random errors and a certain degree of burst errors, and are widely used in modern digital communication and data storage systems.

[0061] To achieve higher error correction capabilities, the channel encoder uses the concatenation of two short codes to form a long code, resulting in a serial concatenated code. This two-stage coding enables two-stage error correction. Specifically, the channel encoder includes an external encoder connected to the source side and an internal encoder connected to the channel side. The external code of the concatenated code typically uses block codes that correct burst errors, such as RS codes or Fal codes, while the internal code typically uses convolutional codes with lower constraints. For example, the NASA code, a space standard code, is a serial concatenated code with an external code of (255, 233) and an internal code of (2, 1, 7) convolutional codes.

[0062] To fully utilize the error correction capabilities of channel coding, an interleaver is often added to the channel encoder, and correspondingly, a deinterleaver is added at the receiver. An interleaver is essentially a device that alters the information structure without changing the information content. Existing interleavers are used to disperse concentrated errors that occur burstily during channel transmission to the greatest extent possible, making previously uncorrectable error patterns correctable and improving the performance of channel decoding. For example, to enhance error correction capabilities, a 5×255 interleaver is added between the outer and inner encoders in the NASA code coding scheme to implement the interleaving method between RS coding and convolutional code coding.

[0063] However, existing concatenated code structures are generally suitable for satellite communication scenarios. For example, the concatenated code structure of RS-encoded sequences (represented by NASA codes) with outer codes and inner codes (convolutional codes) can correct random errors in received signals in satellite communication scenarios. Since convolutional codes are primarily used to correct random errors, their ability to correct burst errors is limited. Furthermore, uncorrected burst errors, after deinterleaving, become more dispersed, which is detrimental to RS decoding and burst error correction. Therefore, existing concatenated code structures are not suitable for correcting burst errors in received signals; for example, they are not suitable for correcting burst errors present in received signals in terrestrial wireless communication scenarios.

[0064] Therefore, the inventors of this application have discovered that the structure of using convolutional codes as external codes for single-frame encoding and RS codes as internal codes for multi-frame joint encoding not only increases the encoding constraint length and has stronger error correction capabilities, but also can correct random and burst errors in signal transmission.

[0065] Traditional interleavers are used to disperse burst errors generated during channel transmission to the greatest extent possible. However, RS-coded sequences are decoded symbol by symbol. Therefore, traditional interleavers cannot enhance the error correction capability of RS coding. Based on this, to maximize the error correction capability of RS coding and ensure that burst errors are concentrated in RS symbols after sorting, the coding method provided in this application interleaves the RS-coded bit sequence according to the bit symbol mapping relationship of the signal constellation to obtain the coding result.

[0066] Figure 1 This example illustrates a specific implementation flow of the encoding method provided in this application, such as... Figure 1 As shown, this method specifically includes:

[0067] S101. Obtain the bit sequence of the data to be encoded, divide the bit sequence of the data to be encoded, and obtain multiple short frame bit sequences of the data to be encoded.

[0068] It should be noted that the specific methods for dividing the bit sequence of the data to be encoded can be found in existing technologies.

[0069] S102. Perform convolutional encoding on multiple short frame bit sequences of the data to be encoded to obtain multiple short frame bit sequences of convolutional code.

[0070] S103. Group and interleave the short frame bit sequences of the convolutional code to obtain the interleaved coded short frame bit sequences.

[0071] In this embodiment, a group interleaver is used to interleave the short frame bit sequences of the convolutional code. For specific interleaving methods, please refer to the prior art.

[0072] S104. Scramble the interleaved short frame bit sequences to obtain scrambled coded short frame bit sequences.

[0073] In this embodiment, the specific method for scrambling the bit sequences of each short frame in the interleaved encoding is described in the prior art.

[0074] S105. Perform RS encoding on all short frame bit sequences that have been scrambled to obtain RS encoded sequences.

[0075] In this embodiment, the RS encoding sequence is a multi-frame symbol sequence. Specifically, the RS encoding sequence consists of multiple RS symbols. It should be noted that any RS symbol is a code element obtained by RS encoding a short frame bit sequence based on scrambling encoding.

[0076] It should be noted that the specific methods for RS encoding can be found in existing technologies.

[0077] S106. Map the RS encoded sequence to the binary domain to obtain multiple bit sequences to be interleaved.

[0078] In this embodiment, each RS symbol in the RS encoded sequence is mapped to a binary field according to the bit width of the RS symbol to obtain the bit sequence corresponding to each RS symbol, which is used as a bit sequence to be interleaved. For example, if the RS encoded sequence is a multi-frame symbol sequence [17,289,30,…], each symbol in the sequence is directly converted into binary. Taking symbol 17 as an example, the bit width of the RS encoded sequence is 8. Mapping 17 to a binary field yields the bit sequence 00010001. The bit sequence 00010001 is used as a bit sequence to be interleaved.

[0079] Figure 2 A schematic diagram of an encoding method provided in an embodiment of this application is shown below. Figure 2 As shown, the bit sequence of the data to be encoded is divided into K short frame bit sequences, namely short frame bit sequence 1 to short frame bit sequence K. After convolutional coding, the K short frame bit sequences of the convolutional code are obtained, which are called the convolutional coding sequence, as shown below. Figure 2 The convolutional coding sequences shown are 1 to K. After grouping and interleaving, K short frame bit sequences with interleaving codes are obtained, which are called convolutional interleaving sequences, namely convolutional interleaving sequence 1 to convolutional interleaving sequence K.

[0080] The K short frame bit sequences obtained after scrambling are called the scrambling coded sequences, such as... Figure 2 The scrambling encoded sequences 1 to K are shown. RS encoding is performed on scrambling encoded sequences 1 to K to obtain RS encoded sequences, also known as concatenated RS inner codes. Mapping the RS inner codes to a binary field yields multiple bit sequences to be interleaved, i.e. Figure 2 The L1 to LM diagrams are shown, where M is the number of bit sequences to be interleaved.

[0081] Understandably, the length of the data increases after RS ​​encoding. For example, if the length before encoding is K*N, the length after encoding is M*N, so M>K, where r is the length of the scrambling encoded sequence and the bit sequence to be interleaved.

[0082] Next, for each bit sequence to be interleaved, the following steps S107 to S115 are performed:

[0083] S107. The bit sequence to be interleaved is divided sequentially to obtain multiple substrings that satisfy the first preset condition, which are used as the first type of substrings.

[0084] In this embodiment, the first preset condition includes the number of bits (i.e., the length) being equal to the first preset value. The first preset value is determined by the number of bits corresponding to the preset modulation symbol (denoted as the first bit number) and the number of bits corresponding to the preset RS symbol (denoted as the second bit number). Specifically, the first preset value is equal to the common multiple of the first bit number and the second bit number.

[0085] It should be noted that the method for sequentially dividing the bit sequence to be interleaved includes: dividing each bit of a first preset value into a substring according to its position from smallest to largest; if the number of bits in the bit sequence to be interleaved that have not been divided into substrings is less than the first preset value, then zeros are added to obtain the substring. It can be understood that each substring includes the number of bits of the first preset value, and the bits in each substring are consecutive and do not overlap.

[0086] like Figure 2 As shown, taking Lm of length N, the first number of bits as p, and the second number of bits as q as an example, the first preset value is equal to the common multiple of p and q, denoted as n. This step divides the bit sequence to be interleaved into N / n = I (rounded up) first-class substrings, that is... Figure 2 In the Lm1~LmI substring, any first-class substring Lmi is binary data of length n, and the n bits are consecutive bits in Lm. If the number of remaining bits is less than n, zeros are added. For details, please refer to the existing technology.

[0087] S108. Based on the preset constellation diagram, obtain the count value of each modulation sequence bit.

[0088] In this embodiment, the bit sequence corresponding to any modulation symbol includes a first set of bits arranged in modulation order. The constellation diagram includes constellation points arranged according to a preset rule, and each constellation point represents a bit sequence corresponding to a modulation symbol.

[0089] In this embodiment, the method for obtaining the count value of the modulation sequence bit includes:

[0090] The initial value of the count value of each modulation bit is 0. Traverse each constellation point in the constellation diagram and determine whether the bits in each modulation bit of the bit sequence corresponding to the target constellation point are misjudged if the target constellation point is misjudged as an adjacent constellation point. If so, increment the count value of the modulation bit by 1.

[0091] Taking the first bit count p=6 as an example, one modulation symbol corresponds to a bit sequence of length 6. Therefore, the total number of bit sequences corresponding to all modulation symbols is 64. In this embodiment, a 64QAM (Quadrature Amplitude Modulation 64) constellation is used as an example. Figure 3The diagram shows a rectangular 64QAM constellation. This constellation has 64 constellation points, each corresponding to a bit sequence of length 6, as shown below. Figure 3 As shown, constellation points correspond one-to-one with the bit sequences of modulation symbols. A 64QAM constellation has three types of constellation points: corner, edge, and interior. The constellation point corresponding to the bit sequence 101100 is located at a corner of the constellation, the constellation point corresponding to the bit sequence 101110 is located on an edge of the constellation, and the constellation point corresponding to the bit sequence 101111 is located inside the constellation. It can be seen that a corner constellation point has two nearest neighbors (the neighbors of 101100 are 101110 and 101101), an edge constellation point has three neighbors (the neighbors of 101110 are 101100, 100110, and 101111), and an interior constellation point has four neighbors (the neighbors of 101111 are 101110, 101101, 100111, and 101011).

[0092] Due to noise and interference, the constellation points on the receiving side will shift. Under high signal-to-noise ratio, the constellation points will jitter around the theoretical position. Therefore, if a misjudgment occurs, the probability of being misjudged as a neighboring constellation point is much greater than other misjudgment situations. Therefore, in this embodiment, when traversing constellation points, it is assumed that the constellation point is misjudged and misjudged as a neighboring constellation point. By statistically analyzing the modulation sequence of the misjudged bits, the modulation sequence with a higher probability of misjudgment is obtained.

[0093] Taking the bit sequence corresponding to the target constellation point as 101111 as an example, if 101111 is misclassified as the neighboring constellation point 101101, the first, second, third, fourth, and sixth bits are not misclassified, so the count values ​​of these five modulation bits remain unchanged. However, the fifth bit (bit 1) is misclassified as 0, so the count value of the fifth bit is incremented by 1. Similarly, if 101111 is misclassified as the neighboring constellation point 101011, and the fourth bit (bit 1) is misclassified as 0, then the count value of the fourth bit is incremented by 1. If 101111 is misclassified as the neighboring constellation point 100111, and the third bit (bit 1) is misclassified as 0, then the count value of the third bit is incremented by 1. If 101111 is misclassified as the neighboring constellation point 101110, and the sixth bit (bit 1) is misclassified as 0, then the count value of the sixth bit is incremented by 1. That is, since the four possible misjudgments will only cause the lower four bits to misjudge once each, the count values ​​of the lower four bits are incremented by 1 respectively, while the count values ​​of the higher two bits remain unchanged (represented by 0). After traversing the target constellation points, the increments of the count values ​​of each modulation sequence bit are [001111].

[0094] Figure 4 An example is provided to illustrate the traversal results, such as... Figure 4As shown, the position number (identifier of modulation sequence) of the binary bit (i.e., bit sequence) corresponding to any 64QAM constellation symbol (modulation symbol) is [012345], and the initial sequence number (count value) is [000000]. After traversing all 64QAM modulation symbols according to the above method, the result of the sequence number count is [2236363636]. The above statistics are performed on all 64 constellation points to obtain the count value of each modulation sequence position. The count value of the modulation sequence position is used to identify the probability of misjudgment of the bit located at that modulation sequence position. The count value results show that the misjudgment probability of the lower 4 bits is significantly higher than that of the higher 2 bits.

[0095] Next, for each substring of the first type, the following steps S110 to S114 are performed:

[0096] S109. Sort each modulation sequence position according to the count value from largest to smallest, select the modulation sequence position that meets the preset counting condition as the first type of sequence position, and the other modulation sequence positions as the second type of sequence position.

[0097] In this embodiment, the counting conditions include the count value being ranked in the top g positions, a ranking threshold, and the count value being greater than a preset counting threshold, where g is a preset quantity threshold.

[0098] like Figure 2 As shown, the modulation symbol can be represented as binary data x. p-1 +x p-2 +K+x 1 +x 0 Let i (i∈[0,p-1]) represent {x i The ordinal position of}, a i Let g represent the count value of i. Since g = p - 2, the first g positions of the count value are from 2 to p - 1. Therefore, the first type of position includes 2 to p - 1, and the second type of position includes 0 and 1.

[0099] S110. Sequentially divide the first type of substrings to obtain multiple substrings that satisfy the second preset condition, and use them as the second type of substrings.

[0100] In this embodiment, the second preset condition includes the number of bits being equal to the second preset quantity, and the second preset quantity being equal to the number of bits in the bit sequence corresponding to the modulation symbol, which is also the first number of bits.

[0101] Specifically, the first type of substring Lmi can be represented as x n-1 +x n-2 +K+x 1 +x 0 Based on the first bit count p, the first type of substring is divided into n / p segments, resulting in n / p = J second type substrings, that is... Figure 2In the sequence l1 to lJ, any substring of the second type is a bit sequence of length p. It should be noted that the specific grouping method is described in S107.

[0102] S111. In each second-class substring, the bits with the first-class rank are taken as first-class bits, and the bits with the second-class rank are taken as second-class bits.

[0103] like Figure 2 As shown, each second-class substring includes p bits, the first-class bits include 2 to p-1, and the second-class bits include 0 and 1. Therefore, by taking the bits with positions 2 to p-1 in each second-class substring as first-class bits, we obtain a set of A first-class bits. Figure 2 The image shows the shading, where the bits with positions 0 and 1 in each second-type substring are taken as second-type bits, resulting in a set of B second-type bits.

[0104] S112. Sequentially map several first-type bits of the second bit to an RS symbol to obtain at least one first-type RS symbol. Sequentially map several second-type bits of the second bit to an RS symbol to obtain at least one second-type RS symbol.

[0105] In this embodiment, the length of the bit sequence corresponding to the RS symbol is the second number of bits, i.e., q.

[0106] Continuing from the previous example, such as Figure 2 As shown, the first type of bit set Mapped to RS symbol RS a 1 ~RS a r1 The second type of bit set Mapped to RS symbol RS b 1 ~RS b r2 Where r1 represents the number of first-class RS symbols, r1 = A / q, and r2 represents the number of first-class RS symbols, r2 = B / q.

[0107] S113. Concatenate each first-type RS symbol and each second-type RS symbol to obtain the interleaving result sequence of the first-type substring.

[0108] like Figure 2 As shown, RS a 1 ~RS a r1 and RS b 1 ~RS b r2The interleaved sequence of Lmi is obtained by splicing.

[0109] S114. Based on the mapping relationship between the position of the bit in the first type of substring and the position of the bit in the corresponding bit sequence of the interleaving result sequence, generate the interleaver pattern of the first type of substring.

[0110] In this embodiment, the binary data representation of the first type of substring is x. n-1 +x n-2 +K+x 1 +x 0 The binary data representation of the bit sequence corresponding to the interleaving result of the first type of substring is y. n-1 +y n-2 +K+y 1 +y 0 Then x n-1 +x n-2 +K+x 1 +x 0 With y n-1 +y n-2 +K+y 1 +y 0 The mapping relationship between them is called the interleaver pattern, which includes the correspondence between the pre-interleaving sequence and the post-interleaving sequence.

[0111] It should be noted that this scheme can obtain the interleaving result sequence and interleaver pattern of each first type of substring according to S110 to S114 above.

[0112] S115. Based on the interleaving result sequence of each first-class substring, obtain the interleaving result of the bit sequence to be interleaved.

[0113] It should be noted that this scheme performs interleaving encoding on each bit sequence to be interleaved according to S107 to S115 above, obtaining the interleaving result sequence of each bit sequence to be interleaved, as follows: Figure 2 As shown, the interleaving result sequence of L1 to LM is obtained.

[0114] S116. Based on the interleaving results of each bit sequence to be interleaved, the encoding result of the data to be encoded is obtained.

[0115] As can be seen from the above technical solutions, the encoding method provided in this application adopts a scheme of single-frame convolutional coding and multi-frame joint RS coding, which increases the coding constraint length and improves the error correction capability. On the other hand, the use of RS coding sequence as internal code can simultaneously cope with random errors and burst errors in signal transmission.

[0116] This scheme obtains the error-prone bits in each first-class substring that are in the signal constellation, i.e., the bits whose positions in the second-class substring belong to the first-class positions. By mapping the error-prone bits and mapping the other bits respectively, the bits in the first-class substring are rearranged so that the error-prone bits in the first-class substring are concentrated in the RS symbol after deinterleaving at the receiving end, thereby maximizing the error correction capability of RS coding.

[0117] It should be noted that, Figure 1 This application only illustrates the flow of one specific implementation method. In other embodiments, this application may also include other specific implementation methods. For example, the application scenarios of this application are not limited to... Figure 1 The concatenated coding scenario shown, namely, S101 to S106, provides a specific method for concatenating and coding the data to be coded to obtain the RS coding sequence. In other optional embodiments, the RS coding sequence to be interleaved in this application can be obtained by other concatenated coding methods.

[0118] For example, in an optional embodiment, after obtaining the interleaving result sequence and interleaver pattern of the substrings to be interleaved (any one or more first-type substrings can be used as interleaved substrings) of the bit sequence to be interleaved based on S110-S114, each of the other first-type substrings is interleaved according to the interleaver pattern of the substrings to be interleaved, to obtain the interleaving result sequence of the other first-type substrings. The other first-type substrings include the first-type substrings other than the substring to be interleaved from the multiple first-type substrings that make up the bit sequence to be interleaved. Still using... Figure 2 For example, after obtaining the interleaving result sequence and interleaver pattern of Lmi based on S110~S114, the interleaver pattern of Lmi is used as the standard interleaver pattern, and Lmj (j≠i and j∈[1,I]) is interleaved according to the standard interleaver pattern to obtain the interleaver pattern of Lmj. It can be understood that using a unified interleaver pattern can improve coding efficiency.

[0119] For example, Figure 2 The process shown does not limit the execution order or number of executions between each step. In one optional embodiment, S108-S109 provides a specific method for obtaining the first type of sequence position of the modulation symbol. In another optional embodiment, according to S108-S109, the first type of sequence position of the modulation symbol is obtained for each type of modulation symbol, and the correspondence between the modulation symbol and the first type of sequence position is recorded. In this scheme, after determining the modulation symbol to be encoded, the first type of sequence position corresponding to the modulation symbol to be encoded can be obtained from the pre-recorded correspondence.

[0120] In summary, the encoding method provided in this application embodiment can be summarized as follows: Figure 5The flowchart shown is as follows: Figure 5 As shown, this method includes:

[0121] S501. Concatenate encoding is performed on the data to be encoded to obtain the RS encoded sequence.

[0122] S502. Obtain the substring to be interleaved based on the RS encoding sequence.

[0123] In this embodiment, the substring to be interleaved is a bit sequence with a length equal to a first preset value, where the first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol.

[0124] It should be noted that there are multiple ways to obtain the substring to be interleaved based on the RS encoding sequence. For example, in the case of concatenated code encoding, after obtaining the first type of substring with a length of the first preset value obtained by dividing the bit sequence to be interleaved through S101 to S107, at least one first type of substring is obtained from multiple first type substrings as the substring to be interleaved.

[0125] It should be emphasized that, in other encoding scenarios, the method for obtaining the substring to be interleaved can refer to existing technologies.

[0126] S503. From each bit of the bit sequence corresponding to the modulation symbol, obtain the bit that satisfies the preset conditions and use it as the first type of bit.

[0127] In this embodiment, the preset conditions include the top m in the misjudgment probability ranking, where m is a preset ranking threshold.

[0128] The misclassification probability refers to the probability that the bits in the bit sequence corresponding to the modulation symbol will be misclassified when the modulation symbol is misclassified. It should be noted that the bits in the bit sequence are all ranked starting from 0.

[0129] Optionally, there are multiple methods for obtaining the misjudgment probability of each bit, one of which is the bit counting method based on constellation diagrams. Let p be the number of bits corresponding to a modulation symbol, and the modulation symbol can be represented as binary data x. p- 1 +x p- 2 +K+x 1 +x 0 Let [p-1…2,1,0] represent {x} i The position index of}, 0≤i≤p-1, [a p-1 K a2,a1,a0] represents the position index count, with an initial value of 0.

[0130] When a modulation symbol is misidentified as an adjacent modulation symbol, the position index i of the erroneous bit corresponds to a iIncrement the count by 1, otherwise leave it unchanged. After traversing all modulation symbols, the set of position indices corresponding to the largest m index counts is {P}. m}, m≤p, where m is the maximum likelihood bit count.

[0131] It should be noted that the specific implementation process of the ordinal counting method can be found in S108 to S109 of the above embodiments.

[0132] S504. Obtain the first type of bit set and the second type of bit set.

[0133] In this embodiment, the first type of bit set includes multiple first type bits, and the second type of bit set includes multiple second type bits.

[0134] In this context, the first type of bits are the bits located at the target position in the substring to be interleaved, and the second type of bits are the bits in the substring to be interleaved excluding the first type of bits. The value of the target position satisfies the condition that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit.

[0135] Taking a bit sequence with a modulation symbol length of 6 and a bit sequence with an RS symbol length of 8, i.e., a substring to be interleaved with a length of 24, as an example. The first type of sequence number includes 2, 3, 4, and 5. If the remainder of a sequence number in the substring to be interleaved with 6 is equal to any one of 2, 3, 4, or 5, then that sequence number is determined to belong to the target sequence number.

[0136] In this embodiment, the method for obtaining the first type of bit set and the second type of bit set also includes other implementation methods. For example, as described in S110 to S111 above, a second type of substring with a length equal to the length of the bit sequence corresponding to the modulation symbol is obtained by dividing the substring to be interleaved. At this time, the order of the second type of substring and the order of the modulation symbol are arranged in the same way, which are both 0 to 5. The first type of order in the second type of substring can be directly used as the target order.

[0137] The bits that satisfy formula (1) are labeled as a set. 0≤i≤n-1, and will Let A be the number of bits in the set, and let set A be the set of bits that do not satisfy formula (1). 0≤j≤n-1, and The number of bits is denoted as B.

[0138] p i = mod(i, p), 0 ≤ i ≤ n-1, p i ∈{P m} (1)

[0139] In formula (1), mod represents the remainder operation, p i P represents mAny one of the m elements in the matrix. That is, if the result of mod(i,p) falls within P... m In the middle, the index i is placed in the set. In the set, the index j that does not satisfy the above relationship is placed in the set. In this context, the index i refers to the position of the bit in the substring to be interleaved (starting from 0).

[0140] This embodiment does not limit the method of dividing the first type of bits and the second type of bits. That is, this embodiment does not limit the method of determining the correspondence between the ordinal position and the first type of ordinal position in the substring to be interleaved.

[0141] S505. Perform RS encoding on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol. Perform RS encoding on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol.

[0142] In this embodiment, several first-type bits of the second bit are sequentially mapped to an RS symbol to obtain at least one first-type RS symbol, and several second-type bits of the second bit are sequentially mapped to RS symbols to obtain at least one second-type RS symbol. The specific symbol mapping method can be found in S112 above.

[0143] S506. Concatenate the first type of RS symbols and the second type of RS symbols to obtain the interleaving result sequence of the substring to be interleaved.

[0144] S507. Obtain the correspondence between the position of the bit in the substring to be interleaved and the position of the bit in the interleaving result sequence of the substring to be interleaved, and generate the interleaver pattern corresponding to the substring to be interleaved.

[0145] Figure 6 An example of interleaving is given with p=6 and q=8. The length of the first type of substring is 24, and the result of the sequence number counting is [2236363636]. The high 2 bits of each second type of substring obtained after grouping belong to the second type of sequence position, and the low 4 bits belong to the first type of sequence position (shown in shaded). The bits on the first type of sequence position are RS encoded to obtain the interleaved RS symbol (first type RS symbol), and the bits on the second type of sequence position are RS encoded to obtain the interleaved RS symbol (second type RS symbol).

[0146] As can be seen from the above technical solutions, the encoding method provided in this application divides the bits with a higher probability of misclassification in the substring to be interleaved into a first bit set, and performs RS encoding based on the bits in the first bit set to obtain a first type of RS symbol. The other bits are divided into a second bit set, and RS encoding based on the bits in the second bit set to obtain a second type of RS symbol. It can be seen that the bit sequence corresponding to the first type of RS symbol includes bits with a higher probability of misclassification. That is, this application performs centralized RS encoding on bits with a higher probability of misclassification, thereby improving the error correction capability of RS encoding.

[0147] Figure 7 This diagram illustrates a performance comparison of different codecs under the same channel conditions (white Gaussian noise) and the same modulation scheme / symbol rate (64QAM / 9.6k / s). Specifically, Figure 7 The CRC check failure probabilities of the encoding results are shown for no encoding, encoding based on convolutional codes, encoding based on convolutional coding followed by RS coding, and encoding based on RS coding followed by interleaving provided in this application. It can be seen that the error correction capability of the encoding method provided in this application is higher than that of other encoding methods.

[0148] As can be seen, this scheme obtains the error-prone bits in the signal constellation, that is, the bits whose sequence satisfies the grouping condition. By mapping the error-prone bits and mapping other bits respectively, the bits in the first type of substring are rearranged so that the error-prone bits in the first type of substring are concentrated in the RS symbol after deinterleaving at the receiving end, thereby maximizing the error correction capability of RS coding.

[0149] Figure 8 A schematic diagram of an encoding device provided in an embodiment of this application is shown, such as... Figure 8 As shown, the device may include:

[0150] Concatenation coding unit 801 is used to concatenately encode the data to be encoded to obtain the RS coding sequence;

[0151] Interleaving substring acquisition unit 802 is used to acquire the substring to be interleaved based on the RS encoding sequence. The substring to be interleaved is a bit sequence with a length equal to a first preset value. The first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol.

[0152] The modulation sequence partitioning unit 803 is used to obtain the sequence positions that meet the preset conditions from each sequence position of the bit sequence corresponding to the modulation symbol, and use them as the first type of sequence positions. The preset conditions include the top m in the misjudgment probability ranking, where m is a preset ranking threshold.

[0153] Bit classification unit 804 is used to obtain a first type of bit set and a second type of bit set. The first type of bit set includes multiple first type bits, which are bits located at the target position in the substring to be interleaved. The second type of bit set includes multiple second type bits, which are bits in the substring to be interleaved other than the first type bits. The value of the target position satisfies that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit.

[0154] Bit encoding unit 805 is used to perform RS encoding on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol; and to perform RS encoding on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol;

[0155] The first interleaving coding unit 806 is used to concatenate the first type of RS symbols and the second type of RS symbols to obtain the interleaving result sequence of the substring to be interleaved;

[0156] The interleaving pattern generation unit 807 is used to obtain the correspondence between the position of the bit in the substring to be interleaved and the position of the bit in the interleaving result sequence of the substring to be interleaved, and to generate the interleaver pattern corresponding to the substring to be interleaved.

[0157] Optionally, the concatenated coding unit is used to perform concatenated coding on the data to be coded to obtain the RS coded sequence, including: the concatenated coding unit is specifically used for:

[0158] Obtain the bit sequence of the data to be encoded, and divide the bit sequence of the data to be encoded into multiple short frame bit sequences of the data to be encoded.

[0159] Convolutional encoding is performed on multiple short frame bit sequences of the data to be encoded to obtain multiple short frame bit sequences with convolutional encoding.

[0160] At least several short frame bit sequences of the convolutional encoding are subjected to RS encoding to obtain the RS encoded sequence.

[0161] Optionally, the concatenated coding unit is used to perform RS coding on at least the multiple short frame bit sequences of the convolutionally coded sequence to obtain the RS-coded sequence, including: the concatenated coding unit is specifically used for:

[0162] The multiple short frame bit sequences of the convolutional coding are grouped and interleaved to obtain interleaved coded short frame bit sequences;

[0163] The interleaved encoding of each short frame bit sequence is scrambled to obtain a scrambled encoded short frame bit sequence;

[0164] RS encoding is performed on all short frame bit sequences of the scrambling encoding to obtain the RS encoded sequence.

[0165] Optionally, the interleaving substring acquisition unit is used to acquire the substring to be interleaved based on the RS encoded sequence, including: the interleaving substring acquisition unit is specifically used for:

[0166] The RS-encoded sequence is mapped to a binary domain to obtain multiple bit sequences to be interleaved;

[0167] The bit sequence to be interleaved is segmented to obtain multiple first-type substrings, the length of which is the first preset value.

[0168] At least one of the multiple first-class substrings is taken as the substring to be interleaved.

[0169] Optionally, the apparatus further includes: a second interleaving encoding unit, configured to further include, after generating the interleaving pattern corresponding to the substring to be interleaved:

[0170] Based on the interleaver pattern corresponding to the substring to be interleaved, other first-class substrings are interleaved and encoded to obtain the interleaving result sequence of the other first-class substrings. The other first-class substrings include first-class substrings other than the substring to be interleaved among the plurality of first-class substrings.

[0171] Based on the interleaving result sequence of each of the plurality of first-class substrings, the interleaving result of the bit sequence to be interleaved is generated;

[0172] Based on the interleaving results of each of the multiple bit sequences to be interleaved, the interleaving result of the RS encoded sequence is generated.

[0173] Optionally, the modulation sequence partitioning unit is used to obtain, from each position of the bit sequence corresponding to the modulation symbol, a position that satisfies a preset condition, as a first type of position, including: the modulation sequence partitioning unit is specifically used for:

[0174] Traverse each constellation point in the preset constellation diagram, and determine whether the target bit of the bit sequence corresponding to the modulation symbol indicated by the constellation point is misjudged if the constellation point is misjudged. If so, increment the count value of the target bit by 1. The target bit includes any bit of the bit sequence corresponding to the modulation symbol.

[0175] After traversal, the count value of each position of the bit sequence corresponding to the modulation symbol is obtained. The count value of the target position is used to indicate the misjudgment probability of the bit located at the target position. The positions are sorted from largest to smallest according to the count value. The positions that meet the counting conditions are selected as the first type of positions. The counting conditions include the first m in the sorting and the count value is greater than a preset quantity threshold.

[0176] Optionally, the case where a constellation point is misidentified includes: the constellation point being misidentified as a constellation point adjacent to the constellation point on the constellation map.

[0177] Figure 9 A schematic diagram of the structure of the encoding device is shown. The device may include: at least one processor 901, at least one communication interface 902, at least one memory 903, and at least one communication bus 904.

[0178] In this embodiment of the application, the number of processor 901, communication interface 902, memory 903 and communication bus 904 is at least one, and processor 901, communication interface 902 and memory 903 communicate with each other through communication bus 904;

[0179] The processor 901 may be a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention.

[0180] The memory 903 may include high-speed RAM, or it may also include non-volatile memory, such as at least one disk storage device;

[0181] The memory stores a program, and the processor can execute the program stored in the memory to implement the various steps of the encoding method provided in this application embodiment, as follows:

[0182] An encoding method, comprising:

[0183] The data to be encoded is concatenated and encoded to obtain the RS encoded sequence;

[0184] The interleaving substring is obtained based on the RS encoding sequence. The interleaving substring is a bit sequence with a length equal to a first preset value. The first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol.

[0185] From each position of the bit sequence corresponding to the modulation symbol, obtain the position that meets the preset conditions as the first type of position. The preset conditions include the top m positions in the misjudgment probability ranking, where m is a preset ranking threshold.

[0186] Obtain a first type of bit set and a second type of bit set. The first type of bit set includes multiple first type bits, which are bits located at the target position in the substring to be interleaved. The second type of bit set includes multiple second type bits, which are bits in the substring to be interleaved other than the first type bits. The target position satisfies the condition that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit.

[0187] RS encoding is performed on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol; RS encoding is performed on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol;

[0188] By concatenating the first type of RS symbols and the second type of RS symbols, the interleaving result sequence of the substring to be interleaved is obtained;

[0189] Obtain the correspondence between the position of each bit in the substring to be interleaved and the position of each bit in the interleaving result sequence of the substring to be interleaved, and generate the interleaver pattern corresponding to the substring to be interleaved.

[0190] Optionally, the data to be encoded is concatenated to obtain an RS-encoded sequence, including:

[0191] Obtain the bit sequence of the data to be encoded, and divide the bit sequence of the data to be encoded into multiple short frame bit sequences of the data to be encoded.

[0192] Convolutional encoding is performed on multiple short frame bit sequences of the data to be encoded to obtain multiple short frame bit sequences with convolutional encoding.

[0193] At least several short frame bit sequences of the convolutional encoding are subjected to RS encoding to obtain the RS encoded sequence.

[0194] Optionally, at least the multiple short frame bit sequences of the convolutional coding are subjected to RS coding to obtain the RS-coded sequence, including:

[0195] The multiple short frame bit sequences of the convolutional coding are grouped and interleaved to obtain interleaved coded short frame bit sequences;

[0196] The interleaved encoding of each short frame bit sequence is scrambled to obtain a scrambled encoded short frame bit sequence;

[0197] RS encoding is performed on all short frame bit sequences of the scrambling encoding to obtain the RS encoded sequence.

[0198] Optionally, obtaining the substring to be interleaved based on the RS-encoded sequence includes:

[0199] The RS-encoded sequence is mapped to a binary domain to obtain multiple bit sequences to be interleaved;

[0200] The bit sequence to be interleaved is segmented to obtain multiple first-type substrings, the length of which is the first preset value.

[0201] At least one of the multiple first-class substrings is taken as the substring to be interleaved.

[0202] Optionally, after generating the interleaver pattern corresponding to the substring to be interleaved, the method further includes:

[0203] Based on the interleaver pattern corresponding to the substring to be interleaved, other first-class substrings are interleaved and encoded to obtain the interleaving result sequence of the other first-class substrings. The other first-class substrings include first-class substrings other than the substring to be interleaved among the plurality of first-class substrings.

[0204] Based on the interleaving result sequence of each of the plurality of first-class substrings, the interleaving result of the bit sequence to be interleaved is generated;

[0205] Based on the interleaving results of each of the multiple bit sequences to be interleaved, the interleaving result of the RS encoded sequence is generated.

[0206] Optionally, from each bit position of the bit sequence corresponding to the modulation symbol, bits that satisfy preset conditions are obtained as the first type of bits, including:

[0207] Traverse each constellation point in the preset constellation diagram, and determine whether the target bit of the bit sequence corresponding to the modulation symbol indicated by the constellation point is misjudged if the constellation point is misjudged. If so, increment the count value of the target bit by 1. The target bit includes any bit of the bit sequence corresponding to the modulation symbol.

[0208] After traversal, the count value of each position of the bit sequence corresponding to the modulation symbol is obtained. The count value of the target position is used to indicate the misjudgment probability of the bit located at the target position. The positions are sorted from largest to smallest according to the count value. The positions that meet the counting conditions are selected as the first type of positions. The counting conditions include the first m in the sorting and the count value is greater than a preset quantity threshold.

[0209] Optionally, cases where constellation points are misjudged include:

[0210] The constellation point was incorrectly identified as a constellation point adjacent to the constellation point on the constellation map.

[0211] This application also provides a readable storage medium that stores a computer program suitable for execution by a processor. When the computer program is executed by the processor, it implements the various steps of an encoding method provided in this application, as follows:

[0212] An encoding method, comprising:

[0213] The data to be encoded is concatenated and encoded to obtain the RS encoded sequence;

[0214] The interleaving substring is obtained based on the RS encoding sequence. The interleaving substring is a bit sequence with a length equal to a first preset value. The first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol.

[0215] From each position of the bit sequence corresponding to the modulation symbol, obtain the position that meets the preset conditions as the first type of position. The preset conditions include the top m positions in the misjudgment probability ranking, where m is a preset ranking threshold.

[0216] Obtain a first type of bit set and a second type of bit set. The first type of bit set includes multiple first type bits, which are bits located at the target position in the substring to be interleaved. The second type of bit set includes multiple second type bits, which are bits in the substring to be interleaved other than the first type bits. The target position satisfies the condition that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit.

[0217] RS encoding is performed on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol; RS encoding is performed on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol;

[0218] By concatenating the first type of RS symbols and the second type of RS symbols, the interleaving result sequence of the substring to be interleaved is obtained;

[0219] Obtain the correspondence between the position of each bit in the substring to be interleaved and the position of each bit in the interleaving result sequence of the substring to be interleaved, and generate the interleaver pattern corresponding to the substring to be interleaved.

[0220] Optionally, the data to be encoded is concatenated to obtain an RS-encoded sequence, including:

[0221] Obtain the bit sequence of the data to be encoded, and divide the bit sequence of the data to be encoded into multiple short frame bit sequences of the data to be encoded.

[0222] Convolutional encoding is performed on multiple short frame bit sequences of the data to be encoded to obtain multiple short frame bit sequences with convolutional encoding.

[0223] At least several short frame bit sequences of the convolutional encoding are subjected to RS encoding to obtain the RS encoded sequence.

[0224] Optionally, at least the multiple short frame bit sequences of the convolutional coding are subjected to RS coding to obtain the RS-coded sequence, including:

[0225] The multiple short frame bit sequences of the convolutional coding are grouped and interleaved to obtain interleaved coded short frame bit sequences;

[0226] The interleaved encoding of each short frame bit sequence is scrambled to obtain a scrambled encoded short frame bit sequence;

[0227] RS encoding is performed on all short frame bit sequences of the scrambling encoding to obtain the RS encoded sequence.

[0228] Optionally, obtaining the substring to be interleaved based on the RS-encoded sequence includes:

[0229] The RS-encoded sequence is mapped to a binary domain to obtain multiple bit sequences to be interleaved;

[0230] The bit sequence to be interleaved is segmented to obtain multiple first-type substrings, the length of which is the first preset value.

[0231] At least one of the multiple first-class substrings is taken as the substring to be interleaved.

[0232] Optionally, after generating the interleaver pattern corresponding to the substring to be interleaved, the method further includes:

[0233] Based on the interleaver pattern corresponding to the substring to be interleaved, other first-class substrings are interleaved and encoded to obtain the interleaving result sequence of the other first-class substrings. The other first-class substrings include first-class substrings other than the substring to be interleaved among the plurality of first-class substrings.

[0234] Based on the interleaving result sequence of each of the plurality of first-class substrings, the interleaving result of the bit sequence to be interleaved is generated;

[0235] Based on the interleaving results of each of the multiple bit sequences to be interleaved, the interleaving result of the RS encoded sequence is generated.

[0236] Optionally, from each bit position of the bit sequence corresponding to the modulation symbol, bits that satisfy preset conditions are obtained as the first type of bits, including:

[0237] Traverse each constellation point in the preset constellation diagram, and determine whether the target bit of the bit sequence corresponding to the modulation symbol indicated by the constellation point is misjudged if the constellation point is misjudged. If so, increment the count value of the target bit by 1. The target bit includes any bit of the bit sequence corresponding to the modulation symbol.

[0238] After traversal, the count value of each position of the bit sequence corresponding to the modulation symbol is obtained. The count value of the target position is used to indicate the misjudgment probability of the bit located at the target position. The positions are sorted from largest to smallest according to the count value. The positions that meet the counting conditions are selected as the first type of positions. The counting conditions include the first m in the sorting and the count value is greater than a preset quantity threshold.

[0239] Optionally, cases where constellation points are misjudged include:

[0240] The constellation point was incorrectly identified as a constellation point adjacent to the constellation point on the constellation map.

[0241] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0242] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other.

[0243] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An encoding method, characterized in that, include: The data to be encoded is concatenated and encoded to obtain the RS encoded sequence; The interleaving substring is obtained based on the RS encoding sequence. The interleaving substring is a bit sequence with a length equal to a first preset value. The first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol. From each position of the bit sequence corresponding to the modulation symbol, obtain the positions that meet the preset conditions as the first type of positions. The preset conditions include sorting the first m positions by the misjudgment probability from largest to smallest, where m is a preset ranking threshold. Obtain a first type of bit set and a second type of bit set. The first type of bit set includes multiple first type bits, which are bits located at the target position in the substring to be interleaved. The second type of bit set includes multiple second type bits, which are bits in the substring to be interleaved other than the first type bits. The target position satisfies the condition that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit. RS encoding is performed on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol; RS encoding is performed on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol; By concatenating the first type of RS symbols and the second type of RS symbols, the interleaving result sequence of the substring to be interleaved is obtained; Obtain the correspondence between the position of each bit in the substring to be interleaved and the position of each bit in the interleaving result sequence of the substring to be interleaved, and generate the interleaver pattern corresponding to the substring to be interleaved.

2. The method according to claim 1, characterized in that, The concatenated encoding of the data to be encoded to obtain the RS encoded sequence includes: Obtain the bit sequence of the data to be encoded, and divide the bit sequence of the data to be encoded into multiple short frame bit sequences of the data to be encoded. Convolutional encoding is performed on multiple short frame bit sequences of the data to be encoded to obtain multiple short frame bit sequences with convolutional encoding. At least several short frame bit sequences of the convolutional encoding are subjected to RS encoding to obtain the RS encoded sequence.

3. The method according to claim 2, characterized in that, The step of performing RS encoding on at least a plurality of short frame bit sequences of the convolutional encoding to obtain the RS encoded sequence includes: The multiple short frame bit sequences of the convolutional coding are grouped and interleaved to obtain interleaved coded short frame bit sequences; The interleaved encoding of each short frame bit sequence is scrambled to obtain a scrambled encoded short frame bit sequence; RS encoding is performed on all short frame bit sequences of the scrambling encoding to obtain the RS encoded sequence.

4. The method according to any one of claims 1 to 3, characterized in that, The step of obtaining the substring to be interleaved based on the RS encoded sequence includes: The RS-encoded sequence is mapped to a binary domain to obtain multiple bit sequences to be interleaved; The bit sequence to be interleaved is segmented to obtain multiple first-type substrings, the length of which is the first preset value. At least one of the multiple first-class substrings is taken as the substring to be interleaved.

5. The method according to claim 4, characterized in that, After generating the interleaver pattern corresponding to the substring to be interleaved, the method further includes: Based on the interleaver pattern corresponding to the substring to be interleaved, other first-class substrings are interleaved and encoded to obtain the interleaving result sequence of the other first-class substrings. The other first-class substrings include first-class substrings other than the substring to be interleaved among the plurality of first-class substrings. Based on the interleaving result sequence of each of the plurality of first-class substrings, the interleaving result of the bit sequence to be interleaved is generated; Based on the interleaving results of each of the multiple bit sequences to be interleaved, the interleaving result of the RS encoded sequence is generated.

6. The method according to claim 1, characterized in that, The step of obtaining, from each bit position of the bit sequence corresponding to the modulation symbol, a bit position that satisfies a preset condition and is designated as a first type of bit position includes: Traverse each constellation point in the preset constellation diagram, and determine whether the target bit of the bit sequence corresponding to the modulation symbol indicated by the constellation point is misjudged if the constellation point is misjudged. If so, increment the count value of the target bit by 1. The target bit includes any bit of the bit sequence corresponding to the modulation symbol. After traversal, the count value of each position of the bit sequence corresponding to the modulation symbol is obtained. The count value of the target position is used to indicate the misjudgment probability of the bit located at the target position. The positions are sorted from largest to smallest according to the count value. The positions that meet the counting conditions are selected as the first type of positions. The counting conditions include the first m in the sorting and the count value is greater than a preset quantity threshold.

7. The method according to claim 6, characterized in that, The situations in which constellation points are misjudged include: The constellation point was incorrectly identified as a constellation point adjacent to the constellation point on the constellation map.

8. An encoding device, characterized in that, include: Concatenated coding unit, used to concatenately encode the data to be encoded to obtain the RS encoded sequence; The interleaving substring acquisition unit is used to acquire the substring to be interleaved based on the RS encoding sequence. The substring to be interleaved is a bit sequence with a length equal to a first preset value. The first preset value is a common multiple of the length of the bit sequence corresponding to the modulation symbol and the length of the bit sequence corresponding to the RS symbol. The modulation sequence partitioning unit is used to obtain the sequence positions that meet the preset conditions from each sequence position of the bit sequence corresponding to the modulation symbol, and use them as the first type of sequence positions. The preset conditions include sorting the first m positions by the misjudgment probability from largest to smallest, where m is a preset ranking threshold. A bit classification unit is used to obtain a first type of bit set and a second type of bit set. The first type of bit set includes multiple first type bits, which are bits located at the target position in the substring to be interleaved. The second type of bit set includes multiple second type bits, which are bits in the substring to be interleaved other than the first type bits. The value of the target position satisfies that the remainder of the length of the bit sequence corresponding to the modulation symbol is equal to the value of the first type of bit. A bit encoding unit is used to perform RS encoding on multiple first-type bits in the first-type bit set to obtain a first-type RS symbol; and to perform RS encoding on multiple second-type bits in the second-type bit set to obtain a second-type RS symbol; The first interleaving coding unit is used to concatenate the first type of RS symbols and the second type of RS symbols to obtain the interleaving result sequence of the substring to be interleaved; The interleaving pattern generation unit is used to obtain the correspondence between the position of the bit in the substring to be interleaved and the position of the bit in the interleaving result sequence of the substring to be interleaved, and to generate the interleaver pattern corresponding to the substring to be interleaved.

9. An encoding device, characterized in that, include: Memory and processor; The memory is used to store programs; The processor is used to execute the program to implement the various steps of the encoding method as described in any one of claims 1 to 7.

10. A readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the various steps of the encoding method as described in any one of claims 1 to 7.

Images