Differences
This shows you the differences between two versions of the page.
02Research [2018/07/01 10:48] Martin Kumm |
02Research [2024/02/23 10:10] (current) Martin Kumm |
||
---|---|---|---|
Line 5: | Line 5: | ||
For that I initiated or contributed to a couple of open-source software projects which are listed below. | For that I initiated or contributed to a couple of open-source software projects which are listed below. | ||
- | === Origami HLS - the art of (circuit) folding === | + | === FloPoCo === |
- | Origami HLS is an open-source tool for the model-based design of highly optimized FPGA architectures for FPGAs from Matlab/Simulink. | + | FloPoCo is a VHDL code generator for arithmetic cores that was initiated by Florent de Dinechin and Bogdan Pasca. |
+ | Now, FloPoCo is maintained by Florent and me. | ||
+ | /*Me and my colleages contributed to several FloPoCo operators and some optimization cores (e.g., the compressor tree optimization and large multiplier optimization). Most of that can be found in the <code>uni_ks</code> branch in the [[https://gforge.inria.fr/scm/?group_id=1030|GIT repository]]. /* | ||
+ | |||
+ | |||
+ | For more information, visit the project website: [[http://flopoco.org]] | ||
- | For more information, visit the project website: [[http://www.uni-kassel.de/go/origami]] | ||
=== PAGSuite === | === PAGSuite === | ||
Line 17: | Line 21: | ||
On top of this, tools to design runtime reconfigurabe SCM/MCM/CMM circuits are included. | On top of this, tools to design runtime reconfigurabe SCM/MCM/CMM circuits are included. | ||
- | For more information, visit the project website: [[http://www.uni-kassel.de/go/pagsuite]] | + | For more information, visit the project website: [[https://gitlab.com/kumm/pagsuite]] |
- | === FloPoCo === | ||
- | FloPoCo is a VHDL code generator for arithmetic cores that was initiated by Florent de Dinechin and Bogdan Pasca. | + | === FIROpt - a filter-optimization suite for optimal multiplierless filters === |
- | Me and my colleages contributed to several FloPoCo operators and some optimization cores (e.g., the compressor tree optimization and large multiplier optimization). | + | |
- | Most of that can be found in the <code>uni_ks</code> branch in the [[https://gforge.inria.fr/scm/?group_id=1030|GIT repository]]. | + | |
+ | FIROpt is an optimization suite for the design of optimal multiplierless filters. | ||
- | For more information, visit the project website: [[http://flopoco.gforge.inria.fr]] | + | For more information, visit the project website: [[https://gitlab.com/filteropt/firopt]] |
+ | |||
+ | === Origami HLS - the art of (circuit) folding === | ||
+ | |||
+ | Origami HLS is an open-source tool for the model-based design of highly optimized architectures for FPGAs from Matlab/Simulink. | ||
+ | |||
+ | For more information, visit the project website: [[http://www.uni-kassel.de/go/origami]] | ||
=== ScaLP - a scalable linear programming tool === | === ScaLP - a scalable linear programming tool === | ||
- | ScaLP is an open source C++ library that acts as a wrapper for different ILP-sovers and provides a nice interface to the developer which is common for all solvers (currently [[http://www.gurobi.com|Gurobi]], [[https://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/|CPLEX]], [[http://scip.zib.de|SCIP]] and [[http://lpsolve.sourceforge.net/5.5/|LPSOLVE]]). | + | ScaLP is an open source C++ library that acts as a wrapper for different ILP-solvers and provides a nice interface to the developer which is common for all solvers (currently [[http://www.gurobi.com|Gurobi]], [[https://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/|CPLEX]], [[http://scip.zib.de|SCIP]] and [[http://lpsolve.sourceforge.net/5.5/|LPSOLVE]]). |
To support a natural user interface, it heavily uses the concept of //operator overloading//, i.e., a constraint like x+y<=31 is exactly written as it is "x+y<=31". | To support a natural user interface, it heavily uses the concept of //operator overloading//, i.e., a constraint like x+y<=31 is exactly written as it is "x+y<=31". | ||
- | For more information, look in our [[http://martin-kumm.de/preprints/2018_MBMV_Sittel.pdf|ScaLP paper]] and visit the project website: [[http://www.uni-kassel.de/go/scalp]] | + | For more information, look in our [[http://martin-kumm.de/preprints/2018_MBMV_Sittel.pdf|ScaLP paper]] and visit the project website: [[https://digidev.digi.e-technik.uni-kassel.de/scalp/]] |
02Research.1530434885.txt.gz · Last modified: 2018/07/01 10:48 by Martin Kumm (login)