J.E. Hicks

TL;DR: This article describes how various interactions in wireless ad hoc networks can be modeled as a game, which allows the analysis of existing protocols and resource management schemes, as well as the design of equilibrium-inducing mechanisms that provide incentives for individual users to behave in socially-constructive ways.

TL;DR: Applying game-theory, a convergence result similar to that of the Anigstein method is obtained, for levelable environments: arbitrarily small noise assures that the eigen-iteration almost surely converges to a neighborhood of the optimum signature set.

TL;DR: The IA problem is cast in a game-theoretic framework and is formulated as a potential game which accommodates previously proposed algorithms and gives a framework that enables the design of new distributed and convergent algorithms for IA including algorithms with nonidentical utility functions for the users.

TL;DR: An iterative joint detection technique, spatially reduced search joint detection (SRSJD), is proposed that well approximates the joint maximum likelihood (JML) receiver, while reducing its computational complexity by several orders of magnitude.

TL;DR: In this article, a method and system for array processing are described, in which a dominant signal set for each signal, which includes dominant signals that interfere with the signal, is determined, and a trellis is constructed from the dominant signal sets.