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

PARALLEL PROCESSING OF ALGEBRAIC EXPRESSIONS

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS 1966年第1期EC15卷 82-+页

作者： HELLERMAN, H IBM Corporation Systems Research Institute New York NY USA

A classification of the objectives and types of parallel processing gives the context of the prinicipal subjects of this paper. A compiler and machine organization which are capable of detecting opportunities for parallel processing in algebraic expressions and executing these by multiple processing units operating concurrently are described. The compiler algorithm, based on a tree structure of algebraic expressions, translates the expression into an object program containing concurrency groups of instructions. Within each such group. all of the instructions can be executed at the same time. The machine organization (described in a schematic way) includes a simple control for executing the object program by allocating instructions to processors within a group and interlocking advance to the next group until execution of the current group is completed.

关键词： Parallel processing Computational modeling Digital simulation Computer simulation Analog computers Springs Program processors Adders Concurrent computing algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

ON THE REPAIR OF REDUNDANT RAMS

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1987年第2期6卷 222-231页

作者： WEY, CL LOMBARDI, F UNIV COLORADO DEPT ELECT & COMP ENGNBOULDERCO 80309

This paper describes a set of novel conditions that can be integrated in a computer-aided-testing (CAT) package for repair of redundant RAM's. A new approach is proposed; the innovative feature of this approach is the independence of analysis on the distribution of faulty bits in memory. This results in better exploitation of redundancy and efficient adaptability of this technique to various testing methods, such as the ones that employ region totalizers and fault counters. algorithms that provide repair solution and earliest detection of unrepairability of a device are presented. The benefits that result by using this approach include a reduction in repair time. Conditions of unrepairability are given as a function of the number of spare resources (columns and rows) in the redundant memory; significant improvement over existing techniques is accomplished. Simulation results are provided to substantiate the validity of the proposed theory.

关键词： Testing Circuit faults Redundancy Very large scale integration Read-write memory Random access memory Production Decoding algorithm design and analysis Packaging

来源：评论

学校读者我要写书评

暂无评论

CONVERGENCE OF TEAMS AND HIERARCHIES OF LEARNING AUTOMATA IN CONNECTIONIST SYSTEMS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1995年第11期25卷 1459-1469页

作者： THATHACHAR, MAL PHANSALKAR, VV Department of Electrical Engineering Indian Institute of Science Bangalore India

Learning algorithms for feedforward connectionist systems in a reinforcement learning environment are developed and analyzed in this paper. The connectionist system is made of units of groups of learning automata, The learning algorithm used is the L(R-I) and the asymptotic behavior of this algorithm is approximated by an Ordinary Differential Equation (ODE) for low values of the learning parameter, This is done using weak convergence techniques, The reinforcement learning model is used to pose the goal of the system as a constrained optimization problem, It is shown that the ODE, and hence the algorithm exhibits local convergence properties, converging to local solutions of the related optimization problem, The three layer pattern recognition network is used as an example to show that the system does behave as predicted and reasonable rates of convergence are obtained, Simulations also show that the algorithm is robust to noise.

关键词： Convergence Learning automata Pattern recognition algorithm design and analysis Differential equations Noise robustness Constraint optimization Stochastic resonance Working environment noise Availability

来源：评论

学校读者我要写书评

暂无评论

THE QUANTIZATION EFFECTS OF THE CORDIC algorithm

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1992年第4期40卷 834-844页

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

The coordinate rotation digital computer (CORDIC) is a rotation-based arithmetic computing algorithm which has found many important digital signal processing applications. In this paper, a detailed analysis of the quantization error encountered in the CORDIC algorithm is presented. Two types of quantization error are examined: One is an approximation error due to the quantized representation of rotation angles. The other is a rounding error due to the finite precision representation in both fixed point and floating point arithmetic. Tight error bounds for these two types of error are derived. The rounding error due to a scaling (normalization) operation in the CORDIC algorithm is also discussed. Lastly, an expression for overall quantization error is derived and several simulation examples are presented.

关键词： Quantization Signal processing algorithms algorithm design and analysis Iterative algorithms Computer errors Roundoff errors Vectors Digital arithmetic Very large scale integration Process design

来源：评论

学校读者我要写书评

暂无评论

A divide-and-conquer-based algorithm for automatic simulation vector generation

引用

IEEE design & TEST OF COMPUTERS 2004年第2期21卷 111-120页

作者： Yen, CC Jou, JY Chen, KC Natl Chiao Tung Univ Dept Elect Engn Hsinchu 300 Taiwan Cadence Design Syst San Jose CA 95134 USA

Divide-and-conquer is a natural way to cope with the complexity of automatic testbench generation. The key to developing an effective divide-and-conquer approach is to identify the partitioning boundaries where interactions among divided components are minimized. The authors propose a novel design decomposition scheme and show how it can help improve the performance of constraint solving for test generation.

关键词： Testing State-space methods Partitioning algorithms algorithm design and analysis Data structures Boolean functions Monitoring Writing Runtime design methodology

来源：评论

学校读者我要写书评

暂无评论

A COMPARATIVE-analysis OF DIGITAL RELAYING algorithmS FOR THE DIFFERENTIAL PROTECTION OF 3 PHASE TRANSFORMERS

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1988年第3期3卷 1378-1384页

作者： HABIB, M MARIN, MA HYDRO QUEBEC INST RES VARENNES J0L 2P0QUEBECCANADA

