Algorithms and Techniques for Polynomial Matrix Decompositions (2008)
Abstract / truncated to 115 words
The concept of polynomial matrices is introduced and the potential application of polynomial matrix decompositions is discussed within the general context of multi-channel digital signal processing. A recently developed technique, known as the second order sequential rotation algorithm (SBR2), for performing the eigenvalue decomposition of a para-Hermitian polynomial matrix (PEVD) is presented. The potential benefit of using the SBR2 algorithm to impose strong decorrelation on the signals received by a broadband sensor array is demonstrated by means of a suitable numerical simulation. This demonstrates how the polynomial matrices produced as a result of the PEVD can be of unnecessarily high order. This is undesirable for many practical applications and slows down the iterative computational procedure. ...
polynomial matrix – polynomial matrix qr decomposition – polynomial matrix eigenvalue decomposition – polynomial matrix singular value decomposition – paraunitary matrix – broadband mimo channel equalisation
Information
- Author
- Foster, Joanne
- Institution
- Cardiff University
- Supervisors
- Publication Year
- 2008
- Upload Date
- Dec. 15, 2008
The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.
The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.