John Reuben, Ph.D.

John Reuben Prabahar, Ph.D.

Post-doctoral researcher

Department Informatik (INF)
Lehrstuhl für Informatik 3 (Rechnerarchitektur)

Raum: Raum 07.139
Martensstrasse 3


Received ETI funding in 2020: EUR 12,000 to do preliminary research to apply for DFG grant.

March 2018-present : Post-doctoral researcher at the Chair of Computer Architecture ( Prof. Dietmar Fey )

at Chair of Computer Architecture,  Friedrich-Alexander University Erlangen-Nuremberg

Jan 2017-Jan 2018 : Post-doctoral researcher at ASIC2 group ( Prof. Shahar Kvatinsky ), Technion- Israel Institute of Technology

2015 : Ph.D. in Electronic Design Automation / CAD for VLSI from

Research Interests

  • Resistive RAMs, ferroelectric memories (FTJ, FeFET) and other memristive technologies (PCM, MRAM)
  • In-memory computing, memristive logic, in-memory arithmetic
  • Beyond CMOS computing

Note: The following list is not updated regularly, but once in a year. See Google Scholar for most recent publication list.

Recent Publications (2019 -)

[14] John Reuben . Design of In-Memory Parallel-Prefix Adders. J. Low Power Electron. appl.  202111 , 45.

[13] Vijaya Lakshmi, John Reuben and Vikramkumar Pudi, „A Novel In-Memory Wallace Tree Multiplier Architecture Using Majority Logic,“ in IEEE Transactions on Circuits and Systems I: Regular Papers , vol. 69, no. 3, pp. 1148-1158, March 2022, doi: 10.1109/TCSI.2021.3129827.

[12]  John Reuben and Dietmar Fey “ Carry-free Addition in Resistive RAM Array: n-bit Addition in 22 Memory Cycles ”, IEEE Computer Society Annual Symposium on VLSI (ISVLSI) , July 2021 (Tampa, Florida), doi: 10.1109 /ISVLSI51109.2021.00038

[11] John Reuben and S. Pechmann, “ Accelerated Addition in Resistive RAM Array Using Parallel-Friendly Majority Gates ,“ in  IEEE Transactions on Very Large Scale Integration (VLSI) Systems , doi: 10.1109 / TVLSI.2021.3068470 10.1109 / TVLSI.2021.3068470 . See video

[10] Pérez-Bosch Quesada, Emilio; Romero-Zaliz, Rocio; Perez, Eduardo; Kalishettyhalli Mahadevaiah, Mamathamba; Reuben, John ; Schubert, Markus A.; Jiménez-Molinos, Francisco; Roldan, Juan B.; Wenger, Christian. 2021. “ Toward Reliable Compact Modeling of Multilevel 1T-1R RRAM Devices for Neuromorphic Systems “  Electronics 10, no. 6:645. doi: 10.3390/electronics10060645

[9] D. Fey and John Reuben , „ Direct state transfer in MLC based memristive ReRAM devices for ternary computing “, 2020 European Conference on Circuit Theory and Design (ECCTD) , Sofia, Bulgaria, 2020, pp. 1-5 , doi: 10.1109/ECCTD49232.2020.9218323 .

[8]  John Reuben, „Rediscovering Majority Logic in the Post-CMOS Era: A Perspective from In-Memory Computing“. J. Low Power Electron. appl.  202010 , 28. doi:  10.3390/jlpea10030028

[7]. John Reuben , M Biglari and D Fey, „ Incorporating Variability of Resistive RAM in Circuit Simulations using the Stanford – PKU Model „, IEEE Transactions on Nanotechnology , vol. 19, pp. 508-518, 2020. doi: 10.1109 / TNANO. 2020.3004666

[6] John Reuben , S. Pechmann, „ A Parallel-friendly Majority Gate to Accelerate In-memory Computation, “ in IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) , Manchester, UK, 2020, pp. 1-8. doi:  10.1109 / ASAP49362.2020.00025

See conference presentation video here (20 min) conference presentation video

[5] John Reuben , „Binary addition in resistance switching memory array by sensing majority,‘ in Micromachines , vol. 11, no. 5, 2020. doi: 10.3390/mi11050496

[4] John Reuben , Dietmar Fey and Christian Wenger, „ A Modeling Methodology for Resistive RAM Based on Stanford-PKU Model With Extended Multilevel Capability , „in IEEE Transactions on Nanotechnology , vol. 18, pp. 647-656, 2019.    Modified Stanford-PKU model to simulate Multilevel SET process-> Download CODE doi: 

[3]. Talati, R Ben Hur, N Wald, A Ali, John Reuben, and S Kvatinsky, “ mMPU – a Real Processing-in-Memory Architecture to Combat the von Neumann Bottleneck ,“ Ed. Mannan Suri, Applications of Emerging Memory Technology . Springer Series in Advanced Microelectronics, vol 63. Springer, Singapore

