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

Ramp-Tracking Generalized Predictive Control System-Based on Second-Order Difference

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2021年第4期68卷 1283-1287页

作者： Cordero, R. Estrabis, T. Batista, E. A. Andrea, C. Q. Gentil, G. Univ Fed Mato Grosso do Sul Fac Engn Architecture & Urban Planning & Geog BR-79060270 Campo Grande MS Brazil

This brief proposes an adaptation of the Generalized Predictive Control (GPC) for ramp-reference tracking. The second-order difference operation and the plant model are used to get an augmented model with two embedded integrators and whose output is the tracking error. Differently from other GPC-based tracking algorithms, the proposed approach does not require information about the reference parameters, and the GPC prediction horizon is composed of the predicted errors instead of the expected plant outputs. Thus, the optimization function and the receding horizon strategy used in conventional GPC can be applied to get the control law. Simulation and experimental results prove that the proposed approach can successfully track constant and ramp references. The proposed method is applicable for single-input single-outputs plants. However, the mathematical background presented in this brief can be used in the development of new GPC strategies.

关键词： Mathematical model Predictive models Predictive control Cost function Circuits and systems prediction algorithms Generalized predictive control model predictive control ramp reference second-order difference tracking

来源：评论

学校读者我要写书评

暂无评论

An Innovative Transient Analysis of Adaptive Filter With Maximum Correntropy Criterion

引用

IEEE SIGNAL PROCESSING LETTERS 2022年 29卷 1689-1693页

作者： Hou, Xinyan Zhao, Haiquan Long, Xiaoqiang Minist Educ Key Lab Magnet Suspens Technol & Maglev Vehicle Beijing 100816 Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu 610031 Peoples R China

The adaptive filtering algorithm based on the maximum correntropy criterion (MCC) is very effective in suppressing non-Gaussian noises and therefore attracts widespread attentions. At present, some works have been done for study the convergence and steady-state performance analysis of the MCC algorithm, but its transient performance analysis is still an open problem. To provide a comprehensive theoretical foundation for the MCC algorithm, we propose a method for transient performance analysis based on moment generating function (MGF). Since this method can efficiently calculate the expected value of the exponential term in the iterative update equation, it can avoid the discrepancies caused by introducing some approximation methods such as Taylor expansions in the analysis process. To date, there is no precedent for using this method to analyze the transient performance of the MCC algorithm. In addition, the steady-state performance and stability conditions of the MCC algorithm are discussed based on this method. Finally, the proposed analytical method is applied to the system identification problem, and the results show that the theoretical analysis results are agree well with the Monte Carlo simulation results.

关键词： Signal processing algorithms Transient analysis Noise measurement Behavioral sciences Steady-state Kernel prediction algorithms Adaptive filtering maximum correntropy criterion moment generating function performance analysis

来源：评论

学校读者我要写书评

暂无评论

Examination of a Popular Out-of-Sequence Measurement Update Algorithm

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2011年第4期47卷 2999-3001页

作者： Guern, Jerry A. Lockheed Martin Corp IS&GS San Diego CA 92121 USA

We examine an out-of-sequence measurement (OoSM) update algorithm by Bar-Shalom. We demonstrate that "Algorithm C" is mathematically equivalent to initializing a track with the OoSM, predicting that track to the current time without process noise, then using the OoSM track as a pseudomeasurement to update the system track. We argue that a more reasonable approximation includes process noise in the OoSM prediction. Like Algorithm C, the proposed algorithm makes use only of current track information.

关键词： Algorithm design and analysis Approximation algorithms Current measurement Filtering Noise measurement prediction algorithms Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Asymptotic performance analysis for signature waveform estimation in synchronous CDMA systems

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1998年第6期46卷 1753-1757页

作者： Yuen, N Friedlander, B Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

In this correspondence, we present an asymptotic performance analysis of a subspace-based method proposed by Liu and Xu for blind signature waveform estimation in synchronous code-division multiple-access systems, In particular, we derive asymptotic, i.e., as the number of samples becomes large, expressions for the covariance of the estimated channel parameters. We also derive aln algorithm independent bound on the covariance of the estimated parameters. This bound can be used as a measure against the theoretically predicted algorithmic performance. Some insight into the achievable performance of this algorithm is obtained by numerical evaluation of the bound for two cases of interest, and the results are compared to that obtained by numerical evaluation of the theoretically predicted performance. Monte Carlo simulations are used to verify the theoretical analysis.

