By Topic

Factorization of discrete-process spectral matrices (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

In this correspondence, we consider factoring the spectral matrix of discrete-time systems. The factoring involves finding a matrixH(z)such thatH(z^{-1})H^T (z)equals the spectral matrix and that bothH(z)andH^{-1} (z)are stable and nonanticipatory. The purpose of this paper is to present a new method for obtaining such a spectral factorization.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 5 )