Authors : Japheth Kodua Wiredu; Basel Atiyire; Nelson Seidu Abuba; Reuben Wiredu Acheampong

Volume/Issue : Volume 9 - 2024, Issue 8 - August

Google Scholar : https://tinyurl.com/293ancur

Scribd : https://tinyurl.com/bdhjstek

DOI : https://doi.org/10.38124/ijisrt/IJISRT24AUG066

Abstract : The performance of base conversion methods varies greatly across several techniques, and this is important for computer-based systems. This research paper therefore examines the efficiency of three base conversion methods namely; Successive Multiplication Method, Positional Notation Method, and Horner’s Method. Their execution times are evaluated for binary, octal, decimal, and hexadecimal bases with input sizes that range from 1000 to 10,000 digits. Empirical results show that on average Horner’s Method outperforms other methods by having about 40% better execution times and up to 30% more uniformity than Positional Notation Method based upon repeated application of decimal points. Specifically speaking, for hexadecimal conversions, it took on average 0.009 seconds for Horner’s method as against 0.460 seconds for Positional Notation and another 0.009 seconds Successive Multiplication method. These observations indicate that Horner’s method is the most efficient in terms of time taken during a base conversion process as well as its consistency when compared to other techniques used in performing the same task throughout different bases such as decimal point addition repeatedly considered in positional notation numeral system. Notably, Horner’s Method completed a hexadecimal conversion at an average rate of one every nine milliseconds on the other hand the Positional Notation Approach finished one conversion per second while the Successive Multiplication Technique performed at best zero conversions within a given unit of time. It accomplishes these tasks much faster than previous approaches because it does not require multiplication steps or many intermediate calculations before obtaining answers like in Problem I; instead, only a few additions per digit are required which can be done more quickly using modern hardware such as programmable logic arrays (PLAs) according to writer P1 - R3 or even printed circuit boards (PCBs).

Keywords : Base Conversion, Computational Systems, Horner's Method, Algorithm Optimization, Efficiency Analysis.

References :

1. Numbers, S. B., & Codes, B. Digital Computers and Digital Systems Binary Numbers 4 Number Base Conversions 6 Octal and Hexadecimal Numbers 9 Complements 10.
2. Rajaraman, V. (2018). Computer oriented numerical methods. PHI Learning Pvt. Ltd..
3. Khan, S. A. (2011). Digital design of signal processing systems: a practical approach. John Wiley & Sons.
4. Mann, Z. Á. (2015). Allocation of virtual machines in cloud data centers—a survey of problem models and optimization algorithms. Acm Computing Surveys (CSUR), 48(1), 1-34.
5. Potkonjak, M., Srivastava, M. B., & Chandrakasan, A. P. (1996). Multiple constant multiplications: Efficient and versatile framework and algorithms for exploring common subexpression elimination. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(2), 151-165.
6. Kumar, A. A. (2016). Fundamentals of digital circuits. PHI Learning Pvt. Ltd..
7. Minato, S. I. (1995). Binary decision diagrams and applications for VLSI CAD (Vol. 342). Springer Science & Business Media.
8. Netz, L. (2015). Using horner schemes to improve the efficiency and precision of interval constraint propagation (Doctoral dissertation, Bachelor’s Thesis, RWTH Aachen University, 2015.⇒ 14).
9. Zeineddine, A., Nafkha, A., Paquelet, S., Moy, C., & Jezequel, P. Y. (2021). Comprehensive survey of FIR-based sample rate conversion. Journal of Signal Processing Systems, 93, 113-125.
10. Howard, J. P. (2017). Computational Methods for Numerical Analysis with R. Chapman and Hall/CRC.
11. Parhami, B. (2010). Computer arithmetic (Vol. 20, No. 00). New York, NY: Oxford university press.
12. Patankar, U. S., & Koel, A. (2021). Review of basic classes of dividers based on division algorithm. IEEE Access, 9, 23035-23069.
13. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley.
14. Goodrich, M. T., Tamassia, R., Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Data Structures & Algorithms in Java. Computer Science, 4003, 233.
15. Hennessy, J. L., & Patterson, D. A. (2011). Computer Architecture: A Quantitative Approach (5th ed.). Morgan Kaufmann.
16. Hwang, K., & Briggs, F. A. (1984). Computer Architecture and Parallel Processing. McGraw-Hill.
17. Knuth, D. E. (1997). The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley.
18. Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (2007). Numerical Recipes: The Art of Scientific Computing (3rd ed.). Cambridge University Press.
19. Quinn, M. J. (1987). Designing Efficient Algorithms for Parallel Computers. McGraw-Hill.
20. Azure, I., Wiredu, J. K., Musah, A., & Akolgo, E. (2023). AI-Enhanced Performance Evaluation of Python, MATLAB, and Scilab for Solving Nonlinear Systems of Equations: A Comparative Study Using the Broyden Method. American Journal of Computational Mathematics, 13(4), 644-677. DOI: 10.4236/ajcm.2023.134036
21. Armah, G. K., Awonekai, E. A., Owagu, U. F., & Wiredu, J. K. (2023). Customer Preference for Electronic Payment Systems for Goods: A Case Study of Some Selected Shopping Malls, Bolgatanga. Asian Journal of Research in Computer Science, 16(4), 257-270. Available:https://doi.org/10.9734/ajrcos/20 23/v16i4387
22. Wiredu, J. K., Abuba, N. S., & Zakaria, H. (2024). Impact of Generative AI in Academic Integrity and Learning Outcomes: A Case Study in the Upper East Region. Asian Journal of Research in Computer Science, 17(7), 214–232. https://doi.org/10.9734/ajrcos/2024/v17i7491.