<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-001-01-0002</article-id>
      <article-id pub-id-type="publisher-id">27077</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>B.2 - ARITHMETIC AND LOGIC STRUCTURES</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>High-radix Division with Approximate Quotient-digit Estimation</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Fenwick</surname>
            <given-names>Peter</given-names>
          </name>
          <email xlink:type="simple">p_fenwick@cs.auckland.ac.nz</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Department of Computer Science, The University of Auckland, Auckland, New Zealand</addr-line>
        <institution>Department of Computer Science, The University of Auckland</institution>
        <addr-line content-type="city">Auckland</addr-line>
        <country>New Zealand</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Peter Fenwick (<email xlink:type="simple">p_fenwick@cs.auckland.ac.nz</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>1995</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>01</month>
        <year>1995</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <fpage>2</fpage>
      <lpage>22</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/8DA41319-C1BB-5F8B-BF25-809F42F12780">8DA41319-C1BB-5F8B-BF25-809F42F12780</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6995042">6995042</uri>
      <permissions>
        <copyright-statement>Peter Fenwick</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>High-radix division, developing several quotient bits per clock, is usually limited by the difficulty of generating accurate high-radix quotient digits. This paper describes techniques which allow quotient digits to be inaccurate, but then refine the result. We thereby obtain dividers with slightly reduced performance, but with much simplified logic. For example, a nominal radix-64 divider can generate an average of 4.5 to 5.5 quotient bits per cycle with quite simple digit estimation logic. The paper investigates the technique for radices of 8, 16, 64 and 256, including various qualities of digit estimation, and operation with restricted sets of divisor multiples.</p>
      </abstract>
    </article-meta>
  </front>
</article>
