完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Jan, Gene Eu | |
dc.contributor.author | Leu, Shao-Wei | |
dc.contributor.author | Li, Cheng-Hung | |
dc.date.accessioned | 2009-08-23T04:41:21Z | |
dc.date.accessioned | 2020-05-25T06:38:09Z | - |
dc.date.available | 2009-08-23T04:41:21Z | |
dc.date.available | 2020-05-25T06:38:09Z | - |
dc.date.issued | 2006-10-16T01:50:47Z | |
dc.date.submitted | 2002-12-18 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1351 | - |
dc.description.abstract | Quadtree and pyramid architectures have attracted considerable attention in recent years. They are being applied, on an increasing basis, to the fields of digital image and signal processing. Consequently, efficient embedding of these architectures in VLSI arrays has become an important research topic. In this paper, we propose three schemes to embed either quadtrees or pyramids in rectangular-, hexagonal-, or octagonal-connected mesh, using three different cell shapes for VLSI layout. Our analyses show that the best achievable node utilization is 67% when embedding either of these architectures in an octagonal-connected mesh. This result outperforms the best utilization recorded in literature by 25%. Our study also indicates that, among the various cell shapes attempted, the octagonal cell gives the best area utilization and the required routing space. | |
dc.description.sponsorship | 東華大學,花蓮縣 | |
dc.format.extent | 19p. | |
dc.format.extent | 445808 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2002 ICS會議 | |
dc.subject | Embedding | |
dc.subject | meshes | |
dc.subject | VLSI | |
dc.subject | bottleneck | |
dc.subject | routing | |
dc.title | On the Array Embeddings and Layout of Quadtrees and Pyramids | |
分類: | 2002年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics002002000040.PDF | 435.36 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。