An analog parallel distributed solution to the shortest path problem

Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors Pub Date : 1990-09-17 DOI:10.1109/ICCD.1990.130182

S. Ritter, K. Soumyanath

引用次数: 4

Abstract

The evolution of analog VLSI has led to increased application of analog circuitry in solving problems previously solved digitally or numerically. Specifically, analog parallel distributed (APD) methods have been used. These methods are applicable to problems that can be modeled using the mathematical functions characteristic of analog circuits. One such problem is the single-source shortest path problem (SPP). An SPP algorithm that is derived by applying an APD approach to solving Bellman's equation is proposed. Correctness of the algorithm is proved for the case of zero-initial conditions. Simulations of the system (algorithm) yield correct results in all cases. A decomposition technique is developed to analyze the dynamic behavior of the algorithm in detail. The complexity, accuracy, and settling time of a physical implementation of the system are also discussed.<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

模拟并行分布式解决最短路径问题

模拟VLSI的发展导致模拟电路在解决以前数字或数值解决的问题中的应用增加。具体来说，采用了模拟并行分布(APD)方法。这些方法适用于可以用模拟电路的数学函数特征来建模的问题。其中一个问题是单源最短路径问题(SPP)。提出了一种应用APD方法求解Bellman方程的SPP算法。证明了该算法在零初始条件下的正确性。系统(算法)的仿真结果在所有情况下都是正确的。提出了一种分解技术，详细分析了该算法的动态行为。还讨论了系统物理实现的复杂性、准确性和建立时间。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors

自引率

0.00%

发文量

期刊最新文献

Design aids and test results for laser-programmable logic arrays An analog parallel distributed solution to the shortest path problem Exploitation of operation-level parallelism in a processor of the CRAY X-MP Pin assignment for improved performance in standard cell design The observability don't-care set and its approximations