Title :
An efficient algorithm for minimal partial realization of matrix sequences
Author_Institution :
Dept. of Knowledge-Based Inf. Eng., Toyohashi Univ. of Technol., Japan
Abstract :
An efficient algorithm for minimal partial realization of matrix sequences is presented. It is more efficient than any similar known algorithm based on matrix computations. At each iteration, one can update each current solution vector by a simple three-term recurrence instead of by a nonexplicit linear combination of auxiliary vectors. The proposed algorithm is a refinement of the Dickinson-Morf-Kailath algorithm (1974)
Keywords :
matrix algebra; polynomials; Dickinson-Morf-Kailath algorithm; matrix sequences; minimal partial realization; three-term recurrence; Computer aided instruction; Decoding; Difference equations; Linear feedback shift registers; Polynomials; Table lookup; Transforms; Vectors;
Conference_Titel :
Systems Engineering, 1992., IEEE International Conference on
Conference_Location :
Kobe
Print_ISBN :
0-7803-0734-8
DOI :
10.1109/ICSYSE.1992.236933
