• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Conference on enabling photonic technologies for aerospace applications >Switching architecture iterative optimization
【24h】

Switching architecture iterative optimization

机译：切换架构迭代优化

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A new method for implementing a general linear system using multi-stage architecture was recently published. In this method an iterative procedure determines the architecture to be used to simulate a linear system with a small number of stages and with a small error. Multi-stage IC architectures allow easy switching between different channels. There are many known algorithms for optimizing the interconnection net in terms of minimizing the number of alterations required to switch form one set of channels to a similar set. In optics, however, there exists the probe of implementation. Not all the routing architectures can be easily constructed optically and there is an advantage in implementing routing architectures with a symmetric structure. Therefore an optical setup might be limited to the use of non-blocking setup is known. Thus, the optimization that can be made refers to a specific set of input-output connections and results in finding the smallest number of routing stages required to achieve the full permutation set. In this work we present an algorithm for optimizing the routing scheme. We also show an algorithm for minimizing the number of changes required in a given routing scheme while shifting form one input-output connection to a similar connection.
机译：最近发布了一种使用多级架构实现一般线性系统的新方法。在此方法中，迭代过程确定要用于模拟具有少量阶段的线性系统和小错误的架构。多级IC架构允许在不同的通道之间轻松切换。有许多已知的算法，用于优化互连网络，以最小化将形成一组通道切换到类似集的频道所需的变化的数量。然而，在光学中，存在实施探讨。并非所有路由架构都可以很容易地光学构造，并且在具有对称结构的路由架构方面存在有利的优点。因此，光学设置可能限于未封锁设置的使用是已知的。因此，可以进行的优化是指特定的输入输出连接，并导致找到实现完整排列集所需的最小路由阶段。在这项工作中，我们呈现了一种优化路由方案的算法。我们还示出了一种算法，用于最小化给定路由方案中所需的更改次数，同时转换与类似连接的一个输入输出连接形成一个输入输出连接。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号