Bit String Accumulation Using Segmented Registers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing approaches to performing recursive operations in memory devices face challenges such as large memory requirements, increased computation time, and accuracy issues due to rounding of intermediate results.
Innovation Solution
The use of special purpose registers and peripheral circuitry in memory devices to store modified results of recursive operations and the corresponding scaling factors, allowing for accurate recovery of the final result.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If standard memory approaches are used to store intermediate results of recursive operations, then memory capacity is sufficient, but memory usage and computation time increase significantly
Solution Approach 1:
The patent segments the storage of intermediate results by dividing them into two parts: a most significant byte (MSB) stored in a special purpose register and a least significant byte (LSB) stored in peripheral circuitry. This segmentation allows the system to track only the most significant changes in memory while storing less critical data locally, reducing overall memory access and computation time.
Solution Approach 2:
The patent introduces a special purpose register as an intermediary component between the memory array and the processing logic. This register acts as a buffer that holds the MSB of intermediate results, allowing the system to perform recursive operations with reduced memory access while maintaining accuracy through the preserved significant bits.
2Quantity of substance
If intermediate results are rounded to fit limited storage, then memory usage decreases, but accuracy of final results deteriorates
Solution Approach 1:
By segmenting the intermediate results into MSB and LSB components and storing them in different locations (special purpose register and peripheral circuitry respectively), the patent preserves the full precision of intermediate calculations while using minimal memory. The MSB storage in the special purpose register ensures accuracy is maintained without requiring extensive memory resources.
Solution Approach 2:
The patent applies local quality by storing different portions of intermediate results in different locations with different storage characteristics. The MSB, which carries the most significant information for accuracy, is stored in the special purpose register with higher retention priority, while the LSB is stored in peripheral circuitry with less storage demand, optimizing both accuracy and memory usage.
3Measurement precision
If full precision intermediate results are stored, then accuracy is maintained, but memory requirements and device complexity increase
Solution Approach 1:
The patent segments the storage architecture into a special purpose register for MSB and peripheral circuitry for LSB, creating a simplified yet effective system that maintains full precision without requiring a complete high-capacity memory subsystem. This segmentation reduces device complexity by using existing components in a novel configuration rather than adding extensive new memory infrastructure.
Solution Approach 2:
The special purpose register serves multiple functions: it stores the MSB of intermediate results, tracks significant changes in the recursive operation, and enables accurate final result recovery. This multi-functionality reduces the need for separate dedicated components, thereby lowering overall device complexity while maintaining accuracy.
Data Source
Figure 1
Figure 2A
Figure 2B
AI summary
Systems, apparatuses, and methods related to bit string accumulation are described. A method for bit string accumulation can include performing an iteration of a recursive operation using a first bit string and a second bit string and modifying a quantity of bits of a result of the iteration of the recursive operation, wherein the modified quantity of bits is less than a threshold quantity of bits. The method can further include writing a first value comprising the modified bits indicative of the result of the iteration of the recursive operation to a first register and writing a second value indicative of the factor corresponding to the result of the iteration of the recursive operation to a second register.