Christian Legl

According to our database, Christian Legl authored at least 7 papers between 1996 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1999

Logiksynthese für wertetabellenbasierte anwenderprogrammierbare Bausteine.

Christian Legl

PhD thesis, 1999

Retiming Sequential Circuits with Multiple Register Classes.

Klaus Eckl, Christian Legl

Proceedings of the 1999 Design, 1999

A Practical Approach to Multiple-Class Retiming.

Klaus Eckl, Jean Christophe Madre, Peter Zepter, Christian Legl

Proceedings of the 36th Conference on Design Automation, 1999

1998

Computing support-minimal subfunctions during functional decomposition.

Christian Legl, Bernd Wurth, Klaus Eckl

IEEE Trans. Very Large Scale Integr. Syst., 1998

1996

Performance-Directed Technology-Mapping for LUT-Based FPGAs - What Role Do Decomposition and Covering Play?

Christian Legl, Klaus Eckl, Bernd Wurth

Proceedings of the Field-Programmable Logic, 1996

An Implicit Algorithm for Support Minimization during Functional Decomposition.

Christian Legl, Bernd Wurth, Klaus Eckl

Proceedings of the 1996 European Design and Test Conference, 1996

A Boolean Approach to Performance-Directed Technology Mapping for LUT-Based FPGA Designs.

Christian Legl, Bernd Wurth, Klaus Eckl

Proceedings of the 33st Conference on Design Automation, 1996