共查询到20条相似文献,搜索用时 31 毫秒
1.
A method is presented for the decomposition of the frequency domain of 2-D linear systems into two equivalent 1-D systems having dynamics in different directions and connected by a feedback system. It is shown that under some assumptions the decomposition problem can be reduced to finding a realizable solution to the matrix polynomial equation X (z 1)P (z 2 )+Q (z 1)Y (z 2 )=D (z 1, z 2). A procedure for finding a realizable solution X (z 1 ), Y (z 2) to the equation is given 相似文献
2.
Simultaneous controller design for linear time-invariant systems 总被引:1,自引:0,他引:1
The use of generalized sampled-data hold functions (GSHF) in the problem of simultaneous controller design for linear time-invariant plants is discussed. This problem can be stated as follows: given plants P 1, P 2, . . ., P N , find a controller C which achieves not only simultaneous stability, but also simultaneous optimal performance in the N given systems. By this, it is meant that C must optimize an overall cost function reflecting the closed-loop performance of each plant when it is regulated by C . The problem is solved in three aspects: simultaneous stabilization, simultaneous optimal quadratic performance, and simultaneous pole assignment in combination with simultaneous intersampling performance 相似文献
3.
Considers the polynomial P (s )=t 0 S n+t 1 S n-1 +···+t n where 0<a j⩽t j⩽b j. Recently, V.L. Kharitonov (1978) derived a necessary and sufficient condition for this polynomial to have only zeros in the open left-half plane. Two lemmas are derived to investigate the existence of theorems similar to the theorem of Kharitonov. Using these lemmas, the theorem of Kharitonov is generalized for P(s) to have only zeros within a sector in the complex plane. The aperiodic case is also considered 相似文献
4.
Averbuch A. Itzikowitz S. Kapon T. 《Parallel and Distributed Systems, IEEE Transactions on》1991,2(2):242-252
The implementations of the Viterbi algorithm (VA) and the interacting multiple model (IMM) algorithm on a shared-bus and shared-memory multiple-input multiple-data (MIMD) multiprocessor are discussed. The computational complexity as well as the speedup and efficiency are examined in detail. It is shown that the computational complexity of the parallel implementation of these algorithms is about the same in both memory space and processing time categories. Efficiency with P processors is about 1-1/P for small P and is expected to be relatively high for large P , especially when many filters and large state and measurement vectors are considered 相似文献
5.
The problem of tightly bounding and shaping the frequency responses of two objective functions T i(s )( i =1,2) associated with a closed-loop system is considered. It is proposed that an effective way of doing this is to minimize (or bound) the function max {∥T 1(s )∥ ∞, ∥T 2(s)∥∞} subject to internal stability of the closed-loop system. The problem is formulated as an H ∞ control problem, and an iterative solution is given 相似文献
6.
Let a family of polynomials be P (s )=t 0s n+t 1s n±1 + . . . + t n where 0<a j⩽t j⩽b j. V.L. Kharitonov (1978) derived a necessary and sufficient condition for the above equation to have only zeros in the open left-half plane. The present authors derive some similar results for the equation to be strictly aperiodic (distinct real roots) 相似文献
7.
It is proved that placing the poles of a linear time-invariant system arbitrarily far to the left of the imaginary axis is not possible if small perturbations in the model coefficients are taken into account. Given a nominal controllable system (A 0, B 0) with one input and at least two states and an open ball around B 0 (no matter how small), there exists a real number γ and a perturbation B within that ball such that for any feedback matrix K placing the eigenvalues of A 0+B 0K to the left of Res=γ, there is an eigenvalue of A 0+BK with real part not less than γ 相似文献
8.
Frankl P.G. Weyuker E.J. 《IEEE transactions on pattern analysis and machine intelligence》1993,19(3):202-213
Several relationships between software testing criteria, each induced by a relation between the corresponding multisets of subdomains, are examined. The authors discuss whether for each relation R and each pair of criteria, C 1 and C 2 , R (C 1, C 2) guarantees that C 1 is better at detecting faults than C 2 according to various probabilistic measures of fault-detecting ability. It is shown that the fact that C 1 subsumes C 2 does not guarantee that C 1 is better at detecting faults. Relations that strengthen the subsumption relation and that have more bearing on fault-detecting ability are introduced 相似文献
9.
Let a family of polynomials be P (s )=t 0S n+t 1s n-1 . . .+t n where O <α j⩽t j⩽β. Recently, C.B. Soh and C.S. Berger have shown that a necessary and sufficient condition for this equation to have a damping ratio of φ is that the 2n+1 polynomials in it which have t k=αk or t k=βk have a damping ratio of φ. The authors derive a more powerful result requiring only eight polynomials to be Hurwitz for the equation to have a damping ratio of φ using Kharitonov's theorem for complex polynomials 相似文献
10.
The worst-case effect of a disturbance system on the H 2 norm of the system is analyzed. An explicit expression is given for the worst-case H 2 norm when the disturbance system is allowed to vary over all nonlinear, time-varying and possibly noncausal systems with bounded L 2-induced operator norm. An upper bound for this measure, which is equal to the worst-case H 2 norm if the exogeneous input is scalar, is defined. Some further analysis of this upper bound is done, and a method to design controllers which minimize this upper bound over all robustly stabilizing controllers is given. The latter is done by relating this upper bound to a parameterized version of the auxiliary cost function studied in the literature 相似文献
11.
The solution of the l 1 sensitivity minimization problem is shown to have two properties which contrast markedly with properties of the solutions to the better-known H ∞ sensitivity minimization problem or the LQG (linear quadratic Gaussian) problem is given of a one-parameter family of first-order plants where the order of the l 1-optimal compensator can be arbitrarily large, and thus it is impossible to bound the order of an l 1-optimal compensator in terms of the order of the plant. A plant is considered which has a continuous one-parameter family of l 1-optimal compensators, and thus l 1-optimal compensators need not be unique. The author's two examples are considered to answer two questions left open by M.A. Daleh and J.B. Pearson (ibid., vol.32, p.314-23, 1987) 相似文献
12.
It is shown that H ∞ optimization is equivalent to weighted H 2 optimization in the sense that the solution of the latter problem also solves the former. The weighting rational matrix that achieves this equivalence is explicitly computed in terms of a state-space realization. The authors do not suggest transforming H ∞ optimization problems to H 2 optimization problems as a computational approach. Rather, their results reveal an interesting connection between H ∞ and H 2 optimization problems which is expected to offer additional insight. For example, H 2 optimal controllers are known to have an optimal observer-full state feedback structure. The result obtained shows that the minimum entropy solution of H ∞ optimal control problems can be obtained as an H 2 optimal solution. Therefore, it can be expected that the corresponding H ∞ optimal controller has an optimal observer-full state feedback structure 相似文献
13.
In a general algebraic framework, starting with a bicoprime factorization P =N prD -1 N pl, a right-coprime factorization N p D p-1, a left-coprime factorization D -1pN p, and the generalized Bezout identities associated with the pairs (N p, D p) and (D ˜ p, N ˜p) are obtained. The set of all H -stabilizing compensators for P in the unity-feedback configuration S (P , C ) are expressed in terms of (N pr, D , N pt) and the elements of the Bezout identity. The state-space representation P =C (sI -A )-1B is included as an example 相似文献
14.
A necessary and sufficient condition is presented for the solution of the row-by-row decoupling problem (known as Morgan's problem) in the general case, that is, without any restrictive assumption added to the system to the feedback law u =Fx +Gy (G may be noninvertible). This is a structural condition in terms of invariant lists of integers which are easily computable from a given state realization of the system. These integers are the infinite zero orders (Morse's list I 4) and the essential orders of the system, which only depend on the input-output behavior, and Morse's list I 2 of the system, which depends on the choice of a particular state realization 相似文献
15.
The problem of distributed detection with consulting sensors in the presence of communication cost associated with any exchange of information (consultation) between sensors is considered. The system considered has two sensors, S 1 and S 2; S 1 is the primary sensor responsible for the final decision u 0 , and S 2 is a consulting sensor capable of relaying its decision u 2 to S 1 when requested by S 1. The final decision u 0 is either based on the raw data available to S 1 only, or, under certain request conditions, also takes into account the decision u 2 of sensor S 2. Random and nonrandom request schemes are analyzed and numerical results are presented and compared for Gaussian and slow-fading Rayleigh channels. For each decision-making scheme, an associated optimization problem is formulated whose solution is shown to satisfy certain set design criteria that the authors consider essential for sensor fusion 相似文献
16.
The theorem states that every block square matrix satisfies its own m -D (m -dimensional, m ⩾1) matrix characteristic polynomial. The exact statement and a simple proof of this theorem are given. The theorem refers to a matrix A subdivided into m blocks, and hence having dimension at least m . The conclusion is that every square matrix A with dimension M satisfies several m -D characteristic matrix polynomials with degrees N 1 . . ., N m, such that N 1+ . . . +N m ⩽M 相似文献
17.
The H 2-optimal control of continuous-time linear time-invariant systems by sampled-data controllers is discussed. Two different solutions, state space and operator theoretic, are given. In both cases, the H 2 sampled-data problem is shown to be equivalent to a certain discrete-time H 2 problem. Other topics discussed include input-output stability of sampled-data systems, performance recovery in digital implementation of analog controllers, and sampled-data control of systems with the possibility of multiple-time delays 相似文献
18.
The focus of this work is L 1-optimal control of sampled-data systems. A converging approximation procedure is derived to compute the L ∞-induced norm of closed-loop finite-dimensional linear time-invariant (LTI) sampled-data systems. An approximation method is developed to synthesize L 1-optimal sampled-data regulators. Finally, an example is provided that illustrates the L 1 analysis and design techniques presented 相似文献
19.
An application-specific architecture for the parallel calculation of the decimation in time and radix 2 fast Hartley (FHT) and Fourier (FFT) transforms is presented. A real sequence with N =2n data items is considered as input. The system calculates the FHT and the FFT in n and n +1 stages. respectively. The modular and regular parallel architecture is based on a constant geometry algorithm using butterflies of four data items and the perfect unshuffle permutation. With this permutation, the mapping of the algorithm in VLSI technology is simplified and the communications among processors are minimized. Organization of the processor memory based on first-in, first-out (FIFO) queues facilitates a systolic data flow and permits the implementation in a direct way of the complex data movements and address sequences of the transforms. This is accomplished by means of simple multiplexing operations, using hardwired control. The total calculation time is (N log2N )/4Q cycles for the FHT and N (1+log2N )/4Q cycles for the FFT, where Q is the number of processors ( Q = 2q, Q ⩽N /4) 相似文献