By Topic

Sorted spectral factorization of matrix polynomials in MIMO communications

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)
Fischer, R.F.H. ; Lehrstuhl fur Inf.subertragung, Univ. Erlangen-Nurnberg, Erlangen, Germany

Sorted spectral factorization of matrix polynomials is studied. Such type of factoring Hermitian matrix polynomials is the key step in calculating the optimum receive filter matrices in spatial/temporal decision-feedback equalization as well as the optimum transmit filter matrices in spatial/temporal Tomlinson-Harashima-type precoding schemes. Contrary to other approaches, we inherently consider asymptotic rather than finite-length results for transmission over MIMO channels with intersymbol interference. It is shown how the different types of factorizations can be transformed onto a prototype factorization task, which in turn can be solved by first performing an unsorted factorization and then determining the optimal processing order. An easy-to-use iterative algorithm for unsorted spectral factorization and the adjustment of the optimized order in DFE and precoding are explained. Numerical simulations cover the impact of sorted and unsorted spectral factorization on the performance of DFE and precoding schemes.

Published in:

Communications, IEEE Transactions on  (Volume:53 ,  Issue: 6 )