Morita, Akihito
Overview
Works:  4 works in 5 publications in 2 languages and 7 library holdings 

Roles:  Author 
Publication Timeline
.
Most widely held works by
Akihito Morita
Efficient construction of binary moment diagrams for verifying arithmetic circuits by
Kiyoharu Hamaguchi(
Book
)
2 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Binary Decision Diagrams (BDDs) have been used as a very powerful tool for manipulating Boolean functions in various application domains, in particular, design verification of logic circuits. We can represent many practical functions with reasonable size of BDDs, and perform Boolean operations very efficiently. Unfortunately, the sizes of the BDDs for representing multiplication are known to blow up exponentially to the number of inputs. Binary Moment Diagrams (BMDs) are graph representations of mappings from binary vectors to integers. BMDs also provide canonical representations to those functions. When we use BMDs, we can represent the output function at the word level. We can represent the functions expressing multiplication with BMDs whose size grows only linearly with the number of variables. Bryant and Chen reported a BMDbased polynomialtime algorithm for verifying multipliers. This approach requires highlevel information such as specifications to subcomponents. From users' point of view, is is convenient to handle circuit descriptions without giving specifications to subcomponents. This paper presents a new technique called backward sweeping. Using this technique, we can verify arithmetic circuits without any highlevel information. Although our experiments are preliminary, the results for array multipliers and Wallacetree multipliers both show that the order of the computation time is approximately n[superscript 3.5], where n is the number of inputs. We have successfully verified 31bit Wallacetree multipliers in 260 seconds with 3 Mbyte of memory on SPARCstation 10/51. We have also built the *BMD for c6288 in 72 seconds with 2 Mbyte of memory. This result outperforms previous BDDbased approaches for verifying multipliers."
2 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Binary Decision Diagrams (BDDs) have been used as a very powerful tool for manipulating Boolean functions in various application domains, in particular, design verification of logic circuits. We can represent many practical functions with reasonable size of BDDs, and perform Boolean operations very efficiently. Unfortunately, the sizes of the BDDs for representing multiplication are known to blow up exponentially to the number of inputs. Binary Moment Diagrams (BMDs) are graph representations of mappings from binary vectors to integers. BMDs also provide canonical representations to those functions. When we use BMDs, we can represent the output function at the word level. We can represent the functions expressing multiplication with BMDs whose size grows only linearly with the number of variables. Bryant and Chen reported a BMDbased polynomialtime algorithm for verifying multipliers. This approach requires highlevel information such as specifications to subcomponents. From users' point of view, is is convenient to handle circuit descriptions without giving specifications to subcomponents. This paper presents a new technique called backward sweeping. Using this technique, we can verify arithmetic circuits without any highlevel information. Although our experiments are preliminary, the results for array multipliers and Wallacetree multipliers both show that the order of the computation time is approximately n[superscript 3.5], where n is the number of inputs. We have successfully verified 31bit Wallacetree multipliers in 260 seconds with 3 Mbyte of memory on SPARCstation 10/51. We have also built the *BMD for c6288 in 72 seconds with 2 Mbyte of memory. This result outperforms previous BDDbased approaches for verifying multipliers."
<> by Yuki Shimba(
)
1 edition published in 2019 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2019 in English and held by 2 WorldCat member libraries worldwide
Jibun de kangaeru chikara o muri naku hagukumu kodomo to otona no kyoikuron(
Book
)
1 edition published in 2021 in Japanese and held by 1 WorldCat member library worldwide
1 edition published in 2021 in Japanese and held by 1 WorldCat member library worldwide
Kodomo to otona no kyōikuron : jibun de kangaeru chikara o muri naku hagukumu by
Akihito Morita(
Book
)
1 edition published in 2021 in Japanese and held by 1 WorldCat member library worldwide
1 edition published in 2021 in Japanese and held by 1 WorldCat member library worldwide
Audience Level
0 

1  
General  Special 
Related Identities
Associated Subjects