By Topic

Blind synchronization in asynchronous multiuser packet networks using KMA

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
$33 $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)
R. Djapic ; Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands ; A. -J. van der Veen

In a system with multiple (interfering) users transmitting data packets asynchronously, we consider separating the user of interest by blind beamforming. The transmitter gives the signal a unique "color code" by modulating the power of each symbol, in a pattern known to the receiver. The beamformer can then be computed using CMA-like algorithms. In this paper, we consider the associated synchronization problem: the receiver does not know when a packet will arrive and has to detect the onset of a packet. We propose an extension of the algebraic known modulus algorithm (AKMA) to take this problem into account.

Published in:

Signal Processing Advances in Wireless Communications, 2003. SPAWC 2003. 4th IEEE Workshop on

Date of Conference:

15-18 June 2003