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

analysis AND SYNTHESIS TECHNIQUES FOR HOPFIELD TYPE SYNCHRONOUS DISCRETE-TIME NEURAL NETWORKS WITH APPLICATION TO ASSOCIATIVE MEMORY

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS 1990年第11期37卷 1356-1366页

作者： MICHEL, AN FARRELL, JA SUN, HF CHARLES STARK DRAPER LAB INC CAMBRIDGE MA 02139 USA

A qualitative theory for synchronous discrete time Hopfield-type neural networks is established. The authors' objectives are accomplished in two phases. First, they address the analysis of the class of neural networks considered. Next, making use of these results, they develop a synthesis procedure for the class of neural networks considered. In the analysis section, techniques from the theory of large-scale interconnected dynamical systems are used to derive tests for the asymptotic stability of an equilibrium of the neural network. Estimates for the rate at which the trajectories of the network will converge from an initial condition to a final state are presented. In the synthesis section the stability tests from the analysis section are used as constraints to develop a design algorithm for associative memories. The algorithm presented guarantees that each desired memory will be stored as an equilibrium, and that each desired memory will be asymptotically stable. The applicability of these results is demonstrated by means of two specific examples.< >

关键词： Neural networks Network synthesis algorithm design and analysis Hopfield neural networks Large-scale systems System testing Asymptotic stability State estimation Stability analysis Associative memory

来源：评论

学校读者我要写书评

暂无评论

On Generalized Reed-Solomon Codes Over Commutative and Noncommutative Rings

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第9期59卷 5882-5897页

作者： Quintin, Guillaume Barbier, Morgan Chabot, Christophe Ecole Polytech Lab Informat LX X CNRS UMR 7161 F-91128 Palaiseau France Univ Caen Grp Rech Informat Image Automat & Instrumentat GR CNRS UMR6072 F-14032 Caen France Univ Grenoble 1 Lab Jean Kuntzmann CNRS UMR 5224 F-38041 Grenoble France

In this paper, we study generalized Reed-Solomon codes (GRS codes) over commutative and noncommutative rings, we show that the classical Welch-Berlekamp and Guruswami-Sudan decoding algorithms still hold in this context, and we investigate their complexities. Under some hypothesis, the study of noncommutative GRS codes over finite rings leads to the fact that GRS codes over commutative rings have better parameters than their noncommutative counterparts. Also, GRS codes over finite fields have better parameters than their commutative rings counterparts. But we also show that given a unique decoding algorithm for a GRS code over a finite field, there exists a unique decoding algorithm for a GRS code over a truncated power series ring with a better asymptotic complexity. Moreover, we generalize a lifting decoding scheme to obtain new unique and list decoding algorithms designed to work when the base ring is, for example, a Galois ring or a truncated power series ring or the ring of square matrices over the latter ring.

关键词： Algebra algorithm design and analysis decoding error correction Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

A METHOD FOR THE DELAY analysis OF RANDOM MULTIPLE-ACCESS algorithmS WHOSE DELAY PROCESS IS REGENERATIVE

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1987年第6期5卷 1051-1062页

作者： GEORGIADIS, L MERAKOS, LF PAPANTONIKAZAKOS, P UNIV CONNECTICUT DEPT ELECT & SYST ENGNSTORRSCT 06268

Random multiple-access algorithms are used to control the accessing of a common communication channel by a large population of bursty channel users. For such algorithms, the induced transmission delay is a key performance measure. A systematic method for finding the delay characteristics of random multiple-access algorithms, whose delay process is regenerative, is presented. The method uses a powerful result from the theory of regenerative processes, in effect, to reduce the problem of determining the delay moments to the problem of solving denumerable dimensional systems of linear equations. Techniques for finding tight bounds on the solutions of such systems are presented. The "0.487" algorithm is used to exemplify the method.

