Double base number system algorithms in constant integer multiplication

The Double Base Number System (DBNS) has been studied for over ten years. Its properties are still being discovered, and its potential uses in varying applications are still being explored.; The contribution of this research is to develop and analyze algorithms that exploit the DBNS in constant integer arithmetic - particularly multiplication. It was found that the novel DBNS algorithms introduced in this thesis consistently outperform many traditional constant integer multiplication methods by exploiting simple yet unorthodox topologies.; Additional greedy DBNS algorithms described here perform nearly as well. These greedy DBNS algorithms closely match, and sometimes improve upon, the costs of prevailing methods. Therefore, the greedy DBNS methods are ideal candidates for future compilers' "constant integer multiplication" modules.; The Double Base Number System is a novel way of approaching Constant Integer Multiplication, and under certain conditions---namely time and space requirements---a great way.