By Topic

A subspace tracking algorithm for separating partially overlapping data packets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mu Zhou ; Dept. of Electr. Eng., Delft Univ. of Technol., Delft, Netherlands ; van der Veen, A.

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.

Published in:

Sensor Array and Multichannel Signal Processing Workshop (SAM), 2012 IEEE 7th

Date of Conference:

17-20 June 2012