Decoding method and apparatus, and electronic device and storage medium

By determining unreliable positions in Hanming decoding and filtering the final test sequence, and using parity bit optimization decoding process, the problem of Hanming's low decoding efficiency is solved, and resource conservation and efficient error correction are achieved.

WO2024245093A1PCT designated stage expired Publication Date: 2024-12-05SANECHIPS TECH CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2024/094923
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-31
Filing Date
2024-05-23
Publication Date
2024-12-05

AI Technical Summary

Technical Problem

Hanming decoding requires a large number of test sequences during the decoding process, resulting in a decrease in decoding efficiency, especially when the bit error rate is high, it is difficult to effectively correct errors.

Method used

By determining the unreliable position in the data to be decoded, selecting the initial test sequence and filtering out the final test sequence based on the parity bit, reducing the number of test sequences required during the decoding process, and using an initial test with a parity bit of 1 The sequence is decoded.

Benefits of technology

The utilization of resources during the decoding process is optimized, the decoding method is simplified, the resource consumption is reduced, and the decoding efficiency is improved. Especially in the case of high bit error rates, errors can be effectively corrected.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024094923_05122024_PF_FP_ABST
    Figure CN2024094923_05122024_PF_FP_ABST
Patent Text Reader

Abstract

Provided in the present disclosure is a decoding method, comprising: determining N unreliable positions in data to be decoded; determining M initial test sequences according to N unreliable bits, wherein the number of bits of each initial test sequence is N; selecting P final test sequences from among the M initial test sequences according to an initial parity check bit, wherein M>P, the initial parity check bit is a parity check bit corresponding to the first initial test sequence, and the P final test sequences comprise P initial test sequences having parity check bits of 1; and decoding said data by using the P final test sequences. Further provided in the present disclosure are a decoding apparatus, an electronic device and a computer-readable storage medium.
Need to check novelty before this filing date? Find Prior Art

Description

Decoding method and device, electronic device, and storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese patent application No. 202310634909.1 filed on May 31, 2023, the contents of which are incorporated herein by reference in their entirety. Technical Field

[0003] The present disclosure relates to the field of communications, and in particular, to a decoding method, a decoding device, an electronic device, and a computer-readable storage medium. Background Art

[0004] In the communications field, forward error correction (FEC) ensures the reliability of communication signals and enables reliable transmission over long distances. FEC works by encoding the signal (data payload) to be processed according to a specific algorithm, adding redundant code (code blocks used for error correction) that reflects the characteristics of the data payload itself, and then transmitting it into the transmission channel. At the receiving end, the data is then decoded according to a corresponding algorithm to identify and correct any errors, restoring the original data payload. FEC effectively mitigates interference introduced by the transmission channel with minimal overhead (the ratio of redundant code to payload, referred to as OH), improving the reliability of the communication system, extending the transmission distance of the communication signal, and reducing the cost of the communication system.

[0005] During decoding, FEC can correct errors and recover the original payload data only when the symbol error rate (SER) is within the correctable range. For example, if an N-bit payload is input, a K-bit redundant code is generated according to a related algorithm, and then (N+K) bits of data are transmitted to the receiver. During transmission, the payload and redundant code are susceptible to environmental factors, which can cause errors. If the errors are within the correctable range, the receiver can correct the errors and recover the N-bit payload data after decoding. Hamming decoding uses FEC technology, but it requires a large number of test sequences during decoding, which reduces decoding efficiency.

[0006] Summary of the Invention

[0007] As a first aspect of the present disclosure, a decoding method is provided, comprising: determining N unreliable positions in data to be decoded; determining M initial test sequences based on the N unreliable positions, wherein the number of bits of the initial test sequences is N; selecting P final test sequences from the M initial test sequences based on initial parity bits, wherein M>P, the initial parity bit is the parity bit corresponding to the first initial test sequence, and the P final test sequences include P initial test sequences whose parity bits are 1; and decoding the data to be decoded using the P final test sequences.

[0008] As a second aspect of the present disclosure, a decoding device is provided, comprising: an unreliable position determination module, configured to determine N unreliable positions in data to be decoded; a test sequence selection module, configured to determine M initial test sequences based on the N unreliable positions, and select P final test sequences from the M initial test sequences based on initial parity bits, wherein the number of bits of the initial test sequences is N, M>P, the initial parity bits are the parity bits corresponding to the first initial test sequence, and the P final test sequences include P initial test sequences whose parity bits are 1; and a decoding module, configured to decode the data to be decoded using the P final test sequences.

