High Performance on Optical Interconnection Network with Polarization Selective Elements

• Main Authors: Lee, Chi-Ping, 李紀萍
• Other Authors: Chang, Chien-Ping
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/65188003788441325799

博士 === 國防大學理工學院 === 國防科學研究所 === 99 === Recently, there has been a growing demand for communication systems. The high speed and high capacity translation feature is an important issue of an effective communication system. Especially on the battlefield, where the situation varies from minute to minute, how to transmit battlefront military news at the highest speed to the combat information center becomes one of the winning factors. Hence, optical communication technologies are more appreciated nowadays. An optical communication technology is more and more noticed that is implemented on optical multistage interconnection networks (MINs). In this article, we present a modified version of holographic optical switches (HOSs). The performances of optical interconnection networks based on these optical switching elements have improved significantly. The double-layer network constructed by the novel PSE has these approving improvements: reducing the volume of the whole system, eliminating all interconnection lines and crossovers significantly, reducing the number of drivers from N2/4+2Nlog2N-2N to 2Nlog2N, and reducing the system insertion loss. After rearranging the channels allocation, the number of electro-optic halfwave plates (EOHWPs) can be significantly decreased from 2N2-2N to 2Nlog2N. Meanwhile, we offer a routing algorithm for the double-layer network with the modified version of HOSs. The time complexity of the routing algorithm is O(1). We introduce a novel 44 optical switch which is strictly nonblocking. The 44 optical switch has 2 stages and uses four PSEs. Based on the 44 optical switch, a strictly nonblocking network structure is proposed, which the system insertion loss is lower than the double-layer network with PSE. We make a comparison with the double-layer network and the Beneš network. At final, we also offer a routing algorithm for the proposed network structure, and the time complexity of the routing algorithm is O(1). The algorithm increases the practicability.