Compact galois field multiplier enginer
A Galois field and multiplier technology, applied in the field of small Galois field multiplier engines, can solve problems such as complex situations
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] Besides the preferred embodiment or preferred embodiments disclosed below, the invention is capable of other embodiments and of being practiced or carried out in different ways. It is therefore to be understood that the invention is not limited in application to the details of construction and the arrangement of component parts set forth in the following description or illustrated in the drawings.
[0037] A Galois Field GF(n) is a set of elements over which binary operations can be performed. Addition and multiplication must satisfy commutative, associative and distributive laws. A field with a finite number of elements is a finite field. An example of a binary field is the set {0, 1}, denoted by GF(2) under modulo 2 addition and modulo 2 multiplication. The modulo-2 addition and multiplication operations are defined by the table shown in the figure below. The first row and column indicate the inputs to the Galois field adder and multiplier. For example, 1+1=0 and ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com