Original title: Modular shift of a polynomial matrix using Matlab
Authors: Hurák, Zdeněk ; Šebek, Michael
Document type: Papers
Conference/Event: MATLAB 2002, Praha (CZ), 2002-11-07
Year: 2002
Language: eng
Abstract: Efficient algorithm for modular shift of a polynomial matrix is proposed in this note.The algorithm avoids any iteration that is inherent in standard Euclidean algorithm for division of polynomial matrices.It assumes that the denominator polynomial matrix is row-reduced.If it is not,it can always be transformed into row-reduced form accepting some additional computational cost. Numerical experiments with an implementation of the proposed algorithm in Matlab are reported.
Keywords: modular arithmetics; polynomial matrix; shift
Project no.: CEZ:AV0Z1075907 (CEP), GA102/02/0709 (CEP)
Funding provider: GA ČR
Host item entry: MATLAB 2002. Sborník příspěvků 10. ročníku konference

Institution: Institute of Information Theory and Automation AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0131028

Permalink: http://www.nusl.cz/ntk/nusl-34943


The record appears in these collections:
Research > Institutes ASCR > Institute of Information Theory and Automation
Conference materials > Papers
 Record created 2011-07-01, last modified 2024-01-26


No fulltext
  • Export as DC, NUŠL, RIS
  • Share