[0009] As a third aspect of the present disclosure, an electronic device is provided, comprising: one or more processors; a memory on which one or more computer programs are stored, wherein the one or more computer programs are executed by the one or more processors, so that the one or more processors implement the decoding method provided in the first aspect of the present disclosure.

[0010] As a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. The computer program is executed by a processor, so that the processor implements the decoding method provided in the first aspect of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] FIG1 is a schematic flow chart of an embodiment of a decoding method provided by the present disclosure;

[0012] FIG2 is a flow chart of an embodiment of step S140;

[0013] FIG3 is a flow chart of another embodiment of the decoding method provided by the present disclosure;

[0014] FIG4 is a module diagram of an embodiment of a decoding device provided by the present disclosure;

[0015] FIG5 is a schematic diagram of a module of an embodiment of an electronic device provided by the present disclosure; and

[0016] FIG6 is a module diagram of a computer-readable medium provided by the present disclosure. DETAILED DESCRIPTION

[0017] To enable those skilled in the art to better understand the technical solutions of the present disclosure, the decoding method, decoding device, electronic device, and computer-readable storage medium provided by the present disclosure are described in detail below with reference to the accompanying drawings.

[0018] Hereinafter, example embodiments will be described more fully with reference to the accompanying drawings, but the example embodiments may be embodied in different forms and should not be construed as limited to the embodiments set forth herein. These embodiments are provided to make this disclosure more thorough and complete and to enable those skilled in the art to fully understand the scope of this disclosure.

[0019] In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.

[0020] As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items.

[0021] The terms used herein are used only to describe specific embodiments and are not intended to limit the present disclosure. As used herein, the singular forms "a," "an," and "the" are also intended to include the plural forms, unless the context clearly indicates otherwise. It will also be understood that when the terms "comprising" and / or "made of" are used in this specification, the presence of the features, wholes, steps, operations, elements, and / or components is specified, but the presence or addition of one or more other features, wholes, steps, operations, elements, components, and / or groups thereof is not excluded.

[0022] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and the present disclosure, and will not be interpreted as having an idealized or overly formal meaning unless expressly defined as such herein.

[0023] As a first aspect of the present disclosure, a decoding method is provided. As shown in FIG1 , the decoding method includes the following steps S110 to S140 .

[0024] In step S110 , N unreliable positions in the data to be decoded are determined.

[0025] In step S120 , M initial test sequences are determined according to the N unreliable positions.

[0026] In step S130 , P final test sequences are determined from the M initial test sequences according to the initial parity bits.

[0027] In step S140 , the data to be decoded are decoded using the P final test sequences.

[0028] In the present disclosure, M, N, and P are all positive integers, and M>P. The initial parity bit is the parity bit corresponding to the first initial test sequence, and the P final test sequences include P initial test sequences whose parity bit is 1.

[0029] In this disclosure, the number of bits in the initial test sequence is N, which means that the number of bits in the final test sequence is also N. For ease of description, the initial and final test sequences are collectively referred to as test sequences. That is, the number of bits in the test sequence is N, and the N numbers in the test sequence correspond to N unreliable positions in the data to be decoded. A 0 in the test sequence indicates that the corresponding bit in the data to be decoded is not flipped, and a 1 in the test sequence indicates that the corresponding bit in the data to be decoded is flipped.

[0030] Parity check is a method for verifying the correctness of code transmission. This check is performed based on whether the number of "1" bits in a transmitted binary code is odd or even. The algorithm shows that if the parity bit is 0, it indicates either no errors or at least one error. If decoding is not required, a corresponding adjacent test sequence will produce the same error correction output. In this case, the test sequence corresponding to a "parity bit of 0" is useless and therefore unnecessary to include in the test sequence for comparison. If multiple errors exist before the test sequence is flipped, some errors can be corrected using soft decision processing, as described below.

[0031] In the decoding method provided by the present disclosure, an initial test sequence corresponding to a parity check bit of 1 is used as a final test sequence to decode the data to be decoded, thereby reducing the number of test sequences required in the decoding process, saving decoding resources, and simplifying the decoding method.

[0032] In the present disclosure, the parity bits corresponding to the remaining M-1 initial test sequences can be determined based on the value of the initial parity bit, the data to be decoded, and the M initial test sequences.

