...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Automatic Control >An analog scheme for fixed-point computation-part II: applications
【24h】

An analog scheme for fixed-point computation-part II: applications

机译：

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In a companion paper 6 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 programming; and 4) network flow 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 proposedimplementation, on a 2-ц 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.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号