From GADIA to Pairwise Synchronous Algorithm for 2-Channel Case

The fully distributed and asynchronous interference reduction algorithm GADIA developed by B. Babadi and V. Tarokh [1] is a very powerful and effective algorithm. It has been the source of various other asynchronous distributed interference reduction algorithms. Due to the time varying channel gains, the convergence speed in all these asynchronous algorithms plays an important role. In this paper, we turn the asynchronous GADIA algorithm into a pairwise synchronous dynamic system in order to improve the convergence speed, and propose a two-node synchronous system. We analyze the proposed system from a mathematical perspective using the results in [5]. Wireless systems simulations show that the proposed pairwise synchronous algorithm (PSA) remarkably increases the convergence speed at the expense of some extra signal exchanges between nodes and at the expense of a probability of a slight performance deterioration as compared to the fully asynchronous GADIA algorithm.