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

IEEE Conference on Decision and Control

作者： P. Bodin L.F. Villemoes B. Wahlberg S3-Automatic Control and Signal Processing Royal Institute of Technology Stockholm Sweden

This paper deals with the problem of structure determination for generalized orthonormal basis models used in system identification. The model structure is parametrized by a pre-specified set of poles. Given this structure and experimental data a model can be estimated using linear regression techniques. Since the variance of the estimated model increases with the number of estimated parameters, the objective is to find structures that are as compact/parsimonious as possible. A natural approach would be to estimate the poles, but this leads to nonlinear optimization with possible local minima. In this paper, a best basis algorithm is derived for the generalized orthonormal rational bases. Combined with linear regression and thresholding this leads to compact transfer function representations.

关键词： Linear regression Transfer functions Signal processing algorithms System identification Parameter estimation Automatic control Board of Directors Context modeling Convergence basis algorithms

来源：评论

学校读者我要写书评

暂无评论

Frequency-shift-invariant orthonormal wavelet packet representations

Frequency-shift-invariant orthonormal wavelet packet represe...

引用

IEEE International Conference on Image Processing

作者： B.S. Krongold K. Ramchandran D.J. Jones Coordinated Science Laboratory University of Illinois Urbana IL USA

It is commonly known that wavelet expansions are very sensitive to translation of an input signal due to their dyadic structure. Without proper time alignment of the signal to the decomposition basis vectors, a compact expansion may be unattainable. Recently, work has been done to combat translation sensitivity by determining the best translation-invariant expansion of a signal with respect to a set of bases. However, the dyadic structure of wavelet expansions also results in frequency alignment sensitivity. In this work, we introduce a frequency-shifted wavelet packet library as well as an efficient best basis algorithm for determining the best signal representation among all frequency shifts of a signal.

关键词： Wavelet packets Discrete wavelet transforms Cost function Testing Time frequency analysis Libraries basis algorithms Signal representations Binary trees Contracts

来源：评论

学校读者我要写书评

暂无评论

Best basis algorithm for orthonormal shift-invariant trigonometric decomposition

Best basis algorithm for orthonormal shift-invariant trigono...

引用

IEEE Digital Signal Processing Workshop

作者： I. Cohen S. Raz D. Malah I. Schnitzer Department of Electrical Engineering Technion Israel Institute of Technology-Technion Haifa Israel Department of Applied Physics RAFAEL Advanced Defense Systems Limited Haifa Israel

Adaptive signal representations in overcomplete libraries of waveforms have been widely used. The local cosine decomposition of Coifman and Wickerhauser (see IEEE Trans. Inf. Th., vol.38, no.3, p.713-18, 1992) is modified by incorporating two degrees of freedom that increase the adaptability of the best basis. These are relative shifts between resolution levels and adaptive polarity foldings. The resultant expansion is shift-invariant, and yields adaptive time-frequency distributions which are characterized by high resolution, high concentration and suppressed cross-terms associated with the Wigner distribution.

关键词： basis algorithms Libraries Wavelet packets Time frequency analysis Signal resolution Wavelet transforms Cost function Binary trees Physics Signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

Best basis algorithm for signal enhancement

Best basis algorithm for signal enhancement

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： H.K.S. Mallat D. Donoho A.S. Willsky Stochastic Systems Group LIDS MIT Cambridge MA USA Courant Institute New York NY USA

We propose a best basis algorithm for signal enhancement in white Gaussian noise. We base our search of best basis on a criterion of minimal reconstruction error of the underlying signal. We subsequently compare our simple error criterion to the Stein (1981) unbiased risk estimator, and provide a substantiating example to demonstrate its performance. A review is also given of noise removal by thresholding and of wavepacket orthonormal bases.

关键词： basis algorithms Cost function White noise Random variables Mirrors Filter bank Frequency conversion Error analysis Random processes Additive white noise

来源：评论

学校读者我要写书评

暂无评论

Computer algebraic methods for multidimensional discrete systems

Computer algebraic methods for multidimensional discrete sys...

引用

IEEE Conference on Decision and Control

作者： E. Zerz Department of Mathematics University of Kaiserslautern Kaiserslautern Germany

This paper contributes to the behavioral approach to the theory of dynamical systems as developed by J.C. Willems and P. Rocha. It provides some computer algebraic techniques, based on the theory of Grobner bases, for... 详细信息

关键词： Multidimensional systems Polynomials Difference equations Mathematics Observability Vectors basis algorithms

来源：评论

学校读者我要写书评

暂无评论

Solving constraints over the reals-a multi-solver approach

Solving constraints over the reals-a multi-solver approach

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： P. Marti M. Rueher I3S-CNRS Université de Nice-Sophia Antipolis Sophia-Antipolis France

