RS (12, 9) fast decoding method for DMR standard

By storing the checker and error position information in advance, and using table lookup method to quickly correct errors, the cumbersome problem of the RS(12,9) code correction process in the DMR standard is solved, and efficient error correction and fast decoding performance is achieved. Suitable for hardware implementation.

CN119070830AActive Publication Date: 2024-12-03FUZHOU UNIV
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202411108497.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-13
Publication Date
2024-12-03
Estimated Expiration
2044-08-13

AI Technical Summary

Technical Problem

The error correction process of RS (12,9) code in the DMR standard in the prior art is too cumbersome, consuming a lot of computing resources, which is not conducive to hardware implementation.

Method used

By storing the information of the checker and the error position in advance, using the characteristics of the error value information and the error position information contained in the checker itself, the error position and difference value are quickly obtained by looking up the table, and the RS(12,9) code is realized Quick error correction.

Benefits of technology

It greatly saves the algorithm process of solving error position information and equations, improves error correction efficiency, and achieves fast decoding performance, which is suitable for the implementation of hardware circuits such as FPGA.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119070830A_ABST
    Figure CN119070830A_ABST
Patent Text Reader

Abstract

The invention provides an RS (12, 9) fast decoding method aiming at a DMR standard, which utilizes the characteristic that a syndrome comprises error value information and error position information and the characteristic that the recursion relationship of the syndrome is only related to the position of an error and is not related to the value of the error when an RS code only corrects one dislocation, so that the RS (12, 9) fast decoding method is realized. According to the method, the recursion relation of the syndrome corresponding to the error position can be stored in advance, and when the RS code is received, if one bit has an error, the error difference value can be obtained only by calculating the recursion relation of the syndrome, obtaining the error position in a table look-up mode and substituting the error position information into the syndrome. And finally, carrying out XOR on the error difference value and the received RS code to obtain an error-corrected RS code. According to the method, a large amount of algorithm processes for solving error position information and solving equations can be saved, and rapid decoding of RS (12, 9) codes only correcting one dislocation in the DMR standard is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of communication technology, and in particular relates to an RS (12, 9) fast decoding method for DMR standard. Background Art

[0002] A walkie-talkie is a professional wireless communication tool with the characteristics of timely communication, easy use, no call charges and low operating costs. The European Telecommunications Standards Institute (ETSI) proposed the DMR (Digital Mobile Radio) digital trunking communication standard in 2004. Compared with other trunking communication protocols, DMR has the advantages of high spectrum utilization, good communication quality, good confidentiality and low terminal equipment cost. The DMR standard includes a variety of coding algorithms such as Golay (20,8), QR (16,7,6) and RS (12,9). For the decoding of RS code, the traditional decoding algorithm needs to go through three steps. First, the error position is solved by substituting the syndrome into the relevant algorithm, such as the Beriekamp Massey iterative algorithm and the Qian search algorithm. Then, the error position information and the syndrome are substituted into the relevant algorithm to solve the error difference, such as the Forney algorithm. Finally, the corrected RS code is obtained by XORing the value of the received RS code error position and the error difference. However, for an error-correcting code such as RS(12,9) that only corrects one bit error, the ability of traditional algorithms to correct multiple bits of code is not actually needed.

[0003] The existing technology is applicable to solving various forms of RS codes, but for RS codes such as the RS (12,9) code in the DMR standard that only corrects one bit error, the decoding process of the existing technology is too cumbersome, requires a lot of computing resources, and is not conducive to hardware implementation.

[0004] The prior art documents available for reference are as follows, and it can be seen that the above problems exist:

[0005] [1] Li Yuliang, Li Jianhua, Lan Wu, et al. A RS encoder and RS encoding and decoding method [P]. Jiangxi Province: CN202111469533.0, 2022-03-08.

[0006] [2] Song Yangjun, Quan Jinguo, Lin Xiaokang. FPGA implementation of DMR standard RS code encoder and decoder[J]. Communication Technology, 2010, 43(06):13-15.

[0007] [3] Yang Liangyong, Bing Zhiguang. Implementation of RS decoding method based on FPGA[J]. Electronic Test, 2017, (15): 40-42. DOI: 10.16520 / j.cnki.1000-8519.2017.15.019.

