A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems

@article{Gustafsson2007ADB,
  title={A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems},
  author={Oscar Gustafsson},
  journal={2007 IEEE International Symposium on Circuits and Systems},
  year={2007},
  pages={1097-1100}
}
Multiple constant multiplication (MCM), i.e., realizing a number of constant multiplications using a minimum number of adders and subtracters, has been an active research area for the last decade. An adder graph type algorithm for solving the MCM problem is introduced with a novel heuristic inspired by difference methods. It is shown that the results is as good or better as previous state of the art under most conditions. Furthermore, the proposed algorithm does not rely on look-up tables. 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 83 CITATIONS

Minimum adder depth multiple constant multiplication algorithm for low power FIR filters

  • 2011 IEEE International Symposium of Circuits and Systems (ISCAS)
  • 2011
VIEW 11 EXCERPTS
CITES METHODS

Low-complexity rotators for the FFT using base-3 signed stages

  • 2012 IEEE Asia Pacific Conference on Circuits and Systems
  • 2012
VIEW 4 EXCERPTS
CITES METHODS

A Common Subexpression Elimination Tree Algorithm

  • IEEE Transactions on Circuits and Systems I: Regular Papers
  • 2013
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Internal quantization in FIR filters implemented using Multiple Constant Multiplications

  • 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers
  • 2010
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Low power and low complexity digital filters design and implementation

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Truncated MCM using pattern modification for FIR filter implementation

  • Proceedings of 2010 IEEE International Symposium on Circuits and Systems
  • 2010
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2007
2019

CITATION STATISTICS

  • 7 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Some optimizations of hardware multiplication by constant matrices

  • Proceedings 2003 16th IEEE Symposium on Computer Arithmetic
  • 2003
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Contention resolution algorithm for common subexpression elimination in digital filter design

Fei Xu, Chip-Hong Chang, Ching-Chuen Jong
  • IEEE Transactions on Circuits and Systems II: Express Briefs
  • 2005
VIEW 1 EXCERPT

Low-complexity constant coefficient matrix multiplication using a minimum spanning tree approach

  • Proceedings of the 6th Nordic Signal Processing Symposium, 2004. NORSIG 2004.
  • 2004
VIEW 1 EXCERPT

Digital filter synthesis based on minimal signed digit representation

  • Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
  • 2001
VIEW 1 EXCERPT

FIR filter synthesis algorithms for minimizing the delay and the number of adders

  • IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140)
  • 2000
VIEW 1 EXCERPT