Abstract
Row reduced representations of behaviors over fields posses a number of useful properties. Perhaps the most important feature is the predictable degree property. This property allows a finite parametrization of the module generated by the rows of the row reduced matrix with prior computable bounds. In this paper we study row-reducedness of representations of behaviors over rings of the form $\mathbb{Z}_{p^r}$, where $p$ is a prime number. Using a restricted calculus within $\mathbb{Z}_{p^r}$ we derive a meaningful and computable notion of row-reducedness.
Original language | Undefined |
---|---|
Title of host publication | Proceedings of the 46th IEEE Conference on Decision and Control |
Place of Publication | United States |
Publisher | IEEE |
Pages | 470-475 |
Number of pages | 6 |
ISBN (Print) | 1-4244-1498-9 |
DOIs | |
Publication status | Published - 2007 |
Event | 46th IEEE Conference on Decision and Control, CDC 2007 - Hilton New Orleans Riverside, New Orleans, United States Duration: 12 Dec 2007 → 14 Dec 2007 Conference number: 46 |
Publication series
Name | |
---|---|
Publisher | IEEE |
Number | 7 |
ISSN (Print) | 0024-3795 |
ISSN (Electronic) | 1873-1856 |
Conference
Conference | 46th IEEE Conference on Decision and Control, CDC 2007 |
---|---|
Abbreviated title | CDC |
Country/Territory | United States |
City | New Orleans |
Period | 12/12/07 → 14/12/07 |
Keywords
- Linear systems
- finite rings
- polynomial matrices
- kernel representations
- METIS-245955
- row reduced
- EWI-11750
- IR-64588
- Behaviors
- predictable degree property