CN101001088B - Method and device for implementing decode - Google Patents
Method and device for implementing decode Download PDFInfo
- Publication number
- CN101001088B CN101001088B CN200710002469A CN200710002469A CN101001088B CN 101001088 B CN101001088 B CN 101001088B CN 200710002469 A CN200710002469 A CN 200710002469A CN 200710002469 A CN200710002469 A CN 200710002469A CN 101001088 B CN101001088 B CN 101001088B
- Authority
- CN
- China
- Prior art keywords
- binary
- product
- binary number
- jia luohua
- field
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
This invention relates to a method and a device for realizing coding including: obtaining required Jialuohua few and binary system number, converting the Jialuohua few to a biary domain from Jialuohuafew to get a binary number corresponding to the Jialuohua few, multiplying the binary number corresponding to the Jialuohua number and the binary number necessary for product operation to get the product to carry out operation with it.
Description
Technical field
The present invention relates to the electronic communication field, relate in particular to a kind of method and device of deciphering realized.
Background technology
In the communication technology, the recipient of data message does not also know whether the packet that receives is correct, so the recipient need adopt error-correcting code technique to come the packet that receives is carried out EDC error detection and correction.Error-correcting code technique is a kind of technology that improves communication reliability, is widely used in various communication systems, such as: CDMA (code division multiple access) system, GSM (global system for mobile telecommunications) system and Digital Television.BCH code (a kind of code word, be used to correct the cyclic code of a plurality of random errors) be a common class error correcting code, RS sign indicating number wherein (a kind of code word) is with its very strong error correcting capability, convenient, the coding characteristic of simple of structure, become a kind of error correcting code of extensive use, be mainly used in the digital communication system field.
GF (Jia Luohua) number is an element in the GF territory, the mode that GF number and binary number multiply each other is applied in the realization of decoding of multiple code word, below in conjunction with Fig. 1 and Fig. 2, decode procedure with common RS sign indicating number is an example, and the implementation of the existing GF of obtaining number and binary number product is described in detail.
Common RS sign indicating number decode procedure comprises the steps: as shown in Figure 1
Step 11: by receiverd polynomial r (X)=r
0+ r
1X+r
2X
2+ ... + r
N-1X
N-1, and generator polynomial
Calculate syndrome Sj (j=1,2, L ... .2t), wherein, X represents the front and back order of input symbols, r
iRepresent concrete code element;
Step 12: draw error location polynomial σ (x) by Sj; The common algorithm that draws error location polynomial σ (x) by Sj comprises BM (iterative decoding) algorithm and Euclid (Ou Ji Reed) algorithm;
Step 13: calculate the root of σ (x), its inverse is the errors present number, obtains errors present; The algorithm of the root of common calculating σ (*) comprises Chien (money) search method;
Step 14: count the mistake in computation value by errors present, thereby obtain error pattern
Step 15: deduct wrong multinomial by receiverd polynomial, that is,
Finish whole error correction procedure.
To step 15, adopt the described mode that multiplies each other in the GF territory of Fig. 2 to obtain GF number and binary number product in above-mentioned steps 11, and the method for the product addition that obtains specifically comprised:
Step 21: binary number is transformed into the GF territory from binary field;
Step 22: in the GF territory, the binary number and the GF number in the GF territory that step 21 is obtained carry out the index addition;
Step 23: what addition in the step 22 was obtained is transformed into binary field with value from the GF territory;
Step 24: according to predetermined rule, such as xor operation commonly used, at binary field, with each product value addition that obtains.
Below with draw in the step 11 shown in Figure 3 syndrome Sj (j=1,2, L ...., detailed process 2t) is come realizing in the prior art that the mode that GF number and binary number multiply each other is elaborated, and specifically comprises:
Step 31: the receiving symbol shown in the receiverd polynomial is transformed into the GF territory by the mode of tabling look-up by binary field;
Step 32: in the GF territory, receiving symbol is carried out addition with the index power of the root of corresponding generator polynomial;
Step 33: the value after the addition that step 32 is obtained is transformed into binary field from the GF territory;
Step 34: according to predetermined rule, the xor operation such as commonly used in binary field, carries out each product value that obtains the addition of binary field.
Similarly, to relating to the step of the product that obtains GF number and binary number in step 12, step 13, the step 14, all realize in the manner described above.
In above-mentioned decode procedure, no matter which kind of method of use draws syndrome, error location polynomial, errors present number and improper value, every step that relates to the product that obtains GF number and binary number all needs
Binary number is transformed into the GF territory from binary field, in the GF territory, does addition, and then will obtain be transformed into binary field with value from the GF territory.
But the inventor is adopting aforesaid way to realize finding in the process of decoding, because data are changed back and forth in GF territory and binary field, makes that RAM (random asccess memory) inquiry is frequent, and amount of calculation increases, thereby has consumed logical resource, has influenced decoding speed.
Summary of the invention
The embodiment of the invention provides a kind of method and device of deciphering realized, can simplify decode procedure, improves decoding speed, saves logical resource.
The embodiment of the invention is achieved through the following technical solutions:
The embodiment of the invention provides a kind of method of deciphering of realizing, described method comprises:
Obtain required Jia Luohua number and binary number in the product operation;
The Jia Luohua number is transformed into binary field from galois field, obtains the binary number that described Jia Luohua counts correspondence;
Described Jia Luohua is counted the required binary number of the binary number of correspondence and product operation multiply each other, obtain product;
Utilize described product to carry out decoded operation.
The embodiment of the invention provides a kind of device of deciphering realized, is used to cooperate the method that realizes decoding, and described device comprises:
Jia Luohua number and binary number acquiring unit are used for obtaining Jia Luohua number and required Jia Luohua number and the binary number of binary number product operation;
The binary field converting unit is used for the Jia Luohua number is transformed into binary field from galois field, obtains the binary number that Jia Luohua counts correspondence;
Binary field product unit is used for that described Jia Luohua is counted the required binary number of the binary number of correspondence and product operation and multiplies each other, and obtains product;
Decoding unit is used to utilize described product to carry out decoded operation.
The technical scheme that provides by the invention described above embodiment as can be seen, the embodiment of the invention adopts a kind of method and device of deciphering realized, makes that the conversion between binary field and the GF territory significantly reduces, thereby can simplify decode procedure, improve decoding speed, save logical resource, reduce power consumption.
Description of drawings
Fig. 1 is a procedure chart of realizing RS decoding in the prior art;
Fig. 2 is a procedure chart of realizing the product of GF number and binary number in the prior art;
Fig. 3 is for being calculated the procedure chart of syndrome by receiverd polynomial in the prior art;
Fig. 4 is the procedure chart of the method for the embodiment of the invention;
Fig. 5 is the exemplary embodiments of the method for the application embodiment of the invention;
Fig. 6 is the structure chart of the device of the embodiment of the invention.
Embodiment
The specific implementation of a method of the embodiment of the invention specifically comprises as shown in Figure 4:
Step 41: in the process of decoding, obtain required GF number and binary number in the operation of GF number and binary number product;
Step 42: the GF number is transformed into binary field from the GF territory, obtains the binary number that described GF counts correspondence; Specifically can realize to the conversion table of binary field by inquiry GF territory;
Step 43: at binary field, described GF is counted the required binary number of the binary number of correspondence and product operation multiply each other, obtain product; Described binary number and described GF count the occurrence of corresponding binary number can be identical also can be inequality; Described binary number comprises definite need multiplying each other with the GF number, to obtain the binary number of product, specifically can determine in advance described binary number according to the requirement of decoding, perhaps, determines in the process of decoding or generates the binary number that need multiply each other with the GF number; The described method that multiplies each other comprises: basic naturally phase multiplication; Perhaps, look-up table.
Step 44: utilize described product to carry out decoded operation.Such as: if that need obtain described each product and value, then can be with each product value addition that obtains, the concrete method of addition can comprise: the xor operation in the binary field.
Below with the interpretation method of RS sign indicating number as a specific embodiment of the present invention, the specific embodiment of the present invention is described in detail.
In each step of RS code coding method, relating to the method that obtains GF number and binary number product and all can finish with the described method of the embodiment of the invention, is that a specific embodiment is described in detail specific implementation of the present invention to adopt the described method of the embodiment of the invention to obtain syndrome in the RS interpretation method shown in Figure 5 below.
The exemplary embodiments of using the inventive method as shown in Figure 5, Fig. 5 adopts nature base multiplication realization GF (2 in the RS decode procedure
8) on the procedure chart of multiplication.For the RS in the GSM05.03 agreement (85,73) decoding, wherein, 85 are meant that code stream to be decoded has 85 code elements, and 73 are meant that 73 of fronts are initial data in 85 code elements to be decoded, next 12 is extra 12 code elements of adding in the cataloged procedure, is used for doing decoding.Need to calculate 12 syndromes:
S
i＝r(α
i+121)＝r
0+r
1α
i+121+r
2(α
i+121)
2+…+r
84(α
i+121)
84＝r
0+r
1α
i+121+r
2α
2*(i+121)+…+r
84α
84*(i+121)
Wherein, i is 0,1,2 ...., 11.
Specifically comprise:
Step 51: by searching the GF territory, with the root of the generator polynomial in GF territory, for example α to the conversion table of binary field
I+121, (α
I+121)
2Deng, be converted to the expression mode of binary field;
Step 52: in binary field, adopt nature base phase multiplication, the root of the generator polynomial of the receiving symbol of binary field and binary field is multiplied each other, draw r
1α
I+121, r
2(α
I+121)
2Value Deng formula;
Step 53: in binary field, the value of described formula is obtained syndrome according to carrying out xor operation (that is addition).
The speed that adopts step 51 to the described method of step 53 to calculate syndrome is very fast, and only need carry out a table lookup operation, adopts the multiplier of nature base phase multiplication can be multiplexing simultaneously, and the area that takies is little.
Be understandable that, other each steps that relate at the RS code coding method, for example, draw error location polynomial σ (x) by syndrome Sj, calculate the root of σ (x), count by errors present in each step of mistake in computation value, relate to the method that obtains GF number and binary product and all can finish with the described method of the embodiment of the invention.
The embodiment of the invention also provides a kind of device that is used to cooperate the described method of the embodiment of the invention, and as shown in Figure 6, described device specifically comprises:
Jia Luohua number and binary number acquiring unit are used for obtaining GF number and required GF number and the binary number of binary number product operation;
The binary field converting unit is used for the GF number is transformed into binary field from the GF territory, obtains the binary number that GF counts correspondence;
Binary field product unit is used for that described GF is counted the required binary number of the binary number of correspondence and product operation and multiplies each other, and obtains product; The required binary number of described product operation and described GF count the occurrence of corresponding binary number can be identical also can be inequality; The required binary number of described product operation comprises definite need multiplying each other with the GF number, to obtain the binary number of product, specifically can determine in advance described binary number, perhaps, in the process of decoding, determine or generate the binary number that need multiply each other with the GF number according to the requirement of decoding;
Decoding unit is used to utilize described product to carry out decoded operation.
If need obtain described each product and value, then described decoding unit can comprise:
The binary field addition unit is used each product addition that described binary field product unit is obtained, and obtains the sum of products of GF number and binary number.
Described device is applied to the realization of decoding of BCH code, specifically can comprise the RS sign indicating number.
Be understandable that, relate to the device that obtains GF number and binary number product and all can finish with the described device of the embodiment of the invention.
In sum, the embodiment of the invention can be applied to relate in the various realization of decoding of obtaining GF number and binary number product, the conversion between binary field and the GF territory can be significantly reduced, thereby can simplify decode procedure, improve decoding speed, save logical resource, reduce power consumption.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.
Claims (9)
1. a method that realizes deciphering is characterized in that, described method comprises:
Obtain required Jia Luohua number and binary number in the product operation;
The Jia Luohua number is transformed into binary field from galois field, obtains the binary number that described Jia Luohua counts correspondence;
Described Jia Luohua is counted the required binary number of the binary number of correspondence and product operation multiply each other, obtain product;
Utilize described product to carry out decoded operation.
2. the method for claim 1 is characterized in that, the method that the binary number that obtains in the binary number that described Jia Luohua counts correspondence and the decoded operation process multiplies each other comprises: basic naturally multiplication mutually or look-up table.
3. method as claimed in claim 1 or 2 is characterized in that, described decoded operation comprises: with described product addition.
4. method as claimed in claim 1 or 2 is characterized in that, described decoded operation comprises the decoded operation to the cyclic code BCH code of correcting a plurality of random errors.
5. method as claimed in claim 4 is characterized in that, described BCH code comprises: code word RS sign indicating number.
6. a device of realizing deciphering is used to cooperate the method that realizes decoding, it is characterized in that described device comprises:
Jia Luohua number and binary number acquiring unit are used for obtaining Jia Luohua number and required Jia Luohua number and the binary number of binary number product operation;
The binary field converting unit is used for the Jia Luohua number is transformed into binary field from galois field, obtains the binary number that Jia Luohua counts correspondence;
Binary field product unit is used for that described Jia Luohua is counted the required binary number of the binary number of correspondence and product operation and multiplies each other, and obtains product;
Decoding unit is used to utilize described product to carry out decoded operation.
7. device as claimed in claim 6 is characterized in that, if described decoded operation comprises that with described product addition, then described decoding unit can comprise:
The binary field addition unit is used each product addition that described binary field product unit is obtained, and obtains the sum of products of Jia Luohua number and binary number.
8. as claim 6 or 7 described devices, it is characterized in that described decoded operation comprises the decoded operation to BCH code.
9. device as claimed in claim 8 is characterized in that, described BCH code comprises: the RS sign indicating number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710002469A CN101001088B (en) | 2007-01-24 | 2007-01-24 | Method and device for implementing decode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710002469A CN101001088B (en) | 2007-01-24 | 2007-01-24 | Method and device for implementing decode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101001088A CN101001088A (en) | 2007-07-18 |
| CN101001088B true CN101001088B (en) | 2010-05-19 |
Family
ID=38692927
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710002469A Active CN101001088B (en) | 2007-01-24 | 2007-01-24 | Method and device for implementing decode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101001088B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1599262A (en) * | 2004-08-06 | 2005-03-23 | 南京邮电学院 | Method of realizing Reed Solomen convolution code in broadband radio insertion system |
-
2007
- 2007-01-24 CN CN200710002469A patent/CN101001088B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1599262A (en) * | 2004-08-06 | 2005-03-23 | 南京邮电学院 | Method of realizing Reed Solomen convolution code in broadband radio insertion system |
Non-Patent Citations (3)
| Title |
|---|
| JP特开平7－200332A 1995.08.04 |
| 叶清贵,刘宇怀,莫霍德,刘锦高.R-S码纠错算法的软件实现.华东师范大学学报(自然科学版) 4.2005,(4),98-101. |
| 叶清贵,刘宇怀,莫霍德,刘锦高.R-S码纠错算法的软件实现.华东师范大学学报(自然科学版) 4.2005,(4),98-101. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101001088A (en) | 2007-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102553814B1 (en) | Transmitter and method for generating additional parity thereof | |
| US7237183B2 (en) | Parallel decoding of a BCH encoded signal | |
| US7206992B2 (en) | Decoding a received BCH encoded signal | |
| US8700977B2 (en) | High-performance ECC decoder | |
| CN101277119B (en) | Method for complexing hardware of Reed Solomon code decoder as well as low hardware complex degree decoding device | |
| CA3193950C (en) | Forward error correction with compression coding | |
| WO2007126266A1 (en) | Apparatus and method for transmitting/receiving signal in communication system | |
| CN101325706B (en) | Reed-Solomon decoder with low hardware spending | |
| CN101442313B (en) | Coding method, decoding method, coding device and decoding device during digital communication process | |
| CN101692612B (en) | Multi-specification Reed-Solomon encoding and decoding method, device and system | |
| KR20160103906A (en) | Transmitter and method for generating additional parity thereof | |
| CN112468160B (en) | Parallel circuit based on money search algorithm and Funi algorithm | |
| CN115632662B (en) | Syndrome calculation method, device, equipment and medium in RS decoding | |
| US10193574B1 (en) | Efficient syndrome calculation in processing a GLDPC code | |
| CN101001088B (en) | Method and device for implementing decode | |
| CN102394662A (en) | Method for decoding broadcast channel (BCH) codes | |
| Chen et al. | A lookup table decoding of systematic (47, 24, 11) quadratic residue code | |
| US20090055716A1 (en) | Efficient Chien search method and system in Reed-Solomon decoding | |
| Zhang et al. | Low-complexity transformed encoder architectures for quasi-cyclic nonbinary LDPC codes over subfields | |
| Huang et al. | A novel approach to the quadratic residue code | |
| CN102025379B (en) | Decoder for error correcting code and error correcting value calculating device thereof | |
| Qamar et al. | An efficient encoding algorithm for (n, k) binary cyclic codes | |
| Liu et al. | Reed-Solomon codes for satellite communications | |
| Prashanthi et al. | An advanced low complexity double error correction of an BCH decoder | |
| Babrekar et al. | Review of FPGA Implementation of Reed-Solomon Encoder-Decoder |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: HAISI SEMICONDUCTOR CO., LTD., SHENZHEN Free format text: FORMER OWNER: HUAWEI TECHNOLOGY CO LTD Effective date: 20120222 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20120222 Address after: 518129 Bantian HUAWEI Longgang HUAWEI electric production center, Shenzhen District, Guangdong, China Patentee after: Haisi Semiconductor Co., Ltd., Shenzhen Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: Huawei Technologies Co., Ltd. |