首页> 外文期刊>IEE proceedings. Part G >Collective process circuit that sorts
【24h】

Collective process circuit that sorts

机译:集体处理电路

获取原文
获取原文并翻译 | 示例
           

摘要

Comparing and sorting are common functions in natural and artificial systems. Many known algorithms that sort m numbers require time from O(m~2) to O(m). Algorithms to find the greatest number have been realised in neural networks and discrete time systems. Presented in the paper is a new circuit, the MAXOR, which incorporates a continuous time recursive collective process for finding the maximum of many inputs and sort inputs, like the O(m) spaghetti sort algorithm, when furnished with synchronous control. The resulting output is broadcast throughout the process. The precision fl required of the circuit is only that needed to distinguish between the maximum and next lower inputs. Stability is assured within practical parameters where the output is observed to settle in linearised time O(m).
机译:比较和分类是自然系统和人工系统中的常见功能。许多已知的对m个数进行排序的算法需要从O(m〜2)到O(m)的时间。在神经网络和离散时间系统中已经实现了找到最大数目的算法。本文中介绍的是一种新电路,即MAXOR,它包含一个连续时间递归集体过程,用于在具有同步控制的情况下查找许多输入和分类输入中的最大值,例如O(m)意大利面条分类算法。结果输出将在整个过程中广播。电路所需的精度fl仅是区分最大输入和下一个较低输入所需的精度。在实际参数范围内可以确保稳定性,在该参数范围内观察到输出在线性化时间O(m / n)内稳定下来。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号