This thesis focuses on reducing the delay of non-restoring division. Although the digit recurrence division is lower in complexity and occupies a smaller area than division by convergence, it has a drawback: slow division speed. To mitigate this problem, two modification ideas are proposed here for the non-restoring division, the fastest division algorithm of the digit recurrence division methods.
For the first proposed approach, the delay of the multiplexer for selecting the quotient digit and determining the way to calculate the partial remainder can be reduced through inverting the order of its flowchart. Second, one adder and one inverter can be removed by using a new quotient digit converter. To prove these ideas are valid, the simulation results comparing the modified non-restoring division and the standard non-restoring division are provided. / text
| Identifer | oai:union.ndltd.org:UTEXAS/oai:repositories.lib.utexas.edu:2152/ETD-UT-2011-05-3300 |
| Date | 11 July 2011 |
| Creators | Jun, Kihwan |
| Source Sets | University of Texas |
| Language | English |
| Detected Language | English |
| Type | thesis |
| Format | application/pdf |
Page generated in 0.0017 seconds