An Algorithm for Constructing a Minimal Register with Non-Linear Update Generating a Given Sequence
2014 (English)In: Proceedings of 2014 IEEE 44th International Symposium on Multiple-Valued Logic (ISMVL), 2014, 254-259 p.Conference paper (Refereed)
Registers with Non-Linear Update (RNLUs) are a generalization of Non-Linear Feedback Shift Registers (NLFSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the stages is required. An RNLU can be used to generate any given 2p-ary sequence, p ≥ 1. In this paper, a new algorithm for constructing RNLUs is presented. Expected size of RNLUs constructed by the presented algorithm is proved to be asymptotically smaller than the expected size of RNLUs constructed by previous algorithms generating the same sequence. The presented algorithm can potentially be useful for applications such as testing, wireless communications, and cryptography.
Place, publisher, year, edition, pages
2014. 254-259 p.
Research subject Computer Science
IdentifiersURN: urn:nbn:se:kth:diva-165459DOI: 10.1109/ISMVL.2014.52ISI: 000361020700043ScopusID: 2-s2.0-84904460383OAI: oai:DiVA.org:kth-165459DiVA: diva2:808482
44th International Symposium on Multiple-Valued Logic (ISMVL)
QC 201505082015-04-282015-04-282015-10-05Bibliographically approved