检索结果-内蒙古大学图书馆

Prior-Boosted GRL: Microarchitecture design Space Exploration via Graph Representation Learning

IEEE Transactions on computer-Aided design of Integrated Circuits and systems 2025年第3期44卷 1141-1154页

作者： Wu, Zheng Shen, Jinyi Yi, Xiaoling Shang, Li Yang, Fan Zeng, Xuan Fudan University State Key Laboratory of Integrated Circuits and Systems The School of Microelectronics Shanghai200433 China Fudan University State Key Laboratory of Integrated Circuits and Systems Shanghai200433 China KU Leuven Department of Electrical Engineering Microelectronics Circuits and Systems Leuven3000 Belgium Fudan University State Key Laboratory of Integrated Circuits and Systems The School of Computer Science Shanghai200433 China

The design space exploration (DSE) of contemporary microprocessors faces a significant challenge of high-computational cost. In this context, we introduce Prior-boosted graph representation learning (GRL), a novel framework for the DSE of the microarchitectures the microprocessors underpinned by graph embeddings. Using GRL, Prior-boosted GRL constructs a compact and continuous vector space for design representation. This framework is further boosted by an efficient sampling algorithm informed by prior knowledge, which is instrumental in generating a superior set of initial designs to accelerate the exploration process. A well-designed ensemble surrogate model is combined with the multiobjective Bayesian optimization to explore the design space holistically within this graph-embedding domain. Rigorous experimental evaluations conducted on the RISC-V Berkeley-Out-of-Order Machine (BOOM) platform demonstrate that Prior-boosted GRL substantially surpasses preceding methods, achieving a 107.79% enhancement in Pareto front quality compared to the state-of-the-art DSE algorithm. It also outstrips manual designs on performance, power, and area metrics. As of this writing, Prior-boosted GRL holds the first place in the ICCAD 2022 CAD Contest evaluation platform. © 2024 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

ATOM: An Automatic Topology Synthesis Framework for Operational Amplifiers

引用

IEEE Transactions on computer-Aided design of Integrated Circuits and systems 2025年第3期44卷 1193-1198页

作者： Shen, Jinyi Yang, Fan Shang, Li Yan, Changhao Bi, Zhaori Zhou, Dian Zeng, Xuan Fudan University State Key Laboratory of Integrated Chips and Systems School of Microelectronics Shanghai200433 China Fudan University State Key Laboratory of Integrated Chips and Systems The School of Computer Science Shanghai200433 China Fudan University State Key Laboratory of Integrated Chips and Systems Microelectronics Department Shanghai200433 China University of Texas at Dallas Department of Electrical Engineering DallasTX75080 United States

Bayesian optimization (BO) is more efficient in automatically synthesizing operational amplifier (opamp) topologies compared to conventional methods. However, the design space for behavior-level opamp topologies involves numerous connections that are difficult to comprehend, and evaluating each topology incurs substantial computational costs. To tackle these challenges, this brief introduces ATOM, an automatic opamp topology synthesis framework. We construct a concise design space for behavior-level opamp topologies, consisting of topologies that designers can easily understand. We propose an opamp topology optimization method that incorporates freeze-thaw BO. This method efficiently explores the design space and expedites the evaluation process. Experimental studies demonstrate that ATOM outperforms state-of-the-art topology synthesis methods in terms of success rate and optimization results while reducing the number of required simulations by up to 8.15 times. The source code for ATOM is available at https://***/Jinyi-Shen/ATOM. © 2024 IEEE.

关键词： Thawing

来源：评论

学校读者我要写书评

暂无评论

ACDV: Adaptive Content Delivery for Vehicular Digital Twin Networks

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 7084-7098页

作者： Zheng, Jinkai Luan, Tom H. Li, Guanjie Yin, Zhisheng Wu, Yuan Dong, Mianxiong Dongguan University of Technology School of Electrical Engineering and Intelligentization Dongguan523808 China Xi'an Jiaotong University School of Cyber Science and Engineering Xi'an710049 China Xidian University School of Cyber Engineering Xi'an710071 China Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore Xidian University State Key Laboratory of Isn Xi'an710071 China University of Macau State Key Laboratory of Internet of Things for Smart City 999078 China University of Macau Department of Computer Information Science 999078 China Muroran Institute of Technology Department of Sciences and Informatics Muroran05-08585 Japan

