Analysis of the LNS implementation of the fast affline projection algorithms.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F02%3A16020131" target="_blank" >RIV/67985556:_____/02:16020131 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Analysis of the LNS implementation of the fast affline projection algorithms.
Original language description
It has been shown that a 32-bit logaritmic arithmetic unit can operate faster than, and maintain the accurancy of, a 32-bit floating point unit. It uses the logarithmic number system (LNS), in which a real number is represented as a fixed-point logarithm. In this paper we investigate the implementation of three fast affine projection (FAP) algorithms using LNS. We propose a simplified Conjugate Gradient FAP (SCGFAP) of the CGFAP and the SCGFAP algorithm are superior to those of the classical FAP algorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Irish Signals and Systems Conference 2002. ISSC 2002.
ISBN
0-9542973-0-X
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
251-255
Publisher name
Institute of Technology
Place of publication
Cork
Event location
Cork [IE]
Event date
Jun 25, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—