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

Asilomar Conference on Signals, Systems & Computers

作者： Kevin T. Wagner Milos I. Doroslovacki Radar Division Naval Research Laboratory Washington DC USA Department of Electrical and Computer Engineering The George Washington University Washington DC USA

ISBN: (纸本)9781479923915

An extension of complex proportionate-type normalized least mean square algorithms is proposed and derived. This new algorithm called the complex proportionate-type affine projection algorithm helps the estimation of unknown impulse responses when the input signal is colored. The derivation of the complex proportionate-type affine projection algorithm is performed by minimizing the second norm of the weighted difference between the current estimate of the impulse response and the estimate at the next time step under constraints that multiple a posteriori output errors are zero. Several variants of the algorithm are obtained as in the case of the complex proportionate-type normalized least mean square algorithm. It is shown how to use the algorithm in the case of widely linear systems. The learning curves of the algorithms are compared for several standard gain assignment laws for colored and speech input. Through simulation it was demonstrated that the complex proportionate-type affine projection algorithm offers superior convergence performance for colored input signals relative to complex proportionate-type normalized least mean square algorithms and that using separate gains to update the real and imaginary parts of the estimated impulse response, as opposed to the same gain, improves the convergence performance.

关键词： Speech Convergence Linear systems Vectors projection algorithms Least mean square algorithms Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Transient behavior of affine projection algorithms

Transient behavior of affine projection algorithms

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Hyun-Chool Shin A.H. Sayed Department of Electrical Engineering Pohang University of Science and Technology South Korea Department of Electrical Engineering University of California Los Angeles USA

Most analytical results on affine projection algorithms assume special regression models or Gaussian regression data. The available analyses also treat different affine projection filters separately. This paper provides a unified treatment of the transient performance of a family of affine projection algorithms. The treatment relies on energy conservation arguments and does not restrict the input data to being Gaussian or white. Simulation results illustrate the analysis and the derived performance expressions.

关键词： projection algorithms Convergence Algorithm design and analysis Energy conservation Least squares approximation Vectors Filters Computational modeling Analytical models Performance analysis

来源：评论

学校读者我要写书评

暂无评论

AFFINE projection algorithms: EVOLUTION TO SMART AND FAST algorithms AND APPLICATIONS

AFFINE PROJECTION ALGORITHMS: EVOLUTION TO SMART AND FAST AL...

引用

European Signal Processing Conference

作者： Alberto Gonzalez Miguel Ferrer Felix Albu Maria de Diego Institute of Telecommunications and Multimedia Applications (iTEAM) Universitat Politecnica de Valencia Department of Electronics & Telecommunications Valahia University of Targoviste

ISBN: (纸本)9781467310680

Affine projection algorithm encompasses a family of configurable algorithms designed to improve the performance of other adaptive algorithms, mainly LMS based ones, especially when input data is highly correlated. The computational cost of the affine projection algorithm depends largely on the projection order, which in turn conditions the speed of convergence, thus high speed of convergence implies usually high computational cost. Some real-time applications (especially multichannel) using the affine projection algorithm can not be implemented in the existing general-purpose hardware, because of this several improvements of the affine projection algorithm have been proposed to make it more computationally efficient and more versatile in terms of performance. This paper outlines the evolution of the affine projection algorithm and its variants, in order to get an efficient and self-reconfigurable algorithm. Furthermore new improvements over the existing low cost and variable step size and projection order versions are proposed to give examples of the new generation of affine projection algorithms.

关键词： projection algorithms Affine In-law step size algorithms High speed evolution evolution projection

来源：评论

学校读者我要写书评

暂无评论

Comparing relaxed and non-relaxed fast affine projection adaptation algorithms

Comparing relaxed and non-relaxed fast affine projection ada...

引用

12th IEEE Digital Signal Processing Workshop/4th IEEE Signal Processing Education Workshop

作者： Ding, Heping Natl Res Council Canada Inst Microstruct Sci Ottawa ON Canada

ISBN: (纸本)1424405343

In order to provide a guideline to designers of practical adaptation systems that are based on the family of affine projection algorithms, this paper derives and verifies certain simple formulation for learning curves of relaxed and non-relaxed affine projection algorithms (APAs), to which the fast affine projection (FAP) algorithms approximate. It is observed that the formulation accurately predicts the behavior of the algorithms when the input is independent and identically distributed (i.i.d.), and gives a reasonable estimate when the input is speech - not satisfying the i.i.d. condition.

关键词： Financial advantage program Adaptive filters projection algorithms Echo cancellers Speech Noise cancellation Filtering algorithms Equations Linear systems Sampling methods

来源：评论

学校读者我要写书评

暂无评论

Using Selective Partial Update-Selective Regressor Affine projection algorithms for Adaptive Equalization in Underwater Acoustic Communications

Using Selective Partial Update-Selective Regressor Affine Pr...

引用

International Conference of Information and Communication Technology

作者： Masoumeh Soflaei Paeiz Azmi Ehsan Mostajeran Faculty of Electrical and Computer Engineering Tarbiat Modares University Faculty of Computer Science and Information Technology University of Malaya

