Wideband MIMO Channel Diagonalization in the Time Domain

View Researcher II's Other Codes

Simulation code for “Wideband MIMO Channel Diagonalization in the Time Domain” (IEEE PIMRC’11).

Disclaimer: “The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).”

Please contact us in case of a broken link from here

Authors R. Brandt, M. Bengtsson
Journal/Conference Name IEEE Int. Symp. Personal, Indoor, Mobile Radio Commun. (PIMRC'11)
Paper Category
Paper Abstract Methods for spatially diagonalizing wideband multiple-input multiple-output channels using linear finite impulse response (FIR) filters are investigated. The PSVD approach by applying the PQRD-BC algorithm for approximate singular value decomposition (SVD) of polynomial matrices is compared to the approach of performing a set of conventional SVDs in the Discrete Fourier Transform (DFT) domain, in terms of complexity and approximation error. Reduced order filters, based on the DFT-SVDs, are then obtained by optimizing the phases of the filters. Applying the phase optimized filters as linear filters then forms a benchmark on the accuracy attainable for any PSVD factorization, for the given filter length. Simulations show that the DFT-SVD method has significantly lower complexity than the PSVD by PQRD-BC, but results in higher order filters. On the other hand, the PSVD by PQRDBC yields filters which are close to being perfectly unitary for all frequencies. To achieve good performance, the reduced order filters are around one order of magnitude longer than the channel impulse response length. Therefore there is no gain in performing time domain diagonalization using a polynomial SVD, compared to using a multicarrier solution.
Date of publication 2011
Code Programming Language MATLAB

Copyright Researcher II 2022