Dariusz Kania

Prof. Dr. Dariusz Kania

Institute of Electronics, Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 March 2017 in International Journal of Applied Mathematics and Computer Science
Verified
Journal Article
Open access
PDF file
MKMarcin Kubica
Marcin Kubica
Dariusz KaniaDariusz Kania
Dariusz Kania
One of the main aspects of logic synthesis dedicated to FPGA is the problem of technology mapping, which is directly associated with the logic decomposition technique. This paper focuses on using configurable properties of CLBs in the process of logic decomposition and technology mapping. A novel theory and a set of efficient techniques for logic decomposition based on a BDD are proposed. The paper shows that logic optimization can be efficiently carried out by using multiple decomposition. The essence of the proposed synthesis method is multiple cutting of a BDD. A new diagram form called an SMTBDD is proposed. Moreover, techniques that allow finding the best technology mapping oriented to configurability of CLBs are presented. In the experimental section, the presented method (MultiDec) is compared with academic and commercial tools. The experimental results show that the proposed technology mapping strategy leads to good results in terms of the number of CLBs.

1 July 2017 in Microprocessors and Microsystems
Verified
Journal Article
Closed access
MKMarcin Kubica
Marcin Kubica
Adam OparaAdam Opara
Adam Opara
Dariusz KaniaDariusz Kania
Dariusz Kania

25 January 2019 in IEEE Access
Verified
Journal Article
Open access
MKMarcin Kubica
Marcin Kubica
Dariusz KaniaDariusz Kania
Dariusz Kania
JKJozef Kulisz
Jozef Kulisz

1 January 2021
Verified
Book
Closed access
MKMarcin Kubica
Marcin Kubica
AOAdam Opara
Adam Opara
Dariusz KaniaDariusz Kania
Dariusz Kania

8 February 2019 in IEEE Access
Verified
Journal Article
Open access
Adam OparaAdam Opara
Adam Opara
MKMarcin Kubica
Marcin Kubica
Dariusz KaniaDariusz Kania
Dariusz Kania
Physical systems may be carried out in both hardware and software. Hardware is based on implementing appropriate logic functions in FPGA structures connected with a physical layer of cyber-physical systems (CPSs). Effective technology mapping of these functions in FPGA structures is directly connected with logic synthesis. Thus, in the case of CPSs, we can talk about cyber-physical synthesis. The effectiveness of this synthesis is key from the point-of-view of designing CPSs. This paper focuses on the methods aiming at shortening synthesis time of circuits carried out in FPGA circuits. The proposed synthesis methods stem from an original way of a function representation enabling to quick search for appropriate decompositions. This paper presents a series of original methods. They include enabling for a quick relocating of variables between bound and free sets, time effective and multilevel technology mapping of multi-output function, and techniques of quick efficiency assessing of technology mapping taking non-disjoint decomposition into account. The methods are the basis of the algorithms implemented in the author's synthesis tools such as dekBDD and MultiDec. The effectiveness of the proposed methods was proved via experiments. The main contribution of the paper in the area of cyber-physical synthesis is proposing effective methods of carrying out a hardware layer cyber-physical synthesis that uses the FPGA circuits.

23 June 2017 in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
Verified
Journal Article
Open access
PDF file
MKMarcin Kubica
Marcin Kubica
Dariusz KaniaDariusz Kania
Dariusz Kania
The main goal of the paper is to present a logic synthesis strategy dedicated to an LUT-based FPGA. New elements of the proposed synthesis strategy include: an original method of function decomposition, non-disjoint decomposition, and technology mapping dedicated to configurability of logic blocks. The aim of all of the proposed synthesis approaches is the sharing of appropriately configured logic blocks. Innovation of the methods is based on the way of searching decomposition, which relies on multiple cutting of an MTBDD diagram describing a multi-output function. The essence of the proposed algorithms rests on the method of unicoding dedicated to sharing resources, searching non-disjoint decomposition on the basis of the partition of root tables, and choosing the levels of diagram cutting that will guarantee the best mapping to complex logic blocks. The methods mentioned above were implemented in the MultiDec tool. The efficiency of the analyzed methods was experimentally confirmed by comparing the synthesis results with both academic and commercial tools.