A radix-4 on-line division design and its application to networks of on-line modules

被引:2
|
作者
Tenca, AF [1 ]
Shantilal, A [1 ]
Sinky, M [1 ]
机构
[1] Oregon State Univ, Sch Elect Engn & Comp Sci, Corvallis, OR 97331 USA
关键词
computer arithmetic; division; on-line arithmetic; radix-4;
D O I
10.1117/12.506455
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
On-line division is one of the slowest operations among the basic arithmetic operations and naturally becomes a bottleneck in networks of on-line modules that use it. A higher radix divider has a good potential to attain higher throughput than radix-2 dividers and therefore improve the overall throughput of networks where division is needed. The improvement in throughput when using radix 4 is not straightforward since several components of the divider become more complex than in the radix-2 case. Previously proposed radix-4 designs were based on operand pre-scaling to simplify the selection function and reduce the critical path delay, at the cost of more complexity in the algorithm conditions and operations, plus a variable on-line delay, which is a very unattractive feature when small precision values are used (usually the case for DSP). These designs include several phases for pre-scaling and actual division. This paper proposes a design approach based on overlapped replication that results in a radix-4 on-line division module with low algorithm complexity, single division phase, less restrictions to the input values, and a small and fixed on-line delay.
引用
收藏
页码:529 / 540
页数:12
相关论文
共 50 条
  • [41] Efficient on-line communication in cellular networks
    Caragiannis, Ioannis, 2000, ACM, New York
  • [42] On-line learning networks: Framework and scenarios
    Bottino, Rosa Maria
    EDUCATION AND INFORMATION TECHNOLOGIES, 2007, 12 (02) : 93 - 105
  • [43] On-line successive synthesis of wavelet networks
    Wong, KW
    Leung, ACS
    NEURAL PROCESSING LETTERS, 1998, 7 (02) : 91 - 100
  • [44] On-line routing problems for broadband networks
    Marchetti-Spaccamela, A
    SOFSEM'98: THEORY AND PRACTICE OF INFORMATICS, 1998, 1521 : 167 - 167
  • [45] On-line routing of random calls in networks
    Malwina J. Luczak
    Colin McDiarmid
    Eli Upfal
    Probability Theory and Related Fields, 2003, 125 : 457 - 482
  • [46] An on-line simulator for wormhole routing networks
    Tao, LX
    SIXTH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, PROCEEDINGS, 1998, : 249 - 254
  • [47] On the diffusion of messages in on-line social networks
    Karnik, Aditya
    Saroop, Atul
    Borkar, Vivek
    PERFORMANCE EVALUATION, 2013, 70 (04) : 271 - 285
  • [48] On-line survey and diagnose of sewer networks
    Manic, G.
    Bernardin, R.
    Salic, C.
    Blanchet, F.
    Zug, M.
    WATER PRACTICE AND TECHNOLOGY, 2007, 2 (02):
  • [49] A Dynamic Model for On-Line Social Networks
    Bonato, Anthony
    Hadi, Noor
    Horn, Paul
    Pralat, Pawel
    Wang, Changping
    ALGORITHMS AND MODELS FOR THE WEB-GRAPH, PROCEEDINGS, 2009, 5427 : 127 - +
  • [50] On-line Survivable Routing in WDM Networks
    Beshir, Anteneh
    Kuipers, Fernando
    Van Mieghem, Piet
    Orda, Ariel
    2009 21ST INTERNATIONAL TELETRAFFIC CONGRESS (ITC 21), 2009, : 17 - +