Mathias Faust

Orcid: 0000-0003-2566-317X

According to our database1, Mathias Faust authored at least 9 papers between 2009 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Tap Delay-and-Accumulate Cost Aware Coefficient Synthesis Algorithm for the Design of Area-Power Efficient FIR Filters.
IEEE Trans. Circuits Syst. I Regul. Pap., 2018

2015
Efficient structural adder pipelining in transposed form FIR filters.
Proceedings of the 2015 IEEE International Conference on Digital Signal Processing, 2015

2012
Pipelined adder graph optimization for high speed multiple constant multiplication.
Proceedings of the 2012 IEEE International Symposium on Circuits and Systems, 2012

2011
Sign-Extension Avoidance and Word-Length Optimization by Positive-Offset Representation for FIR Filter Design.
IEEE Trans. Circuits Syst. II Express Briefs, 2011

Bit-parallel Multiple Constant Multiplication using Look-Up Tables on FPGA.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2011), 2011

Low error bit width reduction for structural adders of FIR filters.
Proceedings of the 20th European Conference on Circuit Theory and Design, 2011

2010
On "A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters".
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2010

Minimal Logic Depth adder tree optimization for Multiple Constant Multiplication.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2010), May 30, 2010

2009
Optimization of Structural Adders in Fixed Coefficient Transposed Direct Form FIR Filters.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009


  Loading...