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

Modeling of Distributed RLC Interconnect and Transmission Line via Closed Forms and recursive algorithms

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2010年第1期18卷 119-130页

作者： Wang, Sheng-Guo Wang, Ben Univ N Carolina Coll Engn Charlotte NC 28223 USA IBM Corp Res Triangle Pk NC 27709 USA

This paper presents the closed forms of the state-space models and the recursive algorithms of the transfer function models for fast and accurate modeling of the distributed RLC interconnect and transmission lines, which may be evenly or unevenly distributed. Considered models include the distributed RLC interconnect lines with or without external source and load connection. The effective closed forms and recursive algorithms do not involve any matrix inverse, LU matrix factorization, or matrix multiplication, thus reducing the computation complexity dramatically. Especially, the computation complexity of the closed forms for any evenly or unevenly distributed RLC interconnect line circuits is only O(1) or O(m), respectively, in sense of the scalar multiplication times, where m << N of the system order. The features of new recursive algorithms are two recursive s-polynomials and the low computation complexity. Examples illustrate the new methods in both time and frequency domains. Comparing with the PSpice, the new methods can dramatically reduce the runtime of the time responses and the Bode plots by 25% - 98.5% in the examples. The results can be applied to the RLC interconnect analysis and model reduction as a key to new approach.

关键词： Closed form distributed RLC circuit interconnect modeling recursive algorithm transmission line

来源：评论

学校读者我要写书评

暂无评论

Speech Enhancement algorithm Using recursive Wavelet Shrinkage

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2016年第7期E99D卷 1945-1948页

作者： Lee, Gihyoun Na, Sung Dae Seong, KiWoong Cho, Jin-Ho Kim, Myoung Nam Kyungpook Natl Univ Dept Med & Biol Engn Grad Sch 680 Gukchaebosang Ro Daegu 41944 South Korea Kyungpook Natl Univ Hosp Dept Biomed Engn 130 Dongdeok Ro Daegu 41944 South Korea Kyungpook Natl Univ Sch Elect Engn Coll IT Engn 80 Daehakro Daegu 41566 South Korea Kyungpook Natl Univ Sch Med Dept Biomed Engn Sch Med 680 Gukchaebosang Ro Daegu 41944 South Korea

Because wavelet transforms have the characteristic of decomposing signals that are similar to the human acoustic system, speech enhancement algorithms that are based on wavelet shrinkage are widely used. In this paper, we propose a new speech enhancement algorithm of hearing aids based on wavelet shrinkage. The algorithm has multi-band threshold value and a new wavelet shrinkage function for recursive noise reduction. We performed experiments using various types of authorized speech and noise signals, and our results show that the proposed algorithm achieves significantly better performances compared with other recently proposed speech enhancement algorithms using wavelet shrinkage.

关键词： speech enhancement wavelet shrinkage recursive algorithm hearing aids

来源：评论

学校读者我要写书评

暂无评论

Fast recursive algorithms for two-dimensional thresholding

引用

PATTERN RECOGNITION 1998年第3期31卷 295-300页

作者： Gong, JA Li, LY Chen, WN Southeast Univ Res Inst Automat Nanjing 210018 Peoples R China

Two-Dimensional (2D) thresholding behaves well in segmenting images of low siginal-to-noise ratio. But the computation complexity of the conventional 2D entropic algorithm is bounded by O(L-4). In this paper, firstly, a fast recursive 2D entropic thresholding algorithm is proposed. By rewriting the formula for calculation of entropy in recurrence form, a lengthy calculation is saved. Analysis shows that the computation complexity of 2D entropic thresholding is reduced to O(L-2). The fast recursive algorithm is also used successfully in 2D Otsu thresholding method. Experimental results show that the processing time of each image is reduced from more than 2 h to less than 10 s. The required memory space is also greatly reduced. (C) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.

关键词： image segmentation thresholding recursive algorithm entropy

来源：评论

学校读者我要写书评

暂无评论

A recursive molecular sticker algorithm for the maximal clique problem

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2007年第7-8期4卷 1253-1256页

