二维迭代逻辑

AFIPS '65 (Fall, part I) Pub Date : 1965-11-30 DOI:10.1145/1463891.1463931

Rudd H. Canaday

{"title":"二维迭代逻辑","authors":"Rudd H. Canaday","doi":"10.1145/1463891.1463931","DOIUrl":null,"url":null,"abstract":"It is well known that given a suitable Boolean function, a large number of \"gates\" or \"elements,\" each producing this function, can be interconnected in a regular structure, or \"array,\" to realize any given Boolean function. Furthermore, the structure of the array can be invariant to the function being realized.","PeriodicalId":143723,"journal":{"name":"AFIPS '65 (Fall, part I)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1965-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Two-dimensional iterative logic\",\"authors\":\"Rudd H. Canaday\",\"doi\":\"10.1145/1463891.1463931\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well known that given a suitable Boolean function, a large number of \\\"gates\\\" or \\\"elements,\\\" each producing this function, can be interconnected in a regular structure, or \\\"array,\\\" to realize any given Boolean function. Furthermore, the structure of the array can be invariant to the function being realized.\",\"PeriodicalId\":143723,\"journal\":{\"name\":\"AFIPS '65 (Fall, part I)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1965-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS '65 (Fall, part I)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1463891.1463931\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '65 (Fall, part I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1463891.1463931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

众所周知，给定一个合适的布尔函数，大量的“门”或“元素”，每个产生这个函数，可以在一个规则结构或“数组”中相互连接，以实现任何给定的布尔函数。此外，数组的结构可以对所要实现的函数保持不变。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Two-dimensional iterative logic

It is well known that given a suitable Boolean function, a large number of "gates" or "elements," each producing this function, can be interconnected in a regular structure, or "array," to realize any given Boolean function. Furthermore, the structure of the array can be invariant to the function being realized.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

AFIPS '65 (Fall, part I)

自引率

0.00%

发文量