UNIFIED APPROACH TO DESIGNING PARALLEL WINOGRAD ALGORITHMS
| dc.citation.epage | 168 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 161 | en_US |
| dc.citation.volume | 141 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | YUAN, S | 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 | College of Engineering | en_US |
| dc.date.accessioned | 2014-12-08T15:04:00Z | |
| dc.date.available | 2014-12-08T15:04:00Z | |
| dc.date.issued | 1994-05-01 | en_US |
| dc.description.abstract | Although the recurrence equation for the Winograd algorithm is uniform, no unified approach has been proposed to design parallel Winograd algorithms. In the paper the authors propose a unified approach to designing parallel Winograd algorithms. Using this approach, several parallel algorithms are designed. These algorithms are executed on regular arrays including conventional systolic arrays and nonplanar regular arrays. A comparison of their performance is given. | en_US |
| dc.identifier.doi | 10.1049/ip-cdt:19949981 | en_US |
| dc.identifier.issn | 1350-2387 | en_US |
| dc.identifier.journal | IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1049/ip-cdt:19949981 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2510 | |
| dc.identifier.wosnumber | WOS:A1994NZ54600003 | |
| dc.language.iso | en_US | en_US |
| dc.subject | CYLINDRICAL ARRAY | en_US |
| dc.subject | MATRIX MULTIPLICATION | en_US |
| dc.subject | PARALLEL ALGORITHM | en_US |
| dc.title | UNIFIED APPROACH TO DESIGNING PARALLEL WINOGRAD ALGORITHMS | en_US |
| dc.type | Article | en_US |