Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables
We develop an algorithm for solving a linear diophantine equation with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction, and first finds short vectors satisfying the diophantine equation. The next step is to branch on linear combi- nations of these vectors, which either yields a vector that satisfies the bound constraints or provides a proof that no such vector exists. The research was motivated by the need for solving constrained linear dio- phantine equations as subproblems when designing integrated circuits for video signal processing. Our algorithm is tested with good result on real-life data.
Unable to display preview. Download preview PDF.
- 1.K. Aardal, A. K. Lenstra, and C. A. J. Hurkens. An algorithm for solving a diophantine equation with upper and lower bounds on the variables. Report UU-CS-97-40, Department of Computer Science, Utrecht University, 1997. ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1997/
- 4.G. Cornuéjols, R. Urbaniak, R. Weismantel, and L. Wolsey. Decomposition of integer programs and of generating sets. In R. Burkard and G. Woeginger, editors, Algorithms — ESA’ 97, LNCS, Vol. 1284, pages 92–103. Springer-Verlag, 1997.Google Scholar
- 6.CPLEX Optimization Inc. Using the CPLEX Callable Library, 1989.Google Scholar
- 7.B. de Fluiter. A Complexity Catalogue of High-Level Synthesis Problems. Master’s thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1993.Google Scholar
- 8.G. Havas, B. S. Majewski, and K. R. Matthews. Extended gcd and Hermite normal form algorithms via lattice basis reduction. Working paper, Department of Mathematics, The University of Queensland, Australia, 1996.Google Scholar
- 12.LiDIA — A library for computational number theory. TH Darmstadt / Universität des Saarlandes, Fachbereich Informatik, Institut für Theoretische Informatik. http://www.informatik.th-darmstadt.de/pub/TI/LiDIA
- 16.C. P. Schnorr and H. H. Hörner. Attacking the Chor-Rivest Cryptosystem by improved lattice reduction. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology — EUROCRYPT’ 95, LNCS, Vol. 921, pages 1–12. Springer Verlag, 1995.Google Scholar
- 17.W. F. J. Verhaegh, P. E. R. Lippens, E. H. L. Aarts, J. H. M. Korst, J. L. van Meerbergen, and A. van der Werf. Modeling periodicity by PHIDEO steams. Proceedings of the Sixth International Workshop on High-Level Synthesis, pages 256–266. ACM/SIGDA, IEEE/DATC, 1992.Google Scholar