Synthesis of Binary Machines
2011 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 57, no 10, 6890-6893 p.Article in journal (Refereed) Published
The problem of constructing a binary machine with the minimum number of stages generating a given binary sequence is addressed. Binary machines are a generalization of nonlinear feedback shift registers (NLFSRs) in which both connections, feedback and feedforward, are allowed and no chain connection between the register stages is required. An algorithm for constructing a shortest binary machine generating a given periodic binary sequence is presented.
Place, publisher, year, edition, pages
2011. Vol. 57, no 10, 6890-6893 p.
Feedback shift register (FSR), nonlinear complexity, sequences
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-45588DOI: 10.1109/TIT.2011.2149495ISI: 000295739000041ScopusID: 2-s2.0-80053958871OAI: oai:DiVA.org:kth-45588DiVA: diva2:454271
FunderSwedish Research Council, 621-2010-4388
QC 201111072011-11-072011-10-312011-11-07Bibliographically approved