Speculatively Redundant Continued Logarithm Representation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F10%3A00170341" target="_blank" >RIV/68407700:21240/10:00170341 - isvavai.cz</a>
Result on the web
<a href="http://service.felk.cvut.cz/anc/brabect1/pub/ieeetc-1441-2010.pdf" target="_blank" >http://service.felk.cvut.cz/anc/brabect1/pub/ieeetc-1441-2010.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TC.2010.110" target="_blank" >10.1109/TC.2010.110</a>

Result language
angličtina
Original language name
Speculatively Redundant Continued Logarithm Representation
Original language description
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniqueness of their representation. This is quite unfortunate, as this representation seems promising for efficient hardware implementation. We propose an idea of making the representation redundant using speculative recognition of noncomputable cases. This approach solves the problem of real number computability, preserves most of the beneficial properties of continued logarithms, and only moderately affects complexity of arithmetic algorithms, thus, keeping the prospect of efficient implementation.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)