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

MAPPING EXTENDED KALMAN FILTERS ONTO LINEAR ARRAYS

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1990年第12期35卷 1310-1319页

作者： BAHETI, RS OHALLARON, DR ITZKOWITZ, HR GE CTR CORP RES & DEV SCHENECTADY NY 12345 USA CARNEGIE MELLON UNIV SCH COMP SCI PITTSBURGH PA 15213 USA AT&T BELL LABS NAPERVILLE IL 60566 USA

Techniques for mapping extended Kalman filters onto linear arrays of programmable cells designed for real-time applications are described. First, a general method for mapping a standard (nonsquare root) Kalman filter, where the columns of the covariance matrix are updated in parallel, is introduced. Next, a general method for mapping a factorized (square root) filter, where fast Givens rotations are used to triangularize the prematrix and where rotations of the rows of the prematrix are performed in parallel, is introduced. These mappings are used to implement an extended Kalman filter commonly used in target tracking applications on the Warp computer. The Warp is a commercially available linear array of 10 or more programmable cells connected to an MC68020-based workstation. The Warp implementation of the standard Kalman filter running on 8 Warp cells achieves a measured speedup of 7 over the same filter running on a single cell. The Warp implementation of the factorized filter running on 10 Warp cells achieves a measured speedup of 2.< >

关键词： Filters Target tracking Workstations Measurement standards Velocity measurement algorithm design and analysis Parallel algorithms Very large scale integration Parallel machines

来源：评论

学校读者我要写书评

暂无评论

ON THE HORIZON - FAST CHIPS QUICKLY

引用

IEEE SPECTRUM 1984年第3期21卷 28-34页

作者： WALLICH, P IEEE Spectrum New York NY USA

A discussion is presented of obstacles on the path toward more sophisticated silicon compilers. An examination is also made of the gap between the ultimate compilers and those now coming into use and the uncertainty over exactly what a silicon compiler is, how compilers work, the various architectural options, and the use of the expert-system approach to design.

关键词： Silicon compiler Humans Layout Silicon algorithm design and analysis Computer architecture Programmable logic arrays

来源：评论

学校读者我要写书评

暂无评论

WAVE-FRONT ARRAY PROCESSORS - CONCEPT TO IMPLEMENTATION

引用

COMPUTER 1987年第7期20卷 18-33页

作者： KUNG, SY LO, SC JEAN, SN HWANG, JN University of Southern California

First Page of the Article

关键词： Systolic arrays Signal processing Image processing Signal processing algorithms Very large scale integration Parallel processing Concurrent computing Pipeline processing algorithm design and analysis Flow graphs

来源：评论

学校读者我要写书评

暂无评论

COMPUTING THE ASPECT GRAPH FOR LINE DRAWINGS OF POLYHEDRAL OBJECTS

引用

IEEE TRANSACTIONS ON PATTERN analysis AND MACHINE INTELLIGENCE 1990年第2期12卷 113-122页

作者： GIGUS, Z MALIK, J Dept. of Electr. Eng. & Comput. Sci. California Univ. Berkeley CA USA

An algorithm for computing the aspect graph for polyhedral objects is described. The aspects graph is a representation of three-dimensional objects by a set of two-dimensional views. The set of viewpoints on the Gaussian sphere is partitioned into regions such that in each region the qualitative structure of the line drawing remains the same. At the boundaries between adjacent regions are the accidental viewpoints where the structure for the line drawing changes. It is shown that for polyhedral objects there are two fundamental visual events: (1) the projections of an edge and a vertex coincide; and (2) the projections of three nonadjacent edges intersect at a point. The geometry of the object is reflected in the locus of the accidental viewpoints. The algorithm computes the partition together with a representative view for each region of the partition.

关键词： Partitioning algorithms Object recognition Geometry Shape Computer science algorithm design and analysis INSPEC: Controlled Indexing picture processing computational geometry graph theory pattern recognition INSPEC: Non-Controlled Indexing geometry 3D object representation picture processing edge projection pattern recognition aspect graph line drawings polyhedral objects Gaussian sphere accidental viewpoints vertex

