Boolean Processor
a processor and boolean technology, applied in the field of computing and microelectronics, can solve the problems of inefficiency associated with the processing of dnf equivalents of cnf expressions, large control operation, etc., and achieve the effects of enhancing computing performance, optimizing performance for computing complex boolean expressions, and building for speed and efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Benefits of technology
Problems solved by technology
Method used
Image
Examples
example 1
[0064]If (Dev1=8 or Dev2=0) and (Dev3=10 or Dev2=0) and (Dev4=1 or Dev2=0) then Dev9=20
Micro-codeSequence #Instruction Register ValueOperation100000001 00001000 001OR200000010 00000000 001OR300000000 00000000 000AND400000011 00001010 001OR500000010 00000000 001OR600000000 00000000 000AND700000100 00000001 001OR800000010 00000000 001OR900000000 00000000 000AND1000001001 00010100 010End of Operation
example 2
[0065]If Dev7=22 goto 200
Else goto 100
SequenceMicro-code#Instruction Register ValueOperation100000111 00010110 001OR200000000 00000000 000AND300000000 11001000 101Conditional Jump400000000 01100100 100Unconditional Jump
[0066]A distinct characteristic of the Boolean processor 36 is the type of expressions it is designed to evaluate; namely expressions in CNF. Optionally, using the same single-bit register design, a DNF-based architecture can also be implemented. However, the architecture of the Boolean processor 36 focuses on CNF, providing the fastest and most scalable design.
[0067]Upon initial inspection of the two forms, CNF and DNF, an individual might be inclined to believe that the short-circuit evaluation of DNF expressions has benefits over short-circuited CNF expressions because the terms are OR'ed together and a positive result for any of the terms results in a completed evaluation. The same argument, in the false case, can be made for CNF evaluations. If any of the terms r...
example 3
Conjunctive Normal Form
[0068]If Dev2=0 and (Dev1=8 or Dev3=10 or Dev4=1) then Dev9=20
Micro-codeSequence #Instruction Register ValueOperation100000010 00000000 000AND200000001 00001000 001OR300000011 00001010 001OR400000100 00000001 001OR500001001 00010100 010End of Operation
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com