SCShantanu Chakrabartty

Shantanu Chakrabartty

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shantanu Chakrabartty has a total of 139 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    What is neuromorphic about neuromorphic computing?

    by Shantanu Chakrabartty, Chetan S. Thakur, Andreas G. Andreou

    (2025). The hardware has kept pace with the literature. Examples include IBM's TrueNorth integrated a million digital spiking neurons on a single die Merolla et al. (2014); Intel's Loihi processors lie at the core of Hala Point, a system exceeding a billion neurons Davies et al. (2018); SpiNNaker and BrainScaleS have matured into second-generation, wafer-scale and supercomputer-scale platforms Furber et al. (2014); Pehle et al. (2022); and memristive crossbar arrays promise in-memory analog computation Chua (1971) ;Strukov et al. (2008). Startups, national initiatives, and semiconductor roadmaps now routinely list "neuromorphic" among the post-Moore alternatives.Yet beneath this boom lies an awkward foundational question: what, exactly, is neuromorphic? Classical computing rests on a crisp abstraction, namely, Boolean logic, the Turing machine, the von Neumann architecture. This abstraction is entirely indifferent to whether it is realized in relays, vacuum tubes, or emerging fabrication technologies. Quantum computing likewise has a precise essence: state vectors in Hilbert space, unitary evolution, entanglement, and measurement, a definition sharp enough to support rigorous claims of quantum advantage Arute et al. (2019). Neuromorphic computing has no comparable statement of principle. "Brain-inspired" feels like a family resemblance, not a definition. The field itself has begun to sense this and a wave of recent editorials and perspective articles now asks what the essence of neuromorphic or neuromorphicism. Most pointed is Indiveri's editorial "Neuromorphic is dead. Long live neuromorphic", which argues that the label has drifted far from its founding meaning Indiveri (2025).History clarifies what the early pioneers of the field intended. Carver Mead coined "neuromorphic" electronic systems Mead (1990), in the late 1980s to describe circuits that exploit the physics of transistors operated in the subthreshold regime, where channel current depends exponentially on gate voltage in close analogy to ionic conductances in neuronal membranes. His 1990 manifesto argued that biology computes with 10,000-fold to billion-fold less energy than digital logic precisely because it uses device physics rather than fighting it Mead (1990). John Hopfield showed that computation could be a collective, emergent property of a dynamical system relaxing in an energy landscape Hopfield (1982), Sejnowski and Hinton introduced statistical mechanics into neural computation Ackley et al. (1985), contributions that were in retrospect worthy of a Nobel Prize in Physics Hopfield and Hinton (2024). Richard Feynman, who taught the famous course on the physics of computation alongside Mead and Hopfield, asked what physics itself can compute and where the thermodynamic limits of computation lie Feynman (1982Feynman ( , 1996)). What these pioneers of physics and computing intended was not the imitation of neurons but the grounding of computation in physical dynamics and energy. Physics of Computation is a field that flourished in the mid-1990s and has since morphed into "Unconventional Computing," an all-encompassing name and research field, one that certainly includes neuromorphic computing.This editorial addresses a misconception about computation in the current neuromorphic engineering discourse. A computing principle must abstract away from the physical substrate on which it is implemented, an idea introduced by the late David Marr Marr (1982), and subsequently addressed by Cassidy et.al. Cassidy et al. (2013) separating form and function. Statements such as "uses subthreshold CMOS," "uses memristors," or "uses neural processing units" are statements about implementation i.e. form, not essence, just as "uses transistors" never defined classical computing, and "uses superconducting junctions" does not define quantum computing. If neuromorphic computing is to be a paradigm rather than a product category, its defining principle must survive translation across substrates: silicon, oxides, photonics, or wetware.What, then, is the substrate-independent essence for neuromorphic computing ? The most defensible candidate is "thermodynamic". Nervous systems evolved under severe metabolic budgets: the human brain runs on roughly 20 watts, and cellular-level energy accounting shows that spiking, signaling, and synaptic transmission are all tuned to minimize metabolic cost Attwell and Laughlin (2001); Laughlin et al. (1998). Insect brains sharpen the point. A honeybee forages over kilometres, navigates by landmark and sky compass, communicates, and learns with about a million neurons, and a fruit fly flies, and adapts with roughly a tenth of that, on power budgets in the microwatt-to-milliwatt range. Direct measurements in fly photoreceptors show that the energy-information trade-off is enforced down to the level of single cells Abshire and Andreou (2000); Niven et al. (2007). The insect brain is therefore the gold standard for edge-AI embodying full sensing, autonomy, and lifelong learning within a milliwatt power-budget, a benchmark that no current engineered system, neuromorphic or otherwise, comes close to matching. Addressing function, neuromorphic computation is thus, at its core, computing with and against thermodynamics: representing problems as energy functions and entropy production, letting physical dynamics perform descent, relaxation, and sampling, and treating statistical mechanics as the native mathematics of the machine. In this sense neuromorphic computing dovetails with the emerging research programs of thermodynamic computing, which take fluctuations, dissipation, and stochastic dynamics as and, in particular, with the field of stochastic thermodynamics, where fluctuation theorems, uncertainty relations, and thermodynamic speed limits now make it possible to quantify the energy costs of computation in systems arbitrarily far from equilibrium, from digital circuits to brains Wolpert et al. (2024). Indeed,...

  • Open Access

    Plasmonic Foam‐Enabled Dual‐Modal Biohybrid Chemical Sensor

    by Avishek Debnath, Prashant Gupta, Rohit Gupta, Yixuan Wang, Yin‐Yuan Huang, Feiyang Deng, Ramachandra Reddy Atigadda, Shantanu Chakrabartty, Baranidharan Raman, Srikanth Singamaneni

    Chemical sensing systems with high sensitivity, molecular specificity, and universality across diverse chemical species are critical in numerous applications, including homeland security, environmental monitoring, industrial process monitoring, and healthcare. Existing synthetic chemical sensors remain suboptimal against their biological counterparts when sensitivity, specificity, versatility, and stability are evaluated jointly. Insect olfaction‐based biohybrid sensors have been proposed, but their accuracy scales with the number of insects and does not extend across chemically diverse species, limiting universality. In this study, we overcome this deficiency by integrating the insect olfactory system with a synthetic chemical sensor, yielding a hybrid platform that identifies a broader range of chemicals than either system alone. We realized an ultralight, highly porous, three‐dimensional (3D) surface‐enhanced Raman scattering (SERS) substrate and interfaced it with the locust antenna and wings to harness the insect's active odor‐sampling abilities. Notably, the plasmonic foam provided molecular vibrational‐fingerprint information without interfering with the insect's innate chemical‐sensing and locomotion abilities. By leveraging their complementary information, confidence‐weighted fusion of neural and SERS responses outperformed either modality alone, improving odor‐detection performance across all chemicals tested. This approach demonstrates the potential of interfacing functional nanomaterials with biological olfaction systems to create biohybrid chemical sensing systems with higher accuracy, specificity, and universality.

  • Open Access

    Higher-order neuromorphic Ising machines—autoencoders and Fowler-Nordheim annealers are all you need for scalability

    by Faiek Ahsan, Saptarshi Maiti, Zihao Chen, Jakob Kaiser, Ankita Nandi, Madhuvanthi Srivatsav, Johannes Schemmel, Andreas G. Andreou, Jason Eshraghian, Chetan Singh Thakur, et al.

    We report that an autoencoder-based neuromorphic architecture, combined with Fowler-Nordheim annealing, is sufficient to implement scalable higher-order Ising machines. We show that these machines can consistently produce state-of-the-art solutions with high reliability and with competitive time-to-solution metrics. The autoencoder captures higher-order interactions by decomposing Ising clauses and Ising spins into encoder-decoder layers of spiking neurons, thereby keeping the resource complexity independent of the interaction order for sparse problems. An annealing process based on the dynamics of Fowler-Nordheim quantum mechanical tunneling extrapolates between an \({{\mathcal{O}}}(1/t)\) annealing schedule and an \({{\mathcal{O}}}(1/\log (t))\) annealing schedule. This not only ensures fast convergence towards high-quality solutions but also guarantees asymptotic convergence to the Ising ground state. To demonstrate the advantages of the proposed higher-order neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and MAX-SAT, comparing the results to those obtained using a second-order Ising machine employing the same annealing process.


  • Estimation of energy-dissipation lower bounds for neuromorphic learning in memory

    by Zihao Chen, Faiek Ahsan, Shantanu Chakrabartty, Johannes Leugering, Gert Cauwenberghs

    Neuromorphic or neurally inspired optimizers rely on local but parallel parameter updates to solve problems that range from quadratic programming to Ising machines. An ideal realization of such an optimizer not only uses a compute-in-memory paradigm to address the memory wall (i.e., energy dissipated due to repeated memory read access), but also uses a learning-in-memory paradigm to address the energy bottlenecks due to repeated memory writes at the precision required for optimization (the update wall), and to address the energy bottleneck due to the repeated transfer of information between short-term and long-term memories (the consolidation wall). In this paper, we derive theoretical estimates for the energy-to-solution metric that can be achieved by this ideal neuromorphic optimizer which is realized by modulating the energy barrier of the physical memories such that the dynamics of memory updates and memory consolidation matches the optimization or the annealing dynamics. The analysis presented in this paper captures the out-of-equilibrium thermodynamics of learning and the resulting energy-efficiency estimates are model agnostic and only depend on the number of model-update operations, the model size in terms of number of parameters, the speed of convergence, and the precision of the solution. To show the practical applicability of our results, we apply our analysis for estimating the lower bound on the energy-to-solution metrics for large-scale AI workloads.


  • Open Access

    Maximum-Entropy Analog Computing Approaching ExaOPS-per-Watt Energy-efficiency at the RF-Edge

    by Aswin Undavalli, Kareem Rashed, Zhili Xiao, Arun Natarajan, Shantanu Chakrabartty, Aravind Nagulu

    In this paper, we demonstrate how the physics of entropy production, when combined with symmetry constraints, can be used for implementing high-performance and energy-efficient analog computing systems. At the core of the proposed framework is a generalized maximum-entropy principle that can describe the evolution of a mesoscopic physical system formed by an interconnected ensemble of analog elements, including devices that can be readily fabricated on standard integrated circuit technology. We show that the maximum-entropy state of this ensemble corresponds to a margin-propagation (MP) distribution and can be used for computing correlations and inner products as the ensemble's macroscopic properties. Furthermore, the limits of computational throughput and energy efficiency can be pushed by extending the framework to non-equilibrium or transient operating conditions, which we demonstrate using a proof-of-concept radio-frequency (RF) correlator integrated circuit fabricated in a 22 nm SOI CMOS process. The measured results show a compute efficiency greater than 2 Peta ($10^{15}$) Bit Operations per second per Watt (PetaOPS/W) at 8-bit precision and greater than 0.8 Exa ($10^{18}$) Bit Operations per second per Watt (ExaOPS/W) at 3-bit precision for RF data sampled at rates greater than 4 GS/s. Using the fabricated prototypes, we also showcase several real-world RF applications at the edge, including spectrum sensing, and code-domain communications.

  • Fully Analog, Multi-Lag, RF Correlators for Code-Domain Radars Using Margin Propagation

    by Aswin Undavalli, Kareem Rashed, Abdul Rakib Hossain, Gert Cauwenberghs, Shantanu Chakrabartty, Arun Natarajan, Aravind Nagulu

    We present a fully analog, multiplier-free, sampled-domain RF correlator to achieve high energy efficiency for radar workloads. The RF correlator employs a split-source follower architecture that leverages the margin propagation (MP) computing paradigm in the sampled domain. As a proof of concept, we implement a $256 \times 256$ fully analog cross correlator in a 22 nm SOI-CMOS process. Large analog delays are realized using a sampling-based approach, and the design incorporates a compact, power and area-efficient four-transistor compute cell. The fabricated IC achieves: 1) input and template data rates up to 4GS/s; 2) single-shot 256-point cross correlations across 256 lags, enabling full $256 \times 256$ cross correlation; 3) >8 bit compute accuracy; 4) energy efficiency of 1000 1b-TOPS/W and 5) compute density of 1.3 1b-TOPS/mm2 per cell. The MP correlator demonstrates robust performance across process–voltage–temperature (PVT) variations and is deployed in a code-domain radar system with multi-user operation, validating system-level feasibility.


  • Open Access

    Author Correction: ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

    by Zihao Chen, Zhili Xiao, Mahmoud Akl, Johannes Leugering, Omowuyi Olajide, Adil Malik, Nik Dennler, Chad Harper, Subhankar Bose, Hector A. Gonzalez, et al.


  • Open Access

    Higher-Order Neuromorphic Ising Machines -- Autoencoders and Fowler-Nordheim Annealers are all you need for Scalability

    by Faiek Ahsan, Saptarshi Maiti, Zihao Chen, Jakob Kaiser, Ankita Nandi, Madhuvanthi Srivatsav, Johannes Schemmel, Andreas G. Andreou, Jason Eshraghian, Chetan Singh Thakur, et al.

    We report a higher-order neuromorphic Ising machine that exhibits superior scalability compared to architectures based on quadratization, while also achieving state-of-the-art quality and reliability in solutions with competitive time-to-solution metrics. At the core of the proposed machine is an asynchronous autoencoder architecture that captures higher-order interactions by directly manipulating Ising clauses instead of Ising spins, thereby maintaining resource complexity independent of interaction order. Asymptotic convergence to the Ising ground state is ensured by sampling the autoencoder latent space defined by the spins, based on the annealing dynamics of the Fowler-Nordheim quantum mechanical tunneling. To demonstrate the advantages of the proposed higher-order neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and MAX-SAT, comparing the results to those obtained using a second-order Ising machine employing the same annealing process. Our findings indicate that the proposed architecture consistently provides higher quality solutions in shorter time frames compared to the second-order model across multiple runs. Additionally, we show that the techniques based on the sparsity of the interconnection matrix, such as graph coloring, can be effectively applied to higher-order neuromorphic Ising machines, enhancing the solution quality and the time-to-solution. The time-to-solution can be further improved through hardware co-design, as demonstrated in this paper using a field-programmable gate array (FPGA). The results presented in this paper provide further evidence that autoencoders and Fowler-Nordheim annealers are sufficient to achieve reliability and scaling of any-order neuromorphic Ising machines.

  • Open Access

    ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

    by Zihao Chen, Zhili Xiao, Mahmoud Akl, Johannes Leugering, Omowuyi Olajide, Adil Malik, Nik Dennler, Chad Harper, Subhankar Bose, Hector A. Gonzalez, et al.

    We introduce NeuroSA, a neuromorphic architecture specifically designed to ensure asymptotic convergence to the ground state of an Ising problem using a Fowler-Nordheim quantum mechanical tunneling based threshold-annealing process. The core component of NeuroSA consists of a pair of asynchronous ON-OFF neurons, which effectively map classical simulated annealing dynamics onto a network of integrate-and-fire neurons. The threshold of each ON-OFF neuron pair is adaptively adjusted by an FN annealer and the resulting spiking dynamics replicates the optimal escape mechanism and convergence of SA, particularly at low-temperatures. To validate the effectiveness of our neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and Max Independent Set. Across multiple runs, NeuroSA consistently generates distribution of solutions that are concentrated around the state-of-the-art results (within 99%) or surpass the current state-of-the-art solutions for Max Independent Set benchmarks. Furthermore, NeuroSA is able to achieve these superior distributions without any graph-specific hyperparameter tuning. For practical illustration, we present results from an implementation of NeuroSA on the SpiNNaker2 platform, highlighting the feasibility of mapping our proposed architecture onto a standard neuromorphic accelerator platform.


  • Margin Propagation Based XOR-SAT Solvers for Decoding of LDPC Codes

    by Ankita Nandi, Shantanu Chakrabartty, Chetan Singh Thakur

    Decoding of Low-Density Parity Check (LDPC) codes can be viewed as a special case of XOR-SAT problems, for which low-computational complexity bit-flipping algorithms have been proposed in the literature. However, a performance gap exists between the bit-flipping LDPC decoding algorithms and the benchmark LDPC decoding algorithms, such as the Sum-Product Algorithm (SPA). In this paper, we propose an XOR-SAT solver using log-sum-exponential functions and demonstrate its advantages for LDPC decoding. This is then approximated using the Margin Propagation formulation to attain a low-complexity LDPC decoder. The proposed algorithm uses soft information to decide the bit-flips that maximize the number of parity check constraints satisfied over an optimization function. The proposed solver can achieve results that are within 0.1dB of the Sum-Product Algorithm for the same number of code iterations. It is also at least 10× lower than other Gradient-Descent Bit Flipping decoding algorithms, which are also bit-flipping algorithms based on optimization functions. The approximation using the Margin Propagation formulation does not require any multipliers, resulting in significantly lower computational complexity than other soft-decision Bit-Flipping LDPC decoders.