Ramprasath Srinivasa Gopalakrishnan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ramprasath Srinivasa Gopalakrishnan has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Sachin S. Sapatnekar
Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, USA
4 shared publications - Ramesh Harjani
University of Minnesota, Minneapolis, MN, USA
3 shared publications - Arvind Kumar Sharma
Semiconductor Technology and Systems Department, Imec, Leuven, Belgium
2 shared publications - Jitesh Poojary
University of Minnesota, Minneapolis, MN, USA
2 shared publications - Kishor Kunal
University of Minnesota
2 shared publications - Meghna Madhusudan
University of Minnesota, Minneapolis, MN, USA
2 shared publications
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
COmPOSER: Circuit Optimization of mm-wave/RF circuits with Performance-Oriented Synthesis for Efficient Realizations
This work presents COmPOSER, an open-source, end-to-end framework for RF/mm-wave design automation that translates target specifications into optimized circuits with layouts. It unifies schematic synthesis, layout generation for actives/passives, and place-and-route, incorporating physics-based equations and machine-learning-driven electromagnetic models. Based on post-layout validation on multiple LNAs and PAs at up to 60 GHz in a commercial 65 nm process, COmPOSER meets performance targets, comparable to manual designs, and delivers a 100–300× productivity gain.
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessCOmPOSER: Circuit Optimization of mm-wave/RF circuits with Performance-Oriented Synthesis for Efficient Realizations
This work presents COmPOSER, an open-source, end-to-end framework for RF/mm-wave design automation that translates target specifications into optimized circuits with layouts. It unifies schematic synthesis, layout generation for actives/passives, and place-and-route, incorporating physics-based equations and machine-learning-driven electromagnetic models. Based on post-layout validation on multiple LNAs and PAs at up to 60 GHz in a commercial 65 nm process, COmPOSER meets performance targets, comparable to manual designs, and delivers a 100–300× productivity gain.
- 20 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 61 (6) , 2951-2964
Distance-Dependent Variations in FinFETs and Its Impact on Analog Circuit Design
Analog circuits, including amplifiers, comparators, and data converters, are highly sensitive to device mismatches, particularly in differential pairs and current mirrors. Intra-die process variations, both random and distance-dependent, are primary contributors to these mismatches. While random variations are well modeled by the SPICE models in the process design kit (PDK) and utilized by designers during transistor sizing, distance-dependent variations are not as accurately modeled. Consequently, designers often employ complex layout patterns, such as common-centroid (CC) and interdigitated (ID), regardless of necessity. These patterns can result in a larger area and increased parasitics compared to clustered (NonCC) patterns, especially in advanced technology nodes. In this article, we present our chip design and mismatch measurement results from multiple dies fabricated using a 12-nm fin field-effect transistor (FinFET) technology. We specifically measure both distance-dependent and random variations, comparing the mismatch across various layout patterns. Our findings are used to develop design methodologies for operational transconductance amplifiers (OTAs) and current-steering digital-to-analog converters (DACs). We demonstrate that for OTAs and low-resolution DACs, CC, ID, and non-CC patterns exhibit similar mismatch levels, with NonCC offering reduced area and complexity. For high-resolution DACs, however, CC and ID patterns perform better, though distance-dependent mismatch remains significant and must also be considered during circuit sizing.
- 20 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 61 (6) , 2951-2964
Distance-Dependent Variations in FinFETs and Its Impact on Analog Circuit Design
Analog circuits, including amplifiers, comparators, and data converters, are highly sensitive to device mismatches, particularly in differential pairs and current mirrors. Intra-die process variations, both random and distance-dependent, are primary contributors to these mismatches. While random variations are well modeled by the SPICE models in the process design kit (PDK) and utilized by designers during transistor sizing, distance-dependent variations are not as accurately modeled. Consequently, designers often employ complex layout patterns, such as common-centroid (CC) and interdigitated (ID), regardless of necessity. These patterns can result in a larger area and increased parasitics compared to clustered (NonCC) patterns, especially in advanced technology nodes. In this article, we present our chip design and mismatch measurement results from multiple dies fabricated using a 12-nm fin field-effect transistor (FinFET) technology. We specifically measure both distance-dependent and random variations, comparing the mismatch across various layout patterns. Our findings are used to develop design methodologies for operational transconductance amplifiers (OTAs) and current-steering digital-to-analog converters (DACs). We demonstrate that for OTAs and low-resolution DACs, CC, ID, and non-CC patterns exhibit similar mismatch levels, with NonCC offering reduced area and complexity. For high-resolution DACs, however, CC and ID patterns perform better, though distance-dependent mismatch remains significant and must also be considered during circuit sizing.
- Open Access
- 9 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 28 (5) , 1-25
A Generalized Methodology for Well Island Generation and Well-tap Insertion in Analog/Mixed-signal Layouts
Well island generation and well tap placement is an important problem in analog/mixed-signal (AMS) circuits. Well taps can only prevent latchups within a certain radius of influence within a well island, and hence must be appropriately inserted to cover all devices. However, existing automated AMS layout paradigms typically defer the insertion of well taps and creation of well islands to a post-processing step after placement. This alters the placement, resulting in increased area and wire length, as well as circuit performance degradation. Therefore, there is a strong need for a solution that generates well islands and inserts well taps during placement so the placer can account for well overheads in optimizing placement metrics. In this work, we propose a modular solution using a graph-based optimization scheme that can be used within multiple placement paradigms with minimal intrusion. We demonstrate the integration of this scheme into stochastic, analytical, and designer-driven row-based placement. The method is demonstrated in advanced FinFET technologies. Layouts generated using this scheme show better area, wire length, and performance metrics at the cost of a marginal runtime degradation when compared to the post-processing approach. Using our scheme, there is an average improvement of 3% and 4% and a maximum improvement of 23% and 11% in area and wirelength, respectively, of layouts of various classes of AMS circuits at the cost of 17% average and 29% maximum increase in total runtime.
- 9 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 28 (5) , 1-25
Open AccessA Generalized Methodology for Well Island Generation and Well-tap Insertion in Analog/Mixed-signal Layouts
Well island generation and well tap placement is an important problem in analog/mixed-signal (AMS) circuits. Well taps can only prevent latchups within a certain radius of influence within a well island, and hence must be appropriately inserted to cover all devices. However, existing automated AMS layout paradigms typically defer the insertion of well taps and creation of well islands to a post-processing step after placement. This alters the placement, resulting in increased area and wire length, as well as circuit performance degradation. Therefore, there is a strong need for a solution that generates well islands and inserts well taps during placement so the placer can account for well overheads in optimizing placement metrics. In this work, we propose a modular solution using a graph-based optimization scheme that can be used within multiple placement paradigms with minimal intrusion. We demonstrate the integration of this scheme into stochastic, analytical, and designer-driven row-based placement. The method is demonstrated in advanced FinFET technologies. Layouts generated using this scheme show better area, wire length, and performance metrics at the cost of a marginal runtime degradation when compared to the post-processing approach. Using our scheme, there is an average improvement of 3% and 4% and a maximum improvement of 23% and 11% in area and wirelength, respectively, of layouts of various classes of AMS circuits at the cost of 17% average and 29% maximum increase in total runtime.
- 27 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (12) , 4844-4857
A Unified Engine for Accelerating GNN Weighting/Aggregation Operations, With Efficient Load Balancing and Graph-Specific Caching
Graph neural networks (GNN) analysis engines are vital for real-world problems that use large graph models. Challenges for a GNN hardware platform include the ability to (a) host a variety of GNNs, (b) handle high sparsity in input vertex feature vectors and the graph adjacency matrix and the accompanying random memory access patterns, and (c) maintain load-balanced computation in the face of uneven workloads, induced by high sparsity and power-law vertex degree distributions. This paper proposes GNNIE, an accelerator designed to run a broad range of GNNs. It tackles workload imbalance by (i) splitting vertex feature operands into blocks, (ii) reordering and redistributing computations, (iii) using a novel flexible MAC architecture. It adopts a graph-specific, degree-aware caching policy that is well suited to real-world graph characteristics. The policy enhances on-chip data reuse and avoids random memory access to DRAM. GNNIE achieves average speedups of 7197× over a CPU and 17.81× over a GPU over multiple datasets on graph attention networks (GATs), graph convolutional networks (GCNs), GraphSAGE, GINConv, and DiffPool. Compared to prior approaches, GNNIE achieves an average speedup of 5× over HyGCN (which cannot implement GATs) for GCN, GraphSAGE, and GINConv. GNNIE achieves an average speedup of 1.3× over AWB-GCN (which runs only GCNs), despite using 3.4× fewer processing units.
- 27 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (12) , 4844-4857
A Unified Engine for Accelerating GNN Weighting/Aggregation Operations, With Efficient Load Balancing and Graph-Specific Caching
Graph neural networks (GNN) analysis engines are vital for real-world problems that use large graph models. Challenges for a GNN hardware platform include the ability to (a) host a variety of GNNs, (b) handle high sparsity in input vertex feature vectors and the graph adjacency matrix and the accompanying random memory access patterns, and (c) maintain load-balanced computation in the face of uneven workloads, induced by high sparsity and power-law vertex degree distributions. This paper proposes GNNIE, an accelerator designed to run a broad range of GNNs. It tackles workload imbalance by (i) splitting vertex feature operands into blocks, (ii) reordering and redistributing computations, (iii) using a novel flexible MAC architecture. It adopts a graph-specific, degree-aware caching policy that is well suited to real-world graph characteristics. The policy enhances on-chip data reuse and avoids random memory access to DRAM. GNNIE achieves average speedups of 7197× over a CPU and 17.81× over a GPU over multiple datasets on graph attention networks (GATs), graph convolutional networks (GCNs), GraphSAGE, GINConv, and DiffPool. Compared to prior approaches, GNNIE achieves an average speedup of 5× over HyGCN (which cannot implement GATs) for GCN, GraphSAGE, and GINConv. GNNIE achieves an average speedup of 1.3× over AWB-GCN (which runs only GCNs), despite using 3.4× fewer processing units.