Skip to Main Content
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.