A subspace tracking algorithm for separating partially overlapping data packets

Consider a narrowband wireless scenario where a terminal equipped with an antenna array is receiving short packets of equal length sent by users from different directions and transmitted at random time points. These packets can be fully or partially overlapping in time. The partially overlapping packets, called asynchronous interferences, make the scenario nonstationary and thus need to be suppressed. Previously, we proposed a subspace intersection algorithm based on signed URV decompositions (SURV) working on block data from one time slot to solve this problem but it needs many steps. In this paper, we propose a one-step subspace tracking algorithm providing competitive performance at a much lower computational complexity like updating a QR decomposition. This algorithm makes use of the tracking ability of SURV to track the orthonormal basis and the rank of the asynchronous interference-free subspace as its principal subspace tracking version through two subspaces with positive and negative signatures.