Efficient Algorithms for Zeckendorf Arithmetic
Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger

TL;DR
This paper presents linear-time algorithms for addition and subtraction in Zeckendorf representation, demonstrating their implementation via combinational logic networks with linear size and logarithmic depth, and discusses implications for other arithmetic operations.
Contribution
It introduces efficient algorithms for Zeckendorf addition and subtraction with linear time complexity and practical logic network implementations, advancing Zeckendorf arithmetic methods.
Findings
Addition and subtraction in Zeckendorf form can be performed in linear time.
These operations can be implemented with combinational logic networks of linear size and logarithmic depth.
Implications for multiplication, division, and square-root extraction are discussed.
Abstract
We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size and logarithmic depth. The implications of these results for multiplication, division and square-root extraction are also discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Digital Filter Design and Implementation · Polynomial and algebraic computation
