Abstract
A recently proposed 3-D optical Fredkin gate interconnection network1 is further analyzed. It is shown that any arbitrary permutation of an array of N × N channels can be performed by cascading 3N – 1 switching layers. The complexity of this architecture, which is defined as the total number of switching elements, is determined and compared with a similar parameter for the 2-D architecture. It is shown that the 3-D architecture becomes superior to the 2-D architecture as the number of channels Nc increases. In particular, the 3-D architecture is found very suitable for the cases where Nc is a square number.
© 1989 Optical Society of America
PDF ArticleMore Like This
Mir M. Mirsalehi, Joseph Shamir, and H. John Caulfield
THI2 OSA Annual Meeting (FIO) 1987
Robert Cuykendall and Debra McMillin
MD6 Optical Computing (IP) 1987
Arthur Chiou and Pochi Yeh
TuB2 Optical Computing (IP) 1989