Staff

Dr.-Ing. Yavuz Can

Contact

About Yavuz Can

Dr.-Ing. Yavuz Can was born in Erlangen, Germany, in 1979. He received his Diploma degree (Dipl.-Ing.) in Mechatronics in 2010 and his degree in Doctor of Engineering (Dr.-Ing) in 2016 from the Friedrich-Alexander-University of Erlangen-Nuremberg (FAU), Germany. He is currently a guest researcher at the Institute for Electronics Engineering at Friedrich-Alexander University in Erlangen. His research mainly deals with the theory and the applications of binary function and algorithms for their utilization. Furthermore, he want to combine Discrete Mathematics and computerbased methods. He is also interested in the theme of orthogonalization of normal forms of Boolean functions and in the field of Ternary-Vector-List arithmetic. Furthermore, he is trying to optimize an existing method which enables getting testbanches for verifying combinational circuits by his new methods and algorithms.

Awards

  • Y. Can, Excellent oral presentation certificate, International Conference on Electrical and Electronics Engineering, 2017. [Bibtex]
    @prize{can_prize_2017,
    author = {Can, Yavuz},
    booktitle = {International Conference on Electrical and Electronics Engineering},
    cris = {can_prize_2017},
    year = {2017},
    month = {04},
    day = {10},
    title = {Excellent oral presentation certificate},
    type = {20773-Kleiner Preis},
    }
  • Y. Can, Excellent Oral Presentation Certificate, ICEEE 2017, 2016. [Bibtex]
    @prize{can_prize_2016,
    author = {Can, Yavuz},
    booktitle = {ICEEE 2017},
    cris = {can_prize_2016},
    year = {2016},
    month = {04},
    day = {09},
    title = {Excellent Oral Presentation Certificate},
    type = {20773-Kleiner Preis},
    }

COPYRIGHT NOTICE: Copyright and all rights of the material above are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by the appropriate copyright. The material may not be reposted without the explicit permission of the copyright holder.

COPYRIGHT NOTICE FOR IEEE PUBLICATIONS: © IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

COPYRIGHT NOTICE FOR EUMA PUBLICATIONS: © EUMA. Personal use of this material is permitted. Permission from European Microwave Association(EUMA) must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Publications