[0033] The “unreliable positions” mentioned above refer to the positions most likely to cause errors. The number of the positions most likely to cause errors and their corresponding positions in the data to be decoded can be determined according to a predetermined algorithm.

[0034] In the present disclosure, the specific value of P is related to N and the value of the initial parity bit.

[0035] For example, when the number of bits of data to be decoded is 128, there are 6 unreliable positions (ie, N=6), the number of bits of each initial test sequence is 6, and the number M of initial test sequences is 42.

[0036] In the present disclosure, the initial parity bit can be determined according to the data to be decoded and the first group of initial test sequences.

[0037] In the case where the initial parity check bit is 1, the initial test sequence in which the bits in the to-be-decoded data satisfying the formula (1) need to be flipped is used as the final test sequence.

[0038] In the case where the initial parity bit is 0, the initial test sequence that needs to flip the bits in the median of the data to be decoded that meet the formula (2) is used as the final test sequence. S = 2i + 1 Formula (1) S = 2i Formula (2)

[0039] In the above formulas (1) and (2), i is an integer and i≥0.

[0040] Specifically, in the case of even parity, if the initial parity bit is 1, it is necessary to flip the initial test sequence of at least one of 1 bit, 3 bits, 5 bits, ..., in the data to be decoded as the final test sequence ; If the initial parity bit is 0, it is necessary to flip the initial test sequence of one of 0 bits, 2 bits, 4 bits, ..., in the data to be decoded as the final test sequence.

[0041] In the present disclosure, step S140 is not particularly limited. In some embodiments, as shown in FIG. 2 , step S140 may include the following steps S141 to S142 .

[0042] In step S141 , P groups of syndromes are generated according to the P final test sequences of the data to be decoded.

[0043] In step S142, the data to be decoded is decoded according to the P groups of syndromes.

[0044] The value of P is related to N and the initial parity bit. In the case of even parity, if the initial parity bit is 1, If the initial parity bit is 0, Wherein, j is an integer.

[0045] Since the number of syndromes is different when the initial parity bit is 0 or 1, zero padding may be performed in step S142 to obtain a uniform output format.

[0046] In some embodiments, the number of final test sequences obtained when the initial parity bit is 1 (for ease of description, assume that when the initial parity bit is 1, P=A1) is greater than the number of final test sequences obtained when the initial parity bit is 0 (for ease of description, assume that when the initial parity bit is 0, P=A2). To unify the output format, in step S142, the (A1-A2) group is supplemented with all-zero syndromes.

[0047] In the present disclosure, there is no particular limitation on how to specifically perform step S142. In some embodiments, step S142 may include: determining initial error positions of the syndromes in group P; determining target error positions based on the correlation differences of the final test sequences in group P and the initial error positions; flipping the bits in the to-be-decoded data located at the target error positions to obtain an initial decoding result; and reverse-sorting the initial decoding result and removing the check bits to obtain a final decoding result.

[0048] It should be noted that the “check bit” here may include a parity check bit, or may include other check bits besides the parity check bit.

[0049] In the present disclosure, the value of N is related to the number of bits of the data to be decoded, and the value of M is related to the value of N.

[0050] In some embodiments, the number of bits of the data to be decoded is 128. In this case, N = 6. That is, there are 6 unreliable positions in the data to be decoded, and the data at these 6 unreliable positions are most likely to be data with flip errors.

[0051] Accordingly, in the case of even parity, if the initial parity bit is 1, it is necessary to flip the initial test sequence of at least one of the 1-bit, 3-bit, and 5-bit bits in the data to be decoded as the final test sequence; if the initial parity bit is 0, it is necessary to flip the initial test sequence of one of the 0-bit, 2-bit, and 4-bit bits in the data to be decoded as the final test sequence.

[0052] It has been confirmed that the gain after flipping 4 / 5 / 6 bits is similar to the gain after flipping only 0 / 1 / 2 / 3 bits, but the test sequence data is doubled. In some implementations, only the initial test sequence of flipping 0 / 1 / 2 / 3 bits can be set.

[0053] That is, when N = 6, M = 42. In the case of even parity, if the initial parity bit is 1, the final test sequence is the initial test sequence corresponding to flipping 1 bit and / or 3 bits; if the initial parity bit is 0, the final test sequence is the initial test sequence corresponding to flipping 0 bits and / or 2 bits.

[0054] The following briefly introduces the case where the number of bits of the data to be decoded is 128, N=6, and M=42.

