Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 199194

BDD complexity analysis of multiplier circuits


Grudenić, Igor; Bogunović, Nikola
BDD complexity analysis of multiplier circuits // Proceedings of the Joint Conferences Computers in Technical systems and Intelligent systems / Budin, Leo ; Ribarić, Slobodan (ur.).
Rjieka: HU MIPRO, 2005. str. 31-34 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 199194 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
BDD complexity analysis of multiplier circuits

Autori
Grudenić, Igor ; Bogunović, Nikola

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of the Joint Conferences Computers in Technical systems and Intelligent systems / Budin, Leo ; Ribarić, Slobodan - Rjieka : HU MIPRO, 2005, 31-34

Skup
Computers in Technical Systems

Mjesto i datum
Opatija, Hrvatska, 30.05.-03.06.2005

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
formal verification; symbolic model checking; BDDs; multiplier complexity

Sažetak
The equivalence of Boolean functions is an important issue in hardware design. In order to check the equivalence of two combinatorial circuits SAT solvers and BDD based algorithms are used. For complex hardware designs efficient BDD manipulation algorithms must be employed. There is a number of industrial combinatorial circuitry for which BDD representation explodes exponentially in the number of inputs. An example of such a circuitry is multiplier that is known to have no efficient BDD representation regardless of the employed variable ordering. In this paper we analyze some important properties of the BDD representation of multipliers, as well as the complexity of the involved computations

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Projekti:
0036051
0098023

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Profili:

Avatar Url Igor Grudenić (autor)

Avatar Url Nikola Bogunović (autor)

Citiraj ovu publikaciju

Grudenić, Igor; Bogunović, Nikola
BDD complexity analysis of multiplier circuits // Proceedings of the Joint Conferences Computers in Technical systems and Intelligent systems / Budin, Leo ; Ribarić, Slobodan (ur.).
Rjieka: HU MIPRO, 2005. str. 31-34 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Grudenić, I. & Bogunović, N. (2005) BDD complexity analysis of multiplier circuits. U: Budin, L. & Ribarić, S. (ur.)Proceedings of the Joint Conferences Computers in Technical systems and Intelligent systems.
@article{article, year = {2005}, pages = {31-34}, keywords = {formal verification, symbolic model checking, BDDs, multiplier complexity}, title = {BDD complexity analysis of multiplier circuits}, keyword = {formal verification, symbolic model checking, BDDs, multiplier complexity}, publisher = {HU MIPRO}, publisherplace = {Opatija, Hrvatska} }
@article{article, year = {2005}, pages = {31-34}, keywords = {formal verification, symbolic model checking, BDDs, multiplier complexity}, title = {BDD complexity analysis of multiplier circuits}, keyword = {formal verification, symbolic model checking, BDDs, multiplier complexity}, publisher = {HU MIPRO}, publisherplace = {Opatija, Hrvatska} }




Contrast
Increase Font
Decrease Font
Dyslexic Font