JPH02217022A - Galois field computing element - Google Patents

Galois field computing element

Info

Publication number
JPH02217022A
JPH02217022A JP3862589A JP3862589A JPH02217022A JP H02217022 A JPH02217022 A JP H02217022A JP 3862589 A JP3862589 A JP 3862589A JP 3862589 A JP3862589 A JP 3862589A JP H02217022 A JPH02217022 A JP H02217022A
Authority
JP
Japan
Prior art keywords
input
conversion means
output
galois field
computing element
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
JP3862589A
Other languages
Japanese (ja)
Inventor
Chiyoko Matsumi
松見 知代子
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.)
Panasonic Holdings Corp
Original Assignee
Matsushita Electric Industrial Co Ltd
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 Matsushita Electric Industrial Co Ltd filed Critical Matsushita Electric Industrial Co Ltd
Priority to JP3862589A priority Critical patent/JPH02217022A/en
Publication of JPH02217022A publication Critical patent/JPH02217022A/en
Pending legal-status Critical Current

Links

Landscapes

  • Detection And Correction Of Errors (AREA)
  • Error Detection And Correction (AREA)

Abstract

PURPOSE:To execute various general purpose operation by providing the title computing element with 1st and 2nd selection means, 1st and 2nd conversion means and a computing means. CONSTITUTION:The computing element is provided with the 1st conversion means for the 1st input in the Galois field GF2<m> (m is a position integer) of a Galois field GF2, the 1st selection means for finding out the 1st operand A from a 1st input and the output of the 1st conversion means, the 2nd conversion means for a 2nd input, the 2nd selection means for finding out a 2nd operand B from the 2nd input and the output of the 2nd conversion means, and the computing means for setting up a 3rd operands C, S respectively to (1, 1) and (B, O) and the time of adding and multiplying based upon the 3rd control signal to find out (A+1).C+B+S. Consequently, the Galois field computing element capable of attaining various operation from inputs P, Q and constituted of a small circuit substrate can be constituted.

Description

【発明の詳細な説明】 産業上の利用分野 本発明は、誤り訂正符号を用いる時に必要とされるガロ
ア拡大体の各種の汎用演算を行なうガロア拡大体演算器
に関するものである。
DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a Galois extension field arithmetic unit that performs various general-purpose operations on the Galois extension field required when error correction codes are used.

従来の技術 この種の演算器に付いて、従来の技術では、例えば加算
は要素のベクトル表現の排他的論理和、もしくは(1+
αj−i)を ROM等から得てα十αJ=α・ (1
+α」−”)により求め、また乗算は要素のベクトル表
現の直接演算、もしくは指数表現のMod(2”−1)
の加算により求めるというように個別に行なわれている
2. Description of the Related Art Regarding this type of arithmetic unit, in the conventional technology, for example, addition is performed using exclusive OR of vector representations of elements, or (1+
αj−i) is obtained from ROM etc. and α1 αJ=α・(1
+α”-”), and multiplication is a direct operation of the vector representation of the element, or Mod (2”-1) of the exponential representation.
This is done individually by adding .

発明が解決しようとする課題 しかしながら上記のような構成では、各種の演算を要求
される場合構成が困難であり、構成した場合にも回路規
模が大きいという課題を有している。
Problems to be Solved by the Invention However, the above configuration has the problem that it is difficult to configure when various calculations are required, and even if it is configured, the circuit scale is large.

本発明はかかる点に鑑み、汎用演算が可能なガロア拡大
体演算器を提供することを目的とする。
In view of the above, an object of the present invention is to provide a Galois extension field arithmetic unit capable of performing general-purpose operations.

