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

Floorplanning With I/O Assignment via Feasibility-Seeking and Superiorization Methods

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2025年第1期44卷 317-330页

作者： Yu, Shan Censor, Yair Luo, Guojie Peking Univ Sch Math Sci Dept Informat & Computat Sci Beijing 100871 Peoples R China Univ Haifa Dept Math IL-3498838 Haifa Israel Peking Univ Sch Comp Sci Natl Key Lab Multimedia Informat Proc Beijing 100871 Peoples R China Peking Univ Ctr Energy Efficient Comp & Applicat Beijing 100871 Peoples R China

The feasibility-seeking approach offers a systematic framework for managing and resolving intricate constraints in continuous problems, making it a promising avenue to explore in the context of floorplanning problems with increasingly heterogeneous constraints. The classic legality constraints can be expressed as the union of convex sets. However, conventional projection-based algorithms for feasibility-seeking do not guarantee convergence in such situations, which are also heavily influenced by the initialization. We present a quantitative property about the choice of the initial point that helps good initialization and analyze the occurrence of the oscillation phenomena for bad initialization. In implementation, we introduce a resetting strategy aimed at effectively reducing the problem of algorithmic divergence in the projection-based method used for the feasibility-seeking formulation. Furthermore, we introduce the novel application of the superiorization method (SM) to floorplanning, which bridges the gap between feasibility-seeking and constrained optimization. The SM employs perturbations to steer the iterations of the feasibility-seeking algorithm toward feasible solutions with reduced (not necessarily minimal) total wirelength. Notably, the proposed algorithmic flow is adaptable to handle various constraints and variations of floorplanning problems, such as those involving I/O assignment. To evaluate the performance of perturbed resettable method of alternating projection, we conduct comprehensive experiments on the Microelectronics Center of North Carolina (MCNC) benchmarks and Gigascale Systems Research Center (GSRC) benchmarks. The results demonstrate that we can obtain legal floorplanning results $166\times $ faster than the branch-and-bound (B&B) method while incurring only a 5% wirelength increase compared to the optimal results. Furthermore, we evaluate the effectiveness of the algorithmic flow that considers the I/O assignment constraints, which ach

关键词： Design automation Convergence Pins Metaheuristics Integrated circuit modeling Benchmark testing Perturbation methods Feasibility seeking floorplanning input/output (I/O) assignment local convergence nonconvex projection algorithms superiorization method (SM)

来源：评论

学校读者我要写书评

暂无评论

Revisiting Model Reference Adaptive Control: Linear-Like Closed-Loop Behavior

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第3期70卷 1483-1498页

作者： Shahab, Mohamad T. Miller, Daniel E. King Abdullah Univ Sci & Technol KAUST Comp Elect & Math Sci & Engn CEMSE Div Thuwal 23955 Saudi Arabia Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

In this article, we examine the model reference adaptive control problem when the commonly used projection algorithm is utilized, subject to several common assumptions on the set of admissible parameters, in particular a compactness constraint as well as knowledge of the sign of the high-frequency gain. It is proven in the literature that for this setup, the closed-loop system is bounded-input bounded-state;since the closed-loop system is not linear time-invariant, this does not imply a bounded gain. Here, we prove a much crisper and detailed bound on the closed-loop behavior consisting of three terms: a decaying exponential on the initial condition, a linear-like convolution bound on the exogenous inputs, and a constant scaled by the square root of the constant in the denominator of the estimator update law;we also provide an upper bound on the two-norm of the tracking error. We then demonstrate that the same kind of bounds hold in the presence of a degree of unmodeled dynamics and plant parameter time-variation.

关键词： Adaptive control projection algorithms Convolution Stability analysis Adaptation models Vectors Standards Linear-like behavior model reference adaptive control projection algorithms robustness

来源：评论

学校读者我要写书评

暂无评论

Strong Lyapunov Functions for Linear Time-Varying Systems Under Persistency of Excitation

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第3期70卷 2028-2034页

作者： Verrelli, Cristiano Maria Tomei, Patrizio Univ Roma Tor Vergata Elect Engn Dept I-00133 Rome Italy