[0008] [4] J. Fang, G. W. Zhang. Low-delay decoder for Reed-Solomon codes[P]. Singapore: CN201710765440.X, 2023-01-13.

[0009] For example, the existing technical solution "A RS encoder and RS encoding and decoding method"

[0010] The technical solution is divided into four steps. The first step is to calculate the adjoint polynomial and calculate the error position polynomial coefficient based on the adjoint polynomial. The second step is to calculate the root of the error position polynomial based on the error position polynomial coefficient and the Galois field element α. The third step is to generate an error position matrix based on the root of the error position polynomial. The fourth step is to calculate the error position based on the error position matrix and the adjoint polynomial. Finally, error correction is performed based on the error position and the root of the error position polynomial, and the decoded data is output to complete the error correction.

[0011] Prior art solution "Low-delay decoder for Reed-Solomon codes"

[0012] This scheme also calculates the syndrome first, and then inputs the syndrome into the key equation solver (KES) to iteratively solve the error location polynomial. In each iteration, two values ​​are calculated in parallel for difference comparison, from which new candidates are obtained, and then iterates again to finally obtain error information and achieve error correction. Summary of the invention

[0013] Therefore, in view of the gaps and shortcomings of the prior art, the present invention proposes a RS(12,9) fast decoding method for the DMR standard for the RS(12,9) error correction code that only corrects one bit error in the DMR standard. By storing the information of the syndrome and the error position in a lookup table in advance, a large amount of computing resources used for solving the error location is saved, the error correction efficiency of RS(12,9) is greatly improved, and it is conducive to the implementation of hardware circuits such as field programmable gate arrays (FPGAs).

[0014] By utilizing the characteristics that the syndrome itself contains error value information and error position information, and the characteristics that when the RS code corrects only one bit error, the recursive relationship of the syndrome is only related to the position where the error occurs, and has nothing to do with the value of the error, the recursive relationship of the syndrome corresponding to the error position can be saved in advance. When the RS code is received, if there is an error in one bit, it is only necessary to calculate the recursive relationship of the syndrome, obtain the position of the error by looking up the table, substitute the error position information into the syndrome, and obtain the error difference. Finally, the error difference and the received RS code are XORed to obtain the error-corrected RS code. The present invention can save a lot of algorithmic processes for solving error position information and solving equations, and realize fast decoding of RS (12,9) code that only corrects one bit error in the DMR standard, which not only saves a lot of decoding resources, but also can achieve faster decoding performance than traditional algorithms.

[0015] The technical solution specifically adopted by the present invention to solve the technical problem is:

[0016] A fast decoding method for RS (12,9) of the DMR standard stores the recursive relationship of the syndrome corresponding to the error position in advance. When the RS code is received, if one bit is wrong, it is only necessary to calculate the recursive relationship of the syndrome, obtain the error position by looking up the table, substitute the error position information into the syndrome, obtain the error difference, and finally perform XOR on the error difference and the received RS code to obtain the error-corrected RS code.

[0017] Furthermore, before correcting the RS(12,9), the ratio relationship of each syndrome at the 12 possible error symbol positions is stored in the error position ratio table. When correcting the RS(12,9), if the ratios between the syndromes are equal, it means that a bit error has occurred. Further error correction is performed, and the error position ratio table is looked up according to the ratio relationship to obtain the error position information: 1 and error position j, the error pattern is directly calculated by the following formula: j =S 1 / 2 j Finally, by comparing the value of the received data r(x) corresponding to the error position with the error pattern e j Perform XOR to obtain the error correction result.

[0018] Furthermore, the method specifically includes the following steps:

[0019] Step 1: Save the adjacent syndrome ratio relationship value λ of RS(12,9) when 1 bit error occurs into the lookup table. If the first position is wrong, the corresponding ratio is λ 1 , and so on, a lookup table with 12 λ values ​​is constructed, corresponding to the 12 different positions when a bit error occurs;