ISBN: (纸本)9781467349901

Interference signals due to scattering from surface and reflecting from bottom is one of the most important problems of reliable communications in shallow water channels. For solving this problem, one of the best suggested ways is to use adaptive equalizers. Convergence rate and misadjustment error in adaptive algorithms have important roles in adaptive equalizer performance. In this paper, affine projection algorithm (APA), selective regressor (SR-APA) and selective partial update selective regressor affine projection algorithm (SPU-SR-APA) have been compared with conventional algorithms such as least mean square (LMS) in underwater acoustic communications. We apply experimental data from Persian Gulf for demonstrating the efficiency of the proposed methods over shallow water channel. We observe that the values of the steady-state mean square error (MSE) of SR-APA and SPU-SR-APA decrease in comparison with least mean square (LMS) algorithm. Also the family of SR-APA, SPU-SR-APA has better convergence rate than LMS type algorithm.

关键词： adaptive equalization underwater acoustic communication projection algorithms shallow water Affine In-law Adaptive algorithms adaptive equalisers Least Mean Square Persian Gulf Levamisole learning management system Mean square error

来源：评论

学校读者我要写书评

暂无评论

Low complexity kernel affine projection-type algorithms with a coherence criterion

Low complexity kernel affine projection-type algorithms with...

引用

International Conference on Signals and Systems (ICSigSys)

作者： Felix Albu Kiyoshi Nishikawa Faculty of Electronics and Information Technology Valahia University of Targoviste Targoviste Romania Faculty of System Design Tokyo Metropolitan University Tokyo Japan

ISBN: (纸本)9781509067497

In this paper, two new kernel adaptive algorithms are proposed. An approximation is used in order to derive the pseudo kernel affine projection algorithm and the pseudo kernel proportionate affine projection algorithm, respectively. The computational efficiency and performance of the proposed algorithms is verified for a nonlinear system identification application.

关键词： Kernel Algorithm design and analysis Approximation algorithms projection algorithms Complexity theory Signal processing algorithms Coherence

来源：评论

学校读者我要写书评

暂无评论

New proportionate affine projection sign algorithms

New proportionate affine projection sign algorithms

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Felix Albu H. K. Kwan Faculty of Electrical Engineering Valahia University of Targoviste Targoviste Romania Department of Electrical and Computer Engineering University of Windsor Windsor Canada

ISBN: (纸本)9781467357609

In this paper, two proportionate affine projection sign algorithms are introduced. The performance of the proposed algorithms is compared with that of other proportionate affine algorithms under impulsive interference environment of a network echo cancellation system. It is shown that one of the proposed algorithms, termed memory improved proportionate affine projection sign algorithm (MIP-APSA), is the most robust to impulsive interferences and colored inputs. It is proved that MIP-APSA is a good candidate for network echo cancellation, because of its low complexity, good convergence speed and tracking abilities for echo paths with different sparseness measures, and projection orders.

关键词： Signal processing algorithms Echo cancellers projection algorithms Robustness Convergence Interference Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Spectral coherence as a method for evaluating adaptive filtering techniques in photoplethysmography

引用

IEEE LATIN AMERICA TRANSACTIONS 2025年第4期23卷 274-284页

作者： Vazquez, Minerva Avalos, Juan-Gerardo Sanchez, Juan-Carlos Becerra, Brayans Inst Politecn Nacl Ctr Invest & Estudios Avanzados Unidad Monterrey Mexico City Nuevo Leon Mexico Inst Politecn Nacl ESIME Culhuacan Mexico City Mexico Natl Inst Cardiol Ignacio Chavez Dept Electromech Instrumentat Mexico City Mexico

In this study, we introduce a method that utilizes spectral coherence as a metric for assessing the restoration of the photoplethysmographic (PPG) pulse signal morphology when filtering myokinetic noise using adaptive filtering techniques. Unlike other approaches that simply focus on detecting peaks and valleys after filtering, our research concentrates on recovering most of the components of the PPG pulse curve, as these reveal highly important information about cardiovascular health status, and which is essential for a proper diagnosis. To record PPG signals, a photoplethysmography system was placed on both hands of the subjects. On one hand, a three-axis accelerometer was also attached to capture the myokinetic motion, while the other hand remained stationary, allowing the PPG system to record a motion-free signal. After capturing the PPG signals with and without motion, we conducted an analysis by calculating the spectral coherence of the contaminated and recovered signals after adaptive filtering. We compared noisy PPG signals with the reference signal (myokinetic motion-free PPG signal). Based on the spectral coherence criterion, the affine projection algorithm and the variable step-size affine projection algorithm were found to be the most effective for filtering a PPG signal contaminated by myokinetic noise, achieving similarity scores of 94.25% and 94.67%, respectively, between the filtered signal and the motion-free pulse signal.

关键词： Filtering Coherence Monitoring projection algorithms Photoplethysmography Hands Electronic mail Noise Detectors Visualization photoplethysmography adaptive filtering motion artifacts spectral coherence power spectral density

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：