Cart (Loading....) | Create Account
Close category search window
 

Discrete-Time Systems with the Decomposition Property

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The decomposition property, a necessary condition for linearity, is defined for discrete-time systems. N-state machines with this property have finite memory μ≤N−1. Linear and autonomous systems are important classes of systems with decomposition. Several representations of systems with decomposition are given and a general form of the discrete-time state equations for a finite-memory system with decomposition is derived. An algorithm is developed by which an arbitrary complete-sequential machine may be tested for decomposition.

Published in:

Computers, IEEE Transactions on  (Volume:C-19 ,  Issue: 5 )

Date of Publication:

May 1970

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.