来源：评论

学校读者我要写书评

暂无评论

An efficient controller scheme for MPEG-2 video decoder

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 1998年第2期44卷 451-458页

作者： Ling, N Wang, NT Ho, DJ Santa Clara Univ Dept Comp Engn Santa Clara CA 95053 USA Nanyang Technol Univ Sch EEE Singapore 639798 Singapore

A video decoder with an efficient block-level-pipeline controller scheme for MPEG-2 MP@ML is presented in this paper. The architecture in most of the reported literature for MPEG-2 MP@ML video uses a 64-bit bus and a complex bus arbitration scheme to communicate with external DRAM, display, and incoming FIFO. Our design imposes a certain order in the DRAM access by various processing units instead of allowing any processing unit within the decoder to request bus access arbitrarily. This efficient DRAM accessing order allows us to reduce bus width from 64 bits to 32 bits, without significantly increasing embedded buffer sizes, and still meet the requirements for MPEG-2 MP@ML real-time decoding. The bus arbitration algorithm is also simple, allowing for a less complex controller design.

关键词： Decoding Random access memory Pipelines Computer architecture Displays Signal processing algorithms Delay Costs Video signal processing algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

THE USE OF SMALL PIVOT PERTURBATION IN CIRCUIT analysis

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1991年第11期10卷 1441-1446页

作者： MACINNES, C IBM CORP DIV GEN TECHNOLE FISHKILL FACILHOPEWELL JUNCTIONNY 12533

In the analysis of large electrical circuits, encompassing thousands of nodes and circuit elements, sparse matrix techniques are essential to the efficient solution of the resulting sparse linear systems. The maintenance of sparsity during Gaussian elimination is of paramount importance. In an attempt to preserve sparsity during Gaussian elimination, circuit analysis programs such as ASTAP [1] and AS/X [9] permute rows and columns of the circuit matrix using the Markowitz reordering technique [4];this is done prior to the execution of the analysis algorithm. Since row and/or column pivoting during the analysis would tend to destroy the initial sparsity-preserving arrangement of rows and columns, this is not allowed at, possibly, the expense of solution accuracy. A technique, termed small pivot perturbation (SPP), is presented which can improved the accuracy of Gaussian elimination in those cases where small pivot magnitudes are encountered during the Gaussian elimination procedure, thus avoiding an inaccurate solution and allowing the analysis to continue. The SPP technique is applicable to either time-domain or frequency-domain analysis and is especially useful with circuit equation formulations where "perfect cancellation" can occur during Gaussian elimination, such as in some implementations of the modified nodal formulation [2], [3].

关键词： Circuit analysis Matrix decomposition design automation Sparse matrices Linear systems Equations Computer errors algorithm design and analysis Time domain analysis Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

A SYNTHESIS PROCEDURE FOR BRAIN-STATE-IN-A-BOX NEURAL NETWORKS

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS 1995年第5期6卷 1071-1080页

作者： PERFETTI, R Istituto di Elettronica University of Perugia Perugia Italy

In this paper, some new qualitative properties of discrete-time neural networks based on the ''brain-state-in-a-box'' model are presented. These properties concern both the characterization of equilibrium points and the global dynamical behavior, Next, the analysis results are used as guidelines in developing an efficient synthesis procedure for networks that function as associative memories, A constrained design algorithm is presented that gives completely stable dynamical neural networks sharing some interesting features. It is guaranteed the absence of nonbinary stable equilibria, that is stable states with nonsaturated components, It is guaranteed that in close proximity (Hamming distance one) of the stored patterns there is no other binary equilibrium point, Moreover, the presented method allows one to optimize a design parameter that controls the size of the attraction basins of the stored vectors and the accuracy needed in a digital realization of the network, Some design examples and computer simulations are presented to demonstrate the effectiveness of the proposed method.

