Computer Science – Information Theory
Scientific paper
2010-07-13
Computer Science
Information Theory
Scientific paper
We consider the framework of Independent Component Analysis (ICA) for the case where the independent sources and their linear mixtures all reside in a Galois field of prime order P. Similarities and differences from the classical ICA framework (over the Real field) are explored. We show that a necessary and sufficient identifiability condition is that none of the sources should have a Uniform distribution. We also show that pairwise independence of the mixtures implies their full mutual independence (namely a non-mixing condition) in the binary (P=2) and ternary (P=3) cases, but not necessarily in higher order (P>3) cases. We propose two different iterative separation (or identification) algorithms: One is based on sequential identification of the smallest-entropy linear combinations of the mixtures, and is shown to be equivariant with respect to the mixing matrix; The other is based on sequential minimization of the pairwise mutual information measures. We provide some basic performance analysis for the binary (P=2) case, supplemented by simulation results for higher orders, demonstrating advantages and disadvantages of the proposed separation approaches.
No associations
LandOfFree
Independent Component Analysis Over Galois Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Independent Component Analysis Over Galois Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Independent Component Analysis Over Galois Fields will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-350668