作者： Geng, Xiutang Xiao, Jianhua Xu, Jin Huazhong Univ Sci & Technol Dept Control Sci & Engn Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

Among various DNA computing algorithms, it is very important to generate an initial data pool that covers both correct and incorrect answers. However, algorithms based on brute force search are limited to problem size, since the bigger the problem, the bigger the initial data pool. In this paper, we propose a recursive molecular sticker algorithm to resolve the maximal clique problem. Some graphs with more vertices can be handled with the proposed algorithm. Particularly, our algorithm is adapted to some graphs with lower edge density. For a given graph with n vertices, the time complexity of our algorithm is O(n(2)). In addition, three kinds of enzymes, two kinds of memory strands, n kinds of stickers, n sticker tubes, n+2 separation tubes and n data tubes are necessary for our recursive molecular sticker algorithm to resolve the maximal clique problem.

关键词： DNA computing sticker model maximal clique problem recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of multi-innovation stochastic Newton recursive algorithms

引用

DIGITAL SIGNAL PROCESSING 2016年 56卷 15-23页

作者： Cao, Pengfei Luo, Xionglin Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao 266590 Peoples R China China Univ Petr Res Inst Automat Beijing 102249 Peoples R China

The stochastic Newton recursive algorithm is studied for system identification. The main advantage of this algorithm is that it has extensive form and may embrace more performance with flexible parameters. The primary problem is that the sample covariance matrix may be singular with numbers of model parameters and (or) no general input signal;such a situation hinders the identification process. Thus, the main contribution is adopting multi-innovation to correct the parameter estimation. This simple approach has been proven to solve the problem effectively and improve the identification accuracy. Combined with multi-innovation theory, two improved stochastic Newton recursive algorithms are then proposed for time-invariant and time-varying systems. The expressions of the parameter estimation error bounds have been derived via convergence analysis. The consistence and bounded convergence conclusions of the corresponding algorithms are drawn in detail, and the effect from innovation length and forgetting factor on the convergence property has been explained. The final illustrative examples demonstrate the effectiveness and the convergence properties of the recursive algorithms. (C) 2016 Elsevier Inc. All rights reserved.

关键词： System identification recursive algorithm Multi-innovation Convergence analysis

来源：评论

学校读者我要写书评

暂无评论

Real time measurement of power disturbances - Part 1. Survey and a novel complex filter approach

引用

ELECTRIC POWER SYSTEMS RESEARCH 2006年第12期76卷 1027-1032页

作者： Lin, Tao Domijan, Alexander, Jr. Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA Wuhan Univ Sch Elect Engn Wuhan 430072 Peoples R China

The accurate and real time measurement of power disturbance is a key element of protection, control, fault diagnosis, power quality monitoring and power metering in electric power systems. This paper proposes three criteria for selecting or developing an appropriate measurement technique and, based on these criteria, the performance of the measurement techniques in common use or newly developed are analysed. A novel complex filter and the associated recursive algorithm are further presented in this paper, which achieve both high measurement accuracy in all service conditions and low computational complexity. The potential applications of the proposed method are also addressed briefly, its effectiveness and superiority are ascertained in Part 2 of the series using both simulated and practical power disturbance waveforms. (c) 2006 Elsevier B.V. All rights reserved.

关键词： power quality complex filter recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Evaluating Applicability of Four recursive algorithms for Computation of the Fully Normalized Associated Legendre Functions

引用

JOURNAL OF APPLIED GEODESY 2016年第4期10卷 267-275页

作者： Lei, Weiwei Li, Kai Henan Polytech Univ Sch Geodesy & Land informat Engn High Tech Zone Century Ave 2001 Jiaozuo 454000 Henan Peoples R China Chinese Acad Sci Shanghai Astron Observ Ctr Astrogeodynam Res Shanghai 200030 Peoples R China

