Data Encoding for Low-Hamming-Weight Memory Bus Transfers

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

External memory accesses in computing systems consume a significant amount of power, particularly due to the capacitance of the bus, and existing methods like bus-invert coding require additional hardware and decrease efficiency as the number of bits compared increases.

Innovation Solution

A method of encoding data values by mapping them to a pre-defined set of codes based on their probability distribution, reducing the Hamming Weight or number of bit flips, which can be transmitted over external buses without requiring additional bus lines or specialized memories, thus reducing power consumption.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Use of energy by moving object

If bus-invert coding is used to reduce transitions in transmitted data, then power consumption is reduced, but additional bus lines and specialized memories are required

Engineering Contradiction:
Improvepower consumptionVSAvoidadditional bus lines and specialized memories
Core Design Contradiction:
Use of energy by moving objectVSDevice complexity

Solution Approach 1:

The patent changes the parameter being optimized from transition reduction (bus-invert) to Hamming weight reduction. By mapping input values to codes with lower Hamming weight based on probability distribution, the invention reduces power consumption without requiring additional bus lines or specialized memory hardware.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The invention uses a pre-defined set of codes that can be stored in standard memory rather than requiring specialized memory hardware. The mapping from input values to these codes creates a virtual encoding system that works with conventional memory and bus structures.

Inventive Principle:
Principle #26Copying

2Measurement precision

If bus-invert coding compares more bits to determine inversion, then encoding accuracy improves, but efficiency decreases

Engineering Contradiction:
Improveencoding accuracyVSAvoidencoding efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent pre-defines a set of codes with known Hamming weights before encoding begins. This eliminates the need for real-time comparison of multiple bits to determine inversion, as the mapping to low Hamming weight codes is determined by pre-calculated probability distributions, significantly improving encoding efficiency.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The encoding system uses the probability distribution characteristics of the input data itself to determine the optimal code mapping. The system serves its own encoding needs by leveraging statistical properties of the data rather than requiring complex external control logic for bit comparison.

Inventive Principle:
Principle #25Self-service

3Speed

If input values are mapped to codes with same bit-length, then transmission efficiency is maintained, but power reduction is limited

Engineering Contradiction:
Improvetransmission efficiencyVSAvoidpower reduction
Core Design Contradiction:
SpeedVSUse of energy by moving object

Solution Approach 1:

The patent introduces a new dimension to the encoding problem by considering Hamming weight as the optimization criterion instead of just transition reduction. This dimensional shift allows mapping to codes of the same bit-length that have lower Hamming weight, achieving both transmission efficiency and power reduction simultaneously.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS20260031831A1Efficient Encoding Methods
Publication Date: 2026.01.29 IMAGINATION TECH LTD
  • US20260031831A1 patent drawing
  • US20260031831A1 patent drawing
  • US20260031831A1 patent drawing

AI summary

Power consumption of read/write operations of a processor is reduced by encoding data values. An input value of a plurality of input values with a uniformly distributed random probability is mapped to one of a predefined set of codes, wherein the input value is mapped to a code that comprises more bits than the input value. The codes corresponding to the input value are outputted, wherein compared to an input value having a relatively low value, an input value having a relatively high value is mapped to a code of the pre-defined set of codes which either: (i) is closer to a target Hamming Weight, or (ii) has closer to a target number of bit flips within the code.