Speculatively Redundant Continued Logarithm Representation

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Speculatively Redundant Continued Logarithm Representation

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Speculatively Redundant Continued Logarithm Representation

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

Kód důvěrnosti údajů

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

Název periodika

IEEE Transactions on Computers

ISSN

0018-9340

e-ISSN

1557-9956

Svazek periodika

59

Číslo periodika v rámci svazku

11

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

1441-1454

Kód UT WoS článku

000282091200001

EID výsledku v databázi Scopus

2-s2.0-77957597532