Rational Digit Set for On-line Addition

被引:0
|
作者
Thienprapasith, Pipop [1 ]
Surarerks, Athasit [1 ]
机构
[1] Chulalongkorn Univ, Fac Engn, Dept Comp Engn, ELITE Lab, Bangkok, Thailand
关键词
RN-coding; on-line computation; signed-digit; rational digit set;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Rounding process is one of the most important problems that limit an ability to perform a parallel or pipelining arithmetic computation in a computer system. An interesting number system called Round-to-Nearest coding (RN-coding) was proposed to solve those problems. A rounding process in an RN-coding can be done only by truncating at any position in a sequence of digits. However, an RN-coding is not suitable for on-line arithmetic operations. This paper proposes a new signeddigit number representation with a rational digit set. The obtained system also preserves a round-to-nearest property. We show in this work that an on-line addition can be illustrated as an on-line finite automaton with an on-line delay k.
引用
收藏
页码:58 / 63
页数:6
相关论文
共 50 条
  • [1] Digit set conversion by on-line finite automata
    Surarerks, A
    BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 2001, 8 (02) : 337 - 358
  • [2] On-line digit set conversion in real base
    Frougny, C
    THEORETICAL COMPUTER SCIENCE, 2003, 292 (01) : 221 - 235
  • [3] On-line multioperand addition based on on-line full adders
    Villalba, J
    Hormigo, J
    Prades, JM
    Zapata, EL
    16th International Conference on Application-Specific Systems, Architecture and Processors, Proceedings, 2005, : 322 - 327
  • [4] Model-based on-line handwritten digit recognition
    Li, XL
    Plamondon, R
    Parizeau, M
    FOURTEENTH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1 AND 2, 1998, : 1134 - 1136
  • [5] Application of Fractal theory for on-line and off-line farsi digit recognition
    Mozaffari, Saeed
    Faez, Karim
    Maergner, Volker
    MACHINE LEARNING AND DATA MINING IN PATTERN RECOGNITION, PROCEEDINGS, 2007, 4571 : 868 - +
  • [6] On-line algorithms for the dominating set problem
    Dept. of Comp. and Info. Science, National Chiao Tung University, Hsinchu 30050, Taiwan
    Inf. Process. Lett., 1 (11-14):
  • [7] On-line algorithms for the dominating set problem
    King, GH
    Tzeng, WG
    INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 11 - 14
  • [8] On-line complexity of monotone set systems
    Kaplan, H
    Szegedy, M
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 507 - 516
  • [9] On-line independent set by coloring vertices
    Vangelis Th. Paschos
    Operational Research, 2001, 1 (3) : 213 - 224
  • [10] On-line handwritten digit recognition based on trajectory and velocity modeling
    Kherallah, Monji
    Haddad, Lobna
    Alimi, Adel M.
    Mitiche, Amar
    PATTERN RECOGNITION LETTERS, 2008, 29 (05) : 580 - 594