CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
Implementation of Feature Selection Using Correlation Matrix in Python

Ahmad Farhan AlShammari
Random Articles
Reseach Article

Enhanced Computational Algorithm of Binary Division by Comparison Method

by Vandana
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 97 - Number 5
Year of Publication: 2014
Authors: Vandana
10.5120/17003-7149

Vandana . Enhanced Computational Algorithm of Binary Division by Comparison Method. International Journal of Computer Applications. 97, 5 ( July 2014), 16-19. DOI=10.5120/17003-7149

@article{ 10.5120/17003-7149,
author = { Vandana },
title = { Enhanced Computational Algorithm of Binary Division by Comparison Method },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 97 },
number = { 5 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 16-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume97/number5/17003-7149/ },
doi = { 10.5120/17003-7149 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:23:18.866535+05:30
%A Vandana
%T Enhanced Computational Algorithm of Binary Division by Comparison Method
%J International Journal of Computer Applications
%@ 0975-8887
%V 97
%N 5
%P 16-19
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Binary division is the basic operation performed by arithmetic circuit. It is simpler than the decimal division because the result always produced in either 1 or 0. All the values of dividend, divisor, quotient and remainder are in 1's or o's form. There are number of binary division algorithms are available as restoring method, non restoring method, division by XOR logic operation and SRT division and comparison method. This paper presents a new concept of the comparison division method. The comparison division algorithm provides high speed computation work and increases' the system performance.

References
  1. Arithmetic operations in a binary computer by Robert F. Shaw
  2. An algorithm for non-restoring algorithm by S. Sonycl, Tata Institute of Fundamental Research Bombay, India
  3. Fast 32-bit Division on the DSP56800E Minimized non restoring division algorithm by David Baca
  4. D. Banerji, T. Cheung, and V. Ganesan, "A High-speed Division Method in Residue Arithmetic, "Proceedings of 5th IEEE, Symposium on Computer Arithmetic, Michigan, USA, 1981, pp. 158-164
  5. A Protected Division Algorithm , Published in P. Honey man, Ed. , Fifth Smart Card Research and Advanced Application Conference (CARDIS '02), pp. 69–74, Usenix Association, 2002. Marc Joye and Karine Villegas
  6. J. H. Yang, C. C. Chang, and C. Y. Chen, "A High- Speed Division Algorithm in Residue Number System Using Parity-Checking Technique,"
  7. Binary division and square-rooting using Gray code by CK Yuen
  8. Improved Algorithms for Non-restoring Division and Square Root by Kihwan Jun, B. S. E. E. , M. S. E. M. S. E. E
  9. A Division Algorithm Using Bisection Method Residue Number System by Chin-Chen Chang and Jen-Ho Yang
  10. Binary division and square-rooting using Gray code by CK Yuen
  11. VHDL Implementation of Non Restoring Division Algorithm Using High Speed Adder/Sub tractor Sukhmeet Kaur1
Index Terms

Computer Science
Information Sciences

Keywords

Binary division Restoring concept Comparison method and Non restoring method Magnitude comparator

Powered by PhDFocusTM