ICA in boolean XOR mixtures

Abstract

We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean "Exclusive Or" (XOR) operation. Thus, each mixture-signal is given by the XOR of one or more of the source-signals. While such mixtures can be considered linear transformations over the finite Galois Field of order 2, they are certainly nonlinear over the field of real-valued numbers, so classical ICA principles may be inapplicable in this framework. Nevertheless, we show that if none of the independent random sources is uniform (i.e., neither one has probability 0.5 for 1/0), then any invertible mixing is identifiable (up to permutation ambiguity). We then propose a practical deflation algorithm for source separation based on entropy minimization, and present empirical performance results by simulation. © Springer-Verlag Berlin Heidelberg 2007.