QR decomposition of Laurent polynomial matrices sampled on the unit circle

Authors:
Davide Cescato;Helmut Bölcskei
Affiliations:
Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland;Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 0

Matrix analysis

Matrix analysis
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
An efficient square-root algorithm for BLAST

ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02
Introduction to Space-Time Wireless Communications

Introduction to Space-Time Wireless Communications
Algorithms for Interpolation-Based QR Decomposition in MIMO-OFDM Systems

IEEE Transactions on Signal Processing
Precoding in multiantenna and multiuser communications

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	754.84

Visualization

Abstract

We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, in general, are neither LP nor rational matrices. In this paper, we present an invertible mapping that transforms Q(s) and R(s) into LP matrices. Furthermore, we show that, given QR factors of sufficiently many samples of A(s), it is possible to obtain QR factors of additional samples of A(s) through application of this mapping followed by interpolation and inversion of the mapping. The results of this paper find applications in the context of signal processing for multiple-input multiple-output (MIMO) wireless communication systems that employ orthogonal frequency-division multiplexing (OFDM).