ON EQUIVALENT SYSTOLIC DESIGNS OF LU DECOMPOSITION AND ITS ALGEBRAIC REPRESENTATION
| dc.citation.epage | 666 | en_US |
| dc.citation.issue | 6 | en_US |
| dc.citation.spage | 662 | en_US |
| dc.citation.volume | 35 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | HOU, YC | en_US |
| dc.contributor.author | TSAY, JC | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:04:43Z | |
| dc.date.available | 2014-12-08T15:04:43Z | |
| dc.date.issued | 1992-12-01 | en_US |
| dc.description.abstract | Algorithms which are to be mapped onto interconnecting processing elements in order to design a systolic array are conventionally represented by graphs or networks. This paper introduces the concept of algebraic representation and uses a generating function to represent a systolic array. | en_US |
| dc.identifier.doi | 10.1093/comjnl/35.6.662 | en_US |
| dc.identifier.issn | 0010-4620 | en_US |
| dc.identifier.journal | COMPUTER JOURNAL | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1093/comjnl/35.6.662 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3214 | |
| dc.identifier.wosnumber | WOS:A1992KL75000018 | |
| dc.language.iso | en_US | en_US |
| dc.title | ON EQUIVALENT SYSTOLIC DESIGNS OF LU DECOMPOSITION AND ITS ALGEBRAIC REPRESENTATION | en_US |
| dc.type | Note | en_US |