Digital Twins (DTs), serving personalized cloud-based digital assistants, hold great promise for supporting infotainment applications of the Internet of Vehicles (IoVs), in which personalized content such as high-definition maps, system updates, and social video streaming can be delivered from individualized DTs to vehicular users (VUEs) to enhance the intelligence of IoV services and improve their driving experience. This paper proposes a novel content caching framework tailored to DT-enabled IoVs, where DTs selectively cache on-demand contents on edge devices (i.e., cellular base stations and roadside units) managed by the edge service manager (ESM) along the VUE's trip to avoid backbone congestion yet save download time. However, ESMs are inherently selfish and reluctant to contribute resources to cache contents without benefits. Furthermore, considering the diverse trajectories of vehicles, it is inefficient to cache data along a single path. To address these challenges, we propose ACDV, which first models the interactions between the ESMs and DTs as a Stackelberg game to incentivize ESMs to actively participate in the content caching process. We then deploy a Markov model to predict the VUE distribution, which enables DTs to cache contents with a focus on predicted trajectories. To save storage costs, we derive an upper bound of content sizes that the VUE can download within a limited network connection time. Considering the lack of network information and users' private utility model in practical scenarios, we further develop a learning-based algorithm to find the optimal pricing scheme and content size strategies of ESMs and DTs. Through extensive simulations, we show that our proposal can effectively find the optimal strategy and achieve a fast convergence speed and high-level performance compared to the baselines. © 1967-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

cVTS: A Constrained Voronoi Tree Search Method for High Dimensional Analog Circuit Synthesis 23

cVTS: A Constrained Voronoi Tree Search Method for High Dime...

引用

Proceedings of the 60th Annual ACM/IEEE design Automation Conference

作者： Aidong Zhao Xianan Wang Zixiao Lin Zhaori Bi Xudong Li Changhao Yan Fan Yang Li Shang Dian Zhou Xuan Zeng State Key Laboratory of Integrated Chips and Systems Microelectronics Department Fudan University Shanghai China Department of Electrical Engineering University of Texas at Dallas USA Department of Electrical and Computer Engineering University of California at San Diego USA School of Data Science Fudan University Shanghai China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9798350323481

A constrained Voronoi tree-based domain decomposition method for high-dimensional Bayesian optimization is proposed to solve large scale analog circuit synthesis problems, which can be formulated as high-dimensional heterogeneous black-box optimization. Hierarchical Voronoi tree progressively breaks down the design space into partitions with implicit performance boundaries such that promising regions are efficiently explored. Fast exploitation is ensured in Voronoi nest via local Bayesian optimization with a few observations. A slice-enhanced Gibbs sampling method is proposed to sample acquisition function cMES in irregular polyhedrons with design constraints. Compared with state-of-the-art methods, cVTS achieves significant speed up without loss of accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

