vi
Preface
Jeferson de Lima Muniz, Alexandre C. R. da Silva, and Gerhard W. Dueck
explore majority-based logic synthesis in Synthesis of Majority Expressions through
Primitive Function Manipulation. Anna Bernasconi, Fabrizio Luccio, Linda Pagli,
and Davide Rucci target synthesis for switching lattices in Chap. 7 Literal Selection
in Switching Lattice Design. In Chap. 8, Heinz Riener, Rüdiger Ehlers, Bruno
Schmitt, and Giovanni De Micheli propose an exact synthesis approach in Exact
Synthesis of ESOP Forms. D. Michael Miller and Mathias Soeken introduce An
Algorithm for Linear, Affine and Spectral Classification of Boolean Functions in
Chap. 9. Chapter 10 targets reversible functions with New Results on Reversible
Boolean Functions Having Component Functions with Specified Properties by
Paweł Kerntopf, Krzysztof Podlaski, Claudio Moraga, and Radomir S. Stankovi´ c.
The book is concluded in Chap. 11 by Danila Gorodecky and Tiziano Villa
on Efficient Hardware Operations for the Residue Number System by Boolean
Minimization.
We would like to express our thanks to the program committee of the 13th
International Workshop on Boolean Problems as well as to the organizational team,
in particular Lisa Jungmann and Kristiane Schmitt. Furthermore, we thank all the
authors of contributed chapters who did a great job in submitting their manuscripts
of very high quality. A special thank goes to the keynote speakers of the workshop,
Prof. Görschwin Fey (Hamburg University of Technology) and Prof. Tim Güneysu
(Ruhr-Universität Bochum). Finally, we would like to thank Brinda Megasyamalan,
Brian Halm, and Charles Glaser from Springer. All this would not have been
possible without their steady support.
Bremen, Germany
Rolf Drechsler
Lausanne, Switzerland
Mathias Soeken
March 2019
Preface
Jeferson de Lima Muniz, Alexandre C. R. da Silva, and Gerhard W. Dueck
explore majority-based logic synthesis in Synthesis of Majority Expressions through
Primitive Function Manipulation. Anna Bernasconi, Fabrizio Luccio, Linda Pagli,
and Davide Rucci target synthesis for switching lattices in Chap. 7 Literal Selection
in Switching Lattice Design. In Chap. 8, Heinz Riener, Rüdiger Ehlers, Bruno
Schmitt, and Giovanni De Micheli propose an exact synthesis approach in Exact
Synthesis of ESOP Forms. D. Michael Miller and Mathias Soeken introduce An
Algorithm for Linear, Affine and Spectral Classification of Boolean Functions in
Chap. 9. Chapter 10 targets reversible functions with New Results on Reversible
Boolean Functions Having Component Functions with Specified Properties by
Paweł Kerntopf, Krzysztof Podlaski, Claudio Moraga, and Radomir S. Stankovi´ c.
The book is concluded in Chap. 11 by Danila Gorodecky and Tiziano Villa
on Efficient Hardware Operations for the Residue Number System by Boolean
Minimization.
We would like to express our thanks to the program committee of the 13th
International Workshop on Boolean Problems as well as to the organizational team,
in particular Lisa Jungmann and Kristiane Schmitt. Furthermore, we thank all the
authors of contributed chapters who did a great job in submitting their manuscripts
of very high quality. A special thank goes to the keynote speakers of the workshop,
Prof. Görschwin Fey (Hamburg University of Technology) and Prof. Tim Güneysu
(Ruhr-Universität Bochum). Finally, we would like to thank Brinda Megasyamalan,
Brian Halm, and Charles Glaser from Springer. All this would not have been
possible without their steady support.
Bremen, Germany
Rolf Drechsler
Lausanne, Switzerland
Mathias Soeken
March 2019