課題を解決するための手段 本発明は、CF (2’″)上で、第1の入力に対する
第1変換手段と、第1の入力と第1変換手段の出力から
第1演算数Aを求める第1選択手段と、第2の入力に対
する第2変換手段と、第2の入力と第2変換手段の出力
から第2演算数Bを求める第2選択手段と、第3の制御
信号に基づいて加算時、乗算時には第3演算数(C,S
)をそれぞれ(1,1)  (B、  O)として(A
+1)・C+B+Sを求める演算手段を備えたガロア拡
大体演算器である。
Means for Solving the Problems The present invention provides a first conversion means for a first input, and a first arithmetic operation A is calculated from the output of the first input and the first conversion means on CF (2'''). a first selection means, a second conversion means for a second input, a second selection means for determining a second operation number B from the second input and an output of the second conversion means, and a second selection means based on a third control signal. During addition and multiplication, the third operation number (C, S
) are respectively (1, 1) (B, O) and (A
+1)・C+B+S is a Galois expansion field arithmetic unit equipped with an arithmetic means for calculating C+B+S.

作用 本発明は、第1の入力Pとその数種の変換値から第1演
算数Aを、第2の入力Qとその数種の変換値から第2演
算数Bを求めた上で、加算時には(C,S) = (1
,1)、乗算時には(C,S’)=(B、O)として(
A+1)・C+B+Sを求めることにより、それぞれ(
A+ 1 )・1+B+1 =A+B、  (A+ 1
 )・B+B+0=A−Bを求めており、入力P、  
Qから多種の演算を可能にした回路規模の小さいガロア
拡大体演算器を構成する。
Effect The present invention calculates the first operation number A from the first input P and its several converted values, and the second operation number B from the second input Q and its several conversion values, and then adds them. Sometimes (C,S) = (1
, 1), and when multiplying (C, S') = (B, O), (
By finding A+1) and C+B+S, respectively (
A+ 1 )・1+B+1 =A+B, (A+ 1
)・B+B+0=A-B, input P,
A Galois extension field arithmetic unit with a small circuit scale that enables a variety of operations is constructed from Q.

実施例 以下に、本発明の実施例を図面を参照して説明する。Example Embodiments of the present invention will be described below with reference to the drawings.

図は本発明の実施例におけるに F (2’)上のカロ
ア拡大体演算器の構成を示すものである。1は2乗変換
器、2は送元変換器、3は第1選択器、4は第2選択器
、5は演算器、6はバッファ、7は乗加算器である。
The figure shows the configuration of a Calois extension field arithmetic unit on F (2') in an embodiment of the present invention. 1 is a square converter, 2 is a source converter, 3 is a first selector, 4 is a second selector, 5 is an arithmetic unit, 6 is a buffer, and 7 is a multiplier/adder.

以下、このガロア拡大体演算器の動作を説明する。まず
第1選択器3は、第1の制御信号Xが0の時に第1の入
力Pを、第1の制御信号Xが1の時に2乗変換器lの出
力P2を第1演算数Aとして出力する。第2選択器4は
、第2の制御信号yがOの時に第2の入力Qを、第2の
制御信号yが1の時に送元変換器2の出力1/Qを第2
演算数Bとして出力する。演算器5では、まずバッファ
6においてその出力の最下位ビットのみをプルアップ状
態、残りの上位からm−1ビツトをプルダウン状態にし
、第3の制御信号2をアウトプットイネーブル(アクテ
ィブロー)として用いると、2=0の時には第2演算数
Bを、z=1の時には(0,0,・・・、0.1)を第
3演算数Cとして得る。そして乗加算器7で、第3演算
数Sを第3の制御信号2に対しくLO+”・+O+2)
とおいて(A+1)−C+B+Sを求めて出力する。そ
の出力の実際の値を次の表に示す。
The operation of this Galois extension field arithmetic unit will be explained below. First, the first selector 3 uses the first input P when the first control signal X is 0, and the output P2 of the square converter l when the first control signal X is 1. Output. The second selector 4 selects the second input Q when the second control signal y is O, and selects the output 1/Q of the source converter 2 when the second control signal y is 1.
Output as arithmetic number B. In the arithmetic unit 5, the buffer 6 first pulls up only the least significant bit of its output, pulls down the remaining m-1 bits from the higher order, and uses the third control signal 2 as an output enable (active low). Then, when 2=0, the second arithmetic number B is obtained, and when z=1, (0, 0, . . . , 0.1) is obtained as the third arithmetic number C. Then, in the multiplier/adder 7, the third arithmetic number S is applied to the third control signal 2 (LO+"・+O+2)
Then, (A+1)-C+B+S is determined and output. The actual values of the output are shown in the following table.

なお、本実施例では変換器として2乗、逆光を用いてい
るが、任意の変換が可能であり、また制御信号の割当も
任意でよい。ここでは、第1の入力Pを単一入力として
いるが複数個の入力にそれぞれ各種の変換(それぞれの
入力に対し同じ変換である必要はなく、また変換をしな
い場合もある)を行なってそれらを第1選択器の入力と
することも可能である。第2の入力に関しても同様であ
る。
In this embodiment, a square converter and a backlight converter are used, but any conversion is possible, and control signals may be assigned arbitrarily. Here, the first input P is a single input, but multiple inputs are subjected to various transformations (the same transformation is not required for each input, and there are cases where no transformation is performed). It is also possible to input the first selector. The same applies to the second input.

また、本発明は任意のガロア拡大体に適用可能である。Furthermore, the present invention is applicable to any Galois extension field.

発明の詳細 な説明したように、本発明によれば、簡単な回路構成に
より、多種の汎用演算を行なうことができる。
As described in detail, according to the present invention, a wide variety of general-purpose operations can be performed with a simple circuit configuration.

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

図は本発明の一実施例におけるカロア拡大体演算器のブ
ロック図である。 1・・・2乗変換器、2・・・送元変換器、3・・・第
1選択器、4・・・第2選択器、5・・・演算器、6・
・・バッファ、7・・・乗加算器。
The figure is a block diagram of a Calois extension field arithmetic unit in one embodiment of the present invention. DESCRIPTION OF SYMBOLS 1... Square converter, 2... Source converter, 3... First selector, 4... Second selector, 5... Arithmetic unit, 6...
... Buffer, 7... Multiply adder.

Claims (1)

【特許請求の範囲】[Claims] ガロア体GF(2)の拡大体GF(2^m)(mは正の
整数)の上で、第1の入力Pに対する1個もしくは複数
個の第1変換手段と、前記第1の入力Pと前記第1変換
手段の出力を入力として第1の制御信号に基づいて1個
以上の入力から第1演算数Aを求める第1選択手段と、
第2の入力Qに対する1個もしくは複数個の第2変換手
段と、前記第2の入力Qと前記第2変換手段の出力を入
力として第2の制御信号に基づいて1個以上の入力から
第2演算数Bを求める第2選択手段と、第3の制御信号
に基づいて加算時には第3演算数(S、C)を(1、1
)、乗算時には第3演算数(S、C)を(0、B)とし
て前記第1演算数Aと前記第2演算数Bから(A+1)
・C+B+Sを求める演算手段とを有することを特徴と
するガロア拡大体演算器。
On the extension field GF(2^m) (m is a positive integer) of the Galois field GF(2), one or more first transformation means for the first input P, and the first input P and a first selection means that uses the output of the first conversion means as input and calculates a first operation number A from one or more inputs based on a first control signal;
one or more second conversion means for a second input Q; and a second conversion means for converting one or more inputs based on a second control signal using the second input Q and the output of the second conversion means as inputs. a second selection means for obtaining the two-operational number B;
), at the time of multiplication, the third operation number (S, C) is (0, B), and from the first operation number A and the second operation number B, (A+1)
- A Galois extension field arithmetic unit characterized by having an arithmetic means for calculating C+B+S.
JP3862589A 1989-02-17 1989-02-17 Galois field computing element Pending JPH02217022A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3862589A JPH02217022A (en) 1989-02-17 1989-02-17 Galois field computing element

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3862589A JPH02217022A (en) 1989-02-17 1989-02-17 Galois field computing element

Publications (1)

Publication Number Publication Date
JPH02217022A true JPH02217022A (en) 1990-08-29

Family

ID=12530423

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3862589A Pending JPH02217022A (en) 1989-02-17 1989-02-17 Galois field computing element

Country Status (1)

Country Link
JP (1) JPH02217022A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04278642A (en) * 1991-03-06 1992-10-05 Matsushita Electric Ind Co Ltd Galois enlarging field computing element
CN1042270C (en) * 1991-03-20 1999-02-24 三星电子株式会社 Operational method and apparatus over GF(2m) using subfield GF(2m/2)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6024650A (en) * 1983-07-20 1985-02-07 Hitachi Ltd Operating circuit on galois field

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6024650A (en) * 1983-07-20 1985-02-07 Hitachi Ltd Operating circuit on galois field

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04278642A (en) * 1991-03-06 1992-10-05 Matsushita Electric Ind Co Ltd Galois enlarging field computing element
CN1042270C (en) * 1991-03-20 1999-02-24 三星电子株式会社 Operational method and apparatus over GF(2m) using subfield GF(2m/2)

Similar Documents

Publication Publication Date Title
JP2012528391A (en) Integer and multiply-add operations with saturation
JP3345894B2 (en) Floating point multiplier
US5177703A (en) Division circuit using higher radices
US5268857A (en) Device and method for approximating the square root of a number
JPH09325955A (en) Square root arithmetic circuit for sum of squares
JPH02217022A (en) Galois field computing element
JPH0690668B2 (en) Fuzzy computing device
JPH0234054B2 (en)
JPH10187416A (en) Floating point arithmetic unit
JP2595820B2 (en) Galois extended field arithmetic unit
JP2622861B2 (en) Galois extended field arithmetic unit
JP2951685B2 (en) Fixed-point arithmetic unit
JPH0677734A (en) Fm demodulator
JP3415569B2 (en) Decimal data division method and program recording medium therefor
JP2550597B2 (en) Squarer
JPH0383127A (en) Decimal divider
JPH0371331A (en) Multiplier
US20070239811A1 (en) Multiplication by one from a set of constants using simple circuitry
JP2519288B2 (en) Multiplier / divider
CN111610955A (en) Data saturation and packaging processing component, chip and equipment
JPH0324614A (en) Shifting arithmetic unit
JPS60247735A (en) Decimal multiplying circuit
JP3321416B2 (en) Arithmetic device with correction processing and program recording medium therefor
JPS6120131A (en) Processing unit
JPS6177964A (en) Digital signal processor