An iterative scheme for decoding asynchronous users on a multi-user adder channel is presented. In each iteration step, one user's a posteriori symbol probabilities are computed. The contribution of that user to the sum signal is partially cancelled such that the residual noise is minimized. Simulations show that two rate-2/3 users of a noiseless binary adder channel can be separated by a 4-state code.
No takes yet. Share an insight, caveat, or question.
F. Tarkoy (2002) studied this question.