FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2147897801> ?p ?o ?g. }

• W2147897801 endingPage "1158" @default.
• W2147897801 startingPage "1143" @default.
• W2147897801 abstract "Motivated by the problem of test pattern generation in digital circuits, this paper presents a novel technique called recursive learning that is able to perform a logic analysis on digital circuits. By recursively calling certain learning functions, it is possible to extract all logic dependencies between signals in a circuit and to perform precise implications for a given set of value assignments. This is of fundamental importance because it represents a new solution to the Boolean satisfiability problem. Thus, what we present is a new and uniform conceptual framework for a wide range of CAD problems including, but not limited to, test pattern generation, design verification, as well as logic optimization problems. Previous test generators for combinational and sequential circuits use a decision tree to systematically explore the search space when trying to generate a test vector. Recursive learning represents an attractive alternative. Using recursive learning with sufficient depth of recursion during the test generation process guarantees that implications are performed precisely; i.e., all necessary assignments for fault detection are identified at every stage of the algorithm so that no backtracks can occur. Consequently, no decision tree is needed to guarantee the completeness of the test generation algorithm. Recursive learning is not restricted to a particular logic alphabet and can be combined with most test generators for combinational and sequential circuits. Experimental results that demonstrate the efficiency of recursive learning are compared with the conventional branch-and-bound technique for test generation in combinational circuits. In particular, redundancy identification by recursive learning is demonstrated to be much more efficient than by previously reported techniques. In an important recent development, recursive learning has been shown to provide significant progress in design verification problems. Also importantly, recursive learning-based techniques have already been shown to be useful for logic optimization. Specifically, techniques based on recursive learning have already yielded better optimized circuits than the well known MIS-II.< <ETX xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>></ETX>" @default.
• W2147897801 created "2016-06-24" @default.
• W2147897801 creator A5066184879 @default.
• W2147897801 creator A5070343644 @default.
• W2147897801 date "1994-01-01" @default.
• W2147897801 modified "2023-10-11" @default.
• W2147897801 title "Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimization" @default.
• W2147897801 cites W1976140238 @default.
• W2147897801 cites W2021492392 @default.
• W2147897801 cites W2026731014 @default.
• W2147897801 cites W2055013504 @default.
• W2147897801 cites W2105788236 @default.
• W2147897801 cites W2109821587 @default.
• W2147897801 cites W2111994103 @default.
• W2147897801 cites W2115571162 @default.
• W2147897801 cites W2119241964 @default.
• W2147897801 cites W2125714700 @default.
• W2147897801 cites W2135717797 @default.
• W2147897801 cites W2142852319 @default.
• W2147897801 cites W2149107969 @default.
• W2147897801 cites W2152406824 @default.
• W2147897801 cites W2153831980 @default.
• W2147897801 cites W2163730402 @default.
• W2147897801 cites W2167138995 @default.
• W2147897801 cites W2172010775 @default.
• W2147897801 cites W2172044541 @default.
• W2147897801 cites W4231903556 @default.
• W2147897801 cites W4238178324 @default.
• W2147897801 cites W4251370346 @default.
• W2147897801 doi "https://doi.org/10.1109/43.310903" @default.
• W2147897801 hasPublicationYear "1994" @default.
• W2147897801 type Work @default.
• W2147897801 sameAs 2147897801 @default.
• W2147897801 citedByCount "164" @default.
• W2147897801 countsByYear W21478978012012 @default.
• W2147897801 countsByYear W21478978012013 @default.
• W2147897801 countsByYear W21478978012014 @default.
• W2147897801 countsByYear W21478978012015 @default.
• W2147897801 countsByYear W21478978012016 @default.
• W2147897801 countsByYear W21478978012017 @default.
• W2147897801 countsByYear W21478978012018 @default.
• W2147897801 countsByYear W21478978012019 @default.
• W2147897801 countsByYear W21478978012020 @default.
• W2147897801 countsByYear W21478978012021 @default.
• W2147897801 countsByYear W21478978012022 @default.
• W2147897801 countsByYear W21478978012023 @default.
• W2147897801 crossrefType "journal-article" @default.
• W2147897801 hasAuthorship W2147897801A5066184879 @default.
• W2147897801 hasAuthorship W2147897801A5070343644 @default.
• W2147897801 hasConcept C11413529 @default.
• W2147897801 hasConcept C119599485 @default.
• W2147897801 hasConcept C126953365 @default.
• W2147897801 hasConcept C127413603 @default.
• W2147897801 hasConcept C131017901 @default.
• W2147897801 hasConcept C134146338 @default.
• W2147897801 hasConcept C141796577 @default.
• W2147897801 hasConcept C17626397 @default.
• W2147897801 hasConcept C187075797 @default.
• W2147897801 hasConcept C187455244 @default.
• W2147897801 hasConcept C33923547 @default.
• W2147897801 hasConcept C41008148 @default.
• W2147897801 hasConcept C80444323 @default.
• W2147897801 hasConcept C81409106 @default.
• W2147897801 hasConcept C81843906 @default.
• W2147897801 hasConceptScore W2147897801C11413529 @default.
• W2147897801 hasConceptScore W2147897801C119599485 @default.
• W2147897801 hasConceptScore W2147897801C126953365 @default.
• W2147897801 hasConceptScore W2147897801C127413603 @default.
• W2147897801 hasConceptScore W2147897801C131017901 @default.
• W2147897801 hasConceptScore W2147897801C134146338 @default.
• W2147897801 hasConceptScore W2147897801C141796577 @default.
• W2147897801 hasConceptScore W2147897801C17626397 @default.
• W2147897801 hasConceptScore W2147897801C187075797 @default.
• W2147897801 hasConceptScore W2147897801C187455244 @default.
• W2147897801 hasConceptScore W2147897801C33923547 @default.
• W2147897801 hasConceptScore W2147897801C41008148 @default.
• W2147897801 hasConceptScore W2147897801C80444323 @default.
• W2147897801 hasConceptScore W2147897801C81409106 @default.
• W2147897801 hasConceptScore W2147897801C81843906 @default.
• W2147897801 hasIssue "9" @default.
• W2147897801 hasLocation W21478978011 @default.
• W2147897801 hasOpenAccess W2147897801 @default.
• W2147897801 hasPrimaryLocation W21478978011 @default.
• W2147897801 hasRelatedWork W1952330409 @default.
• W2147897801 hasRelatedWork W1966842980 @default.
• W2147897801 hasRelatedWork W1995481531 @default.
• W2147897801 hasRelatedWork W2058953966 @default.
• W2147897801 hasRelatedWork W2112886407 @default.
• W2147897801 hasRelatedWork W2140824755 @default.
• W2147897801 hasRelatedWork W2165747555 @default.
• W2147897801 hasRelatedWork W2367779395 @default.
• W2147897801 hasRelatedWork W2541363157 @default.
• W2147897801 hasRelatedWork W2913446198 @default.
• W2147897801 hasVolume "13" @default.
• W2147897801 isParatext "false" @default.
• W2147897801 isRetracted "false" @default.
• W2147897801 magId "2147897801" @default.
• W2147897801 workType "article" @default.