Methods and systems for determining characteristics of a sequence of n-state symbols
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Mar 29, 2016
Grant Date -
Jan 30, 2014
app pub date -
Mar 14, 2013
filing date -
Jul 24, 2012
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
Maximum length properties of n-state sequences of n-state symbols with n=2 or n>2 are tested. Checkwords are generated from p consecutive n-state symbols in a sequence of n-state symbols which may overlap by (p−1) n-state symbols. If a sequence has np−1 n-state symbols in which 2 consecutive checkwords overlap in (p−1) n-state symbols and each checkword formed in the extended sequence is unique, then the sequence is a maximum length n-state sequence. An n-state feedback shift register based sequence generator with p n-state register elements is tested on the content of the shift register for np−1 cycles. If the shift register content is not repeated the sequence is maximum length. Generation of a sequence is stopped when the content repeats. Non-reversible n-state inverters and non-reversible n-state logic functions are applied to generate n-state sequences.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully