Please use this identifier to cite or link to this item: https://doi.org/10.1109/31.81865
Title: Decomposition of binary integers into signed power-of-two terms
Authors: Lim, Yong Ching 
Evans, Joseph B.
Liu, Bede
Issue Date: Jun-1991
Citation: Lim, Yong Ching, Evans, Joseph B., Liu, Bede (1991-06). Decomposition of binary integers into signed power-of-two terms. IEEE transactions on circuits and systems 38 (6) : 667-672. ScholarBank@NUS Repository. https://doi.org/10.1109/31.81865
Abstract: Previous work has shown that approximation of digital filter coefficients using sums of signed power-of-two terms yields significant area/speed advantages in custom implementations, at the expense of a slight frequency response deterioration. The completeness, uniqueness, and resolving power of signed powers-of-two representations are studied, and circuits for extracting a prescribed number of signed power-of-two terms whose sum is the closest approximation to a given integer are presented. Examples of implementation of these circuits in a CMOS process are given.
Source Title: IEEE transactions on circuits and systems
URI: http://scholarbank.nus.edu.sg/handle/10635/61994
ISSN: 00984094
DOI: 10.1109/31.81865
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

64
checked on Dec 6, 2022

WEB OF SCIENCETM
Citations

53
checked on Nov 28, 2022

Page view(s)

122
checked on Nov 24, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.