Efficient VLSI implementation of modulo (2n ± 1) addition and multiplication

被引：0
|
作者：
Zimmermann, Reto [1 ]
机构：
[1] Swiss Federal Inst of Technology, (ETH), Zurich, Switzerland
来源：
Proceedings - Symposium on Computer Arithmetic | 1999年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
17
引用
收藏
页码：158 / 167
相关论文
共 50 条
  • [31] On the Design of Modulo 2n±1 Residue Generators
    Tsoumanis, Kostas
    Efstathiou, Constantinos
    Moschopoulos, Nikos
    Pekmestzi, Kiamal
    2013 IFIP/IEEE 21ST INTERNATIONAL CONFERENCE ON VERY LARGE SCALE INTEGRATION (VLSI-SOC), 2013, : 33 - 38
  • [32] MULTIFUNCTION RNS MODULO 2n ± 1 MULTIPLIERS
    Juang, Tso-Bing
    Kuo, Chao-Tsung
    Wu, Go-Long
    Huang, Jian-Hao
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2012, 21 (04)
  • [33] Improved modulo (2n + 1) multiplier for IDEA
    Department of Computer Science and Information Engineering, National Taiwan University, Taipei, 106, Taiwan
    不详
    不详
    J. Inf. Sci. Eng., 2007, 3 (907-919):
  • [34] MODULO (2N + 1) ARITHMETIC-LOGIC
    AGRAWAL, DP
    RAO, TRN
    IEE JOURNAL ON ELECTRONIC CIRCUITS AND SYSTEMS, 1978, 2 (06): : 186 - 188
  • [35] Modulo 2n+1 Squarer Design for Efficient Hardware Implementation
    Modugu, Rajashekhar
    Kim, Yong-Bin
    Kim, Kyung Ki
    Choi, Minsu
    2014 INTERNATIONAL SOC DESIGN CONFERENCE (ISOCC), 2014, : 17 - 18
  • [36] Analysis on the consistent degree of addition modulo 2n with XOR and its application
    Chen, Shi-Wei
    Jin, Chen-Hui
    Li, Xi-Bin
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2010, 33 (03): : 44 - 47
  • [37] Simplified architecture for modulo (2n+1) multiplication
    Chinese Acad of Sciences, Beijing, China
    IEEE Trans Comput, 3 (333-337):
  • [38] A simplified architecture for modulo (2n+1) multiplication
    Ma, YT
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (03) : 333 - 337
  • [39] Efficient Diminished-1 Modulo (2n +1) Adder Using Parallel Prefix Adder
    Singhal, Subodh Kumar
    Mohanty, B. K.
    Patel, Sujit Kumar
    Saxena, Gaurav
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2020, 29 (12)
  • [40] The ANF of the composition of addition and multiplication mod 2n with a Boolean function
    Braeken, A
    Semaev, I
    FAST SOFTWARE ENCRYPTION, 2005, 3557 : 112 - 125
12345