Software Open Access

Construction of Parallel Addition Algorithms by the Extending Window Method - implementation

Legerský, Jan

An algebraic number \(\beta \in \mathbb{C}\) with no conjugate of modulus 1 can serve as the base of a numeration system \((\beta, \mathcal{A})\) with parallel addition, i.e., the sum of two operands represented in base \(\beta\) with digits from \(\mathcal{A}\) is calculated in constant time, irrespective of the length of the operands.

In the paper Construction of Algorithms for Parallel Addition, a so-called Extending Window Method is introduced. This method is an algorithm to construct Parallel Addition algorithms. See the paper for the details, or the project website.

The content of this upload is the implementation of the Extending Window Method. It can be found also in the GitHub repository.
See results of the implementation for selected numeration systems.

Files (23.6 MB)
Name Size
EWM-implementation.zip
md5:abff1fd50a54dc2a829741d8e729c58b
23.6 MB Download
10
0
views
downloads
All versions This version
Views 1010
Downloads 00
Data volume 0 Bytes0 Bytes
Unique views 55
Unique downloads 00

Share

Cite as