[0020] Step 2: Receive RS (12, 9) code data and calculate the syndrome. If all the syndromes are 0, it means that there is no error in the code data. If not all the syndromes are 0, calculate the ratio of adjacent syndromes, i.e. S 3 / S 2 and S 2 / S 1 ;

[0021] Step 3: If the ratios of adjacent syndromes are equal, it means that one bit error has occurred and error correction can be performed, then go to step 4 for error correction; if the ratios of adjacent syndromes are not equal, it means that more than one bit error has occurred and error correction cannot be performed, then request retransmission or discard the error codeword;

[0022] Step 4: If the ratio of adjacent syndromes is equal, then the ratio is λ. Look up the table to get the error position j and substitute it into e j =S 1 / 2 j , solve to get the error pattern e j Finally, the data at the jth position of the received symbol data is compared with the error pattern e j Perform XOR to obtain the error correction result and complete the error correction.

[0023] And, a radio intercom system adopting the DMR standard adopts the above-mentioned RS (12,9) fast decoding method when in use.

[0024] An electronic device comprises a memory, a processor and a computer program stored in the memory and executable on the processor. When the processor executes the program, the steps of the RS (12, 9) fast decoding method for the DMR standard as described above are implemented.

[0025] A non-transitory computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of the RS (12, 9) fast decoding method for the DMR standard as described above.

[0026] Compared with the prior art, the present invention and its preferred solution are aimed at the RS (12,9) error correction code that only corrects one bit error in the DMR standard, and cleverly realize fast decoding of such error correction code based on the characteristic that the ratio relationship between adjacent syndromes is only related to the position where the error occurs.

[0027] Compared with the existing RS decoding algorithm, it is more targeted for the application scenario of the RS (12,9) error correction code that only corrects one bit error in the DMR standard. Although the traditional RS decoding algorithm has the ability to correct multiple bit errors, it consumes a large amount of algorithm computing resources, which is too wasteful for the RS code that only corrects one bit error. This application proposal realizes the two processes in the traditional RS decoding algorithm steps (finding the error location and solving the error pattern) by cleverly using the characteristics of the check sub, which has the advantages of low algorithm resource consumption and high speed. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] The present invention is further described in detail below with reference to the accompanying drawings and specific embodiments:

[0029] Figure 1 It is a workflow diagram of RS (12,9) decoding of the algorithm provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0030] In order to make the features and advantages of this patent more obvious and easy to understand, the following embodiments are specifically described in detail as follows:

[0031] It should be noted that the following detailed descriptions are illustrative and are intended to provide further explanation of the present application. Unless otherwise specified, all technical and scientific terms used in this specification have the same meanings as those commonly understood by those skilled in the art to which the present application belongs.

[0032] It should be noted that the terms used herein are only for describing specific embodiments and are not intended to limit the exemplary embodiments according to the present application. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should be understood that when the terms "comprise" and / or "include" are used in this specification, it indicates the presence of features, steps, operations, devices, components and / or combinations thereof.

[0033] Considering that the traditional RS decoding algorithm has the ability to correct RS codes with multiple bit errors, it requires a large amount of decoding resources, while the RS (12,9) in the DMR standard only needs to correct one bit error and does not require the ability of the traditional decoding algorithm to correct multiple bit errors. The solution provided by the present invention has fast decoding in this application scenario and greatly reduces the consumption of computing resources, which is more conducive to hardware implementation.

[0034] In RS(n,k) code, n is the code length, k is the information bit length, then RS(12,9) has a code length of 12, an information bit length of 9, and a check bit length of 3, which has the ability to detect 3 bit errors and correct 1 bit error. The representation and calculation of RS code all use data of Galois Field (GF) finite field with primitive element α of 2. Addition and subtraction in Galois Field are bitwise XOR, and multiplication and division calculations can be implemented using exponential table and logarithmic table, which is suitable for hardware circuit implementation. For RS decoding, the received data can be represented by the following equation:

[0035] r(x)=s(x)+e(x)

[0036] Where r(x) is the received codeword data, s(x) is the sent codeword data, which is the target of decoding, and e(x) is the error pattern, which contains error value information and error position information, as shown below:

[0037]

