JPH03190327A - Error correction circuit - Google Patents

Error correction circuit

Info

Publication number
JPH03190327A
JPH03190327A JP33081389A JP33081389A JPH03190327A JP H03190327 A JPH03190327 A JP H03190327A JP 33081389 A JP33081389 A JP 33081389A JP 33081389 A JP33081389 A JP 33081389A JP H03190327 A JPH03190327 A JP H03190327A
Authority
JP
Japan
Prior art keywords
error
circuit
syndrome
series
decoding
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.)
Pending
Application number
JP33081389A
Other languages
Japanese (ja)
Inventor
Koji Tomimitsu
康治 冨満
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP33081389A priority Critical patent/JPH03190327A/en
Publication of JPH03190327A publication Critical patent/JPH03190327A/en
Pending legal-status Critical Current

Links

Landscapes

  • Error Detection And Correction (AREA)

Abstract

PURPOSE:To eliminate the need for a division circuit and to reduce the circuit scale by using a hardware for coding in common with the hardware used for decoding. CONSTITUTION:In the case of decoding, a syndrome generating circuit is used to obtain a syndrome series from a reception code series. Then an error is judged from the syndrome series and when any error exists, a ROM 3 is used to obtain an error number, an error location and an error pattern is obtained to correct the error. In the case of coding, the hardware used for decoding is used. Then a syndrome generating circuit 1 generates a syndrome with a redundant series set to 0 is generated and an inverse matrix H<-1> stored in the ROM 3 is used and a definite field arithmetic circuit 2 obtains a redundancy series to execute the coding. Thus, an exclusive circuit for coding is not required and the circuit scale is reduced.

Description

【発明の詳細な説明】 [産業上の利用分野1 本発明は、情報伝送、情報記録を行なう装置に関し、特
に誤り訂正を行なう回路に関する。
DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field 1] The present invention relates to an apparatus for transmitting and recording information, and particularly to a circuit for correcting errors.

[従来の技術] 従来の誤り訂正回路では、冗長符号系列を求める際、情
報多項式を生成多項式で割る方法がとられていた。例え
ば生成多項式 ・・・+β1x+β。とした場合、第2図に示すような
回路により実現できる。第2図の回路は、生成多項式の
割算回路で、各レジスタ5をOとおき順次、情報多項式
の各係数、すなわち情報符号系列を情報符号系列人力6
より入力し、モジュロ2加算器8を通ってレジスタ5に
セットすれば、最後に、各レジスタ5に冗長符号系列を
得ることができる。
[Prior Art] In conventional error correction circuits, when obtaining a redundant code sequence, a method has been adopted in which an information polynomial is divided by a generator polynomial. For example, the generator polynomial...+β1x+β. In this case, it can be realized by a circuit as shown in FIG. The circuit shown in FIG. 2 is a generator polynomial division circuit, in which each register 5 is set to O and each coefficient of the information polynomial, that is, the information code sequence is input to the information code sequence 6 manually.
Finally, a redundant code sequence can be obtained in each register 5 by inputting the code into each register 5 through the modulo 2 adder 8 and setting it in the register 5.

〔発明が解決しようとする課題J 上述した従来の誤り訂正回路は、符号化のために第2図
のような専用の回路を必要とするため、回路規模が増大
するという欠点がある。
[Problem to be Solved by the Invention J] The conventional error correction circuit described above requires a dedicated circuit as shown in FIG. 2 for encoding, which has the disadvantage of increasing the circuit scale.

本発明の目的は、符号化のための専用の回路が不要で、
したがって回路規模が小さい誤り訂正回路を提供するこ
とである。
The purpose of the present invention is to eliminate the need for a dedicated circuit for encoding;
Therefore, it is an object of the present invention to provide an error correction circuit with a small circuit scale.

[課題を解決するための手段] 本発明の誤り訂正回路は、 受信符号系列のシンドロームを生成するシンドローム生
成回路と、 復号化の場合、受信符号系列からシンドローム生成回路
により求められたシンドローム系列から誤りの判断を行
ない、誤りがある場合、誤り数、誤り位置、誤りパター
ンを求め誤り訂正を行ない、符号化の場合、シンドロー
ム生成回路により求められたシンドロームから符号化系
列を求める、有限体上の演算が可能な有限体演算回路と
、有限体演算回路が誤り数、誤り位置、誤りパターンを
求めるための情報および符号化系列を求めるための各種
テーブルを記憶しているROMとを有している。
[Means for Solving the Problems] The error correction circuit of the present invention includes a syndrome generation circuit that generates a syndrome of a received code sequence, and, in the case of decoding, an error correction circuit that generates a syndrome from the received code sequence by the syndrome generation circuit. If there is an error, the number of errors, error position, and error pattern are determined and error correction is performed. In the case of encoding, an encoded sequence is determined from the syndrome determined by the syndrome generation circuit. Calculation on a finite field. The finite field arithmetic circuit has a finite field arithmetic circuit that can perform the following, and a ROM that stores information for the finite field arithmetic circuit to determine the number of errors, error positions, error patterns, and various tables for determining the encoding sequence.

