Base-N Encoding for Data Throughput and Gate Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for increasing data throughput on interfaces, such as those used in mobile devices, face challenges in reducing energy consumption and require large correspondence tables for larger numeral bases, making them costly for devices where cost is a factor.
Innovation Solution
The method involves encoding and decoding data by calculating base-N coefficients and determining wire state changes using exclusive-NOR operations, allowing direct reading of ternary or larger numeral base coefficients, reducing the number of gates required and ensuring backwards compatibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If previous methods are used to increase data throughput on two-wire bus interfaces, then data throughput is improved, but device complexity and cost increase significantly for larger numeral bases
Solution Approach 1:
The patent extracts and eliminates the need for large correspondence tables by directly calculating base-N coefficients from binary data streams using mathematical operations. Instead of storing pre-computed mappings for all possible symbol combinations, the system computes coefficients on-the-fly through subtraction and comparison operations, thereby removing the bulky lookup tables that previously increased device complexity and cost.
Solution Approach 2:
The patent replaces the mechanical/physical correspondence tables with algorithmic computation. Rather than physically storing and accessing large tables of pre-computed values, the system uses computational algorithms to dynamically generate base-N coefficients from binary input, substituting a static physical storage mechanism with a dynamic computational process that reduces hardware requirements.
2Productivity
If previous methods are used to increase data throughput, then data throughput is improved, but energy consumption increases
Solution Approach 1:
The patent removes the energy-intensive operations associated with accessing and managing large correspondence tables. By eliminating the need to store and search through extensive lookup tables, the system reduces memory access operations and associated power consumption, thereby lowering overall energy usage while maintaining high data throughput through efficient coefficient calculation.
3Productivity
If correspondence tables and translation blocks are added to support larger numeral bases, then data throughput increases, but manufacturing cost increases
Solution Approach 1:
The patent extracts and eliminates the need for expensive correspondence tables and translation blocks by using direct mathematical computation. Instead of manufacturing devices with large stored lookup tables, the system uses algorithmic coefficient calculation that requires minimal hardware resources, thereby significantly reducing manufacturing costs while supporting larger numeral bases for high-speed data transmission.
Solution Approach 2:
The patent replaces physical manufacturing components (correspondence tables, translation blocks) with computational algorithms. This substitution eliminates the need to manufacture and install large physical storage structures, replacing them with software-based or simple hardware-based calculation routines that are much cheaper to manufacture and easier to update or modify.
Data Source
AI summary
System, methods and apparatus are described that facilitate a device to encode/decode data in a data communications interface coupled to a plurality of wires. The device determines a value of a sequence of data bits allocated to a frame, converts the value into a sequence of symbols associated with the frame, and transmits the sequence of symbols to a receiver. The device performs the converting by calculating base-N coefficients of a base-N number polynomial for the frame based on the value, where N is greater than 2, calculating base-2 coefficients of a base-2 number polynomial for each symbol according to a respective base-N coefficient corresponding to each symbol, determining changes of states of the plurality of wires for each symbol according to the base-2 coefficients respectively calculated for each symbol, and generating the sequence of symbols based on the changes of states of the plurality of wires for each symbol.