基于TMS320VC5410的最小系统设计

TMS320VC5410是TI公司生产的一款定点数字信号处理(DSP)芯片。基于DSP的最小系统是以其简洁的硬件结构来实现DSP的一般功能,广泛应用于工业生产、教学、科研、电子设计等领域。主要介绍了基于TMS320VC5410的最小系统硬件电路设计方案,阐述了重要电路部分的抗干扰设计和软件调试过程中应注意的若干问题。最后提出了简单易行的软件调试方法以及部分程序代码。     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

Timelike Minimal Surfaces via Loop Groups

This work consists of two parts. In Part I, we shall give a systematic study of Lorentz conformal structure from structural viewpoints. We study manifolds with split-complex structure. We apply general results on split-complex structure for the study of Lorentz surfaces.In Part II, we study the conformal realization of Lorentz surfaces in the Minkowski 3-space via conformal minimal immersions. We apply loop group theoretic Weierstrass-type representation of timelike constant mean curvature for timelike minimal surfaces. Classical integral representation formula for timelike minimal surfaces will be recovered from loop group theoretic viewpoint.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

Exceptional Θ-Correspondences I

Let G be either a split SO(2n+2), or a split adjoint group of type En, (n=6,7,8), over a p-adic field. In this article we study correspondences arising by restricting the minimal representation of G to various dual pairs in G.