Allocating the chains of consecutive additions for optimal fixed-point data path synthesis

TL;DR

This paper presents a technique for allocating chains of consecutive additions in fixed-point data path synthesis to predict data width growth, reduce design complexity, and minimize computational errors.

Contribution

It introduces a novel analysis method that optimally allocates addition chains to improve fixed-point data path design accuracy and efficiency.

Findings

Effective prediction of data width growth

Reduced computational errors in fixed-point paths

Simplified data path design process

Abstract

Minimization of computational errors in the fixed-point data path is often difficult task. Many signal processing algorithms use chains of consecutive additions. The analyzing technique that can be applied to fixed-point data path synthesis has been proposed. This technique takes advantage of allocating the chains of consecutive additions in order to predict growing width of the data path and minimize the design complexity and computational errors.