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.
A method is provided for decoding a bit string representation of a NRZI encoded serial datastream in order to recover the original unencoded data.
English (United States)
This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately
81% of the total text.
Page 1 of 2
Fast Compact NRZI Decoding Algorithm
A method is provided for decoding a bit string representation of a NRZI
encoded serial datastream in order to recover the original unencoded data.
The bit string representation is produced by sampling the NRZI encoded
datastream once per clock interval (but out of phase with the clock) to produce a
binary output that is packed into sequential bit positions in storage. This
sampling technique is used to record the output of a data communications line or
magnetic recording device in a digitized, but unprocessed, form for later analysis
where both encoded and decoded versions of the datastream are desired.
The bit string is decoded in groups of n bits (referred to as bytes), where n is
> 0. The binary value of each byte is used as an index into one of two translation
tables to produce each decoded byte of output. Translation table A is used if the
first bit of the current byte and the last bit of the previous byte have the same
value (both are 1 or both are 0), and translation table B is used if they have
opposite values. When starting the algorithm, the value of the first previous byte
is arbitrary and the first bit of output is of no value.
Each table consists of 2/n-1/ entries of n bits each. Each table entry string
contains the decoded representation of the index byte. The first bit of each table
entry string in table A always has a value of 1, and the first bit in table B is always 0.