Emulating Massively Parallel non-Boolean Operators on FPGA

被引:0
|
作者
Kiss, Andras [1 ,2 ]
Nagy, Zoltan [1 ,2 ]
Szolgay, Peter [1 ,2 ]
Csaba, Gyoergy [3 ]
Hu, Xiaobo Sharon [3 ]
Porod, Wolfgang [3 ]
机构
[1] Hungarian Acad Sci, Comp & Automat Res Inst, Budapest, Hungary
[2] Paiziminy Peter Catholic Univ, Dept Informat Technol, Budapest, Hungary
[3] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we demonstrate an optically inspired massively parallel non-Boolean operator which can emulate 3D wave dynamics on a 2D FPGA-based architecture. The algorithm is based on the Paraxial Helmholtz Equation: which describes the beam propagation through different media with different refractive indices. To solve this wave propagation equation numerically the FPGA-accelerated hardware have to operate with spatial varying templates. The FPGA-based implementation is very well parallelizable, consequently it is also be amenable to mega-core architectures.
引用
收藏
页码:1981 / 1984
页数:4
相关论文
共 50 条
  • [41] Beyond Charge-Based Computation: Boolean and Non-Boolean Computing With Spin Torque Devices
    Roy, Kaushik
    Sharad, Mrigank
    Fan, Deliang
    Yogendra, Karthik
    2013 IEEE INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN (ISLPED), 2013, : 139 - 142
  • [42] NON-BOOLEAN ALMOST PERFECT NONLINEAR FUNCTIONS ON NON-ABELIAN GROUPS
    Poinsot, Laurent
    Pott, Alexander
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (06) : 1351 - 1367
  • [43] Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation
    Sourav Dutta
    Odysseas Zografos
    Surya Gurunarayanan
    Iuliana Radu
    Bart Soree
    Francky Catthoor
    Azad Naeemi
    Scientific Reports, 7
  • [44] Sampling methods applied to dense instances of non-boolean optimization problems
    Andersson, G
    Engebretsen, L
    RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE, 1998, 1518 : 357 - 368
  • [45] New Lower Bounds for Polynomial Calculus over Non-Boolean Bases
    The Institute of Mathematical Sciences , Chennai, India
    不详
    Leibniz Int. Proc. Informatics, LIPIcs,
  • [46] Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory
    Kalai, Gil
    Mossel, Elchanan
    MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (04) : 915 - 925
  • [47] Distributed boundary representation and Boolean operations on a massively parallel computer
    Hui, KC
    Kan, YM
    COMPUTER-AIDED DESIGN, 1996, 28 (08) : 631 - 649
  • [48] AN EXAMINATION OF THE EFFECTS OF NON-BOOLEAN ENHANCEMENTS TO AN INFORMATION-RETRIEVAL SYSTEM
    DALRYMPLE, PW
    COX, R
    ONLINE REVIEW, 1992, 16 (03): : 169 - 169
  • [49] Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation
    Dutta, Sourav
    Zografos, Odysseas
    Gurunarayanan, Surya
    Radu, Iuliana
    Soree, Bart
    Catthoor, Francky
    Naeemi, Azad
    SCIENTIFIC REPORTS, 2017, 7
  • [50] Beyond-CMOS Non-Boolean Logic Benchmarking: Insights and Future Directions
    Pan, Chenyun
    Naeemi, Azad
    PROCEEDINGS OF THE 2017 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2017, : 133 - 138