Digital filter design using subexpression elimination and all signed-digit representations

@article{Dempster2004DigitalFD,
  title={Digital filter design using subexpression elimination and all signed-digit representations},
  author={Andrew Graham Dempster and Malcolm D. Macleod},
  journal={2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)},
  year={2004},
  volume={3},
  pages={III-169}
}
We examine the application of Hartley's subexpression elimination algorithm to sets of coefficients that are represented all combinations signed-digits including those that require more digits than CSD. FIR filters using this method can use fewer adders than those designed by the best of existing techniques. However, the search space for practical filters means that exhaustive searching is impractical. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS, ESTIMATED 27% COVERAGE

84 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 84 citations based on the available data.

See our FAQ for additional information.

References

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

Relationship between Efficient Multiplier Design Techniques: Subexpression Elimination and Multiplier Blocks

  • A G Dempster, M D Macleod
  • ISCAS
  • 2004
1 Excerpt

Wanhammer, “Extended Results for Minimum-Adder Constant Integer Multipliers

  • Oscar Gustafsson, Andrew G Dempster, Lars
  • Proc ISCAS , Phoenix, May 27 –
  • 2002
1 Excerpt

A new algorithm for elimination of common subexpressions

  • R Pasko
  • IEEE Trans Computer- Aided Design of IC Systems,
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…