关键词： Performance analysis Code division multiplexing Covariance matrix Parameter estimation Multiaccess communication Algorithm design and analysis Signal processing algorithms prediction algorithms Multicast algorithms Interchannel interference

来源：评论

学校读者我要写书评

暂无评论

Robust Widely Nonlinear Quaternion Volterra Adaptive Filter Based on Recursive General Barron Algorithm and its Performance Analysis

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2024年第7期71卷 3578-3582页

作者： Liu, Qianqian Yan, Han Jiangsu Univ Technol Sch Elect & Informat Engn Changzhou 213001 Peoples R China NYU Tandon Sch Engn Brooklyn NY 11201 USA

Recent developments in signal processing have led to the introduction of a novel set of algorithms known as the quaternion-valued second-order Volterra (QSOV) least mean square family, alongside an advanced algorithm termed the widely nonlinear QSOV recursive least square (WNL-QSOV-RLS). These innovative methods are adept at handling signals in 3D and 4D dimensions. Nonetheless, their effectiveness is often challenged in real-world conditions where the error sensor is subjected to impulsive or non-Gaussian noise. Under these circumstances, algorithms relying on the MSE criterion tend to underperform or even diverge. In response to these limitations, this brief introduces the General Barron cost function (GBF), leading to the creation of a novel adaptive filter - the widely nonlinear quaternion-valued second-order Volterra adaptive filter based on recursive GBF (WNL-QSOV-RGBF) algorithm. This brief includes an extensive steady-state analysis of the WNL-QSOV-RGBF algorithm. Furthermore, the efficacy of this newly proposed algorithm, along with its family, is rigorously evaluated through simulation-based system identification and wind prediction tests. These tests unequivocally demonstrate the superior performance of the WNL-QSOV-RGBF algorithm in environments plagued by impulsive noise, compared to existing methods. Complementary to the theoretical analysis, this brief also presents a corroborative simulation study to validate the performance metrics.

关键词： Signal processing algorithms Quaternions prediction algorithms Steady-state Cost function Adaptive filters Filtering algorithms Nonlinear graph filter general robust cost function graph signal processing general Barron

来源：评论

学校读者我要写书评

暂无评论

Intelligent Base Station Placement in Urban Areas With Machine Learning

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2023年第9期22卷 2220-2224页

作者： Loh, Wei Ren Lim, Soo Yong Rafie, Irfan Farhan Mohamad Ho, Jia Sheng Tze, Kah Sheng Univ Nottingham Malaysia Dept Elect & Elect Engn Semenyih 43500 Malaysia

This letter presents a time-reliable machine learning model for accurate and rapid base station placement in urban areas. Several real-world city data are used for training the machine learning model to predict parameters such as path loss values. It is developed using supervised training and multiple regressions with the use of artificial intelligence. Parameters such as coverage dimensioning, bandwidth of frequencies, building's density and height, propagation model tuning and path loss values are used to predict the locations of base stations. Once the predicted base station position is obtained, the average percentage error is calculated against the real-world data of base station that shows an accuracy of 84%. This proves that our model is a reliable tool to predict future base station locations. This model will benefit the telecommunication industries to reduce time and cost for rapid base station planning in urban areas that see frequent changes to their landscapes.

关键词： Predictive models Base stations Mathematical models Urban areas Propagation losses Loss measurement prediction algorithms Machine learning path loss radio propagation

来源：评论

学校读者我要写书评

暂无评论

Making Video Quality Assessment Models Robust to Bit Depth

引用

IEEE SIGNAL PROCESSING LETTERS 2023年 30卷 488-492页

作者： Ebenezer, Joshua P. P. Shang, Zaixi Wu, Yongjun Wei, Hai Sethuraman, Sriram Bovik, Alan C. C. Univ Texas Lab Image & Video Engn LIVE Austin TX 78712 USA Amazon Prime Video Seattle WA 98109 USA

We introduce a novel feature set, which we call HDRMAX features, that when included into Video Quality Assessment (VQA) algorithms designed for Standard Dynamic Range (SDR) videos, sensitizes them to distortions of High Dynamic Range (HDR) videos that are inadequately accounted for by these algorithms. While these features are not specific to HDR, and also augment the equality prediction performances of VQA models on SDR content, they are especially effective on HDR. HDRMAX features modify powerful priors drawn from Natural Video Statistics (NVS) models by enhancing their measurability where they visually impact the brightest and darkest local portions of videos, thereby capturing distortions that are often poorly accounted for by existing VQA models. As a demonstration of the efficacy of our approach, we show that, while current state-of-the-art VQA models perform poorly on 10-bit HDR databases, their performances are greatly improved by the inclusion of HDRMAX features when tested on HDR and 10-bit distorted videos.