There are four recursive algorithms used in the computation of the fully normalized associated Legendre functions ( FNALFs): the standard forward column algorithm, the standard forward row algorithm, the recursive algorithm between every other degree, and the Belikov algorithm. These algorithms were evaluated in terms of their first relative numerical accuracy, second relative numerical accuracy, and computation speed and efficiency. The results show that when the degree n reaches 3000, both the recursive algorithm between every other degree and the Belikov algorithm are applicable for vertical bar cos theta vertical bar is an element of[0, 1], with the latter better second relative numerical accuracy than the former at a slower computation speed. In terms of vertical bar cos theta vertical bar is an element of[0, 1], the standard forward column algorithm, the recursive algorithm between every other degree, and the Belikov algorithm are applicable within degree n of 1900, and the standard forward column algorithm has the highest computation speed. The standard forward column algorithm is applicable for vertical bar cos theta vertical bar is an element of[0, 1] within degree n of 1900. This algorithm's range of applicability decreases as the degree increases beyond 1900;however, it remains applicable within a minute range when vertical bar cos theta vertical bar is approximately equal to 1. The standard forward row algorithm has the smallest range of applicability: it is only applicable within degree n of 100 for vertical bar cos theta vertical bar is an element of[0, 1], and its range of applicability decreases rapidly when the degree is greater than 100. The results of this research are expected to be useful to researchers in choosing the best algorithms for use in the computation of the FNALFs.

关键词： Fully Normalized Associated Legendre Functions recursive algorithm Relative Numerical Accuracy Computation Speed Range of Applicability

来源：评论

学校读者我要写书评

暂无评论

Two recursive algorithms for the Fourier series

引用

Japan Journal of Industrial and Applied Mathematics 1996年第2期13卷 195-202页

作者： Li, Lei Dept. of Info. Systems Engineering Aomori University Aomori 030 Japan

Numerical computation of Fourier series is an important problem of the numerical application theory. In this paper, we present two recursive algorithms for evaluation of the Fourier series, f(x) = a₀/2 + Σⁿ_i=1(a_i cos ix + b_i sin ix), where a_i and b_i are known complex constants and x is an evaluation point. Compared to some traditional algorithms, the new algorithms take only half of the arithmetic operations.

关键词： Fourier series recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

An adjusted recursive operator allocation optimization algorithm for line balancing control

An adjusted recursive operator allocation optimization algor...

引用

International Multiconference of Engineers and Computer Scientists

作者： Song, B. L. Wong, W. K. Fan, Jintu Chan, S. F. Hong Kong Polytech Univ Inst Text & Clothing Hong Kong Hong Kong Peoples R China

This paper aims to solve the operator allocation optimization problem for line balancing control under two unsatisfied conditions. With the help of a combination condition adjustment approach, an adjusted recursive op... 详细信息

ISBN: (纸本)9889867133

关键词： operator allocation optimization recursive algorithm assembly line balancing operator efficiency

来源：评论

学校读者我要写书评

暂无评论

recursive Interval State Estimation algorithm for Power System

Recursive Interval State Estimation Algorithm for Power Syst...

引用

2023 IEEE Sustainable Power and Energy Conference, iSPEC 2023

作者： Hu, Kunxi Chen, Feixiong Shao, Zhenguo Wu, Hongbin Ding, Jiaxin Zhan, Xiang College of Electrical Engineering and Automation Fuzhou University Fuzhou China

ISBN: (纸本)9798350322699

Due to the existence of measurement error and approximate theory of network model parameters, the result of power system state estimation is uncertain. Interval analysis based on iterative solution method can estimate the upper and lower bounds of system state variables, but the accuracy of estimation will be affected by interval expansion. In this paper, using a recursive solution method, an interval state estimation method for power system based on holomorphic embedding method is proposed. By introducing the holomorphic embedding method, the interval measurement equation is embedded and reconstructed, and the coefficient recursion formula after power series expansion is obtained, which is solved in recursive form, and the interval solution of state quantity is obtained. Cases show that, compared with the Monte Carlo simulation method, the proposed method is effective and can reduce the calculation time greatly. © 2023 IEEE.

关键词： holomorphic embedding method interval analysis recursive algorithm state estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：