Engineering topics

Kailath, Thomas

Publications and source records attributed to Kailath, Thomas.

10 records

NASA NTRS1991

Depth-size tradeoffs for neural computation

The tradeoffs between the depth (i.e., the time for parallel computation) and the size (i.e., the number of threshold gates) in neural networks are studied. The authors focus the study on the neural computations of symmetric Boolean functions and some arithmetic functions. It is shown that a significant reduction in the size is possible for symmetric functions and some arithmetic functions, at the expense of a small constant increase in depth. In the process, several neural networks which have the minimum size among all the known constructions have been developed. Results on implementing symmetric functions can be used to improve results about arbitrary Boolean functions. In particular, It is shown that any Boolean function can be computed in a depth-3 neural network with O(2n/2) threshold gates; it is also proven that a minimum number of threshold gates are required.

Siu, Kai-Yeung↗

NASA NTRS1991

Obtaining schedules for digital systems

A systematic technique is presented to derive correct schedules for a synchronous digital system, given a signal flow graph for an algorithm. It is also shown how to use this technique to derive designs that are optimal in having the lowest latency, the highest throughput, or the smallest number of registers. The same technique can also be used to verify digital systems that have already been designed.

Jagadish, H. V.↗

NASA NTRS1991

A general weight matrix formulation using optimal control

Classical methods from optimal control theory are used in deriving general forms for neural network weights. The network learning or application task is encoded in a performance index of a general structure. Consequently, different instances of this performance index lead to special cases of weight rules, including some well-known forms. Comparisons are made with the outer product rule, spectral methods, and recurrent back-propagation. Simulation results and comparisons are presented.

Farotimi, Oluseyi↗

NASA NTRS1990

Estimability And Regulability Of Linear Systems

Report presents two new properties of systems characterized by linear state space models (e.g., dynamical systems and associated control systems): estimability and regulability. Provides criteria for reductions of errors and cost functions in control systems. Useful in design of optimal controllers and estimators.

Baram, Yoram↗

NASA NTRS1990

Model-free distributed learning

Model-free learning for synchronous and asynchronous quasi-static networks is presented. The network weights are continuously perturbed, while the time-varying performance index is measured and correlated with the perturbation signals; the correlation output determines the changes in the weights. The perturbation may be either via noise sources or orthogonal signals. The invariance to detailed network structure mitigates large variability between supposedly identical networks as well as implementation defects. This local, regular, and completely distributed mechanism requires no central control and involves only a few global signals. Thus it allows for integrated on-chip learning in large analog and optical networks.

Dembo, Amir↗

NASA NTRS1989

Wide-band array signal processing via spectral smoothing

A novel algorithm for the estimation of direction-of-arrivals (DOA) of multiple wide-band sources via spectral smoothing is presented. The proposed algorithm does not require an initial DOA estimate or a specific signal model. The advantages of replacing the MUSIC search with an ESPRIT search are discussed.

Xu, Guanghan↗

NASA NTRS1988

Estimability and Regulability of Linear Systems

A linear state-space system will be said to be estimable if in estimating its state from its output the posterior error covariance matrix is strictly smaller than the prior covariance matrix. It will be said to be regulable if the quadratic cost of state feedback control is strictly smaller than the cost when no feedback is used. Estimability and regulability are shown to be dual properties, equivalent to the nonreducibility of the Kalman filter and of the optimal linear quadratic regulator, respectively.

Baram, Yoram↗

NASA NTRS1987

Array architectures for iterative algorithms

Regular mesh-connected arrays are shown to be isomorphic to a class of so-called regular iterative algorithms. For a wide variety of problems it is shown how to obtain appropriate iterative algorithms and then how to translate these algorithms into arrays in a systematic fashion. Several 'systolic' arrays presented in the literature are shown to be specific cases of the variety of architectures that can be derived by the techniques presented here. These include arrays for Fourier Transform, Matrix Multiplication, and Sorting.

Jagadish, Hosagrahar V.↗

NASA NTRS1987

Estimability and regulability of linear systems

A linear state-space system will be said to be estimable if in estimating its state from its output the posterior error covariance matrix is strictly smaller than the prior covariance matrix. It will be said to be regulable if the quadratic cost of state feedback control is strictly smaller than the cost when no feedback is used. These properties, which are shown to be dual, are different from the well known observability and controllability properties of linear systems. Necessary and sufficient conditions for estimability and regulability are derived for time variant and time invariant systems, in discrete and continuous time.

Baram, Yoram↗

NASA NTRS1987

Estimability and regulability of linear systems

A linear state-space system will be said to be estimable if in estimating its state from its output the posterior error covariance matrix is strictly smaller than the prior covariance matrix. It will be said to be regulable if the quadratic cost of state feedback control is strictly smaller than the cost when no feedback is used. These properties, which are are shown to be dual, are different from the well known observability and controllability properties of linear systems. Necessary and sufficient conditions for estimability and regulability are derived for time variant and time invariant systems, in discrete and continuous time.

Baram, Yoram↗