In this paper we introduce a multi-solver approach for solving systems of constraints over the reals. First, we informally show how a cooperation between different solvers makes it possible to solve problems that none of these solvers can tackle alone. Then, we specify a cooperative architecture based upon agents that communicate via asynchronous message passing. This architecture allows to use concurrently symbolic and numerical solvers together, in order to handle constraints over the real numbers.< >

关键词： Message passing Nonlinear equations basis algorithms Application software Thermal engineering Algebra Differential equations Calculus Sun

来源：评论

学校读者我要写书评

暂无评论

Choosing VLSI algorithms for finite field arithmetic

Choosing VLSI algorithms for finite field arithmetic

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Y. Jeong W. Burleson Department of Electrical & Computer Engineering University of Massachusetts Amherst MA USA

The authors systematically synthesize finite field multipliers in VLSI using a well-known array synthesis technique which gives good estimates of area, latency, and period. The dependency graph (DG) is mapped to signal flow graphs (SFGs) using various projection and scheduling vectors which correspond to different multipliers in GF(2/sup m/). Previous work on arithmetic in GF(2/sup m/) suggests that a dual basis multiplier uses minimum area and a standard basis multiplier has a regular structure. On the contrary, the authors claim that standard basis and dual basis algorithms have basically the same DG structure and hence similar time and area in VLSI. They derive the DGs and SPGs to compare mesh and linear VLSI implementations of the algorithms and show how previous designs can be derived from them. They also show a DG for normal basis multiplication which requires large area because of a large XOR sum of products. They also explain the proper choice of finite field arithmetic algorithms by considering the higher level of algorithms in which they are embedded.< >

关键词： Very large scale integration Galois fields Arithmetic basis algorithms Iterative algorithms Circuits Cryptography Signal synthesis Delay Polynomials

来源：评论

学校读者我要写书评

暂无评论

Modeling generic polyhedral objects with constraints

Modeling generic polyhedral objects with constraints

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： V.-D. Nguyen J.L. Mundy D. Kapur Corporate Research and Development General Electric Schenectady NY USA Department of Computer Science State University of New York Albany NY USA

A generic polyhedral model is represented as a network of nodes and constraints. Nodes are 3-D vectors representing the location and orientation of the geometric entities, or measure variables such as length or cosine. Constraints are polynomial equations in the node parameters. Modeling and recognition are viewed as solving for values of the node parameters such that all the constraint equations are satisfied and the mean square error between the model and the observed shape is minimized. Buchberger's Grobner basis algorithm and Ritt-Wu's triangulation algorithm can be used for eliminating dependent parameters as well as for detecting inconsistency among constraints. Numerical techniques are used to find the best-fit model subject to constraints.< >

关键词： Equations Length measurement Solid modeling Geometry Contracts Research and development Mean square error methods Shape basis algorithms Layout

来源：评论

学校读者我要写书评

暂无评论

INFORMATION-FLOW IN DIGITAL METAL-OXIDE SEMICONDUCTOR CIRCUITS

引用

IEEE MICRO 1989年第2期9卷 69-79页

作者： INGENBLEEK, B WOELCKEN, K MATTHAUS, C GERMAN RES CTR COMP SCI POSTFACH 1240D-5205 ST AUGUSTIN 1FED REP GER DORNIER SYST GMBH D-7990 FRIEDRICHSHAFENFED REP GER

Static algorithms designed to symbolically describe an electrical network and derive subnetworks of a given maximal size are presented. These algorithms further provide the solution order of the subnetworks. This network splitting allows for strong local feedback that would otherwise cause convergence speed problems. Signal-flow graphs that describe the influence of each element in the circuit on its neighbors serve as the basis for these algorithms. Cycles in the signal-flow graph represent feedback in an electrical network. By removing the cycles, one can naturally determine (by leveling) a favorable solution order for the differential equations and small-equation systems. The work presented here also provides the basis for designing the parallelization of a differential equation solver.

关键词： basis signal flow graphs differential equation solver Feedback algorithms Electricity basis algorithms leveling design basis parallelization Flowcharts Differential equations

来源：评论

学校读者我要写书评

暂无评论

The power of counting

The power of counting

引用

Annual Conference on Structure in Complexity Theory

作者： U. Schoning Informatik EWH Koblenz Koblenz Germany

An overview of applications and variations of counting in structural complexity theory is provided. It is argued that the capacity for exact counting is closely related with the capacity for nondeterministic complementation. Relations between counting classes and classes requiring uniqueness, such as UP, are discussed, as well as approximate counting and relativized results.< >

关键词： Complexity theory Polynomials Noise measurement basis algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：