User Grouping-Based Hierarchical Rate-Splitting Multiple Access for Reconfigurable Intelligent Surface-Assisted Downlink Communication

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Yang, Zhixiang Feng, Lei Zhou, Fanqin Xie, Kunyi Qiu, Xuesong Xiong, Zehui Yuen, Chau Han, Zhu Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Singapore University of Technology and Design Pillar of Information Systems Technology and Design Singapore487372 Singapore Nanyang Technological University School of Electrical and Electronic Engineering Singapore639798 Singapore University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The joint optimization of rate-splitting multiple access (RSMA) and reconfigurable intelligent surface (RIS) offers a mutually beneficial solution. In this paper, we study a RIS-assisted downlink user grouping-based hierarchical RSMA communication network, where the base station transmits the common streams and private streams simultaneously to serve multiple users. The sum rate (SR) optimization problem is constructed to jointly optimize user grouping, beamforming, and rate splitting. To tackle the NP-hard problem, a user grouping algorithm is first provided to form the hierarchical RSMA model. Next, an equivalent weighted minimum mean-square error (WMMSE) problem is constructed and a WMMSE-based block coordinate descent (BCD) algorithm is designed to update the remaining variables in an iterated way. Specifically, the optimization of transmit beamforming and the rate splitting matrix is reduced to solving a typical convex quadratically constrained quadratic program problem. The solution for passive beamforming is recovered from the intermediate result obtained by the manifold optimization method. Finally, the process of the BCD algorithm is presented. The numerical results indicate that the proposed scheme evidently surpasses one-layer RSMA scheme, NOMA scheme, SDMA scheme, and no RIS scheme, especially in overloaded scenarios. The proposed scheme further increases the SR of common steams compared to the hierarchical RSMA scheme and significantly reduces computational complexity compared to the generalized RSMA scheme. © 2015 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Over-the-Air Computation for Federated Generative Model Fine-Tuning in Unmanned Vehicle-Assisted Disaster Relief

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Zhao, Yikun Feng, Lei Zhou, Fanqin Li, Wenjing Xiong, Zehui Du, Hongyang Wu, Celimuge Guo, Song Quek, Tony Q.S Han, Zhu State Key Laboratory of Networking and Switching Technology Beijing100876 China Singapore University of Technology and Design Information Systems Technology and Design Pillar Singapore487372 Singapore University of Hong Kong Department of Electrical and Electronic Engineering Pok Fu Lam Hong Kong University of Electro-Communications Meta-Networking Research Center Tokyo Japan Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The utilization of emergent generative artificial intelligence (GAI) within the realm of unmanned vehicles (UVs) can boost edge intelligence and potentially enhance the efficiency and effectiveness of rescue operations. However, to facilitate specialized generative edge intelligence in dynamic UV networks, GAI models need to tap into local data and conduct online fine-tuning, and the dispersed distribution of UVs makes distributed fine-tuning paradigms crucial. Although the federated generative model fine-tuning brings a potential solution, the large number of parameter transmissions involved in its fine-tuning process are often constrained by communication bottlenecks, which are more pronounced for resource-constrained UV networks. To cope with these challenges, we introduce an energy-efficient GAI model fine-tuning framework for the hierarchical UV networks, which employs over-the-air technology to save computational resource costs for unmanned aerial vehicle (UAV) during federated aggregation within a federated learning paradigm. Thereafter, we study the resource allocation problem in the fine-tuning process of the generative model and formulate a joint optimization problem for the bandwidth allocation, power control, computation resource allocation, and denoising factor control, aiming to minimize the system energy consumption. Then, we decouple the original problem into four tractable subproblems, and propose a block coordinate descent algorithm to solve them iteratively. Particularly, we derive a closed-form solution for the denoising factor to minimize the local model uploading transmission energy consumption under a specific AirComp communication error threshold. Simulation based on the state-of-the-art generative models shows that our AirComp-assisted federated generative model fine-tuning scheme can achieve satisfactory customized field-of-view image generation capability compared with the traditional fine-tuning scheme in an energy-efficient way. © 2015 I

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Enabling Real-time Computing and Transmission Services in Large-Scale LEO Satellite Networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Guo, Binquan Zhang, Zhou Atapattu, Saman Pan, Miao Yan, Ye Xiong, Zehui Li, Hongyan Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Tianjin300457 China Singapore University of Technology and Design Pillar of Information Systems Technology and Design 487372 Singapore Hunan University College of Computer Science and Electronic Engineering Changsha410012 China University School of Engineering MelbourneVIC3000 Australia University of Houston Department of Electrical and Computer Engineering HoustonTX77204 United States Tianjin Artificial Intelligence Innovation Center Tianjin300387 China

