Abstract
In this paper, Grain-like cascade feedback shift registers (FSRs) are regarded as two Boolean networks (BNs), and the semi-tensor product (STP) of the matrices is used to convert the Grain-like cascade FSRs into an equivalent linear equation. Based on the STP, a novel method is proposed herein to investigate the nonsingularity of Grain-like cascade FSRs. First, we investigate the property of the state transition matrix of Grain-like cascade FSRs. We then propose their sufficient and necessary nonsingularity condition. Next, we regard the Grain-like cascade FSRs as Boolean control networks (BCNs) and further provide a sufficient condition of their nonsingularity. Finally, two examples are provided to illustrate the results obtained in this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