关键词： Databases Feature extraction Predictive models prediction algorithms Nonlinear distortion Dynamic range Standards High dynamic range video quality assessment

来源：评论

学校读者我要写书评

暂无评论

CALF - A CORDIC ADAPTIVE LATTICE FILTER

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1992年第4期40卷 990-993页

作者： HU, YH LIAO, HE Department of Electrical and Computer Engineering University of Wisconsin Madison Madison WI USA

CALF is a CORDIC processor implementation of the adaptive lattice filter. Unlike previously reported results which simply use the CORDIC processor to implement the lattice algorithm formulated for conventional multiply-and-accumulate type arithmetic units, reported in this correspondence is a novel adaptive normalized lattice algorithm which directly updates the rotation angles rather than the reflection coefficients. Thus, this angle updating lattice algorithm is derived specifically for implementation with a CORDIC processor. Moreover, we further modified this algorithm to a sign-sign algorithm to take advantage of the fact that the CORDIC processors only rotate a finite number of distinct rotation angles. Computer simulation results showed good converging properties even at rather coarsely quantized angles.

关键词： Lattices Adaptive filters Reflection Signal processing algorithms Arithmetic Very large scale integration Computer simulation Computational modeling prediction algorithms Computer errors

来源：评论

学校读者我要写书评

暂无评论

Evolving Order Based Affine Projection Sign Algorithm For Enhanced Adaptive Filtering

引用

IEEE SIGNAL PROCESSING LETTERS 2024年 31卷 1530-1534页

作者： Zhao, Ji Ni, Xia Li, Qiang Tang, Lingli Zhang, Hongbin Southwest Univ Sci & Technol Sch Informat Engn Mianyang 621010 Peoples R China Southwest Univ Sci & Technol Dept Social Sci Mianyang 621010 Peoples R China Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu 611731 Peoples R China

The affine projection sign algorithm (APSA) has garnered significant attention in adaptive filtering due to its exceptional robustness and reduced computational demands. Nevertheless, the inherent use of a fixed projection order in APSA can compromise filtering accuracy and convergence speed. To address this issue, we introduce an innovative strategy for dynamically updating the projection order, resulting in an enhanced version of APSA called the evolving order based APSA (E-APSA). This evolving strategy compares the instantaneous power of output error to a threshold determined by the steady-state mean-square error of APSA, thereby enabling variable projection orders. Furthermore, we provide computational complexity and convergence analyses for E-APSA. Simulation results demonstrate that, compared to other related algorithms, E-APSA offers a significantly faster convergence rate while maintaining competitive steady-state misalignment.

关键词： Convergence Vectors Steady-state Signal processing algorithms Heuristic algorithms prediction algorithms Computational complexity Adaptive filering variable projection order non-Gaussian noise affine projection sign algorithm

来源：评论

学校读者我要写书评

暂无评论

Polynomial-Decomposition-Based LPC for Formant Estimation

引用

IEEE SIGNAL PROCESSING LETTERS 2022年 29卷 1392-1396页

作者： Fu, Meijun Wang, Xiaomin Wang, Jun Southwest Jiaotong Univ Sch Comp & Artificial Intelligence Sch Informat Sci & Technol Chengdu 611756 Peoples R China Yunnan Minzu Univ Sch Math & Comp Sci Kunming 650500 Yunnan Peoples R China

This letter proposes a robust polynomial-decompo- sition-based linear prediction coding algorithm, PDLPC, for formant estimation, which can effectively eliminate merger peaks. PDLPC first combines LPC with statistical analysis to obtain the peak and suspicious merger peak screening criteria;then uses Cauchy integral formula to calculate the number of poles located in the fan-shaped area near the suspicious merger peak to determine whether the merger peak occurs;finally, utilizes division algorithm for polynomial to separate those merger peaks. The evaluations on Primi and VTR show that PDLPC is effective in separating merger peaks, and has certain competitiveness compared with some existing formant estimation algorithms.

关键词： Corporate acquisitions Estimation Signal processing algorithms prediction algorithms Statistical analysis Frequency estimation Analytical models PDLPC formant merger peak Cauchy integral formula division algorithm for polynomial

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：