[0055] Table 1 shows a schematic diagram of an implementation of a test sequence 41 (ie, the last test sequence among the 42 test sequences).

[0056] Table 1

[0057] Since the initial parity bit (denoted by p_o in this disclosure) is known, and the parity bit corresponding to the last set of test sequences is flipped by 3 bits, the parity bit corresponding to this set of test sequences (denoted by p41 in this disclosure) is also determined, p41 == ~p_o. If the input p_o == 1'b1 at this time, then p41 == 1'b0. As described above, if the parity bit is 0, it means there is no error or there is more than one error, which will result in two results: decoding failure or no decoding required. If no decoding is required, there will be a corresponding adjacent test sequence, such as the 37th group (corresponding to flipping the two bits at the fifth unreliable position and the sixth unreliable position) to complete the error correction output with the same result. At this point, the 41st test sequence is no longer needed, so it's not necessary to include it in the test sequence comparison. If multiple errors exist before the sequence flip, some of them may be corrected through soft decision, allowing the data to complete the Hamming decoding operation. In the entire Hamming soft decoding process, a maximum of 3 bits can be changed through soft information, and 1 bit can be corrected through Hamming decoding. In the case of even parity, if the initial parity bit is 1, an initial test sequence with 1 or 3 bits flipped can potentially become the optimal test case (i.e., the final test sequence described above). If the initial parity bit is 0, an initial test sequence with 0 or 2 bits flipped can potentially become the optimal test sequence (i.e., the final test sequence described above).

[0058] Table 2

[0059] Similar to the case where the initial parity bit p_o == 1'b1, in the case of even parity, when the initial parity bit p_o == 1'b0 is input, all initial test sequences that require flipping one or three bits are not necessary for decoding. These test sequences are shown in Table 2 above: Group 1, Group 2, Group 4, Group 7, Group 8, Group 11, Group 13, Group 14, Group 15, Group 18, Group 20, Group 21, Group 23, Group 24, Group 25, Group 26, Group 29, Group 31, Group 32, Group 34, Group 35, Group 36, Group 38, Group 39, Group 40, and Group 41, totaling 26 test sequences. These 26 test sequences are only required when the initial value p_o == 1'b1. In the case where the initial parity bit p_o == 1'b0, the remaining 16 initial test sequences, starting with Group 0, are required as the final test sequences. The final test sequence used in the subsequent decoding process depends solely on the input initial parity bits, in addition to the order of the final test sequences themselves. The final test sequence can be selected from multiple initial test sequences based on the initial parity bits. During subsequent decoding, the number of syndromes required to locate error locations is reduced from 42 to 26 (including the 16 initial syndromes derived from the 16 final test sequences and the 10 supplementary syndromes), saving table lookup resources. In the subsequent syndrome-based decoding step, the amount of data required to calculate the minimum Euclidean distance and the number of minimum values ​​to be found are also reduced.

[0060] In summary, no matter what the value of the initial parity bit is, there will always be a part of the initial test sequence that cannot become the final test sequence. That is to say, in the present disclosure, the test sequence can be optimized from the initial 42 groups to 26 groups, which has a significant effect on resource optimization.

[0061] As described above, if the parity bit is 0, it indicates that there are no errors or that there are more than one error. In the present disclosure, the data to be decoded cannot have too many errors. Therefore, as shown in Figure 3, before determining N unreliable positions in the data to be decoded, the decoding method further includes step 100.

[0062] In step S100, soft decoding is used to correct errors in the initial data to obtain the data to be decoded, where the error in the data to be decoded is no more than 3 bits.

[0063] In the present disclosure, the initial data needs to be subjected to 1-bit error correction and have a parity bit.

[0064] As a second aspect of the present disclosure, a decoding device is provided, comprising: an unreliable position determination module configured to determine N unreliable positions in data to be decoded; a test sequence selection module 410 configured to determine M initial test sequences based on the N unreliable positions, and select P final test sequences from the M initial test sequences based on initial parity bits, wherein the number of bits of the initial test sequences is N, M>P, the initial parity bits are the parity bits corresponding to the first initial test sequence, and the P final test sequences include P initial test sequences whose parity bits are 1; and a decoding module 420 configured to decode the data to be decoded using the P final test sequences.

[0065] The decoding device is used to execute the decoding method provided by the first aspect of the present disclosure. The working principle and beneficial effects of the decoding method have been described in detail above and will not be repeated here.

