Decomposition of binary integers into signed power-of-two terms
- 1 June 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 38 (6) , 667-672
- https://doi.org/10.1109/31.81865
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A CMOS implementation of a variable step size digital adaptive filterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A high speed programmable digital FIR filterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A simple design of FIR filters with powers-of-two coefficientsIEEE Transactions on Circuits and Systems, 1988
- Architectures for multiplierless fast Fourier transform hardware implementation in VLSIIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Efficient design of 2-D multiplierless FIR filters by transformationIEEE Transactions on Circuits and Systems, 1987
- High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition TreeIEEE Transactions on Computers, 1985
- Efficient and multiplierless design of FIR filters with very sharp cutoff via maximally flat building blocksIEEE Transactions on Circuits and Systems, 1985
- FIR filter design over a discrete powers-of-two coefficient spaceIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Adaptive filter performance with nonlinearities in the correlation multiplierIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- A Single-Chip VLSI Echo CancelerBell System Technical Journal, 1980