Use of upper triangular matrix tracking for complexity reduction in a linear ZF MIMO system

  • Authors:

  • Ravi Narayan Panda;Sasmita Kumari Padhy;Siba Prasada Panigrahi

  • Affiliations:

  • Nalanda Institute of Technology, Bhubaneswar, Orissa, India;ITER, SOA University, Bhubaneswar, Orissa, India;GITA, Bhubaneswar, Orissa, India

  • Venue:
  • Signal Processing
  • Year:
  • 2013

Quantified Score

Hi-index 0.08

Visualization

Abstract

This paper addresses the complexity problem associated with the QR decomposition algorithm, which is frequently used as a faster alternative to channel inversion in a MIMO scheme. Channel tracking can be employed with QR equalization in order to reduce the pilot overhead of a MIMO system in a non-stationary environment. QR decomposition is part of the QR equalization method and has to be performed in every instance that the channel estimate is obtained. The high rate of the QR decomposition, a computationally intensive technique, results in a high computational complexity per symbol. Some novel modifications are proposed to address this problem. Reducing the repetition rate of QR decompositions and tracking R (the upper triangular matrix) directly, while holding unitary matrix Q fixed, can significantly reduce complexity per symbol at the expense of some introduced error.