A 2-digit DBNS filter architecture

We have previously reported on a novel number representation using 2 bases which we refer to as the double-base number system (DBNS). Our preferred implementation uses the relatively prime bases {2,3}. If we allow the exponents of the bases to be arbitrarily large signed integers, then we can represent any real number to any arbitrary precision by a single digit DBNS representation. By representing the digit position by the exponent values, we generate a logarithmic-like representation which we can manipulate using an index calculus. A multiplier accumulator architecture for a FIR filter application has been reported which uses a half-index domain to remove the problem of addition within the index calculus. In this paper we show that using a 2-digit DBNS representation for both the input data and the filter coefficients can result in substantial hardware savings compared to both the single-digit a DBNS approach and an equivalent binary implementation of a general multiplier accumulator. In the paper we discuss the filter architecture, techniques for converting between binary and the 2-digit DBNS representations, and also the design technique used to generate the 2-digit DBNS FIR filter coefficients.

[1]  David M. Lewis.  An accurate LNS arithmetic unit using interleaved memory function interpolator , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[2]  Graham A. Jullien,et al.  Designing FIR filters with enhanced Fermat ALUs , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[3]  Graham A. Jullien,et al.  Digital arithmetic using analog arrays , 1998, Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222).

[4]  Majid Ahmadi,et al.  Design of 1-D FIR filters with genetic algorithms , 1999, ISSPA '99. Proceedings of the Fifth International Symposium on Signal Processing and its Applications (IEEE Cat. No.99EX359).

[5]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.

[6]  Karl-Heinz Brenner,et al.  Digital Optical Computing With Symbolic Substitution , 1989, Other Conferences.

[7]  Graham A. Jullien,et al.  Theory and applications for a double-base number system , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[8]  M. Ahmadi,et al.  Design of 1-D FIR filters with genetic algorithms , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[9]  Majid Ahmadi,et al.  A hybrid DBNS processor for DSP computation , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[10]  E Swartzlander.  Digital optical arithmetic. , 1986, Applied optics.

[11]  Roberto Muscedere,et al.  Nonlinear signal processing using index calculus DBNS arithmetic , 2000, SPIE Optics + Photonics.