Binary machines are a generalization of Feedback Shift Registers (FSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the register stages is required. In this paper, we present an algorithm for synthesis of binary machines with the minimum number of stages for a given degree of parallelization. Our experimental results show that for sequences with high linear complexity such as complementary, Legendre, or truly random, parallel binary machines are an order of magnitude smaller than parallel FSRs generating the same sequence. The presented approach can potentially be of advantage for many applications including wireless communication, cryptography, and testing.
In was shown in REF that, for random sequences, parallel binary machines can be an order of magnitude smaller than parallel LFSRs or NLFSRs generating the same sequence.
Synthesis of parallel binary machines
2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
Computer Science Mathematics