Soumyanath, K and Borkar, Vivek S (1999) An Analog Scheme for Fixed-Point Computation - Part II: Applications. In: IEEE Transactions on Circuits and Systems - I: Fundamental Theory and Applications, 46 (4). pp. 442-451.
In a companion paper  we presented theoretical analysis of an analog network for fixed-point computation. This paper applies these results to several applications from numerical analysis and combinatorial optimization, in particular: 1) solving systems of linear equations; 2) nonlinear programming; 3) dynamic programing; and 4) network how computations, Schematic circuits are proposed for representative cases and implementation issues are discussed. Exponential convergence is established for a fixed-point computation that determines the stationary probability vector for a Markov chain. A fixed-point formulation of the single source shortest path problem (SPP) that will always converge to the exact shortest path is described. A proposed implementation, on a 2-mu complementary metal-oxide-semiconductor (CMOS) process, for a fully connected eight-node network is described in detail. The accuracy and settling time issues associated with: the proposed design approach are presented.
|Item Type:||Journal Article|
|Additional Information:||©1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||CMOS;analogue integrated circuits;markov processes;analogue processing circuits;dynamic programming;fixed point arithmetic;nonlinear programming;optimisation|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:15|
Actions (login required)