A new approach to functional decomposition

LDR 03676cam a2200481Ii 4500
001 102198295
003 MiAaHDL
005 20241229000000.0
006 m d
007 cr bn ---auaua
008 090605e197012 maua bt f000 0 eng d
035 ⊔ ⊔ ‡a(MiU)990157501700106381
035 ⊔ ⊔ ‡asdr-miu.990157501700106381
035 ⊔ ⊔ ‡z(MiU)MIU01000000000000015750170-goog
035 ⊔ ⊔ ‡a(OCoLC)370735684
035 ⊔ ⊔ ‡z(MiU)Aleph015750170
040 ⊔ ⊔ ‡aLHL ‡beng ‡cLHL ‡dFUG ‡dOCLCF ‡dOCLCQ ‡dCOD ‡dTRAAL
049 ⊔ ⊔ ‡aMAIN
086 0 ⊔ ‡aD 301.45/42:113
088 ⊔ ⊔ ‡aAD 0883164
088 ⊔ ⊔ ‡aAFCRL 71-10
100 1 ⊔ ‡aSmall, Albert W.
245 1 2 ‡aA new approach to functional decomposition / ‡cAlbert W. Small.
264 ⊔ 1 ‡aL.G. Hanscom Field, Bedford, Massachusetts : ‡bAir Force Cambridge Research Laboratories, Air Force Systems Command, United States Air Force, ‡c1970.
300 ⊔ ⊔ ‡aviii, 84 pages : ‡billustrations ; ‡c28 cm.
336 ⊔ ⊔ ‡atext ‡btxt ‡2rdacontent
337 ⊔ ⊔ ‡aunmediated ‡bn ‡2rdamedia
338 ⊔ ⊔ ‡avolume ‡bnc ‡2rdacarrier
490 0 ⊔ ‡aAFCRL ; ‡v71-10
490 0 ⊔ ‡aSpecial Reports ; ‡vNo. 113
500 ⊔ ⊔ ‡aResearch supported by the Air Force Cambridge Research Laboratories, Air Force Systems Command, United States Air Force, L.G. Hanscom Field, Bedford, Massachusetts.
500 ⊔ ⊔ ‡aData Sciences Laboratory Project 5632.
500 ⊔ ⊔ ‡aAD0883164 (from http://www.dtic.mil).
500 ⊔ ⊔ ‡a"28 December 1970."
504 ⊔ ⊔ ‡aIncludes bibliographical references (pages 63-64).
520 ⊔ ⊔ ‡aDigital logic circuits are the heart of all signal-processing and information-handling systems in the Air Force. Therefore, the efficient synthesis of digital logic circuits is important to the Air Force. Functional decomposition provides a basic approach to the problem of synthesizing digital logic circuits. The purpose of this study is to provide new insight into the decomposition of combinational logic functions. First, intuitive characterizations are developed that classify logic-functions according to the information they pass. Then, a decomposition problem is presented in which one must synthesize a logic-function using information from the outputs of several given logic-circuits. The goal is to minimize interconnections in the resulting network by appropriate processing at the outputs of the given circuits. To attack this problem the author introduces a partition-quotient operation that can be used to specify the unique information which each of the given circuits must supply. If the collection of given circuits is logically independent, then supplying the unique information guarantees the supply of all necessary information. If the collection is not logically independent, its circuits can be grouped so that the collection of groups is logically independent. The problem is thereby divided into smaller independent problems.
538 ⊔ ⊔ ‡aMode of access: Internet.
650 ⊔ 7 ‡aLogic, Symbolic and mathematical. ‡2fast ‡0http://id.worldcat.org/fast/1002068
650 ⊔ 7 ‡aLogic circuits ‡xMathematical models. ‡2fast ‡0http://id.worldcat.org/fast/1002041
650 ⊔ 7 ‡aInformation theory. ‡2fast ‡0http://id.worldcat.org/fast/973149
650 ⊔ 0 ‡aInformation theory. ‡0http://id.loc.gov/authorities/subjects/sh85066289
650 ⊔ 0 ‡aLogic, Symbolic and mathematical. ‡0http://id.loc.gov/authorities/subjects/sh85078115
650 ⊔ 0 ‡aLogic circuits ‡xMathematical models.
710 2 ⊔ ‡aAir Force Cambridge Research Laboratories (U.S.) ‡0http://id.loc.gov/authorities/names/n81133515 ‡1http://id.loc.gov/rwo/agents/n81133515
730 0 ⊔ ‡aTechnical Report Archive & Image Library (TRAIL)
899 ⊔ ⊔ ‡a39015095134451
CID ⊔ ⊔ ‡a102198295
DAT 0 ⊔ ‡a20241217223021.0 ‡b20241229000000.0
DAT 1 ⊔ ‡a20250103235348.0 ‡b2025-01-04T17:32:55Z
DAT 2 ⊔ ‡a2024-05-06T17:30:02Z
CAT ⊔ ⊔ ‡aSDR-MIU ‡cmiu ‡dALMA ‡lprepare.pl-004-009
FMT ⊔ ⊔ ‡aBK
HOL ⊔ ⊔ ‡0sdr-miu.990157501700106381 ‡aMiU ‡bSDR ‡cGWLA ‡f015750170 ‡pmdp.39015095134451 ‡sMIU ‡1990157501700106381
974 ⊔ ⊔ ‡bMIU ‡cGWLA ‡d20250104 ‡sgoogle ‡umdp.39015095134451 ‡y1970 ‡rpd ‡qbib ‡tUS fed doc