[作用] 本発明は、復号化に必要な回路を符号化に必要な回路と
共用するものである。
[Function] The present invention shares the circuit necessary for decoding with the circuit necessary for encoding.

[実施例] 次に、本発明の実施例について図面を参照して説明する
[Example] Next, an example of the present invention will be described with reference to the drawings.

第1図は本発明の誤り訂正回路の一実施例のブロック図
である。
FIG. 1 is a block diagram of an embodiment of an error correction circuit according to the present invention.

シンドローム生成回路1は、受信符号系列のシンドロー
ムを生成する。有限体演算回路2は、有限体の演算を行
う回路で、シンドローム生成回路lから得られたシンド
ロームを元に誤りの状態の判断、誤り数、誤り位置、誤
りパターンを求め、誤り訂正を行う。ROM(読出し専
用メモリ)3は、有限体演算回路2で必要な各種テーブ
ル、例えば、乗法における逆光やベクトル表現値に対す
る指数表現値などを記憶している。
A syndrome generation circuit 1 generates a syndrome of a received code sequence. The finite field arithmetic circuit 2 is a circuit that performs finite field arithmetic, and performs error correction by determining the error state, determining the number of errors, error positions, and error patterns based on the syndrome obtained from the syndrome generation circuit 1. A ROM (read-only memory) 3 stores various tables necessary for the finite field arithmetic circuit 2, such as backlighting in multiplication and exponent expression values for vector expression values.

復号化の場合、受信符号系列から、シンドローム生成回
路3によりシンドローム系列を求める。
In the case of decoding, the syndrome generation circuit 3 calculates a syndrome sequence from the received code sequence.

そして、このシンドローム系列から誤りの判断を行い、
誤りがある場合、ROM3を用いて、誤り数、誤り位置
、誤りパターンを求め、誤り訂正を行う。符号化の場合
、従来は、第2図に示すような割算回路による方法をと
っていたが、本発明は、復号化で使用するハードウェア
を使用する。
Then, judge the error based on this syndrome series,
If there is an error, the number of errors, error position, and error pattern are determined using the ROM 3, and error correction is performed. In the case of encoding, conventionally a method using a division circuit as shown in FIG. 2 has been used, but the present invention uses hardware used in decoding.

今、入力された情報系列U n−、、U n−、、・−
、U。
The currently input information sequence U n-,, U n-, .-
,U.

に対して、冗長系列U、、、U、、、・・・、 U o
は次式を満たす(ただし、n>m)。
For, the redundant sequence U, , U, ,..., U o
satisfies the following formula (where n>m).

U(α’)=O,U(α1)=o、・・・、U(α1−
1)=O ただし、 U(X) =4Jn−,x”−’ +Un−z X′″
−2+−・+Usa−+ xs−t +・・−+U+ 
X+U。
U(α')=O, U(α1)=o,..., U(α1-
1)=O However, U(X) =4Jn-,x"-' +Un-z X'"
-2+-・+Usa-+ xs-t +・・-+U+
X+U.

ここで、冗長系列をすべてOlすなわちU o =U 
1= ”” = U−r = Oとおいて、これに対応
する式をV (X) とする。
Here, all the redundant sequences are Ol, that is, U o =U
1 = "" = U-r = O, and the corresponding equation is V (X).

