An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation

Shigeru Yamashita, Hiroshi Sawada, Akira Nagoya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We present an efficient framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on functional (boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.

Original languageEnglish
Title of host publicationProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Pages253-258
Number of pages6
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event2000 Asia and South Pacific Design Automation Conference, ASP-DAC 2000 - Yokohama, Japan
Duration: Jan 25 2000Jan 28 2000

Other

Other2000 Asia and South Pacific Design Automation Conference, ASP-DAC 2000
CountryJapan
CityYokohama
Period1/25/001/28/00

Fingerprint

Decomposition
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Yamashita, S., Sawada, H., & Nagoya, A. (2000). An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 253-258) https://doi.org/10.1145/368434.368624

An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation. / Yamashita, Shigeru; Sawada, Hiroshi; Nagoya, Akira.

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2000. p. 253-258.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yamashita, S, Sawada, H & Nagoya, A 2000, An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation. in Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. pp. 253-258, 2000 Asia and South Pacific Design Automation Conference, ASP-DAC 2000, Yokohama, Japan, 1/25/00. https://doi.org/10.1145/368434.368624
Yamashita S, Sawada H, Nagoya A. An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2000. p. 253-258 https://doi.org/10.1145/368434.368624
Yamashita, Shigeru ; Sawada, Hiroshi ; Nagoya, Akira. / An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation. Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2000. pp. 253-258
@inproceedings{430c480cf5f943a88743ea79738299e6,
title = "An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation",
abstract = "We present an efficient framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on functional (boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.",
author = "Shigeru Yamashita and Hiroshi Sawada and Akira Nagoya",
year = "2000",
doi = "10.1145/368434.368624",
language = "English",
isbn = "0780359747",
pages = "253--258",
booktitle = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

}

TY - GEN

T1 - An efficient framework of using various decomposition methods to synthesize LUT networks and its evaluation

AU - Yamashita, Shigeru

AU - Sawada, Hiroshi

AU - Nagoya, Akira

PY - 2000

Y1 - 2000

N2 - We present an efficient framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on functional (boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.

AB - We present an efficient framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on functional (boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.

UR - http://www.scopus.com/inward/record.url?scp=0343852673&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0343852673&partnerID=8YFLogxK

U2 - 10.1145/368434.368624

DO - 10.1145/368434.368624

M3 - Conference contribution

SN - 0780359747

SN - 9780780359741

SP - 253

EP - 258

BT - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

ER -