Linear time-varying differential equations that arise in the study of model reference adaptive identification problems are studied in both the continuous-time and the discrete-time frameworks. The original contribution of the article is to present two new strong Lyapunov functions (e.g., Lyapunov functions with negative definite derivative), assessing global uniform asymptotic stability properties under the classical persistency of excitation condition. The first Lyapunov function, in the continuous-time framework, covers general (full-order) gradient-like adaptive observer forms-possibly taking into account the presence of projection algorithms and exhibiting piecewise continuous regressor matrices-that have so far restrictively required uniform boundedness of the (everywhere defined) derivative of the regressor. The second Lyapunov function, in the discrete-time framework, owns the advantage feature of being nonanticipating (e.g., characterized by a causal time-varying matrix that is available at runtime), which allows the designer to solve further adaptation issues.

关键词： Lyapunov methods Time-varying systems Symmetric matrices Vectors Runtime Robustness projection algorithms Parameter estimation Observers Observability Adaptive identification linear time-varying systems persistency of excitation strong Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

Multitask Diffusion Adaptive Tuning Affine projection Algorithm for Distributed Model

Multitask Diffusion Adaptive Tuning Affine Projection Algori...

引用

International Electrical Engineering Congress (iEECON)

作者： Suchada Sitjongsataporn Theerayod Wiangtong Dept. of Electronic Engineering Mahanakorn Institute of Innovation (MII) Faculty of Engineering and Technology Mahanakorn University of Technology Bangkok Thailand Dept. of Electrical Engineering School of Engineering King Mongkut’s Institute of Technology Ladkrabang Bangkok Thailand

ISBN: (数字)9798331543952

ISBN: (纸本)9798331543969

This paper presents combine-then-adapt diffusion model on affine projection adaptive algorithm with adaptive tuning mechanism. An adaptive affine projection algorithm is suggested in the distributed network. Diffusion strategy involves with the combination stage and adaptation stage. By adding the extra-stage in the combination stage, the combination between nodes and inside nodes are built with the global cost function for multitask model to eliminate unknown data. As dealt with fast convergence, the adaptive tuning parameters are assigned in terms of step-size value. Experimental results reveal that this proposed algorithm is able to contribute the approving results for system identifications.

关键词： Electrical engineering Adaptation models Cost function Market research Diffusion models Data models System identification projection algorithms Tuning Convergence

来源：评论

学校读者我要写书评

暂无评论

Extraction of Fetal Electrocardiogram from Maternal Skin Electrodes using Affine projection Algorithm (APA), Recursive Least Square (RLS), and QR-RLS algorithms

Extraction of Fetal Electrocardiogram from Maternal Skin Ele...

引用

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

作者： Aryan Salmanpour Nikjoo S. Mohammad Arash Saber Tehrani Seyed Mohammad Amin Moghadas Department of Electrical and Computer Engineering University of Western Ontario London Ontario Canada Western University London ON CA Department of Electrical and Information Technology Munich University of Technology Munchen Bavaria Germany Department of Electrical and Computer Engineering University of Texas at San Antonio Texas USA

The abdominal ECG is a composite signal because it contains both the mother's and the fetus' ECG signals, but the chest ECG is supposed to have only maternal (MECG) component. In this paper, we use three different adaptive algorithms to remove FECG signal from the abdominal ECG. All procedures are applied to real multichannel ECG recordings obtained from a pregnant woman. We explain and compare the use of multichannel APA, RLS, and QR-RLS in time-domain for fetal electrocardiogram (FECG) extraction from four ECG signals recorded at the abdominal and chest areas of mother's skin. The results show that the multichannel QR-RLS is more effective than multichannel APA and RLS in this important biomedical application.

关键词： Skin Electrodes projection algorithms Least squares methods Resonance light scattering Electrocardiography Abdomen Fetus Adaptive algorithm Pregnancy

来源：评论

学校读者我要写书评

暂无评论

Almost sure convergence of consensus algorithms by relaxed projection mappings

Almost sure convergence of consensus algorithms by relaxed p...

引用

IEEE/SP Workshop on Statistical Signal Processing (SSP)

作者： Ondrej Slučiak Markus Rupp Institute of Telecommunications University of Technology Vienna Austria