VEX)=[J、−、x’−+ +un−z xn−2
+−・+U、X” このV (X)に対するシンドロームをシンドローム生
成回路1より生成し、S、、 =V (αm−1)。
VEX) = [J, -, x'-+ +un-z xn-2
+-・+U,

S ea−2= V (a ”−2)、 ・・・、S+
 =V (al。
S ea-2=V (a ”-2), ..., S+
=V (al.

S O” V (α0)とする。S O” V (α0).

ついで、U”[U−t、U−z、”・、Uol”  S
=[Slm−1,511m−1””+SO]”とおき、
とした時、HU=Sを満たすので、Hの逆行列)(−1
を求め、U=H−’Sにより冗長系列U1−1・・・U
oを算出することができる。シンドローム生成回路1で
、冗長系列なOとした時のシンドロームを生成し、RO
M3に格納した逆行列H−1を使用して、有限体演算回
路2で冗長系列を求めることにより、符号化を実行する
Then, U” [U-t, U-z, “・, Uol” S
= [Slm-1,511m-1""+SO]",
Since HU=S is satisfied, the inverse matrix of H)(-1
Find the redundant sequence U1-1...U by U=H-'S
o can be calculated. Syndrome generation circuit 1 generates a syndrome when O is a redundant series, and RO
Using the inverse matrix H-1 stored in M3, the finite field arithmetic circuit 2 obtains a redundant sequence, thereby performing encoding.

[発明の効果] 以上説明したように本発明は、符号化を復号化で使用す
るハードウェアと共用することにより、割算回路が不要
となり、回路規模を小さくできる効果がある。
[Effects of the Invention] As described above, the present invention has the effect of making the division circuit unnecessary and reducing the circuit scale by sharing the hardware used for encoding with the hardware used for decoding.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の誤り訂正回路の一実施例のブロック図
、第2図は従来の符号化回路のブロック図である。 1・・・シンドローム生成回路、 2・・・有限体演算回路、  3・・・ROM、4・・
・情報符号系列入力、 5・・・レジスタ、6・・・情
報符号系列入力、 7・・・係数乗算器、8・・・モジ
ュロ2加算器。
FIG. 1 is a block diagram of an embodiment of the error correction circuit of the present invention, and FIG. 2 is a block diagram of a conventional encoding circuit. 1... Syndrome generation circuit, 2... Finite field calculation circuit, 3... ROM, 4...
- Information code series input, 5... Register, 6... Information code series input, 7... Coefficient multiplier, 8... Modulo 2 adder.

Claims (1)

【特許請求の範囲】 1、受信符号系列のシンドロームを生成するシンドロー
ム生成回路と、 復号化の場合、受信符号系列からシンドローム生成回路
により求められたシンドローム系列から誤りの判断を行
ない、誤りがある場合、誤り数、誤り位置、誤りパター
ンを求め誤り訂正を行ない、符号化の場合、シンドロー
ム生成回路により求められたシンドロームから符号化系
列を求める、有限体上の演算が可能な有限体演算回路と
、有限体演算回路が誤り数、誤り位置、誤りパターンを
求めるための情報および符号化系列を求めるための各種
テーブルを記憶しているROMとを有する誤り訂正回路
[Scope of Claims] 1. A syndrome generation circuit that generates a syndrome of a received code sequence; and in the case of decoding, an error is determined from the syndrome sequence obtained from the received code sequence by the syndrome generation circuit, and if there is an error, , a finite field calculation circuit capable of performing calculations on a finite field, which calculates the number of errors, error positions, and error patterns and performs error correction, and in the case of encoding, calculates a coded sequence from the syndrome determined by the syndrome generation circuit; An error correction circuit comprising a ROM in which a finite field arithmetic circuit stores information for determining the number of errors, error positions, error patterns, and various tables for determining a coding sequence.
JP33081389A 1989-12-19 1989-12-19 Error correction circuit Pending JPH03190327A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP33081389A JPH03190327A (en) 1989-12-19 1989-12-19 Error correction circuit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP33081389A JPH03190327A (en) 1989-12-19 1989-12-19 Error correction circuit

Publications (1)

Publication Number Publication Date
JPH03190327A true JPH03190327A (en) 1991-08-20

Family

ID=18236836

Family Applications (1)

Application Number Title Priority Date Filing Date
JP33081389A Pending JPH03190327A (en) 1989-12-19 1989-12-19 Error correction circuit

Country Status (1)

Country Link
JP (1) JPH03190327A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010199811A (en) * 2009-02-24 2010-09-09 Fanuc Ltd Memory system of controller

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61230526A (en) * 1985-04-05 1986-10-14 Mitsubishi Electric Corp Coding/decoding circuit
JPS6324724A (en) * 1986-07-17 1988-02-02 Mitsubishi Electric Corp Encoding and decoding circuit

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61230526A (en) * 1985-04-05 1986-10-14 Mitsubishi Electric Corp Coding/decoding circuit
JPS6324724A (en) * 1986-07-17 1988-02-02 Mitsubishi Electric Corp Encoding and decoding circuit

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010199811A (en) * 2009-02-24 2010-09-09 Fanuc Ltd Memory system of controller

Similar Documents

Publication Publication Date Title
US4852098A (en) Polynomial operator in galois fields and a digital signal processor comprising an operator of this type
KR0168839B1 (en) Decoding method and apparatus for bch code
US7162679B2 (en) Methods and apparatus for coding and decoding data using Reed-Solomon codes
JPH0452556B2 (en)
EP0836285B1 (en) Reed-Solomon decoder with general-purpose processing unit and dedicated circuits
JP3354025B2 (en) Error location polynomial calculation method and apparatus
JPH02178738A (en) Detection of errors in arithmetic computation of at least two operands
JPH10112660A (en) Error decoding method and device utilizing reed solomon code
JPH03190327A (en) Error correction circuit
JP2810397B2 (en) Error correction device
KR940011663B1 (en) Error correcting system
JPH08149017A (en) Crc code generating method
JPS6246893B2 (en)
JPH06314978A (en) Chain search circuit
JPH01265332A (en) Production of determinant of crc parallel arithmetic circuit
JP4057876B2 (en) Control method of Galois field multiplier
JPS6217256B2 (en)
JPH0778748B2 (en) Galois field arithmetic unit
JP2710176B2 (en) Error position and error pattern derivation circuit
KR100308025B1 (en) method for multiplication/division in communication system
KR900000670Y1 (en) Cord word generator of read-solomon encoder
EP0458285A1 (en) Error location and error pattern calculation circuit
JP2553571B2 (en) Galois field arithmetic unit
JP2805328B2 (en) Burst error correction method
JP2546014B2 (en) Digital signal processor