An Improved Recursive Algorithm for V-BLAST to Save Memories without Sacrificing Speed

TL;DR

This paper introduces an improved recursive algorithm for V-BLAST that significantly reduces memory usage while maintaining high speed, achieving a 1.86 times speedup and halving memory requirements compared to previous methods.

Contribution

The paper presents a novel recursive algorithm for V-BLAST that saves memory without sacrificing computational speed, improving upon existing algorithms with minimal complexity increase.

Findings

Achieves 1.86x speedup over previous algorithms.

Halves memory usage compared to the least-memory recursive algorithm.

Maintains computational speed while reducing memory requirements.

Abstract

For vertical Bell Laboratories layered space-time architecture (V-BLAST), the original fast recursive algorithm was proposed, and then several improvements were proposed successively to further reduce the computational complexity. The improvements include the inverse of a partitioned matrix and the interference cancellation scheme adopted by the know recursive algorithm with the least computations, while the former is applied to improve the latter into an interference cancellation scheme with memory saving in this paper. The corresponding recursive algorithm proposed by us saves memories without sacrificing speed compared to the know recursive algorithm with the least computations, while it achieves the speedup of 1.86 and saves about half memories compared to the know recursive algorithm with the least memories.