关键词： algorithm design and analysis Delay effects Equations Steady-state Communication system control Communication channels Optical design Satellite broadcasting Artificial satellites Data buses

来源：评论

学校读者我要写书评

暂无评论

THE RELIABILITY OF APPROXIMATE TESTABILITY MEASURES

引用

IEEE design & TEST OF COMPUTERS 1988年第6期5卷 57-67页

作者： HUISMAN, LM IBM Thomas J. Watson Research Center USA

Techniques for gauging the accuracy of approximate testability measures that estimate the random-pattern testability of gate-level faults in designs with combinational logic are considered. The measures examined are overall fault-exposure distribution, high coverage, and fault grading. Sampling techniques are compared with the Stafan and Protest approximate testability measures. For random-pattern testing, it is clear that state-of-the-art testability measures like Stafan and Protest do provide some information about the testability of single faults or complete designs, but this information is not accurate; in many areas of use they cannot compete with carefully chosen sampling techniques. The three techniques described here are applicable to testing strategies other than the random-pattern testing of stuck-at faults; they are equally useful in a weighted random-pattern testing environment, for example.

关键词： Circuit testing Circuit faults Logic testing Sampling methods algorithm design and analysis Performance analysis Accuracy Logic design Logic circuits Length measurement

来源：评论

学校读者我要写书评

暂无评论

NEW TOPOLOGICAL FORMULA AND RAPID algorithm FOR RELIABILITY analysis OF COMPLEX NETWORKS

引用

IEEE TRANSACTIONS ON RELIABILITY 1978年第2期27卷 82-100页

作者： SATYANARAYANA, A PRABHAKAR, A JAWAHARAL NEHRU TECHNOL UNIV HYDERABADINDIA

Part I derives a new topological formula for the terminalpair reliability of complex networks. The formula generates only non-cancelling terms. The non-cancelling terms in the reliability expression correspond one-to-one with the acyclic subgraphs of the given probabilistic graph. Part II introduces the concept of neutral sequences in acyclic graphs; several of their important properties are established. Based on these results a powerful algorithm for generating the reliability expression is presented. The reliability expression is obtained in symbolic factored form. Examples indicate that the present algorithm is appreciably faster than earlier methods. The properties of cyclic and acyclic graphs established in this paper are significant new results in the theory of digraphs and have further ramifications and wider application than in reliability.

关键词： algorithm design and analysis Complex networks Reliability theory Transfer functions Graph theory Reliability engineering Power generation Arithmetic

来源：评论

学校读者我要写书评

暂无评论

COMPARISON AND EXTENSIONS OF CONTROL METHODS FOR NARROW-BAND DISTURBANCE REJECTION

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1992年第10期40卷 2377-2391页

作者： SIEVERS, LA VONFLOTOW, AH MIT DEPT AERONAUT & ASTRONAUTCAMBRIDGEMA 02139

There are many different techniques for designing and implementing algorithms for the control of periodic disturbances. The methods range between discrete and analog, time invariant and adaptive, and time domain and frequency domain approaches. The goal of this paper is to provide an overview of the methods available for such narrow-band control and to show, through analysis, the strong similarities between the different methodologies. The analysis of linear time invariant feedback systems results in a suggestion of how to extend two of the LQ-based multiple-input multiple-output methodologies to achieve improved performance and stability robustness properties. In the analysis of the adaptive feedforward methods, it is concluded that the popular filtered-x LMS algorithm is useful for implementation, but is best analyzed from a classical linear time invariant feedback perspective. This perspective also then results in a suggestion of how to extend the multiple error LMS algorithm to achieve improved performance and stability robustness. Stability bounds of the adaptive feedforward approaches are derived in terms of allowable model error.

关键词： Narrowband Least squares approximation Robust stability Transfer functions algorithm design and analysis Feedback Convergence Space technology Frequency domain analysis Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

