The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
This algorithm is useful for assigning to each block, in a logic design a value equal to its "distance" from a primary input. The code is broken down into five basic steps:
English (United States)
This text was extracted from a PDF file.
This is the abbreviated version, containing approximately
70% of the total text.
Page 1 of 1
Levelization Algorithm For Logic Designs
This algorithm is useful for assigning to each block, in a logic design a value
equal to its "distance" from a primary input. The code is broken down into five
Step 1 initializes the variables used in the program. blocks and assigns them
to the current left level. (The i-th block has no come-froms if the i-th column of
the GTM is all zeroes.) This step is executed repeatedly, incrementing the left
level value each time, until there are either no blocks left to be levelized, or only
blocks with come-froms are left, i.e., blocks involved in feedback loops. In the
first case (no blocks left), the step branches out to step 5 to adjust the level
vector. In the second case, it branches to step 3.
Step 3 removes from the GTM all blocks with no go-to blocks and assigns
them to the current right level. (The i-th block has no go-tos if the i-th row of the
GTM is all zeroes.) This step is executed repeatedly, decrementing the right
level value each time, until the only blocks left are those with come-froms and/or
go-tos, i.e., blocks involved in feedback loops. When this condition is met, a
branch is done to the step 4 (to cut the feedback loop).
Step 4 cuts the feedback loop by setting to zero the row of the GTM
corresponding to the block which has the fewest outputs. Then the code
branches back to step 2 to process the modified GTM.
Step 5 adjusts the output level vector so that the level values form a set of