{"created":"2023-07-25T09:06:14.375507+00:00","id":4457,"links":{},"metadata":{"_buckets":{"deposit":"6071c303-bd80-41a1-b13d-3d016d9ca31f"},"_deposit":{"created_by":3,"id":"4457","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"4457"},"status":"published"},"_oai":{"id":"oai:toyama.repo.nii.ac.jp:00004457","sets":["496:556:559:560:604"]},"author_link":["57588","57587","57586","57585","57584","57589"],"item_3_alternative_title_19":{"attribute_name":"その他（別言語等）のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"The Logical Design of Minimal Three-level NAND Circuits(I) : P-N cube method"}]},"item_3_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1993-03","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"30","bibliographicPageStart":"21","bibliographicVolumeNumber":"44","bibliographic_titles":[{"bibliographic_title":"富山大学工学部紀要"}]}]},"item_3_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"In this paper, we propose the P-N cube method for logical design of three-level NAND circuits. there are zn permissible cubes on the map for n-variable functions. We number all the permissible cubes in an unique manner that the permissible cube may be generated in order of its size. This strategy for generating the cubes make P-N cube method very efficient, because the following procedure is used repeatedly in the method; first some P-(permissible) cubes are selected to cover all 1'-minterms on the map, and then 0'-minterms get mixed with those 1'-minterms are deleted by using some N-(permissible) cubes from each P-cube. In the program, the function is represented as a 2^n-dimensional Boolean vector and permissible cubes are generated with a particular array of 2^n X 2^n size. Also how to change the shape of data at each step of progress of the algorithm is explained by the output results of a computer.","subitem_description_type":"Abstract"},{"subitem_description":"本論文で，我々は三段NANDゲート回路の論理設計法として，P-N項法を提案している。\nn変数の関数のマップには2^n個の許容項がある。\nすべての許容項に許容項が大きさの順序で生成出来るよう我々独自の方法で番号付けを行なっている。\n項生成のこの方法によって，P-N項法は大変効率的となる。\nというのは，最初にマップ上のすべての1の最小項がカバーされるように，いくつかのP（許容）項が選ばれ，それから1の最小項と混ざって入ったOの最小項がいくつかのN（許容）項を使って，各P項から取り除かれるという手順が本方法で繰り返されるからである。\nプログラムにおいて，関数は2^n次元ブールベクトルとして表され，許容項は大きさ2^n X 2^nのある特別な配列でもって生成される。\nまた，アルゴリズムの進行の各ステップで，データがどのように変わるかも計算結果を使って説明される。","subitem_description_type":"Abstract"}]},"item_3_description_40":{"attribute_name":"資源タイプ(DSpace)","attribute_value_mlt":[{"subitem_description":"Article","subitem_description_type":"Other"}]},"item_3_description_6":{"attribute_name":"引用","attribute_value_mlt":[{"subitem_description":"富山大学工学部紀要，44, Page 21-30","subitem_description_type":"Other"}]},"item_3_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"57587","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Matsuda, Hideo"}]},{"nameIdentifiers":[{"nameIdentifier":"57588","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Miyagoshi, Takashi"}]},{"nameIdentifiers":[{"nameIdentifier":"57589","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Hatakeyama, Toyomasa"}]}]},"item_3_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.15099/00004451","subitem_identifier_reg_type":"JaLC"}]},"item_3_publisher_33":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"富山大学工学部"}]},"item_3_source_id_10":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00175872","subitem_source_identifier_type":"NCID"}]},"item_3_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"03871339","subitem_source_identifier_type":"ISSN"}]},"item_3_subject_22":{"attribute_name":"国立国会図書館分類","attribute_value_mlt":[{"subitem_subject":"ZM2","subitem_subject_scheme":"NDLC"}]},"item_3_version_type_16":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松田, 秀雄"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"宮越, 隆"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"畠山, 豊正"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-02-16"}],"displaytype":"detail","filename":"Kokiyo_44_01_Page021to030.pdf","filesize":[{"value":"1.9 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"Kokiyo_44_01_Page021to030.pdf","url":"https://toyama.repo.nii.ac.jp/record/4457/files/Kokiyo_44_01_Page021to030.pdf"},"version_id":"3f7ee960-9477-4948-b18e-3fd7a38b4bb9"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"三段NANDゲート回路","subitem_subject_scheme":"Other"},{"subitem_subject":"論理設計法","subitem_subject_scheme":"Other"},{"subitem_subject":"P-N項法","subitem_subject_scheme":"Other"},{"subitem_subject":"多変数論理関数の簡単化","subitem_subject_scheme":"Other"},{"subitem_subject":"大規模回路","subitem_subject_scheme":"Other"},{"subitem_subject":"プログラム化","subitem_subject_scheme":"Other"},{"subitem_subject":"プログラム","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"三段NANDゲート回路の論理設計法について(I) : P-N項法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"三段NANDゲート回路の論理設計法について(I) : P-N項法"}]},"item_type_id":"3","owner":"3","path":["604"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-10-12"},"publish_date":"2012-10-12","publish_status":"0","recid":"4457","relation_version_is_last":true,"title":["三段NANDゲート回路の論理設計法について(I) : P-N項法"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-07-25T15:08:05.208670+00:00"}