[0038] For RS(12,9), the value of n is 12, which means 12 symbol positions where errors may occur. i Indicates an error value, x i Indicates the error position information. The main goal of the error correction algorithm is to solve e(x), perform XOR with the received code data r(x) under the Galois field, and obtain the corrected code data s(x), which is expressed as follows:

[0039]

[0040] The generating polynomial of the RS code in the DMR standard is:

[0041] g(x) = x 3 +0e*x 2 +38*x+40

[0042] Since the check bit, i.e. the information bit of RS(12,9), is divided by g(x), 3 remainders can be obtained, it can be known that when the received codeword r(x) is correct, the root of g(x) is the root of r(x). Because in the Galois Field, the root of g(x) is 2 1 , 2 2 and 2 3 , which are 2, 4 and 8, then the roots of r(x) are also 2, 4 and 8. To find the syndrome of r(x), we essentially substitute the three roots mentioned above into r(x). If the three results are 0, it means that r(x) has no error; if the three results are not 0, it means that an error has occurred and error correction is required. In the case of an error in r(x) of RS(12,9), the three syndromes S 1 , S 2 and S 3 The values ​​of e(2 1 )、e(2 2 ) and e(2 3 ), assuming that the jth bit in r(x) is wrong (j∈[1,12]), S 1 , S 2 and S 3 The relationship is as follows:

[0043] S 1 =e(2 1 )=e j *(2 1 ) j

[0044] S 2 =e(2 2 )=e j *(2 2 ) j

[0045] S 3 =e(2 3 )=e j *(2 3 ) j

[0046]

[0047] It can be found that when RS(12,9) has a single error, the ratio of adjacent syndromes is equal, and this ratio has nothing to do with the value of the error, but only with the location where the error occurs. However, when more than one error occurs, there is no such ratio relationship, that is, in S 3 / S 2 ≠S 2 / S 1 In this case, multiple bit errors occur and error correction cannot be performed.

[0048] The key to the implementation of the solution of the present invention is that before correcting the RS(12,9), the ratio relationship of each syndrome at the 12 positions is first stored in the error position ratio table. When correcting the RS(12,9), if the ratios between the syndromes are equal, it means that a single bit error has occurred and the error correction can be performed. The error position ratio table is looked up according to the ratio relationship to obtain the error position information. In this way, a large amount of algorithm design resources used to find the error position in the traditional algorithm is saved. At the same time, in the case of a single bit error, the method for solving the error pattern is also very simple. After obtaining S 1 and error position, error pattern e j =S 1 / 2 j , which also saves the time used in traditional algorithms to solve the error pattern e j The algorithm resources are finally obtained by comparing the value of r(x) corresponding to the error position with the error pattern e j Perform XOR to get the error correction result.

[0049] like Figure 1 As shown, this embodiment provides a design of a RS (12, 9) fast decoding method for the DMR standard, and its implementation process includes the following steps:

[0050] Step 1: Save the adjacent syndrome ratio relationship value λ of RS(12,9) when 1 bit error occurs into the lookup table. If the first position is wrong, the corresponding ratio is λ 1 , and so on, the lookup table has 12 λ values ​​(λ 1 , 2 ......λ 12 ), corresponding to 12 different locations for each bit error.

[0051] Step 2: Receive RS (12, 9) code data and calculate the syndrome. If all the syndromes are 0, it means that there is no error in the code data. If not all the syndromes are 0, calculate the ratio of adjacent syndromes, i.e. S 3 / S 2 and S 2 / S 1 .

[0052] Step 3: If the ratio of adjacent syndromes is equal, it means that there is a 1-bit error and error correction can be performed, then go to step 4 for error correction. If the ratio of adjacent syndromes is not equal, it means that there are more than 1-bit errors and error correction cannot be performed, and request retransmission or discard the erroneous codeword.

[0053] Step 4: If the ratio of adjacent syndromes is equal, then the ratio is λ. Look up the table to get the error position j and substitute it into e j =S 1 / 2 j , solve to get the error pattern e j Finally, the data at the jth position of the received symbol data is compared with the error pattern e j Perform XOR to obtain the error correction result and complete the error correction.

