Abstract
Given a sequence of integers, what is the smallest number of additions and shifts needed to compute all integers starting with 1? This is a generalization of the addition-sequence problem which naturally appears in the multiplication of constants with a single variable and in its hardware implementation, and it will be called the addition-shift sequence problem. As a fundamental result on computational complexity, we show that the addition-shift-sequence problem is NP-complete. Then, we show lower and upper bounds of the number of operations for some particular sequence, where some techniques specific to our model are demonstrated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Scholz, “Aufgabe 253”, Jahresbericht der deutchen Mathematiker-Vereinigung, 47, pp. 41–42 (1937).
A. Brauer, “On addition chains”, Bull. Amer. Math. Soc., 45, pp. 736–739 (1939).
A. Schönhage, “A lower bound for the length of addition chains”, Theoret. Comp. Sci., 1, pp. 1–12 (1975).
A. Yao, “On the evaluation of powers”, SIAM J. Computing, vol. 5, no. 1, pp. 100–103 (1976).
P. Downey, B. Leong and R. Sethi, “Computing sequences with addition chains”, SIAM J. Computing, 3, pp. 638–696 (1981).
J. Bos and M. Coster, “Addition Chain Heuristics”, Proc. CRYPTO'89, pp. 400-407 (1989).
Y. Tsuruoka and K. Koyama, “Fast Exponentiation Algorithms Based on Batch-Processing and Precomputation”, IEICE Trans. Fundamentals, vol.E80-A, no. 1, pp. 34–39 (Jan. 1997).
M. Potkonjak, M. B. Srivastava and A. P. Chandrakasan, “Efficient substitution of multiple constant multiplications by shifts and additions using iterative pairwise matching”, ACM/IEEE Proc. 31st DAC, pp. 189–194 (1994).
M. Mehendale, S. D. Shelekar and G. Venkatesh, “Synthesis of Multiplier-less FIR Filters with Minimum Number of Additions", Proc. ICCAD'95, pp. 668–671 (1995).
A. Matsuura, M. Yukishita and A. Nagoya, ldAn Efficient Hierarchical Clustering Method for the Multiple Constant Multiplication Problem”, Proc. ASP-DAC'97, pp. 83–88 (1997).
R. M. Karp, “Reducibility among combinatorial problems”, In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, pp. 85–103 (1972).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsuura, A., Nagoya, A. (1997). Formulation of the addition-shift-sequence problem and its complexity. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive