Algebraic methods are used to construct the exact solution P (whenever a unique solution exists) of the linear matrix equation PA + BP =-C where A, B and C are n × n, m × m and m × n matrices respective...
详细信息
Algebraic methods are used to construct the exact solution P (whenever a unique solution exists) of the linear matrix equation PA + BP =-C where A, B and C are n × n, m × m and m × n matrices respectively, with real entries. The method uses polynomial arithmetic and is based on the following idea: Let M be an F-module where F is a commutative ring with identity. Let there be elements a,b in F and x,y in M with a·b a unit in F (i.e. there exists a t in F such that t(ab) = 1 and ax = y. Then x = (t·b)y. The method can also be used when the matrices are taken over an arbitrary field or more generally an integral domain.
A normalized digital two-pair has unity L p - scaling norms at all pertinent internal nodes and the two output nodes. A simple technique is proposed to derive the normalized filter structure recently forwarded by Gray...
详细信息
A normalized digital two-pair has unity L p - scaling norms at all pertinent internal nodes and the two output nodes. A simple technique is proposed to derive the normalized filter structure recently forwarded by Gray and Markel. Additional normalized digital two-pairs are also derived.
This paper presents a formal procedure for determining the state space representations of any digital network consisting of adders, multipliers and delays. Such representations are called state-structures whenever the...
详细信息
This paper presents a formal procedure for determining the state space representations of any digital network consisting of adders, multipliers and delays. Such representations are called state-structures whenever the state variables are exclusively identified to the appropriately chosen internal node variables of the network. In general, the state-structures corresponding to a given network are not unique, and for non-canonic networks, it is sometimes possible to find state-structures for state vectors of the lowest dimension. Procedures for determining such minimal structures are also discussed.
Strong sufficient conditions are derived for the robustness of optimal linear- quadratic (LQ) regulators to large parameter perturbations. In particular, it is shown that under certain conditions LQ designs remain sta...
Strong sufficient conditions are derived for the robustness of optimal linear- quadratic (LQ) regulators to large parameter perturbations. In particular, it is shown that under certain conditions LQ designs remain stable in the presence of actuator channel failures. The general results can be specialized to provide insight into the gain margin, gain reduction, and phase margin properties of optimal LQ regulators.
A new method of developing a stable network function from a specified odd part is outlined. The proposed method is based cm a modification of Miyata's method of constructing a network function from a specified eve...
详细信息
An algorithm is defined for establishing routing tables in the individual nodes of a data network. The routing table at a node i specifies, for each other node j, what fraction of the traffic destined for node j shoul...
详细信息
In this paper, a necessary and sufficient condition is given to model the output of a quantizer as an infinite-precision input and an additive, uniform, white noise. The statistical properties of the quantization erro...
详细信息
The sequential and indeterminate behavior of an end-around-carry (EAC) adder is examined. This behavior is commonly overlooked in the literature. Design modifications to impose determinism are provided. These modifica...
详细信息
The sequential and indeterminate behavior of an end-around-carry (EAC) adder is examined. This behavior is commonly overlooked in the literature. Design modifications to impose determinism are provided. These modifications also eliminate the troublesome negative zero found in the one's complement number system.
暂无评论