Programmable Finite Field Generator for Memory Adaptability

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing memory systems struggle to generate varying quantities and bitrates of substantially random binary sequences, as their hardware and circuitry are statically configured, limiting their adaptability for cryptographic operations and noise source applications.

Innovation Solution

A programmable finite field generator system with configuration registers that store coefficient values for Galois Field multipliers, allowing dynamic adjustment of sequence generation parameters such as bitrate, quantity, and power consumption, enabling the generation of finite field sequences with different polynomial orders and types.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If hardware and circuitry are statically configured, then device complexity is reduced and manufacturing is easier, but adaptability for different cryptographic operations and noise source requirements is limited

Engineering Contradiction:
ImproveadaptabilityVSAvoiddevice complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent implements dynamically reconfigurable hardware circuitry that can change its configuration at runtime through control signals. The finite field generator includes programmable logic elements that can be reconfigured to support different polynomial orders and sequence generation parameters, allowing the same hardware to adapt to various cryptographic operations and noise source requirements without being fixed during manufacturing

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system allows dynamic modification of operational parameters such as polynomial order, sequence length, and generation bitrate through programmable control. Configuration registers and control logic enable the hardware to switch between different finite field parameters (e.g., GF(2^m) where m can vary), providing versatility for different cryptographic algorithms while maintaining a single unified hardware design

Inventive Principle:
Principle #35Parameter changes

2Adaptability or versatility

If hardware is designed to support varying quantities and bitrates of binary sequences, then adaptability improves, but device complexity and manufacturing difficulty increase

Engineering Contradiction:
ImproveversatilityVSAvoidease of manufacture
Core Design Contradiction:
Adaptability or versatilityVSEase of manufacture

Solution Approach 1:

The patent designs a universal finite field generator that can perform multiple functions through a single unified architecture. The same hardware circuitry supports different sequence quantities, bitrates, and polynomial orders by receiving control signals that reconfigure its operation. This multi-functional design eliminates the need for multiple dedicated hardware units, simplifying manufacturing while providing versatility for cryptographic operations, noise generation, and other applications

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Adaptability or versatility

If static configuration is used, then manufacturing precision requirements are reduced, but the system cannot dynamically adjust to different operational needs

Engineering Contradiction:
ImproveadaptabilityVSAvoidmanufacturing precision
Core Design Contradiction:
Adaptability or versatilityVSManufacturing precision

Solution Approach 1:

The system incorporates dynamically reconfigurable elements that can be programmed after manufacturing to achieve the desired configuration. Control logic and configuration registers allow the hardware to be precisely adjusted to different operational requirements through software or control signals, eliminating the need for high-precision manufacturing variations while maintaining adaptability

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS20240012616A1Programmable finite field generator for memory
Publication Date: 2024.01.11 MICRON TECHNOLOGY INC
  • US20240012616A1 patent drawing
  • US20240012616A1 patent drawing
  • US20240012616A1 patent drawing

AI summary

Methods, systems, and devices for a programmable finite field generator for memory are described. In some cases, a system (e.g., a memory system, a host system) may store coefficient values indicating Galois Field multipliers in an array of configuration registers associated with a finite field generator. To update a set of values stored in a set of registers associated with the finite field generator, the system may perform a set of Galois Field multiplication operations according to Galois Field multipliers indicated by the coefficient values stored in the array of configuration registers. The system may perform at least one Galois Field summation operation on one or more of the multiplied values to generate an updated value. Then, the system may store the updated value in a first register from the set of registers, and shift the set of values along the remaining set of registers.