Computer Science – Information Theory
Scientific paper
2011-02-13
Computer Science
Information Theory
5 Pages, 0 Figures
Scientific paper
In this paper, we present a new method for variable elimination in systems of inequations which is much faster than the Fourier-Motzkin Elimination (FME) method. In our method, a linear Diophantine problem is introduced which is dual to our original problem. The new Diophantine system is then solved, and the final result is calculated by finding the dual inequations system. Our new method uses the algorithm Normaliz to find the Hilbert basis of the solution space of the given Diophantine problem. We introduce a problem in the interference channel with multiple nodes and solve it with our new method. Next, we generalize our method to all problems involving FME and in the end we compare our method with the previous method. We show that our method has many advantages in comparison to the previous method. It does not produce many of the redundant answers of the FME method. It also solves the whole problem in one step whereas the previous method uses a step by step approach in eliminating each auxiliary variable.
Aref Mohammad Reza
Chaharsooghi Farhad Shirani
Emadi Mohammad Javad
Zamanighomi Mahdi
No associations
LandOfFree
A New Method for Variable Elimination in Systems of Inequations 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 A New Method for Variable Elimination in Systems of Inequations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Method for Variable Elimination in Systems of Inequations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-428