{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00028354","sets":["1164:2036:2148:2152"]},"path":["2152"],"owner":"1","recid":"28354","title":["任意角度辺を含むLSIマスクパターンの拡大・縮小手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1988-07-12"},"_buckets":{"deposit":"f4a2b942-58e0-4a97-b0a6-abea304bfd09"},"_deposit":{"id":"28354","pid":{"type":"depid","value":"28354","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"任意角度辺を含むLSIマスクパターンの拡大・縮小手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"任意角度辺を含むLSIマスクパターンの拡大・縮小手法"},{"subitem_title":"A RESIZING ALGORITHM FOR THE LSI LAYOUT WITH DIAGONAL EDGES","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1988-07-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"シャープ株式会社　コンピュータシステム研究所"},{"subitem_text_value":"シャープ株式会社　コンピュータシステム研究所"},{"subitem_text_value":"シャープ株式会社　コンピュータシステム研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Computer Systems Laboratories, SHARP Corporation","subitem_text_language":"en"},{"subitem_text_value":"Computer Systems Laboratories, SHARP Corporation","subitem_text_language":"en"},{"subitem_text_value":"Computer Systems Laboratories, SHARP Corporation","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/28354/files/IPSJ-SLDM88043004.pdf"},"date":[{"dateType":"Available","dateValue":"1990-07-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM88043004.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"03df3ced-e43d-4eb8-9f52-ba920a85b06a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1988 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"長尾, 明"},{"creatorName":"小嶋, 格"},{"creatorName":"神戸尚志"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Akira, Nagao","creatorNameLang":"en"},{"creatorName":"Itaru, Kojima","creatorNameLang":"en"},{"creatorName":"Takashi, Kambe","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"リサイジングは図形演算のひとつであり、マスクパターンの拡大や縮小を行う操作のことである。マスクパターンを構成する図形のほとんどは、垂直・水平線分からなっているが、高集積化の実現や、回路特性の向上のために斜め辺も用いられている。このようなマスクパターンをリサイジングできるよう、任意角度辺からなる図形を対象とし、かつ高速に処理できる手法を開発したので報告する。本手法は、リサイジング図形を得る前にいったん「仮図形」と呼ぶ中間的な頂点列を生成することにより、アルゴリズムの簡単化と高速化を図っている。本稿ではまず、入力図形とリサイジング図形を比較し、その変化分の図形について考察するとともに、仮図形とはどのようなものであるかを示し、次いで仮図形の生成法を含めたリサイジングのアルゴリズムについて述べている。最後に、本手法が頂点数nのマスクパターンを、O(n log n)の計算複雑度で高速に処理することを示す。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The resizing operation which is one of the pattern operation for the LSI layout, expands or shrinks it. The LSI layout pattern includes a lot of othogonal figures, but diagonal figures are often used in order to accomplish a high density layout and to improve a characteristic of a circuits. We have developed a high-speed resizing algorithm for the LSI layout with diagonal figures using the intermediate figure called \"imaginary figure\". In this paper, we discuss the difference of an objective figure and the figure given by the resizing, and describe \"what is the imaginary figure?\" Next, we show the making of the imaginary figure, and the flow of the resizing algorithm. At last it is shown that the resizing algorithm manipulates the LSI layout pattern with n-vertices in O(n log n) time complexity.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1988-07-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"47(1988-SLDM-043)","bibliographicVolumeNumber":"1988"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":28354,"updated":"2025-01-22T18:06:18.765948+00:00","links":{},"created":"2025-01-18T22:58:29.091909+00:00"}