A lattice-based minimal partial realization algorithm for matrix sequences of varying length

作者：Wang Li Ping^*

来源：Cryptography and Communications, 2011, 3(1): 29-42.

DOI：10.1007/s12095-010-0037-8

• Minimal partial realization
• Linear feedback register synthesis
• Linear complexity
• Joint linear complexity
• Linear system theory

In this paper we first extend a minimal partial realization algorithm from vector sequences to matrix sequences of equal length by means of a lattice basis reduction algorithm over polynomial rings. We also give all minimal partial realizations for such matrix sequences and a sufficient and necessary condition for the uniqueness issue. Then we improve the above algorithm to solve the minimal partial realization problem for matrix sequences of varying length.

• 出版日期2011-3
• 单位清华大学