[0066] In the embodiment shown in Figure 4, the test sequence selection module 410 includes the following modules: a soft-hard separation module (bch_decode_syndrome), an unreliable position determination module (find_6min), and a test sequence generation module (bch_decode_syndrome_ext). The soft-hard separation module (bch_decode_syndrome) performs the sorting function and calculates the absolute value of the soft information (dehaming_abs), the hard decision result (y0), the initial syndrome (s_origin), the initial parity bit (p_origin), and the early decoding exit signal (s_p_flag) from the received data. In other words, the soft-hard separation module (bch_decode_syndrome) separates the input soft and hard information and determines whether to exit the decoder early based on the hard information. The unreliable position determination module (find_6min) primarily implements soft decoding, using the soft information to identify the six most unreliable positions in the 128-bit data and output the addresses of the corresponding hard bits. The test sequence generation module (bch_decode_syndrome_ext) calculates the final test sequence for the flipped bits, thus implementing the soft decoding function.

[0067] The decoding module 420 may include a hard decoding module bch_decode_pn and a best finding module find_best.

[0068] The hard decoding module bch_decode_pn completes the table lookup of the s signal and outputs the hard bit error position corresponding to each final test sequence, realizing the hard decoding function.

[0069] The best search module find_best finds the best flip position according to the output result of the err_pn signal and reverses it, compares the correlation differences of all test sequences and finds the best result, and finally outputs it after reverse sorting and removing the parity bit.

[0070] Since the initial parity bit p_o input to the bch_decode_syndrome module is known, and the parity bit corresponding to the final test sequence is flipped with three bits, the parity bit for this test sequence is also known: p41 == p_o. If the input p_o == 1'b1, then p41 == 1'b0. The algorithm shows that if the parity bit is 0, it indicates either no error or more than one error, which means decoding will fail or no decoding is required. If decoding is not required, a corresponding adjacent test sequence, such as group 37 (which flips the fifth and sixth unreliable bits), will produce the same error correction output. In this case, group 41 is completely unnecessary and therefore need not be included in the test sequence comparison. If multiple errors exist before the flip sequence, they may be corrected through soft decision correction, allowing the data to complete Hamming decoding. In the entire Hamming soft decoding process, at most three bits can be changed through soft information, and one bit can be corrected through Hamming decoding. By using the decoding device provided in the present disclosure, the test sequence can be optimized from the initial 42 groups to 26 groups, which has a significant effect on resource optimization.

[0071] Similar to the case when the initial parity bit p_o == 1'b1, in the case of even parity, when the input initial parity bit p_o == 1'b0, all test sequences that require flipping one or three bits are not necessary for decoding. A total of 26 test sequences are required, and these are only used when the initial value p_o == 1'b1. When p_o == 1'b0, the remaining 16 test sequences, starting with group 0, are required. Which test sequence is used in subsequent modules depends solely on the input initial parity bit, in addition to the order of the test sequences themselves. Therefore, the output test sequence is determined by the selector controlled by p_o. In the bch_decode_pn module, the number of syndromes required to locate the error position has been reduced from 42 to 26, saving table lookup resources. In the find_best module, due to the simplification of the test sequence, the number of err_pn inputs was reduced, and the amount of data required to calculate the minimum Euclidean distance and the number of minimum values ​​to be found were also reduced. The optimization in the find_best module was primarily based on the reduction in the number of operations. Since the optimization of the bch_decode_syndrome module eliminated the parity check condition in the find_best module, the parity check bit corresponding to the input data met the condition of equal to one. There were no other updates to the solution. The synthesis after optimization shows that the count of the find_best module after optimization is 17456, while the count of the find_best module before optimization was 30234. The optimization of this module is estimated to have reduced resources by 40%, which is a significant impact. Generally speaking, the larger the test sequence, the better the optimization effect.

[0072] As a third aspect of the present disclosure, an electronic device is provided, as shown in Figure 5, the electronic device including: one or more processors 101; a memory 102 on which one or more computer programs are stored, and the one or more computer programs are executed by the one or more processors, so that the one or more processors implement the decoding method provided in the first aspect of the present disclosure.

[0073] In some implementations, the electronic device may further include one or more I / O interfaces 103 connected between the processor and the memory, and configured to implement information interaction between the processor and the memory.

[0074] The processor 101 is a device with data processing capabilities, including but not limited to a central processing unit (CPU); the memory 102 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), and flash memory (FLASH); the I / O interface (read-write interface) 103 is connected between the processor 101 and the memory 102, and can realize information exchange between the processor 101 and the memory 102, including but not limited to a data bus (Bus) interface.