[2]  John Reuben and Dietmar Fey, „ A Time-based Sensing Scheme for Multilevel Cell (MLC) Resistive RAM , „in IEEE Nordic Circuits And Systems Conference (NORCAS) , Finland, October 2019. doi: 10.1109 / NORCHIP.2019.8906921 

[1] John Reuben , R. Ben-Hur, N. Wald, N. Talati, A.Ali, P.-E. Gaillardon, and S Kvatinsky, “ A taxonomy and evaluation framework for memristive logic ,“ in Handbook of Memristor Networks , A Adamatzky, L Chua, and G Sirakoulis, Eds. Springer International Publishing, 2019. doi:


I taught „CAD for VLSI/ Electronic Design automation course“ for Masters Program in VLSI at VIT university, India. During those years (2012-2016), I prepared a series of video lectures elucidating some classical algorithms used for physical design automation. They are available on youtube for public access. The links to those video lectures are below:

(Note: Animations in my videos were made by Mr.Sanket Yawalker(Masters in VLSI design, 2014 batch). His contribution is acknowledged.)

  1. Clock Distribution network- Introduction : In this lecture, I give an introduction to one of the crucial aspects of physical design- the clock distribution network.
  2. Exact zero skew clock routing algorithm: The exact zero skew clock routing algorithm, proposed by Tsay in 1993 is still used in many clock tree synthesis tools. This algorithm is foundational to all the latest developments in clock distribution. This lecture presents the algorithm with an example.
  3. Introduction to floor planning : In this lecture, I give an introduction to floor planning – the phase in physical design flow after partitioning where the modules are assigned a tentative location on the chip. Includes an interesting animation on slicing tree to represent a floor plan.
  4. Floor planning by Polish expression (Wong-Liu algorithm): The polish expression, proposed by Wong and Liu is a succinct representation of slicing floor plans. In this lecture, I explain how floor plans can be represented by polish expressions and how simulated annealing can be used to optimize the floor plan. I also discuss an example from the book „Practical problems in VLSI PDA“ by Prof. Sung Kyu Lim, Georgia Tech
  5. Floor planning by Polish expression- contd : The continuation of my previous lecture on floor planning using polish expression. The 3 moves suggested by Wong and Liu are illustrated by animation.
  6. Introduction to Partitioning
    In this lecture, I give an introduction to the first step in physical design automation of integrated circuit.
  7. Kernighan-Lin(KL) algorithm for partitioning
    KL algorithm is an iterative improvement algorithm for bi-partitioning a netlist.Belonging to the class of group migration algorithms, it is based on exchanging a pair of nodes across the partition to reduce the cutset this lecture, the algorithm is explained with an example.
  8. Floorplanning by Integer Linear Programming(ILP) Integer Linear Programming(ILP) is a general optimization technique. In this algorithm the floor planning problem in VLSI physical design is formulated as an ILP and solved.
  9. Placement- Sequence pair representation: The sequence pair is a concise representation of non-slicing floor plan. In this lecture, I introduce sequence pair representation and illustrate how it can be used together with simulated annealing for optimization in VLSI placement. I also discuss an example from the book „Practical problems in VLSI PDA“ by Prof. Sung Kyu Lim, Georgia Tech
  10. Channel routing- Left Edge and Dogleg Algorithm: In this lecture, the left edge algorithm for Channel routing is described. The dogleg algorithm, which improves the left edge algorithm by net-splitting is also discussed.
  11. Clock Mesh In this lecture, I discuss mesh based clock distribution method which has received much attention since 2010. Clock mesh is more resistant to on chip variations when compared to tree, but this achieved at cost of more power.
Digital IC design Lab for Masters‘ in VLSI program

(Voice in the following 2 demos is of Dr.Mohammed Zackriya)introductionto_ngspice_johnreuben_vit)

Layout of Inverter – Part -I
In this lab demo, we show how to draw the layout of a CMOS inverter using Cadence Virtuoso, Technology-90 nm

Layout of Inverter – Part -II
In this lab demo, we show how to post layout simulation of a CMOS inverter using Cadence Virtuoso, Technology-90 nm

Clock Mesh/clock tree simulation in NGSPICE( IntroductionTo_ngspice_JohnReuben_VIT ):

This document is appendix of my PhD thesis which contains how to simulate a clock mesh in NGSPICE.Also includes how to do Monte carlo simulation in NGSPICE by varying some parameters

Analog Electronics Lab 

Introduction to lab equipment and Common Emitter(CE) amplifier (FG, Oscilloscope and voltage regulator)

Frequency response of CE amplifier