An Improved Implementation for the Recursive V-BLAST Algorithms to Save Memories and Permutation Operations

In this paper, we propose an improved implementation for the recursive V-BLAST algorithms, which saves memories and permutation operations, as the existing V-BLAST algorithm with memory saving. When the same number of transmit and receive antennas are assumed, the proposed implementation requires only half memories and saves more than twice permutation operations, with respect to the existing V-BLAST algorithm with memory saving. Moreover, as the number of receive antennas increases relative to the number of transmit antennas, the ratio between the memories required by the proposed implementation and those required by the existing V-BLAST algorithm with memory saving becomes even smaller. On the other hand, when the same number of transmit and receive antennas are assumed, the speedups of the proposed implementation over the existing V-BLAST algorithm with memory saving in the number of multiplications, additions and flops (floating-point operations) are 2.28, 1.86 and 2.18, respectively.