Summary
International Symposium on Nonlinear Theory and its Applications
2005
Session Number:1-3-2
Session:
Number:1-3-2-1
Quirnary Coded Decimal Conversion Techniques
Ali Massoud Haidar, Hassan Amin Osseily, Elias Nassar, Hiroyuki Shirahama,
pp.70-73
Publication Date:2005/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.40.1-3-2-1
PDF download (116.7KB)
Summary:
The aim of this paper is to introduce new models, algorithms and circuits of quinary to quinary coded decimal (QCD) conversion. In classical binary logic [1,2], the conversion from binary to binary coded decimal could be done easily while in higher valued logic [3,4,5] the matter of conversion will be much different and done in a much difficult way. Many methods of conversion from quinary to quinary coded decimal were considered such as the counters comparison, table look up and addition technique of the quinary number 30 (15 in decimal). These methods are common for all multi-valued radices [6]. Here we will develop the algorithm and the circuit of addition technique using adder and subtraction units. Then we will introduce a new algorithm called "division by 2" technique and we will develop its circuit using ?-gate [7,8]. Finally, we will make a brief comparison between these two methods in terms of cost and performance.