完整後設資料紀錄
DC 欄位語言
dc.contributor.authorJan, Gene Eu
dc.contributor.authorLeu, Shao-Wei
dc.contributor.authorLi, Cheng-Hung
dc.contributor.authorLiou, Wan-Rone
dc.date.accessioned2009-06-02T06:38:32Z
dc.date.accessioned2020-05-25T06:43:56Z-
dc.date.available2009-06-02T06:38:32Z
dc.date.available2020-05-25T06:43:56Z-
dc.date.issued2006-10-18T07:49:52Z
dc.date.submitted2004-12-15
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/1871-
dc.description.abstractMesh network is commonly seen in parallel computation network, as it is straightforward and easy to expand. Two- dimensional mesh network also attract considerable attention in the VLSI layout due to its simplicity. In applying binary tree to the layout of VLSI array in the form of H, better flexibility and regularity might be achieved. Based on the advantages of mesh architecture and binary trees, we present a new approach of mesh-connected trees that are different to those previously. They unite mesh architecture and binary trees into a new architecture and apply it to the layout of VLSI array. This architecture is free from the problems of crossing, saving the area of overall layout. In addition, this improves the problem that traditional meshes of trees and meshconnected tree difficult to expanded in terms of number of levels. Furthermore, now that we have another mesh-connected architecture, the new meshconnected tree architecture provided by us will be more efficient than traditional binary tree. Concentrating on the communications between binary trees.
dc.description.sponsorship大同大學,台北市
dc.format.extent4p.
dc.format.extent708183 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2004 ICS會議
dc.subjectVLSI layout
dc.subjectVLSI array
dc.subjectbinary tree
dc.subjectmesh of trees
dc.subjectmesh-connected tree
dc.subject.otherMiscellaneous
dc.titleAnother Approach of Mesh-Connected trees
分類:2004年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002004000235.pdf691.58 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。