{"title":"Channel complexity analysis for reconfigurable VLSI/WSI processor arrays","authors":"P. Rhee, J. H. Kim","doi":"10.1109/ASAP.1990.145470","DOIUrl":null,"url":null,"abstract":"The authors propose a general method to analyze channel complexity for a 2D array with a given domain constraint. A domain-based reconfiguration scheme can be divided into two phases: assignment and interconnection. In the assignment phase a logical cell is assigned to a fault-free cell under a domain constraint by assignment rules. In the interconnection phase connections between the assigned logical cells are determined. A domain may be decided considering predetermined maximum distance between two logically adjacent cells. Interconnection redundancy, is represented by channel complexity, where channel complexity is measured by the number of tracks and associated switches. The array is partitioned into as small units, called subranges, as possible while preserving the characteristics of array reconfigurability. Channel complexity is analyzed based on subranges.<<ETX>>","PeriodicalId":438078,"journal":{"name":"[1990] Proceedings of the International Conference on Application Specific Array Processors","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings of the International Conference on Application Specific Array Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASAP.1990.145470","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The authors propose a general method to analyze channel complexity for a 2D array with a given domain constraint. A domain-based reconfiguration scheme can be divided into two phases: assignment and interconnection. In the assignment phase a logical cell is assigned to a fault-free cell under a domain constraint by assignment rules. In the interconnection phase connections between the assigned logical cells are determined. A domain may be decided considering predetermined maximum distance between two logically adjacent cells. Interconnection redundancy, is represented by channel complexity, where channel complexity is measured by the number of tracks and associated switches. The array is partitioned into as small units, called subranges, as possible while preserving the characteristics of array reconfigurability. Channel complexity is analyzed based on subranges.<>