Abstract
This work investigates how to reduce nonlinear feedback shift registers (NFSRs) in combination with bisimulation method via semi-tensor product (STP). By considering a large-scale NFSR as a smaller-scale Boolean system utilising bisimulation relations, the computing complexity of the system can be decreased. On the one hand, the properties of the bisimulation relation between two different NFSRs are examined, while on the other hand, a necessary and sufficient condition is discovered, as well as a reduction strategy utilising bisimulation. Besides, it is talked about how NFSR properties spread throughout the reduction process. The nonsingularity, driven stability and other aspects of the original NFSR are confirmed to be preserved by the reduced Boolean system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.