Enhanced by onboard computing resources and inter-satellite links (ISLs), large-scale satellite networks (SNs) can supplement terrestrial networks, facilitating real-time edge computing and transmission in remote areas at low latency. This capability benefits applications such as real-time remote object tracking, vehicular edge computing, and environmental monitoring. However, different from terrestrial vehicular networks, satellite mobility and the intermittent nature of ISLs often render many computing satellites inaccessible, necessitating efficient scheduling scheme for joint computing and communication resource allocation. To meet this requirement, we investigate joint computing and transmission strategy for real-time computing applications over SNs to reduce end-to-end delays. We formulate the real-time computing and transmission problem over time-varying SNs as an integer linear programming problem. The mathematical optimization method has an exponential time complexity of O(2|L⫟| . (4 |V⫟| + 4∣ L⫟|)2|L∣) in the worst case, which grows rapidly with the growth of network sizes. Here, |V⫟| and |L⫟| denote the number of nodes and links, respectively, within the time window {\tau }. Resorting to the designed k-shortest path-based method yields a worst-case complexity of O(|V⫟|! . |V⫟|3). While efficient under common scenarios, its running time is still relatively unstable and may become tens of times longer when computing resources become scarce. To enhance efficiency, we further design a graph-based algorithm that leverages the solution space's unique structure, thereby achieving optimal solutions with polynomial time complexity O(3|L⫟| + (2\log |V⫟|+1) |V⫟|). Extensive evaluations conducted on the world's largest Starlink system validate the efficacy of the designed methods and highlight their potential synergy. © 1967-2012 IEEE.

关键词： Satellite links

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

QoE-Guaranteed Optimization in MEC-Enabled Metaverse: An Active Inference Deep Reinforcement Learning Approach

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Du, Jianbo Gong, Jie Chu, Xiaoli Xiong, Zehui Chen, Xianfu Dong, Mianxiong Yu, F. Richard Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security School of Communications and Information Engineering Xi'an710121 China The University of Sheffield Mappin Street Department of Electronic and Electrical Engineering SheffieldS1 3JD United Kingdom Singapore University of Technology and Design Information Systems Technology and Design Pillar Singapore Singapore Shenzhen CyberAray Network Technology Company Ltd Shenzhen518000 China Muroran Institute of Technology Department of Sciences and Informatics Muroran050-8585 Japan Carleton University Systems and Computer Engineering OttawaON Canada

In this paper, we consider a MEC-enabled metaverse scenario which consists of a remote metaverse server and an edge server that cooperates to provide services to mobile users. The edge server is deployed at the base station (BS), serves a dual role: augmenting computational capabilities for user equipment (UE) and pre-caching a portion of the metaverse service contents before each time slot. Moreover, the foreground information and the requested contents generated by the UEs can also be cached to the BS. We formulate a problem to maximize the cache hit number by jointly optimizing contents pre-caching and resource allocation at the BS while considering UEs preference and reducing the UEs total energy consumption, essential for the efficient delivery of services in dynamic MEC environments. To solve this problem, we reformulate it as a partially observable markov decision process and propose an active inference enabled deep reinforcement learning algorithm, which combines active inference with deep reinforcement learning to select the optimal strategy by minimizing the expected free energy. Simulations show that the proposed algorithm can effectively improve the total quality of experience and the cache hit number of UEs, while minimizing the UEs total energy consumption compared with other baseline algorithms © 2015 IEEE.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

A frequency response, harmonic distortion, and intermodulation distortion test for BIST of a sigma-delta ADC

引用

IEEE TRANSACTIONS ON CIRCUITS AND systems II-ANALOG AND DIGITAL SIGNAL PROCESSING 1996年第8期43卷 608-613页

作者： Toner, MF Roberts, GW Microelectronics and Computer Systems Laboratory Department of Electrical Engineering McGill University Montreal Canada

Built-In-Self-Test (BIST) for VLSI systems is desirable for production-time testing and in-the-field diagnostics, This brief discusses a Mixed Analog-Digital BIST (MADBIST) for a frequency response test, a harmonic distortion test and an intermodulation distortion test of an analog-to-digital converter, The MADBIST strategy for the frequency response, harmonic distortion, and intermodulation distortion tests of the ADC is introduced, accuracy issues are discussed, and preliminary experimental results are presented.

关键词： Frequency response Harmonic distortion Intermodulation distortion Built-in self-test Cellular neural networks Neural networks Circuit testing Cellular networks Optical interconnections Optical receivers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：