Decimal Floating-Point Adder Leading Zero Anticipation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing binary floating-point arithmetic is inadequate for commercial and monetary applications, requiring decimal floating-point arithmetic capabilities, particularly for addition and subtraction, which current software libraries execute slowly and lack standardization in number representation.

Innovation Solution

A system incorporating a decimal floating-point adder network with a leading zero anticipator, utilizing a parallel prefix network and preprocessing circuit to perform decimal digit addition and subtraction efficiently, aligning operands for quantum alignment and generating leading zero counts in parallel with the result.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If software libraries are used to perform decimal floating-point arithmetic operations, then correctness of decimal representation is achieved, but execution time becomes slow

Engineering Contradiction:
Improvecorrectness of decimal representationVSAvoidexecution time
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent replaces software-based decimal floating-point arithmetic with a dedicated hardware circuit (decimal floating-point adder) that performs addition and subtraction operations. This hardware implementation uses binary-to-BCD conversion circuits, alignment circuits, and adder circuits to directly compute results in decimal format, eliminating the interpretation overhead of software libraries while maintaining correct decimal representation.

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

2Measurement precision

If leading zero count is calculated after addition is completed, then accuracy of result is ensured, but latency increases

Engineering Contradiction:
Improveaccuracy of resultVSAvoidlatency
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent implements a leading zero anticipator circuit that operates in parallel with the adder circuit during the addition process. This circuit analyzes the operands and carries out leading zero count calculation simultaneously with the addition operation, rather than waiting for the addition to complete. The anticipator uses comparison logic to determine the number of leading zeros in the result based on the relative magnitudes and signs of the operands, thereby reducing latency without compromising accuracy.

Inventive Principle:
Principle #10Preliminary action

3Productivity

If decimal floating-point arithmetic is implemented in hardware, then execution speed is improved, but device complexity increases

Engineering Contradiction:
Improveexecution speedVSAvoidcircuit complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent divides the decimal floating-point adder into multiple functional modules: binary-to-BCD conversion circuits for converting binary significands to BCD format, alignment circuits for matching exponents and shifting operands, adder circuits for performing the actual addition, and a leading zero anticipator circuit for determining result normalization. This modular segmentation allows each component to be optimized independently and simplifies the overall design and implementation of the hardware system.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS8601047B2Decimal floating-point adder with leading zero anticipation
Publication Date: 2013.12.03 ADVANCED MICRO DEVICES INC
  • US8601047B2 patent drawing
  • US8601047B2 patent drawing
  • US8601047B2 patent drawing

AI summary

A decimal floating-point (DFP) adder includes a decimal leading-zero anticipator (LZA). The DFP adder receives DFP operands. Each operand includes a significand, an exponent, a sign bit and a leading zero count for the significand. The DFP adder adds or subtracts the DFP operands to obtain a DFP result. The LZA determines the leading zero count associated with the significand of the DFP result. The LZA operates at least partially in parallel with circuitry (in the DFP adder) that computes the DFP result. The LZA does not wait for that circuitry to finish computation of the DFP result. Instead it “anticipates” the number of leading zeros that the result's significand will contain.