{"id":{"repo_id":"ottawa-retro","oai_identifier":"oai:ruor.uottawa.ca:10393/10944"},"canonical_url":"https://search.dev.ndltd.org/etd/ottawa-retro/oai:ruor.uottawa.ca:10393/10944","repository":{"repo_id":"ottawa-retro","name":"University of Ottawa","base_url":"https://ruor.uottawa.ca/server/oai/request"},"display":{"title":"Analysis and synthesis of linear sequential machines.","abstract":"The material presented in this thesis can be divided into three major topics: Controllability and observability of linear sequential machines, where these principles are presented from the point of view of cyclic subspaces. Such an approach as it pertains to the direct-sum of the state space enables us to extend current results to cases other than the single input and non-derogatory state transition matrix and develop synthesis algorithms for a controllable and/or observable linear sequential machine. Minimality of a linear sequential machine, where these principles are presented from the observability point of view. This approach enables us to develop quick tests for minimality and introduce a different minimization algorithm having definite advantages when dealing with very large machines. This approach then leads us in a natural way to the consideration of minimality where the input sequence length is finite and/or the set of starting states is a subset of the set of states. Shift register synthesis of a linear sequential machine. Our first approach develops an algorithm which yields both parallel and/or serial shift register realizations by mathematically operating upon the characterizing matrices. A generalized synthesis module giving the illusion of variable hardware is presented next. Finally shift register realizations are obtained from the transfer function definition or sets of input/output sequence pairs where the length of the input sequence is finite and starting state restrictions exist.","abstract_html":"The material presented in this thesis can be divided into three major topics: Controllability and observability of linear sequential machines, where these principles are presented from the point of view of cyclic subspaces. Such an approach as it pertains to the direct-sum of the state space enables us to extend current results to cases other than the single input and non-derogatory state transition matrix and develop synthesis algorithms for a controllable and/or observable linear sequential machine. Minimality of a linear sequential machine, where these principles are presented from the observability point of view. This approach enables us to develop quick tests for minimality and introduce a different minimization algorithm having definite advantages when dealing with very large machines. This approach then leads us in a natural way to the consideration of minimality where the input sequence length is finite and/or the set of starting states is a subset of the set of states. Shift register synthesis of a linear sequential machine. Our first approach develops an algorithm which yields both parallel and/or serial shift register realizations by mathematically operating upon the characterizing matrices. A generalized synthesis module giving the illusion of variable hardware is presented next. Finally shift register realizations are obtained from the transfer function definition or sets of input/output sequence pairs where the length of the input sequence is finite and starting state restrictions exist.","abstract_has_math":false,"creators":["Farley, J. W. Jacques."],"institution":"University of Ottawa (Canada)","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-04-17T16:04:29Z","date_published":"2009-04-17T16:04:29Z","updated_at":"2026-07-24T03:39:16Z","subjects":["Engineering, Electronics and Electrical."],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4697.","http://dx.doi.org/10.20381/ruor-17084"],"render_values":[{"text":"Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4697.","href":null,"code":true},{"text":"http://dx.doi.org/10.20381/ruor-17084","href":"http://dx.doi.org/10.20381/ruor-17084","code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10393/10944","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Farley, J. W. Jacques."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2009-04-17T16:04:29Z","1977"]},{"key":"dc:publisher","label":"Institution","values":["University of Ottawa (Canada)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4697.","http://hdl.handle.net/10393/10944","http://dx.doi.org/10.20381/ruor-17084"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The material presented in this thesis can be divided into three major topics: Controllability and observability of linear sequential machines, where these principles are presented from the point of view of cyclic subspaces. Such an approach as it pertains to the direct-sum of the state space enables us to extend current results to cases other than the single input and non-derogatory state transition matrix and develop synthesis algorithms for a controllable and/or observable linear sequential machine. Minimality of a linear sequential machine, where these principles are presented from the observability point of view. This approach enables us to develop quick tests for minimality and introduce a different minimization algorithm having definite advantages when dealing with very large machines. This approach then leads us in a natural way to the consideration of minimality where the input sequence length is finite and/or the set of starting states is a subset of the set of states. Shift register synthesis of a linear sequential machine. Our first approach develops an algorithm which yields both parallel and/or serial shift register realizations by mathematically operating upon the characterizing matrices. A generalized synthesis module giving the illusion of variable hardware is presented next. Finally shift register realizations are obtained from the transfer function definition or sets of input/output sequence pairs where the length of the input sequence is finite and starting state restrictions exist."]},{"key":"dc:format","label":"Dc Format","values":["189 p.","application/pdf"]},{"key":"dc:title","label":"Title","values":["Analysis and synthesis of linear sequential machines."]}]}],"canonical_facts":{"dc:creator":["Farley, J. W. Jacques."],"dc:date":["2009-04-17T16:04:29Z","1977"],"dc:description":["The material presented in this thesis can be divided into three major topics: Controllability and observability of linear sequential machines, where these principles are presented from the point of view of cyclic subspaces. Such an approach as it pertains to the direct-sum of the state space enables us to extend current results to cases other than the single input and non-derogatory state transition matrix and develop synthesis algorithms for a controllable and/or observable linear sequential machine. Minimality of a linear sequential machine, where these principles are presented from the observability point of view. This approach enables us to develop quick tests for minimality and introduce a different minimization algorithm having definite advantages when dealing with very large machines. This approach then leads us in a natural way to the consideration of minimality where the input sequence length is finite and/or the set of starting states is a subset of the set of states. Shift register synthesis of a linear sequential machine. Our first approach develops an algorithm which yields both parallel and/or serial shift register realizations by mathematically operating upon the characterizing matrices. A generalized synthesis module giving the illusion of variable hardware is presented next. Finally shift register realizations are obtained from the transfer function definition or sets of input/output sequence pairs where the length of the input sequence is finite and starting state restrictions exist."],"dc:format":["189 p.","application/pdf"],"dc:identifier":["Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4697.","http://hdl.handle.net/10393/10944","http://dx.doi.org/10.20381/ruor-17084"],"dc:publisher":["University of Ottawa (Canada)"],"dc:subject":["Engineering, Electronics and Electrical."],"dc:title":["Analysis and synthesis of linear sequential machines."],"dc:type":["Thesis"]},"updated_at":"2026-07-24T03:39:16Z"}