(eng): 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.