The authors present a survey and a comparative analysis of various algorithms introduced for the differential protection of three-phase transformers. After a brief review of the concept, the problems associated with the differential protection of transformers, and the existing solutions as implemented with conventional (electromagnetic) relays, the algorithms introduced for digital relaying are outlined. Some of these algorithms are derived from conventional protection methods while others represent novel methods. They are analyzed in view of how well they address the two subproblems of differential protection per se and exciting-current detection. Finally, a simple ranking procedure is introduced. Two optimality performance indices, based on time and frequency, are defined and used as a basis for a comparison of the algorithm presented.< >

关键词： algorithm design and analysis Digital relays Protective relaying Surge protection Power system relaying Power system protection Phase transformers Performance analysis Current transformers Power transformers

来源：评论

学校读者我要写书评

暂无评论

High performance finite element approximate inverse preconditioning

引用

APPLIED MATHEMATICS AND COMPUTATION 2008年第1-2期201卷 293-304页

作者： Giannoutakis, Konstantinos M. Gravvanis, George A. Democritus Univ Thrace Dept Elect & Comp Engn Sch Engn GR-67100 Xanthi Greece

A new parallel normalized optimized approximate inverse algorithm, based on the concept of the "fish bone" computational approach satisfying an antidiagonal data dependency, for computing classes of explicit approximate inverses, is introduced for symmetric multiprocessor systems. The parallel normalized explicit approximate inverses are used in conjunction with parallel normalized explicit preconditioned conjugate gradient square schemes, for the efficient solution of finite element sparse linear systems. The parallel design and implementation issues of the new proposed algorithms are discussed and the parallel performance is presented, using OpenMP. (c) 2007 Elsevier Inc. All rights reserved.

关键词： algorithm design and analysis concurrent programming numerical algorithms and problems sparse linear systems iterative solution techniques parallel algorithms parallelism and concurrency

来源：评论

学校读者我要写书评

暂无评论

TRACKING analysis OF THE SIGN algorithm IN NONSTATIONARY ENVIRONMENTS

引用

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1990年第12期38卷 2046-2057页

作者： CHO, SH MATHEWS, VJ UNIV UTAH DEPT ELECT ENGNSALT LAKE CITYUT 84112

A tracking analysis of the adaptive filters equipped with the sign algorithm and operating in nonstationary environments is presented. Under the assumption that the nonstationary can be modeled using a random disturbance, it is shown that the long-term time average of the mean-absolute error is bounded, and that there exists an optimal choice of the convergence constant mu which minimizes this quality. Applying the commonly used independence assumption, and under the assumption that the nonstationarity is solely due to the time-varying behavior of the optimal coefficients, it is shown that the distributions of the successive coefficient misalignment vectors converge to a limiting distribution when the adaptive filter is used in the system identification mode. Finally, under the additional assumption that the signals involved are zero mean and Gaussian, a set of nonlinear difference equations is derived that characterizes the mean and mean-squared behavior of the filter coefficients and the mean-squared estimation error during adaptation and tracking. Results of several experiments that show very good correlation with the theoretical analyses are presented.< >

关键词： algorithm design and analysis Adaptive filters Convergence Difference equations Estimation error Cities and towns Least squares approximation Adaptive algorithm Performance analysis

来源：评论

学校读者我要写书评

暂无评论

AN ITERATIVE METHOD FOR designING SEPARABLE WIENER FILTERS

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1995年第1期43卷 262-271页

作者： YOO, CD BACE, MM LIM, JS Research Laboratory of Electronics Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge MA USA

In this paper, we present a technique for designing the optimal (in the mean square error sense) separable 2-D filter for recovering a signal from a noise-corrupted signal when the joint statistics of the signal and noise are known. A set of nonlinear equations in the design parameters is derived, and an iterative algorithm to solve them is presented, The algorithm is shown to be nondivergent in theory and rapidly convergent in practice. The results of applying the separable filter design algorithm to several typical image recovery problems are given, In most cases, the performance of the resulting separable filter is similar to that of the optimal nonseparable filter with the same region of support.

关键词： Iterative methods design methodology Wiener filter Iterative algorithms algorithm design and analysis Signal design Mean square error methods Error analysis Nonlinear equations Image converters

来源：评论

学校读者我要写书评

暂无评论

RESOLUTION THRESHOLD OF BEAMSPACE MUSIC FOR 2 CLOSELY SPACED EMITTERS

引用

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1990年第9期38卷 1545-1559页

作者： LEE, HB WENGROVITZ, MS Atlantic Aerospace Electronics Corporation Waltham MA USA

An analysis of a beamspace version of the MUSIC algorithm applicable to two closely spaced emitters in diverse scenarios is presented. Specifically, the analysis is applicable to uncorrelated far-field emitters of any relative power level, confined to a known plane, and observed by an arbitrary array of omnidirectional sensors. An expression for the threshold array signal-to-noise ratio at which beamspace MUSIC is able to resolve the emitters is obtained. The preprocessor that minimizes the resolution threshold is identified. It is demonstrated that the resolution threshold is proportional to the dimension of the noise subspace; therefore, the threshold can be reduced substantially by utilizing an appropriate beamformer to reduce the dimension of the noise subspace. It is also demonstrated that MUSIC in conjunction with a suitable preprocessor can provide a resolution threshold lower than conventional (sensor-space) MinNorm.< >

关键词： Multiple signal classification Sensor arrays Signal resolution Signal to noise ratio Spatial resolution Colored noise Noise reduction Array signal processing algorithm design and analysis Navigation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：