基于分解树的压缩过程与迭代步骤，用于任务的相互转换布局

Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014) Pub Date : 2014-09-01 DOI:10.1109/EWDTS.2014.7027091

V. Andreeva, Kirill A. Sorudeykin

{"title":"基于分解树的压缩过程与迭代步骤，用于任务的相互转换布局","authors":"V. Andreeva, Kirill A. Sorudeykin","doi":"10.1109/EWDTS.2014.7027091","DOIUrl":null,"url":null,"abstract":"In this paper we propose a further development of compaction procedure of based on decomposition tree. The goal of the development is to simplify a decomposition tree, in other words to reduce the number Local Don't Care sets (LDCs). A simplification is achieved due to an introduction of iteration step in the process of decomposition tree creation.","PeriodicalId":272780,"journal":{"name":"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Decomposition tree - based compaction procedure with iteration steps for interconversional layouts of tasks\",\"authors\":\"V. Andreeva, Kirill A. Sorudeykin\",\"doi\":\"10.1109/EWDTS.2014.7027091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a further development of compaction procedure of based on decomposition tree. The goal of the development is to simplify a decomposition tree, in other words to reduce the number Local Don't Care sets (LDCs). A simplification is achieved due to an introduction of iteration step in the process of decomposition tree creation.\",\"PeriodicalId\":272780,\"journal\":{\"name\":\"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EWDTS.2014.7027091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EWDTS.2014.7027091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种基于分解树的压缩过程的进一步发展。开发的目标是简化分解树，换句话说，减少局部不关心集(ldc)的数量。由于在分解树创建过程中引入了迭代步骤，实现了简化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Decomposition tree - based compaction procedure with iteration steps for interconversional layouts of tasks

In this paper we propose a further development of compaction procedure of based on decomposition tree. The goal of the development is to simplify a decomposition tree, in other words to reduce the number Local Don't Care sets (LDCs). A simplification is achieved due to an introduction of iteration step in the process of decomposition tree creation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)

自引率

0.00%

发文量