A Large Language Model-based Multi-Agent Framework for Analog Circuits' Sizing Relationships Extraction

• URL: http://arxiv.org/abs/2506.18424v1
• Date: Mon, 23 Jun 2025 09:03:58 GMT
• Title: A Large Language Model-based Multi-Agent Framework for Analog Circuits' Sizing Relationships Extraction
• Authors: Chengjie Liu, Weiyu Chen, Huiyao Xu, Yuan Du, Jun Yang, Li Du,
• Abstract summary: We propose a large language model (LLM)-based multi-agent framework for analog circuits' sizing relationships extraction from academic papers.<n>We conduct tests on 3 types of circuits, and the optimization efficiency was improved by $2.32 sim 26.6 times$.
• Score: 15.623880398190103
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In the design process of the analog circuit pre-layout phase, device sizing is an important step in determining whether an analog circuit can meet the required performance metrics. Many existing techniques extract the circuit sizing task as a mathematical optimization problem to solve and continuously improve the optimization efficiency from a mathematical perspective. But they ignore the automatic introduction of prior knowledge, fail to achieve effective pruning of the search space, which thereby leads to a considerable compression margin remaining in the search space. To alleviate this problem, we propose a large language model (LLM)-based multi-agent framework for analog circuits' sizing relationships extraction from academic papers. The search space in the sizing process can be effectively pruned based on the sizing relationship extracted by this framework. Eventually, we conducted tests on 3 types of circuits, and the optimization efficiency was improved by $2.32 \sim 26.6 \times$. This work demonstrates that the LLM can effectively prune the search space for analog circuit sizing, providing a new solution for the combination of LLMs and conventional analog circuit design automation methods.

Related papers

• CROP: Circuit Retrieval and Optimization with Parameter Guidance using LLMs [4.481239665281804]
  We present CROP, the first large language model (LLM)-powered automatic VLSI design flow tuning framework.<n>Our approach includes: (1) a scalable methodology for transforming RTL source code into dense vector representations, (2) an embedding-based retrieval system for matching designs with semantically similar circuits, and (3) a retrieval-augmented generation (RAG)-enhanced LLM-guided parameter search system.<n>Experiment results demonstrate CROP's ability to achieve superior quality-of-results (QoR) with fewer iterations than existing approaches on industrial designs, including a 9.9% reduction in power consumption.
  arXiv  Detail & Related papers  (2025-07-02T20:25:47Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference [77.47238561728459]
  R-Sparse is a training-free activation sparsity approach capable of achieving high sparsity levels in advanced LLMs.<n> Experiments on Llama-2/3 and Mistral models across ten diverse tasks demonstrate that R-Sparse achieves comparable performance at 50% model-level sparsity.
  arXiv  Detail & Related papers  (2025-04-28T03:30:32Z)
• AI-Powered Agile Analog Circuit Design and Optimization [6.380907373534062]
  AI techniques are transforming analog circuit design by automating device-level tuning and enabling system-level co-optimization.<n>The combined insights highlight how AI can improve analog performance, reduce design effort, and jointly optimize analog components and application-level metrics.
  arXiv  Detail & Related papers  (2025-04-17T05:56:14Z)
• Tiered Acquisition for Constrained Bayesian Optimization: An Application to Analog Circuits [5.353688923855625]
  We propose a novel Bayesian optimization algorithm with a tiered ensemble of acquisition functions.<n>The method is validated in gain and area optimization of a two-stage Miller compensated operational amplifier in a 65 nm technology.<n>In comparison to robust baselines and state-of-the-art algorithms, this method reduces constraint violations by up to 38% and improves the target objective by up to 43%.
  arXiv  Detail & Related papers  (2024-12-23T07:41:43Z)
• Automated Placement of Analog Integrated Circuits using Priority-based Constructive Heuristic [0.0]
  We focus on the specific class of analog placement, which requires so-called pockets, their possible merging, and parametrizable minimum distances between devices. Our solution minimizes the perimeter of the circuit's bounding box and the approximated wire length. We show the quality of the proposed method on both synthetically generated and real-life industrial instances accompanied by manually created designs.
  arXiv  Detail & Related papers  (2024-10-18T07:16:59Z)
• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery.<n>Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods.<n>Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• Machine Learning Driven Global Optimisation Framework for Analog Circuit Design [0.0]
  We propose a machine learning-driven optimisation framework for analog circuit design. We employ machine learning models and spice simulations to direct the optimisation algorithm.
  arXiv  Detail & Related papers  (2024-02-27T03:51:00Z)
• Adaptive Planning Search Algorithm for Analog Circuit Verification [53.97809573610992]
  We propose a machine learning (ML) approach, which uses less simulations. We show that the proposed approach is able to provide OCCs closer to the specifications for all circuits.
  arXiv  Detail & Related papers  (2023-06-23T12:57:46Z)
• Can SAM Boost Video Super-Resolution? [78.29033914169025]
  We propose a simple yet effective module -- SAM-guidEd refinEment Module (SEEM) This light-weight plug-in module is specifically designed to leverage the attention mechanism for the generation of semantic-aware feature. We apply our SEEM to two representative methods, EDVR and BasicVSR, resulting in consistently improved performance with minimal implementation effort.
  arXiv  Detail & Related papers  (2023-05-11T02:02:53Z)
• LoRD-Net: Unfolded Deep Detection Network with Low-Resolution Receivers [104.01415343139901]
  We propose a deep detector entitled LoRD-Net for recovering information symbols from one-bit measurements. LoRD-Net has a task-based architecture dedicated to recovering the underlying signal of interest. We evaluate the proposed receiver architecture for one-bit signal recovery in wireless communications.
  arXiv  Detail & Related papers  (2021-02-05T04:26:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.