• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Constructions of optical FIFO queues
【24h】

Constructions of optical FIFO queues

机译：光学FIFO队列的构造

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

摘要

Discrete-time queues are infinite dimensional switches in time. Ever since Shannon published his paper ("Memory requirements in a telephone exchange", Bell Syst. Tech. J., pp. 343-349, vol. 29, 1950) on the memory requirements in a telephone exchange, there have been tremendous efforts in the search for switches with minimum complexity. Constructing queues with minimum complexity has not received the same amount of attention as queues are relatively cheap to build via electronic memory. Recent advances in optical technologies, however, have spurred interest in building optical queues with minimum complexity. In this correspondence, we develop mathematical theory of constructing discrete-time optical first-in-first-out (FIFO) queues. To our surprise, we find that many classical constructions for switches have their counterparts for constructing queues. Analogous to the three-stage construction of Clos networks, we develop a three-stage construction of optical FIFO queues via switched delay lines (SDLs). Via recursively expanding the three-stage construction, we show that an optical FIFO queue with buffer 2/sup n/-1 can be constructed by using 2n 2/spl times/2 switches with the total fiber length 3/spl middot/2/sup n-1/-2.
机译：离散时间队列是时间上的无限维切换。自从Shannon发表有关电话交换机中内存需求的论文（“电话交换机中的内存需求”，Bell Syst。Tech。J.，第343-349页，第29卷，1950年）以来，就付出了巨大的努力。在寻找具有最小复杂度的开关。构造具有最小复杂度的队列并没有获得同等的关注，因为通过电子存储器建立队列相对便宜。但是，光学技术的最新进展引起了人们对以最小的复杂度建立光学队列的兴趣。在这种对应关系中，我们发展了构造离散时间光学先进先出（FIFO）队列的数学理论。令我们惊讶的是，我们发现许多经典的交换机构造都有对应的构造队列。与Clos网络的三阶段构造类似，我们通过交换延迟线（SDL）开发了光学FIFO队列的三阶段构造。通过递归扩展三阶段结构，我们显示可以使用总光纤长度为3 / spl middot / 2 /的2n 2 / spl times / 2个开关来构造具有缓冲区2 / sup n / -1的光学FIFO队列。 sup n-1 / -2。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号