Composite Valid Data Encoding for Maximum Bit Packing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing computing systems face inefficiencies in storing and communicating bits of information due to unused bits in different data formats, leading to suboptimal encoding and potential waste in storage space and communication bandwidth.

Innovation Solution

The system employs techniques to identify disjoint classes of valid data and create composite classes, generating transcoders that can encode and decode the theoretical number of possible bits as valid data in given bitstring formats, thereby optimizing bit packing and storage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional data formats are used for storage and communication, then simplicity and ease of implementation are maintained, but storage efficiency and bandwidth utilization deteriorate due to unused bits

Engineering Contradiction:
Improvestorage efficiencyVSAvoidencoding complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent segments the data encoding process into multiple independent transcoders, each handling a specific subset of valid data classes. This allows the system to achieve high storage efficiency by systematically encoding all valid bit patterns while keeping each individual transcoder relatively simple in structure.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary classification of valid data into disjoint classes before encoding. By pre-organizing the encoding space and assigning specific bit patterns to specific classes in advance, the system eliminates unused bits without requiring complex real-time decision-making during encoding operations.

Inventive Principle:
Principle #10Preliminary action

2Loss of information

If more iterations are performed to identify more disjoint classes of valid data, then the number of storable bits increases, but computing resource consumption increases

Engineering Contradiction:
Improveinformation storage capacityVSAvoidcomputing resource consumption
Core Design Contradiction:
Loss of informationVSUse of energy by moving object

Solution Approach 1:

The patent allows the iterative process to run for a partial number of iterations based on available computing resources rather than exhaustively finding all possible disjoint classes. This partial action approach achieves a practical balance between storage capacity improvement and computing resource consumption, encoding the theoretical maximum number of bits possible within resource constraints.

Inventive Principle:
Principle #16Partial or excessive action

3Loss of substance

If non-optimal encoding is used when free bits are limited, then implementation simplicity is maintained, but storage space and communication bandwidth are wasted

Engineering Contradiction:
Improvestorage space utilizationVSAvoidtranscoder complexity
Core Design Contradiction:
Loss of substanceVSDevice complexity

Solution Approach 1:

The patent creates a universal encoding framework where transcoders can handle multiple data formats and validity constraints through a unified approach. The system universally applies the principle of encoding floor(log2(n)) bits across different data formats and constraint types, eliminating waste in storage space and communication bandwidth while maintaining manageable transcoder complexity through standardized procedures.

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

Data Source

PatentUS20250047301A1Storage and Communicating Bits of Information in Composite Classes of Valid Data
Publication Date: 2025.02.06 SRI INTERNATIONAL
  • US20250047301A1 patent drawing
  • US20250047301A1 patent drawing
  • US20250047301A1 patent drawing

AI summary

Techniques are disclosed for storing bits of information in composite classes of valid data. An example method includes determining, by processing circuitry and based on a bitstring format, a first set of bitstrings for a first transcoder, determining, by the processing circuitry and based on the bitstring format, a second set of bitstrings for a second transcoder, wherein no bitstring of the first set of bitstrings matches a bitstring of the second set of bitstrings, and outputting, by the processing circuitry, an indication of a first bit value assigned to the first transcoder and a second bit value assigned to the second transcoder.