Title :
Strongly autonomous behaviors over finite rings
Author_Institution :
RWTH Aachen Univ., Aachen, Germany
fDate :
June 29 2009-July 1 2009
Abstract :
We give a new characterization of strong autonomy of linear shift-invariant multidimensional behaviors over finite rings. Unlike earlier descriptions of the concept, the new notion coincides directly with known results on past-determinedness when applied to the special case of one-dimensional systems of this type. This is a first step towards formulating a well-posed initial value problem for systems of partial difference equations over finite rings, a question of interest from the point of view of convolutional coding theory.
Keywords :
convolutional codes; deterministic algorithms; finite automata; initial value problems; invariance; partial differential equations; polynomial matrices; convolutional coding theory; finite rings; initial value problem; linear shift-invariant; partial differential equation; past determinedness; strong autonomous behavior; Convolutional codes; Difference equations; Kernel; Modules (abstract algebra); Multidimensional systems; Polynomials;
Conference_Titel :
Multidimensional (nD) Systems, 2009. nDS 2009. International Workshop on
Conference_Location :
Thessaloniki
Print_ISBN :
978-1-4244-2797-0
Electronic_ISBN :
978-1-4244-2798-7
DOI :
10.1109/NDS.2009.5191688