2018

  • Y. Can and B. Steinbach, "Orthogonalization of a TVL in Disjunctive or Conjunctive Form," in Further Improvements in the Boolean Domain, B. Steinbach, Ed., Cambridge Scholars Publishing, 2018. [Bibtex]
    @inbook{can2017a,
    author = {Can, Yavuz and Steinbach, Bernd},
    editor = {Steinbach, Bernd},
    language = {English},
    publisher = {Cambridge Scholars Publishing},
    booktitle = {Further Improvements in the Boolean Domain},
    cris = {https://cris.fau.de/converis/publicweb/publication/118724584},
    year = {2018},
    month = {01},
    day = {01},
    faupublication = {no},
    isbn = {9781527503717},
    peerreviewed = {Yes},
    title = {Orthogonalization of a TVL in Disjunctive or Conjunctive Form},
    type = {Buchkapitel},
    }

2017

  • Y. Can and G. Fischer, "Basis Forms of Switching Functions" in 10th International Conference on Electrical and Electronics Engineering (ELECO 2017), IEEE Turkey Section, Bursa, 2017. [Bibtex]
    @inproceedings{can2017d,
    abstract = {This paper presents extended forms, equations, and relations of switching function which are derived out of the theory of switching algebra and the combinational circuit design. Two extended forms and four already defined standard forms of switching function, which are partly renamed, are presented. Out of the combinational circuit design these extended forms, the antivalence of disjunctions ADF and the equivalence of conjunctions ECF, are educed and thereby their algebraic expressions are set up. For that, conversion rules which enable the transformation of a disjunction of two variables in equivalence-operation of the same variables and the transformation of a conjunction consisting of two variables in antivalence-operation of the same variables will be lay down. Additionally, exclusion laws regarding to the extended forms ADF and ECF are set up which are deduce out of the distributive laws of the standard forms. Furthermore, in the case of orthogonal representation of these six function forms relations between them result. That means, by orthogonalization of a corresponding function form it can be easily transformed in an equivalent another function form.
    }, author = {Can, Yavuz and Fischer, Georg}, language = {English}, booktitle = {10th International Conference on Electrical and Electronics Engineering (ELECO 2017), IEEE Turkey Section}, cris = {https://cris.fau.de/converis/publicweb/publication/208635548}, year = {2017}, month = {11}, day = {30}, eventdate = {2017-11-30/2017-12-02}, faupublication = {yes}, peerreviewed = {unknown}, title = {Basis Forms of Switching Functions}, type = {Konferenzschrift}, venue = {Bursa}, }
  • Y. Can, "Quaternary-Vector-List for totally computational treating of switching algebraic tasks" in ICAT 2017, Sarajevo, Bosnia and Herzegovina, 2017. [Bibtex]
    @inproceedings{can2017c,
    abstract = {In this paper an advanced form of vector-list called quaternary-vector-list QVL is introduced. QVL is the computational representation of Boolean function or switching function respectively and enables the total computational treatment of switching algebraic tasks. It has advantages in terms of memory usage, simplicity, clarity and also in computation time. Furthermore, important operations as complement, intersection and union are demonstrated for the advanced QVL-arithmetic. By the use of QVL the computational utilization of the extended Basis function forms of switching function will be granted. By QVL the already available ternary-vector-list TVL is supplemented and substituted.},
    author = {Can, Yavuz},
    language = {English},
    publisher = {IEEE Supported},
    booktitle = {ICAT 2017},
    cris = {https://cris.fau.de/converis/publicweb/publication/107484124},
    year = {2017},
    month = {10},
    day = {26},
    eventdate = {2017-10-26/2017-10-28},
    eventtitle = {26. International Conference on Information, Communication and Automation Technologies ICAT '17},
    faupublication = {yes},
    keywords = {Quaternary-Vector-List,Switching Function,Normal Form,Algorithms,Combinational Circuit,Operation Rule},
    peerreviewed = {unknown},
    title = {Quaternary-Vector-List for totally computational treating of switching algebraic tasks},
    type = {Konferenzschrift},
    venue = {Sarajevo, Bosnia and Herzegovina},
    }
  • Y. Can and G. Fischer, "Extended Forms of Switching Functions" in Proceedings of ICEEE 2017, Ankara, Turkey, 2017, pp. 1-353. [DOI] [Bibtex]
    @inproceedings{can2017,
    abstract = {Two new extended forms of switching functions with the four already existing forms, which will be partly renamed, are presented in this paper. These new extended forms, the antivalence of disjunctions ADF and the equivalence of conjunctions ECF, are educed from circuit of digital logic gates and thereby their algebraic expressions are set up. For that, conversion rules which enable the transformation of a disjunction in equivalence-operation and the transformation of a conjunction in antivalence-operation with respect to the extended forms will be lay down. In  addition, new formulas for resolution of terms of ADF and ECF while retaining the form of the given function will be derived. Furthermore, relations between these six forms are described in algebra of sets if they have the same representation of disjunctions respectively conjunctions whereby the conjunctions and disjunctions have operations of the same literals. Additionally, in the case of orthogonal representation of these six function forms further relations between them result. That means, an orthogonal disjunctive form is equivalent to the orthogonal antivalence form of conjunctions and equivalent to the complement of the orthogonal  equivalence form of conjunctions. Against this, an orthogonal conjunctive form is equivalent to the orthogonal antivalence form of disjunctions and equivalent to the complement of the orthogonal equivalence form of disjunctions.},
    author = {Can, Yavuz and Fischer, Georg},
    language = {English},
    publisher = {IEEE},
    booktitle = {Proceedings of ICEEE 2017},
    cris = {https://cris.fau.de/converis/publicweb/publication/121122144},
    year = {2017},
    month = {04},
    day = {08},
    doi = {10.1109/ICEEE2.2017.7935793},
    eventdate = {2017-04-08/2017-04-10},
    eventtitle = {4th International Conference on Electrical and Electronics Engineering (ICEEE)},
    faupublication = {yes},
    isbn = {9781509067886},
    keywords = {switching algebra,switching function,normal form,combinational circuit,resolution of terms,set theory,orthogonality},
    pages = {1--353},
    peerreviewed = {Yes},
    title = {Extended Forms of Switching Functions},
    type = {Konferenzschrift},
    venue = {Ankara, Turkey},
    }

2016

  • Y. Can, H. Kassim, and G. Fischer, "Orthogonalization of DNF in TVL-Arithmetic" in 12th International Workshop of Boolean Problems, Freiberg, Germany, 2016, pp. 1-219. [Bibtex]
    @inproceedings{can2016,
    abstract = {In this paper two new equations for orthogonalization of disjunctive normal form are presented in Ternary-Vector-List arithmetic. They provides the mathematical solution of orthogonalization of disjunctive normal form. These new equations are based on the method of orthogonalizing difference-building and orthogonalizing OR-ing. Furthermore, they are compared in their number of operations. Their advantages in respect of computation time and the number of terms in the orthogonalized result are also shown. The presentation of both equations take place in Ternary-Vector-List arithmetic.},
    author = {Can, Yavuz and Kassim, Hassen and Fischer, Georg},
    editor = {der TU Bergakademie Freiberg, Medienzentrum},
    language = {English},
    booktitle = {12th International Workshop of Boolean Problems},
    cris = {https://cris.fau.de/converis/publicweb/publication/108095064},
    year = {2016},
    month = {09},
    day = {22},
    eventdate = {2016-09-22/2016-09-23},
    eventtitle = {12th International Workshop on Boolean Problems},
    faupublication = {yes},
    isbn = {9783860125403},
    keywords = {IC Test},
    pages = {1--219},
    peerreviewed = {Yes},
    title = {Orthogonalization of DNF in TVL-Arithmetic},
    type = {Konferenzschrift},
    url = {http://www.informatik.tu-freiberg.de/prof2/ws_bp12/index.html},
    venue = {Freiberg, Germany},
    }
  • Y. Can, G. Fischer, and H. Kassim, "Orthogonalizing of DNF in TVL-Arithmetic" in 12th International Workshop on Boolean Problems (IWSBP’16), Freiberg (Sachsen), Germany, 2016. [Bibtex]
    @inproceedings{can2016g,
    abstract = {In this paper two new equations for orthogonalization of disjunctive normal form are presented in Ternary-Vector-List arithmetic. They provides the mathematical solution of orthogonalization of disjunctive normal form. These new equations are based on the method of orthogonalizing difference-building ⊖ and orthogonalizing OR-ing ∨. Furthermore, they are compared in their number of operations. Their advantages in respect of computation time and the number of terms in the orthogonalized result are also shown. The presentation
    of both equations take place in Ternary-Vector-List arithmetic.
    }, author = {Can, Yavuz and Fischer, Georg and Kassim, Hassen}, language = {English}, booktitle = {12th International Workshop on Boolean Problems (IWSBP’16)}, cris = {https://cris.fau.de/converis/publicweb/publication/208635862}, year = {2016}, month = {09}, day = {22}, eventdate = {2016-09-22/2016-09-23}, faupublication = {yes}, isbn = {9783860125403}, peerreviewed = {unknown}, title = {Orthogonalizing of DNF in TVL-Arithmetic}, type = {Konferenzschrift}, venue = {Freiberg (Sachsen), Germany}, }
  • Y. Can, "Neue Boolesche Orthogonalisierende Operative Methoden und Gleichungen", 2016. [Bibtex]
    @phdthesis{can2016a,
    abstract = {Orthogonalität ist eine besondere Eigenschaft Boolescher Funktionen. Die Orthogonalisierung einer Booleschen Funktion vereinfacht die Transformation in eine andere äquivalente Form. Mit dieser Arbeit werden zwei neue allgemeingültige, logische operative Verknüpfungsmethoden die 'orthogonalisierende Differenzbildung ⊝' und das 'orthogonalisierende Verodern v ' vorgestellt. Die orthogonalisierende Differenzbildung wird zur Ermittlung einer Differenz in orthogonaler Form zweier Produktterme oder zweier Funktionen eingesetzt. Das orthogonalisierendes Verodern wird zum Verodern zweier Produktterme oder zweier orthogonaler Funktionen angewendet, welches auch Ergebnisse in orthogonaler Form darbietet. Darüber hinaus weisen die algorithmischen Implementierung beider Verknüpfungsmethoden geringere Rechenzeiten mit zunehmender Dimension im Vergleich zu den herkömmlichen bekannten Operationen auf. Auch werden die Vorteile im Hinblick auf den Speicherplatzbedarf hierbei besser genutzt, weil kein zusätzlicher Algorithmus zur Orthogonalisierung benötigt wird. Zudem werden Anwendungen der orthogonalisierenden Differenzbildung in weiteren Verfahren gezeigt, wie z.B. die Bildung der orthogonalen Negierten einer Funktion der disjunktiven Normalform. Durch die inhärente Orthogonalisierung werden weitere Verarbeitungsschritte in der TVL-Arithmetik, wie das Boolesche Differentialkalkül, erheblich vereinfacht. Ternär-Vektor-Listen werden als rechnerinterne Darstellung für binäre Funktionen verwendet und sind für die Behandlung Boolescher Probleme vorteilhafter. Daneben werden in dieser Arbeit zwei neue mathematische Boolesche Gleichungen zur Orthogonalisierung Boolescher Funktionen bzw. Ternär-Vektor-Listen disjunktiver Normalformen hergeleitet, welche jeweils auf den neuen Verknüpfungen ⊝ und v basieren. Damit wird zum ersten Mal mathematisch die Problematik der Orthogonalisierung behandelt und einfache Gleichungen zur Berechnung der orthogonalen Form vorgestellt. Zudem werden die beiden neuen Methoden in der Bestimmung von Testbelegungen für kombinatorische Schaltnetzwerke zur Verifizierung möglicher logischer Fehler in der TVL-Arithmetik eingesetzt. Ihre implementierten Algorithmen weisen zudem Vorteile bezüglich Rechenzeit und Speicherplatzbedarf auf und ermöglichen damit die Berechnung von minimierterer Menge an Testbelegungen. Im Vergleich zu den Methoden aus der Literatur reduzieren die neuen Algorithmen ORTH[⊝] und ORTH[ v ] die Rechenzeit um einen Faktor von ca. 2,5. Zusätzlich haben die beiden neuen Algorithmen ORTH[⊝] und ORTH[ v ] die Eigenschaft bessere Lösungen zu liefern, das bedeutet, orthogonale TVLen geringerer Anzahl an Termen, d.h. eine Reduzierung um etwa 50%. Damit wird eine Weiterbehandlung der ermittelten orthogonalen TVL mit geringerer Anzahl an Operationen gewährleistet, welche zum einen weitere Rechenzeiten optimiert und zum anderen die Anzahl an Terme in den nachfolgenden Verfahrensschritten niedriger ausfallen lässt. Mit dieser Verminderung wird die Reduzierung an Termen bis zur Ermittlung der Testbelegungen fortgesetzt, so dass minimierte Testsätze zur Verifizierung von kombinatorischen Schaltungen am Ende der Berechnungslinie erhalten werden können. Mit der geringeren Rechenzeit der Algorithmen und der minimal ermittelten Menge an Testsätzen wird eine Einsparung in Testzeit und die damit verbundenen Testkosten erreicht werden können. },
    author = {Can, Yavuz},
    institution = {FAU Erlangen-Nürnberg},
    language = {German},
    publisher = {FAU University Press},
    cris = {https://cris.fau.de/converis/publicweb/publication/122992584},
    year = {2016},
    month = {08},
    day = {10},
    entrysubtype = {Dissertation},
    faupublication = {yes},
    isbn = {9783944057699},
    peerreviewed = {automatic},
    title = {Neue Boolesche Orthogonalisierende Operative Methoden und Gleichungen},
    type = {Dissertation},
    }
  • Y. Can, Neue Boolesche Orthogonalisierende Operative Methoden und Gleichungen, F. U. Press, Ed., FAU University Press, 2016.. [Bibtex]
    @book{can2016e,
    abstract = {Orthogonalität ist eine besondere Eigenschaft Boolescher Funktionen. Die Orthogonalisierung einer Booleschen Funktion vereinfacht die Transformation in eine andere äquivalente Form. Mit dieser Arbeit werden zwei neue allgemeingültige, logische operative Verknüpfungsmethoden die 'orthogonalisierende Differenzbildung ⊝' und das 'orthogonalisierende Verodern v ' vorgestellt. Die orthogonalisierende Differenzbildung wird zur Ermittlung einer Differenz in orthogonaler Form zweier Produktterme oder zweier Funktionen eingesetzt. Das orthogonalisierendes Verodern wird zum Verodern zweier Produktterme oder zweier orthogonaler Funktionen angewendet, welches auch Ergebnisse in orthogonaler Form darbietet. Darüber hinaus weisen die algorithmischen Implementierung beider Verknüpfungsmethoden geringere Rechenzeiten mit zunehmender Dimension im Vergleich zu den herkömmlichen bekannten Operationen auf. Auch werden die Vorteile im Hinblick auf den Speicherplatzbedarf hierbei besser genutzt, weil kein zusätzlicher Algorithmus zur Orthogonalisierung benötigt wird. Zudem werden Anwendungen der orthogonalisierenden Differenzbildung in weiteren Verfahren gezeigt, wie z.B. die Bildung der orthogonalen Negierten einer Funktion der disjunktiven Normalform. Durch die inhärente Orthogonalisierung werden weitere Verarbeitungsschritte in der TVL-Arithmetik, wie das Boolesche Differentialkalkül, erheblich vereinfacht. Ternär-Vektor-Listen werden als rechnerinterne Darstellung für binäre Funktionen verwendet und sind für die Behandlung Boolescher Probleme vorteilhafter. Daneben werden in dieser Arbeit zwei neue mathematische Boolesche Gleichungen zur Orthogonalisierung Boolescher Funktionen bzw. Ternär-Vektor-Listen disjunktiver Normalformen hergeleitet, welche jeweils auf den neuen Verknüpfungen ⊝ und v basieren. Damit wird zum ersten Mal mathematisch die Problematik der Orthogonalisierung behandelt und einfache Gleichungen zur Berechnung der orthogonalen Form vorgestellt. Zudem werden die beiden neuen Methoden in der Bestimmung von Testbelegungen für kombinatorische Schaltnetzwerke zur Verifizierung möglicher logischer Fehler in der TVL-Arithmetik eingesetzt. Ihre implementierten Algorithmen weisen zudem Vorteile bezüglich Rechenzeit und Speicherplatzbedarf auf und ermöglichen damit die Berechnung von minimierterer Menge an Testbelegungen. Im Vergleich zu den Methoden aus der Literatur reduzieren die neuen Algorithmen ORTH[⊝] und ORTH[ v ] die Rechenzeit um einen Faktor von ca. 2,5. Zusätzlich haben die beiden neuen Algorithmen ORTH[⊝] und ORTH[ v ] die Eigenschaft bessere Lösungen zu liefern, das bedeutet, orthogonale TVLen geringerer Anzahl an Termen, d.h. eine Reduzierung um etwa 50%. Damit wird eine Weiterbehandlung der ermittelten orthogonalen TVL mit geringerer Anzahl an Operationen gewährleistet, welche zum einen weitere Rechenzeiten optimiert und zum anderen die Anzahl an Terme in den nachfolgenden Verfahrensschritten niedriger ausfallen lässt. Mit dieser Verminderung wird die Reduzierung an Termen bis zur Ermittlung der Testbelegungen fortgesetzt, so dass minimierte Testsätze zur Verifizierung von kombinatorischen Schaltungen am Ende der Berechnungslinie erhalten werden können. Mit der geringeren Rechenzeit der Algorithmen und der minimal ermittelten Menge an Testsätzen wird eine Einsparung in Testzeit und die damit verbundenen Testkosten erreicht werden können. },
    author = {Can, Yavuz},
    editor = {Press, FAU University},
    language = {German},
    publisher = {FAU University Press},
    cris = {https://cris.fau.de/converis/publicweb/publication/122855964},
    year = {2016},
    month = {08},
    day = {24},
    faupublication = {yes},
    isbn = {9783944057705},
    keywords = {Algorithmus; Boolesche Funktion; Disjunktive Normalform; Mengenlehre; Orthogonalisierung; Orthogonalität; Rechenzeit},
    peerreviewed = {unknown},
    series = {FAU Studien aus der Elektrotechnik (5)},
    title = {Neue Boolesche Orthogonalisierende Operative Methoden und Gleichungen},
    type = {undefined},
    url = {https://opus4.kobv.de/opus4-fau/frontdoor/index/index/docId/7389},
    }
  • Y. Can, G. Fischer, and H. Kassim, "New Boolean Equation for Orthogonalizing of Disjunctive Normal Form based on the Method of Orthogonalizing Difference-Building", Journal of Electronic Testing-Theory and Applications, vol. 32, iss. 2, pp. 197-208, 2016. [DOI] [Bibtex]
    @article{can2016f,
    abstract = {In this paper a new Boolean equation for the orthogonalization of Boolean functions respectively of Ternary-Vector-Lists of disjunctive normal form is presented. It provides the mathematical solution of orthogonalization for the first time. The new equation is based on the new method of orthogonalizing difference-building ⊖. In contrast to other methods the new method has a faster computation time. Another advantage is the smaller
    number of product terms respectively of Ternary-Vectors in the orthogonalized result in contrast to other methods. Furthermore, the new equation can be used as a part in the calculation procedure of getting suitable test patterns for combinatorial circuits for verifying feasible logical faults.
    }, author = {Can, Yavuz and Fischer, Georg and Kassim, Hassen}, cris = {https://cris.fau.de/converis/publicweb/publication/208635231}, year = {2016}, month = {04}, doi = {10.1007/S10836-016-5572-6}, faupublication = {yes}, issn = {0923-8174}, journaltitle = {Journal of Electronic Testing-Theory and Applications}, keywords = {Boolean Function · Ternary-Vector-List · Orthogonalization · Computation Time · Combinatorial Circuit · Test Pattern}, number = {2}, pages = {197--208}, peerreviewed = {Yes}, shortjournal = {J ELECTRON TEST}, title = {New Boolean Equation for Orthogonalizing of Disjunctive Normal Form based on the Method of Orthogonalizing Difference-Building}, type = {Article in Journal}, volume = {32}, }
  • Y. Can, H. Kassim, and G. Fischer, "New Boolean Equation for Orthogonalizing of Disjunctive Normal Form based on the Method of Orthogonalizing Difference-Building", Journal of Electronic Testing-Theory and Applications, vol. Vol. 32, iss. Issue 2, pp. 197-208, 2016. [DOI] [Bibtex]
    @article{can2016b,
    abstract = {In this paper a new Boolean equation for the orthogonalization of Boolean functions respectively of Ternary-Vector-Lists of disjunctive normal form is presented. It provides the mathematical solution of orthogonalization for the first time. The new equation is based on the new method of orthogonalizing difference-building ⊖. In contrast to other methods the new method has a faster computation time. Another advantage is the smaller number of product terms respectively of Ternary-Vectors in the orthogonalized result in contrast to other methods. Furthermore, the new equation can be used as a part in the calculation procedure of getting suitable test patterns for combinatorial circuits for verifying feasible logical faults.},
    author = {Can, Yavuz and Kassim, Hassen and Fischer, Georg},
    language = {English},
    cris = {https://cris.fau.de/converis/publicweb/publication/108457624},
    year = {2016},
    month = {03},
    day = {17},
    doi = {10.1007/S10836-016-5572-6},
    faupublication = {yes},
    issn = {0923-8174},
    journaltitle = {Journal of Electronic Testing-Theory and Applications},
    keywords = {Orthogonalizing Boolean Forms},
    number = {Issue 2},
    pages = {197--208},
    peerreviewed = {Yes},
    shortjournal = {J ELECTRON TEST},
    title = {New Boolean Equation for Orthogonalizing of Disjunctive Normal Form based on the Method of Orthogonalizing Difference-Building},
    type = {Article in Journal},
    volume = {Vol. 32},
    }

2015

  • Y. Can and G. Fischer, "New Orthogonalizing Boolean Equation using in the Calculation of Test Patterns for Combinatorial Circuits" in ELECO 2015, Bursa, Turkey, 2015. [DOI] [Bibtex]
    @inproceedings{can2015a,
    abstract = {In this paper a new Boolean equation for the orthogonalization of Boolean functions respectively of Ternary-Vector-Lists of disjunctive normal form is presented. It provides the mathematical
    solution of orthogonalization. The new equation is based on the new method of orthogonalizing OR-ing gwhich enables the building the union of two product terms respectively of two Ternary-Vectors whereby the result is orthogonal. The algorithm based on the new equation has a faster computation time in contrast to other methods. Further advantage is the smaller number of the product terms respectively of the Ternary-Vectors in the orthogonalized result which reduces the number of further calculation steps. Furthermore, the new equation can be used as a part in the calculation procedure of getting suitable test patterns for combinatorial circuits for verifying~ feasible logical faults.}, author = {Can, Yavuz and Fischer, Georg}, editor = {Supported, IEEE}, language = {English}, booktitle = {ELECO 2015}, cris = {https://cris.fau.de/converis/publicweb/publication/115237144}, year = {2015}, month = {11}, day = {26}, doi = {10.1109/ELECO.2015.7394481}, eventdate = {2015-11-26/2015-11-28}, eventtitle = {9th International Conference on Electrical and Electronics Engineering}, faupublication = {yes}, keywords = {Boolean Normal Forms}, peerreviewed = {Yes}, title = {New Orthogonalizing Boolean Equation using in the Calculation of Test Patterns for Combinatorial Circuits}, type = {Konferenzschrift}, venue = {Bursa, Turkey}, }
  • Y. Can and G. Fischer, "New Orthogonalizing Boolean Equation using in the Calculation of Test Patterns for Combinatorial Circuits" in 9th International Conference on Electrical and Electronics Engineering (ELECO 2015), IEEE Turkey Section, Bursa, Turkey, 2015. [DOI] [Bibtex]
    @inproceedings{can2015c,
    abstract = {In this paper a new Boolean equation for the orthogonalization of Boolean functions respectively of Ternary-Vector-Lists of disjunctive normal form is presented. It provides the mathematical solution of orthogonalization. The new equation is based on the new method of orthogonalizing OR-ing ∨ which enables
    the building the union of two product terms respectively of two Ternary-Vectors whereby the result is orthogonal. The algorithm based on the new equation has a faster computation time in contrast to other methods. Further advantage is the smaller number of the product terms respectively of the Ternary-Vectors in the orthogonalized result which reduces the number of further calculation steps. Furthermore, the new equation can be used
    as a part in the calculation procedure of getting suitable test patterns for combinatorial circuits for verifying feasible Logical faults.
    }, author = {Can, Yavuz and Fischer, Georg}, language = {English}, booktitle = {9th International Conference on Electrical and Electronics Engineering (ELECO 2015), IEEE Turkey Section}, cris = {https://cris.fau.de/converis/publicweb/publication/208636161}, year = {2015}, month = {11}, day = {26}, doi = {10.1109/ELECO.2015.7394481}, eventdate = {2015-11-26/2015-11-28}, faupublication = {yes}, peerreviewed = {unknown}, title = {New Orthogonalizing Boolean Equation using in the Calculation of Test Patterns for Combinatorial Circuits}, type = {Konferenzschrift}, venue = {Bursa, Turkey}, }
  • Y. Can and G. Fischer, "Orthogonalizing Boolean Subtraction of Minterms or Ternary Vectors", Archives of Materials Science and Engineering, vol. 2B, iss. Vol 128, 2015. [DOI] [Bibtex]
    @article{can2014,
    author = {Can, Yavuz and Fischer, Georg},
    language = {English},
    booktitle = {ACTA PHYSICA POLONICA A},
    cris = {https://cris.fau.de/converis/publicweb/publication/123873024},
    year = {2015},
    month = {08},
    day = {25},
    doi = {10.12693/APHYSPOLA.128.B-388},
    eventdate = {2014-10-25/2014-10-29},
    eventtitle = {International Conference on Computational and Experimental Science and Engineering (ICCESEN)},
    faupublication = {yes},
    issn = {1897-2764},
    journaltitle = {Archives of Materials Science and Engineering},
    number = {Vol 128},
    peerreviewed = {Yes},
    title = {Orthogonalizing Boolean Subtraction of Minterms or Ternary Vectors},
    venue = {Antalya, Turkey},
    volume = {2B},
    }
  • Y. Can and G. Fischer, "Boolean Orthogonalizing Combination Methods" in Fifth International Conference on Computational Science, Engineering and Information Technology, Vienna, Austria, 2015, pp. 1-88. [DOI] [Bibtex]
    @inproceedings{can2015,
    abstract = {In this paper a new logical operation method called “orthogonalizing difference-building” is presented. It is used to calculate the difference, but also the complement of a function as well as the EXOR and EXNOR of two minterms respectively two ternary-vectors or two functions respectively two ternary-vector-lists is presented. On the basis of this new method a further logical operation method called “orthogonal OR-ing” is going to be introduced. The advantages of both methods are their results, which are already available in an orthogonal form that has an essential advantage for continuing calculations. Since it applies, an orthogonal disjunctive normal form is equal to orthogonal antivalence normal form, subsequent Boolean differential calculus will be simplified.},
    author = {Can, Yavuz and Fischer, Georg},
    language = {English},
    booktitle = {Fifth International Conference on Computational Science, Engineering and Information Technology},
    cris = {https://cris.fau.de/converis/publicweb/publication/123890404},
    year = {2015},
    month = {05},
    day = {23},
    doi = {10.5121/CSIT.2015.51102},
    eventdate = {2015-05-23/2015-05-24},
    eventtitle = {Fifth International Conference on Computational Science, Engineering and Information Technology CCSEIT 2015},
    faupublication = {yes},
    isbn = {9781921987397},
    issn = {2231-5403},
    keywords = {Difference-Building,Orthogonality,TVL,Data Memory Request,Computing Time},
    pages = {1--88},
    peerreviewed = {Yes},
    title = {Boolean Orthogonalizing Combination Methods},
    type = {Konferenzschrift},
    url = {http://www.airccj.org/CSCP/vol5/csit54102.pdf},
    venue = {Vienna, Austria},
    }
  • Y. Can and G. Fischer, "Orthogonalizing Boolean Subtraction of Minterms or Ternary-Vectors", Acta Physica Polonica A, vol. Vol. 128, iss. No. 2B, 2015. [DOI] [Bibtex]
    @article{can2015b,
    abstract = {In this paper, a method called “Boolean subtraction” which enables the subtraction of two minterms and of two functions of the disjunctive normal form respectively of two ternary-vectors and of two ternary-vector-lists is presented. The advantage of “Boolean subtraction” is that the calculated results are already presented in an orthogonal form, which has a significant advantage for further calculations. It replaces two procedures, once building the difference and then the subsequent orthogonalizing and has faster computing time in comparison. Furthermore, another equation is developed from the property of this new method providing orthogonal results in order to orthogonalize functions of the disjunctive normal form.},
    author = {Can, Yavuz and Fischer, Georg},
    language = {English},
    cris = {https://cris.fau.de/converis/publicweb/publication/118150604},
    year = {2015},
    doi = {10.12693/APHYSPOLA.128.B-388},
    faupublication = {yes},
    issn = {0587-4246},
    journaltitle = {Acta Physica Polonica A},
    keywords = {Set Theory,Difference Building,Ternary-Vector,K-map,Venn-Diagram,Computation Time,Orthogonality},
    number = {No. 2B},
    peerreviewed = {Yes},
    shortjournal = {ACTA PHYS POL A},
    title = {Orthogonalizing Boolean Subtraction of Minterms or Ternary-Vectors},
    type = {Article in Journal},
    volume = {Vol. 128},
    }

2014

  • Y. Can and G. Fischer, "Orthogonalizing Boolean Subtraction of Minterms or Ternary-Vectors" in Bell Laps Future X-Days, Stuttgart, Germany, 2014. [Bibtex]
    @inproceedings{can2014c,
    abstract = {Postervorstellung},
    author = {Can, Yavuz and Fischer, Georg},
    language = {English},
    booktitle = {Bell Laps Future X-Days},
    cris = {https://cris.fau.de/converis/publicweb/publication/112604404},
    year = {2014},
    month = {11},
    day = {19},
    eventdate = {2014-11-19/2014-11-19},
    faupublication = {yes},
    keywords = {Ternary-Vector,Boolean,Orthogonality,Difference-Building},
    peerreviewed = {unknown},
    title = {Orthogonalizing Boolean Subtraction of Minterms or Ternary-Vectors},
    type = {Abstract zum Poster},
    venue = {Stuttgart, Germany},
    }
  • Y. Can and G. Fischer, "Orthogonalizing Boolean Subtraction of Minterms or Ternary-Vectors" in Bell Laps Future X-Days, Alcatel-Lucent. Stuttgart, Germany, 2014. [Bibtex]
    @inproceedings{can2014d,
    author = {Can, Yavuz and Fischer, Georg},
    booktitle = {Bell Laps Future X-Days},
    cris = {https://cris.fau.de/converis/publicweb/publication/208636614},
    year = {2014},
    month = {11},
    day = {19},
    eventdate = {2014-11-19/2014-11-19},
    faupublication = {yes},
    peerreviewed = {unknown},
    title = {Orthogonalizing Boolean Subtraction of Minterms or Ternary-Vectors},
    type = {undefined},
    venue = {Alcatel-Lucent. Stuttgart, Germany},
    }

2013

  • Y. Can, M. Rantisi, and S. Sattler, "Selftest by μC to detect faulty capacitors" in Scientific Cooperations Publications, Istanbul, Turkey, 2013, pp. 1-279. [Bibtex]
    @inproceedings{can2013,
    abstract = {The presented work concerns the concept of validating measurements of simple analog filter~ wirings in automotive electronic control units (ECU). Therefore, open or faulty capacitors should be detected. An input signal is fed to the filter circuit by means of the microcontroller TC1797, and the filter output signal for determining the functionality of the filter is received by the same microcontroller.},
    author = {Can, Yavuz and Rantisi, Mohammed and Sattler, Sebastian},
    editor = {Cooperations, Scientific},
    language = {English},
    booktitle = {Scientific Cooperations Publications},
    cris = {https://cris.fau.de/converis/publicweb/publication/123073544},
    year = {2013},
    month = {09},
    day = {05},
    eventdate = {2013-09-05/2013-09-07},
    eventtitle = {International Conference in Electrical and Electronics Engineering: Advances in Control Engineering (ACE 2013)},
    faupublication = {yes},
    isbn = {9786058663718},
    keywords = {Verification,µC 1797,ECU,signal theory,filter analysis},
    pages = {1--279},
    peerreviewed = {Yes},
    title = {Selftest by μC to detect faulty capacitors},
    type = {Konferenzschrift},
    venue = {Istanbul, Turkey},
    }

COPYRIGHT NOTICE: Copyright and all rights of the material above are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by the appropriate copyright. The material may not be reposted without the explicit permission of the copyright holder.

COPYRIGHT NOTICE FOR IEEE PUBLICATIONS: © IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

COPYRIGHT NOTICE FOR EUMA PUBLICATIONS: © EUMA. Personal use of this material is permitted. Permission from European Microwave Association(EUMA) must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.