Wang et al., 1985 - Google Patents
VLSI architectures for computing multiplications and inverses in GF (2 m)Wang et al., 1985
- Document ID
- 12660027080529603022
- Author
- Wang
- Troung
- Shao
- Deutsch
- Omura
- Reed
- Publication year
- Publication venue
- IEEE Transactions on Computers
External Links
Snippet
Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that can be easily realized on VLSI chips. Massey and Omura [1] recently …
- 241000315040 Omura 0 abstract description 2
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
- G06F2207/3804—Details
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
- G06F2207/7209—Calculation via subfield, i.e. the subfield being GF(q) with q a prime power, e.g. GF ((2**m)**n) via GF(2**m)
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06G—ANALOGUE COMPUTERS
- G06G7/00—Devices in which the computing operation is performed by varying electric or magnetic quantities
- G06G7/12—Arrangements for performing computing operations, e.g. operational amplifiers
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | VLSI architectures for computing multiplications and inverses in GF (2 m) | |
| Jain et al. | Efficient semisystolic architectures for finite-field arithmetic | |
| Yeh et al. | Systolic multipliers for finite fields GF (2 m) | |
| Wei | VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF (2/sup m/) | |
| US4587627A (en) | Computational method and apparatus for finite field arithmetic | |
| US4037093A (en) | Matrix multiplier in GF(2m) | |
| Guo et al. | Digit-serial systolic multiplier for finite fields GF (2 m) | |
| Liu | Architecture for VLSI design of Reed-Solomon decoders | |
| US4797848A (en) | Pipelined bit-serial Galois Field multiplier | |
| Guo et al. | Hardware-efficient systolic architecture for inversion and division in GF (2m) | |
| US7089276B2 (en) | Modular Galois-field subfield-power integrated inverter-multiplier circuit for Galois-field division over GF(256) | |
| Fenn et al. | Dual basis systolic multipliers for GF (2m) | |
| Taheri et al. | High-speed signal processing using systolic arrays over finite rings | |
| US6052704A (en) | Exponentiation circuit and inverter based on power-sum circuit for finite field GF(2m) | |
| US4216531A (en) | Finite field multiplier | |
| KR100322739B1 (en) | Finite Field Computation Method and Its Apparatus | |
| US5964826A (en) | Division circuits based on power-sum circuit for finite field GF(2m) | |
| US5931894A (en) | Power-sum circuit for finite field GF(2m) | |
| Hasan et al. | Efficient architectures for computations over variable dimensional Galois fields | |
| DEUTSCH et al. | VLSI Architectures for Computing Multiplications and | |
| Mekhallalati et al. | Novel radix finite field multiplier for GF (2m) | |
| Bandyopadhyay et al. | Algorithms for multiplication in Galois field for implementation using systolic arrays | |
| WO1991020028A1 (en) | Universal galois field multiplier | |
| Chang et al. | The VLSI design of a single chip for the multiplication of integers modulo a Fermat number | |
| Wang et al. | VLSI architectures for computing multiplications and inverses in GF (2-m) |