[0075] In some implementations, the processor 101 , the memory 102 , and the I / O interface 103 are connected to each other via a bus 104 , and further connected to other components of the computing device.

[0076] As a fourth aspect of the present disclosure, as shown in FIG6 , a computer-readable storage medium is provided, on which a computer program is stored. The computer program is executed by a processor, so that the processor implements the decoding method provided in the first aspect of the present disclosure.

[0077] The above embodiment clarifies the even parity case, however, the technical solution provided by the present disclosure is not limited to the even parity case, and the odd parity case can be obtained according to the disclosed even parity case. Therefore, the odd parity case also falls within the protection scope of the present disclosure.

[0078] It will be appreciated by those skilled in the art that all or some of the steps, systems, and functional modules / units in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As is well known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable, and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those skilled in the art that communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0079] Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly indicated, features, characteristics, and / or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in conjunction with other embodiments. Therefore, it will be understood by those skilled in the art that various changes in form and detail may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

1. A decoding method, comprising: Determining N unreliable positions in the data to be decoded; Determine M initial test sequences according to the N unreliable positions, wherein the number of bits of the initial test sequences is N; Selecting P final test sequences from the M initial test sequences according to the initial parity check bit, wherein M>P, the initial parity check bit is the parity check bit corresponding to the first initial test sequence, and the P final test sequences include the P initial test sequences whose parity check bits are 1; and The to-be-decoded data are decoded using the P final test sequences.

2. The decoding method according to claim 1, wherein: The initial parity check bit is 1, and the initial test sequence of the bits that need to be flipped in the median of the data to be decoded to satisfy formula (1) is used as the final test sequence; The initial parity check bit is 0, and the initial test sequence of the bits that need to be flipped in the median of the data to be decoded to satisfy formula (2) is used as the final test sequence; S=2i+1 Formula (1); S = 2i Formula (2); Wherein, i is an integer and i≥0.

3. The decoding method according to claim 2, wherein: The step of decoding the to-be-decoded data by using the P final test sequences comprises: Generate P groups of syndromes according to the P final test sequences of the data to be decoded; The data to be decoded is decoded according to the P groups of syndromes.

4. The decoding method according to claim 3, wherein: When the initial parity bit is 1, In the case where the initial parity bit is 0, Wherein, j is an integer.

5. The decoding method according to claim 3, wherein: The decoding of the to-be-decoded data according to the M groups of syndromes comprises: Determine the initial error position of the syndrome of group P; Determine a target error position according to the correlation differences of the P final test sequences and the initial error position; Flipping the bit located at the target error position in the data to be decoded to obtain an initial decoding result; The initial decoding results are reversed and the check bits are removed to obtain the final decoding results.

6. The decoding method according to any one of claims 1 to 4, wherein: M=42, and the 42 initial test sequences correspond to flipping a maximum of 3 unreliable positions among the 6 unreliable positions.

7. The decoding method according to any one of claims 1 to 4, wherein: Before determining the N unreliable positions in the data to be decoded, the decoding method further includes: The initial data is corrected by using soft decoding to obtain the data to be decoded, wherein the error of the data to be decoded is no more than 3 bits.

8. A decoding device, comprising: An unreliable position determination module, used to determine N unreliable positions in the data to be decoded; A test sequence selection module, used to determine M initial test sequences according to N unreliable positions, and select P final test sequences from the M initial test sequences according to initial parity check bits, wherein the number of bits of the initial test sequences is N, M>P, the initial parity check bit is the parity check bit corresponding to the first initial test sequence, and the P final test sequences include the P initial test sequences whose parity check bits are 1; as well as A decoding module is used to decode the data to be decoded using the P final test sequences.

9. An electronic device, comprising: one or more processors; A memory having one or more computer programs stored thereon, wherein the one or more computer programs are executed by the one or more processors so that the one or more processors implement the decoding method described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor so that the processor implements the decoding method according to any one of claims 1 to 7.

Citation Information

Patent Citations

  • Decoding method and device and computer readable storage medium

    CN111342846A

  • Decoding method, decoder and decoding device

    CN113131947A

  • Transmission method, reception method, transmission device, and reception device

    EP3145089A1

  • Soft-input soft-output decoding of block codes

    US20210288674A1

  • Method and arrangements for supporting forward error correction decoding of a word

    WO2022255913A1