In this contribution we present a stronger notion of almost sure convergence for a large class of consensus algorithms including also asynchronous updates. We introduce the concept of the so-called relaxed projection algorithms and show that many consensus algorithms can be interpreted as such relaxed projection updates. It is well known that such algorithms converge to a solution lying in the intersection of the projections. The convergence of such algorithms is, however, guaranteed only for deterministic ordering of the projections. Since we are interested in random data exchanges, we analyze the convergence in case of random orderings of the projections and show that the algorithms converge in the underrelaxed case even for time-varying and individual mixing parameters.

关键词： Signal processing algorithms Convergence Wireless sensor networks Signal processing projection algorithms Hilbert space Conferences

来源：评论

学校读者我要写书评

暂无评论

Fitting nature's basic functions Part IV: The variable projection algorithm

引用

COMPUTING IN SCIENCE & ENGINEERING 2003年第2期5卷 74-79页

作者： Rust, BW NIST Gaithersburg MD 20899 USA

For pt. III see ibid., vol. 4, no. 4, pp. 72-77 (2002). The author examines the variable projection algorithm, which often greatly simplifies nonlinear least squares calculations because it does not require iteration ... 详细信息

关键词： least squares approximations variable projection algorithm nonlinear least squares calculations iterative methods Variable projection algorithms Nonlinear least squares MACHINE SHOP PRACTICE

来源：评论

学校读者我要写书评

暂无评论

Robust Sequential projection Algorithm: Teletraffic applications

引用

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS 1997年第3期8卷 285-292页

作者： Ursini, EL Yacoub, MD DoAmaral, WC Girolami, A Telebrás Research and Development Center CPqD - Campinas - SP - Brazil Campinas State University UNICAMP - Campinas - SP - Brazil Telecommunications of S?o Paulo TELESP - S?o Paulo - SP - Brazil

An n-step ahead Robust Sequential projection Algorithm - Robust SPA -, used for traffic forecast as well as for long term network planning is proposed. The algorithm uses the State Space Model with the state transition matrix being estimated by a relaxation technique. This lightly increases its complexity, as compared to a similar algorithm proposed in the literature, but renders the Robust SPA a better performance. The algorithm is also compared with the Expectation-Maximization technique and, in general, the Robust SPA yields a slightly poorer performance as far as the mean square error between projected and observed data is concerned. On the other hand, it is more robust and requires far less computational effort. Moreover, due to its simplicity, an automated version of the algorithm can be easily implemented for applications in which a great deal of data is to be forecasted.

关键词： Traffic forecasting observational data Network planning State space models Mean square error algorithms Relaxation Techniques Robustness projection algorithms state transition matrix

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional variable step-size normalized least mean squares and affine projection adaptive filter algorithms

Two-dimensional variable step-size normalized least mean squ...

引用

Iranian Machine Vision and Image Processing (MVIP)

作者： Mohammad Shams Esfand Abadi Sahar Nikbakht Faculty of Electrical and Computer Engineering Shahid Rajaee University Tehran Iran

In this paper the new two-dimensional (TD) adaptive filter algorithms are introduced. The presented algorithms are TD variable step-size (VSS) normalized least mean squares (TD-VSS-NLMS) and TD-VSS affine projection algorithms (TD-VSS-APA). In these algorithms, the step-size changes during the adaptation which leads to the low steady-state mean square error (MSE), and fast convergence speed. We demonstrate the good performance of the derived algorithms in TD system identification and adaptive noise cancellation in digital images for image restoration.

关键词： Adaptive filters System identification Finite impulse response filter Convergence Signal processing algorithms Noise cancellation projection algorithms

来源：评论

学校读者我要写书评

暂无评论

New Affine projection Tanh-Based algorithms for Active Impulsive Noise Control

New Affine Projection Tanh-Based Algorithms for Active Impul...

引用

Measurement and Simulation (ATOMS), Advanced Topics on

作者： Felix Albu Ion Caciula Daniela Hagiescu Dept. of Electronics and Telecommunications Valahia University of Targoviste Targoviste Romania R&D Department Advanced Slisys SRL Bucharest Romania

Two new affine projection and improved proportionate affine projection tanh-based algorithms for active impulsive noise control are presented. It is shown that they can obtain better performance for active impulsive n... 详细信息

ISBN: (数字)9798350358377

ISBN: (纸本)9798350358384

关键词： Noise Filtering algorithms Attenuation measurement Atoms Control systems Attenuation Robustness Complexity theory Noise measurement projection algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：