[0054] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0055] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0056] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0057] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0058] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the present invention should be understood by people with ordinary skills in the field to which the present invention belongs. The "first", "second" and similar words used in the present invention do not indicate any order, quantity or importance, but are only used to distinguish different components. "Include" or "comprise" and similar words mean that the elements or objects appearing before the word include the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0059] The above is only a preferred embodiment of the present invention, and does not limit the present invention in other forms. Any technician familiar with the profession may use the above disclosed technical content to change or modify it into an equivalent embodiment with equivalent changes. However, any simple modification, equivalent change and modification made to the above embodiment according to the technical essence of the present invention without departing from the technical solution of the present invention still belongs to the protection scope of the technical solution of the present invention.

[0060] This patent is not limited to the above-mentioned optimal implementation mode. Anyone can derive other forms of RS (12,9) fast decoding methods for the DMR standard under the inspiration of this patent. All equal changes and modifications made according to the scope of the patent application of the present invention should be covered by this patent.

Claims

1. A RS (12,9) fast decoding method for the DMR standard, characterized by: The recursive relationship of the syndrome corresponding to the error position is stored in advance. When the RS code is received, if one bit is wrong, it is only necessary to calculate the recursive relationship of the syndrome, obtain the error position by looking up the table, substitute the error position information into the syndrome, obtain the error difference, and finally perform XOR on the error difference and the received RS code to obtain the error-corrected RS code.

2. The RS (12, 9) fast decoding method based on the DMR standard according to claim 1, characterized in that: Before correcting RS(12,9), the ratio relationship of each syndrome at the 12 possible error symbol positions is stored in the error position ratio table. When correcting RS(12,9), if the ratios between syndromes are equal, it means that a bit error has occurred. Further error correction is performed, and the error position ratio table is looked up according to the ratio relationship to obtain the error position information: When the syndrome S1 and the error position j are obtained, the error pattern is directly calculated by the following formula: j = S1 / 2 j Finally, by comparing the value of the received data r(x) corresponding to the error position with the error pattern e j Perform XOR to obtain the error correction result.

3. The RS (12, 9) fast decoding method for the DMR standard according to claim 2, characterized in that: The specific steps include: Step 1: Save the adjacent syndrome ratio relationship value λ of RS(12,9) when a 1-bit error occurs into the lookup table. If the first position is wrong, the corresponding ratio is λ1. And so on. Construct a lookup table with 12 λ values, corresponding to the 12 different positions when each bit error occurs. Step 2: Receive RS (12, 9) code data and calculate the syndrome. If all the syndromes are 0, it means that there is no error in the code data. If not all the syndromes are 0, calculate the ratio of adjacent syndromes, i.e. S3 / S2 and S2 / S1. Step 3: If the ratios of adjacent syndromes are equal, it means that one bit error has occurred and error correction can be performed, then go to step 4 for error correction; if the ratios of adjacent syndromes are not equal, it means that more than one bit error has occurred and error correction cannot be performed, then request retransmission or discard the error codeword; Step 4: If the ratio of adjacent syndromes is equal, then the ratio is λ. Look up the table to get the error position j and substitute it into e j =S1 / 2 j , solve to get the error pattern e j Finally, the data at the jth position of the received symbol data is compared with the error pattern e j Perform XOR to obtain the error correction result and complete the error correction.

4. A radio intercom system using the DMR standard, characterized in that: When in use, the RS (12, 9) fast decoding method according to any one of claims 1-3 is adopted.

5. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of the RS (12, 9) fast decoding method for the DMR standard as described in any one of claims 1 to 3 are implemented.

6. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the RS (12, 9) fast decoding method for the DMR standard as described in any one of claims 1 to 3 are implemented.

Citation Information

Patent Citations

  • Signal coding and modulating method and device for digital interphone, signal demodulating and decoding method and device for digital interphone

    CN104468441A

  • Parallel CRC (Cyclic Redundancy Check) error correction method having single bit error correction function

    CN106788878A

  • Method and apparatus for detecting and correcting errors using cyclic redundancy check

    US20020046382A1

  • Method and apparatus for decoding RS code

    WO2022267031A1