关键词： Network synthesis Biological neural networks Associative memory Guidelines Stability Error correction Brain modeling algorithm design and analysis Hamming distance design optimization

来源：评论

学校读者我要写书评

暂无评论

LIST VITERBI DECODING algorithmS WITH APPLICATIONS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1994年第2-4期42卷 313-323页

作者： SESHADRI, N SUNDBERG, CEW AT&T Bell Labs. Murray Hill NJ

A list Viterbi decoding algorithm (LVA) produces a rank ordered list of the L globally best candidates after a trellis search. Here, we present two such algorithms, (i) a parallel LVA that simultaneously produces the L best candidates and (ii) a serial LVA that iteratively produces the k(th) best candidate based on knowledge of the previously found k-1 best paths. The application of LVA to a concatenated communication system consisting of an inner convolutional code and an outer error detecting code is considered in detail. analysis as well as simulation results show that significant improvement in error performance is obtained when the inner decoder, which is conventionally based on the Viterbi algorithm (VA), is replaced by the LVA. An improvement of up to 3 dB is obtained for the additive white Gaussian noise (AWGN) channel due to an increase in the minimum Euclidean distance. Ever larger gains are obtained for the Rayleigh fading channel due to an increase in the time diversity. It is also shown that a 10% improvement in throughput is obtained along with significantly reduced probability of a decoding failure for a hybrid FEC/ARQ scheme with the inner code being a rate compatible punctured convolutional (RCPC) code.

关键词： Viterbi algorithm Iterative algorithms AWGN Iterative decoding Convolutional codes Concatenated codes Performance analysis algorithm design and analysis Analytical models Additive white noise

来源：评论

学校读者我要写书评

暂无评论

THE USE OF MODIFIED CONSTELLATION GRAPH METHOD FOR COMPUTER-AIDED CLASSIFICATION OF CONGENITAL HEART-DISEASES

引用

IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 1991年第8期38卷 814-820页

作者： SEKIYA, T WATANABE, A SAITO, M UNIV TOKYO FAC MEDINST MED ELECTRTOKYO 113JAPAN

This paper describes a new method of data reduction and classification in a multidimensional symptom space for diagnostic aid of congenital heart diseases. The algorithm developed here is to reduce interactively a multidimensional symptom space to sectorial regions representing each disease in a semicircle using the modified constellation graph method. This method enables us to classify patients using the angle in the semicircle as a single classifying parameter with an accuracy of about 90%, that is, with little overlapping between disease sectors. Comparing this method with conventional factor analysis, we have found the former far more effective than the latter for disease region separation.

关键词： Heart Cardiac disease Cardiovascular diseases Multidimensional systems Medical diagnostic imaging Decision making Medical diagnosis Medical treatment Decision trees algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

DETECTION IN MULTIVARIATE NON-GAUSSIAN NOISE

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1994年第2-4期42卷 1672-1683页

作者： WONG, BCY BLAKE, IF UNIV WATERLOO DEPT ELECT ENGN WATERLOO N2L 3G1 ONTARIO CANADA

The applications of multivariate Edgeworth series and higher-order statistics to the discrete-time detection of a known constant signal in multivariate non-Gaussian noise are considered. A technique to derive suboptimum detectors from the Neyman-Pearson optimum and locally optimum detectors is described. A numerical algorithm based on knowledge of the noise cumulants is presented in order to analyze the finite-sample size performance of the suboptimum detectors. As an example, the performance of the detectors as compared with the linear detector in multivariate Gaussian-Gaussian mixture noise is presented via receiver operating characteristic curves. Numerical results indicate that the suboptimum detectors, when exploiting knowledge of the dependence structure of the noise, can have very good performance with respect to the linear detector.

关键词： Detectors Working environment noise Gaussian noise Additive noise Higher order statistics Performance analysis algorithm design and analysis Surges Buildings Face detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：