Binary Value Min Max Determination via Bitwise Logic

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In automated test equipment, determining the minimum or maximum value from a plurality of binary values stored at different locations remote from a central processor is inefficient due to the need for multiple read operations, which dominates the processing time.

Innovation Solution

A method involving bit-wise OR and AND combinations to identify a bit position where all values are the same, followed by iterative selection and modification of values to determine the minimum or maximum value in a centralized processor, utilizing common read operations to reduce the number of read operations required.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If multiple individual read operations are performed to determine minimum/maximum from distributed processors, then the minimum/maximum value can be determined, but the processing time is excessively long

Engineering Contradiction:
Improveminimum/maximum determination accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent combines multiple individual read operations into a single common read operation by merging the data streams from multiple processors. The bit-wise OR and AND operations are performed on the combined data to determine the minimum/maximum value, eliminating the need for sequential individual reads and significantly reducing processing time.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent segments the determination process into bit-level operations. By dividing the binary values into individual bits and performing parallel bit-wise OR and AND operations on corresponding bits from multiple values, the system can efficiently identify the minimum/maximum through systematic bit comparison rather than sequential value comparison.

Inventive Principle:
Principle #1Segmentation

2Loss of information

If data from multiple processors is read individually, then each value can be processed, but the number of read operations increases significantly

Engineering Contradiction:
Improvedata completenessVSAvoidprocessing efficiency
Core Design Contradiction:
Loss of informationVSProductivity

Solution Approach 1:

The patent merges data from multiple processors into a unified processing stream using a single common read operation. By combining the data paths and performing bit-wise operations on the merged data, the system maintains complete data information while reducing the number of read operations from N (where N is the number of processors) to just 1.

Inventive Principle:
Principle #5Merging (Combining)

3Productivity

If common read operations are used to reduce read operations, then processing speed improves, but the complexity of bit-wise operations increases

Engineering Contradiction:
Improveprocessing speedVSAvoidoperation complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent replaces the mechanical approach of sequential individual read operations with a computational approach using bit-wise logical operations. Instead of physically reading and comparing each value sequentially, the system uses bit-wise OR and AND operations to computationally determine the minimum/maximum, achieving faster processing through logical computation rather than mechanical iteration.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS8898210B2Method and apparatus for determining a minimum/maximum of a plurality of binary values
Publication Date: 2014.11.25 ADVANTEST CORP
  • US8898210B2 patent drawing
  • US8898210B2 patent drawing
  • US8898210B2 patent drawing

AI summary

For determining a minimum/maximum of a plurality of binary values a bit position in the plurality of binary values is determined subsequent to which all bit values are the same. From the plurality of binary values those binary values are selected the bit values of which at the bit position determined in the preceding step and all subsequent positions, if any, has a predetermined value. The preceding steps are then repeated until only one binary value remains which is provided as the minimum or maximum.