design OF EQUIRIPPLE NONRECURSIVE DIGITAL DIFFERENTIATORS AND HILBERT TRANSFORMERS USING A WEIGHTED LEAST-SQUARES TECHNIQUE

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1994年第9期42卷 2504-2509页

作者： SUNDER, S RAMACHANDRAN, V Department of Electrical and Computer Engineering Concordia University Montreal Canada

A procedure for the design of equiripple digital differentiators (DD's) and Hilbert transformers (HT's) using a weighted least-squares technique is described. This procedure involves an iterative algorithm in which the appropriate frequency-dependent weighting function that yields an equiripple design is determined. Our procedure is used in conjunction with prediction techniques for the DD and HT lengths to design DD's and HT's, respectively, satisfying prescribed specifications.

关键词： Transformers algorithm design and analysis Minimax techniques Fourier series Filters Frequency response Delay Computer errors Passband Equations

来源：评论

学校读者我要写书评

暂无评论

Applying and implementing the MPEG-4 multimedia standard

引用

IEEE MICRO 1999年第6期19卷 64-74页

作者： Kneip, J Schmale, B Möller, H Robert Bosch GmbH Dept FV SLM D-31132 Hildesheim Germany Robert Bosch GmbH Dept Adv Dev Multimedia Syst D-31132 Hildesheim Germany

MPEG-4's many algorithms and high-performance requirements pose a challenge for designers of a new generation of flexible, low-power coder/decoder VLSI implementations for mobile and portable applications.

关键词： MPEG 4 Standard Layout Decoding ISO standards IEC standards Application software Streaming media algorithm design and analysis Convergence Telecommunications

来源：评论

学校读者我要写书评

暂无评论

The tensor product: A mathematical programming language for FFTs and other fast DSP operations

引用

IEEE SIGNAL PROCESSING MAGAZINE 1992年第1期9卷 40-48页

作者： Granata, J. Conner, M. Tolimieri, R. CUNY Ctr Large Sclae Computat New York NY 10021 USA CUNY Herbert H Lehman Coll New York NY 10021 USA Univ Connecticut Storrs CT 06269 USA

The use of the tensor product as a tool for modeling and developing digital signal processing algorithms is discussed. A precise mathematical definition of the tensor product is established along with several important properties. Special tensor matrices suited for implementation on various computer architectures are then identified. The notion of the stride permutation matrix is introduced as a method of modeling operand addressing. An important connection between tensor matrices and stride permutations is made explicit. By identifying particular tensor matrices suited for implementation on a given machine the tensor product has been transformed from a mathematical convenience into an extremely useful tool for matching algorithms to computer architectures. Several design examples in which a tensor matrix multiplication is implemented on several radically different types of computer architectures are presented.< >

关键词： Tensile stress Mathematical programming Flexible printed circuits Digital signal processing Signal processing algorithms algorithm design and analysis Computer architecture Computer languages design optimization Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

TIME-EFFICIENT VLSI ARTWORK analysis algorithmS IN GOALIE2

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1989年第6期8卷 640-648页

作者： CHIANG, KW NAHAR, S LO, CY AT and T Bell Laboratories Inc. Murray Hill NJ USA

New algorithms used in the GOALIE2 circuit extraction system are presented that are based on representing VLSI layout geometries as trapezoids. These include polygon-to-trapezoid decomposition, scanline management, and output sorting. The scanline algorithm virtually eliminates the redundant computation present in similar systems. It solves the VLSI layout analysis problem in O(n+k) expected time and O( square root n) expected space, where n is the total number of input segments and k is the total number of intersection points. The new scanline algorithm is robust in what it will maintain its performance over a wide range of layout styles. Experimental results show that the running time is O(n/sup 1.0547/), i.e. that these algorithms enable one to perform VLSI layout analysis in nearly linear time.< >

关键词： Very large scale integration algorithm design and analysis Robustness Sorting Computational geometry design automation Circuit analysis computing Routing Compaction Central Processing Unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：