Abstract
The various possibilities of optically interconnecting 16×16-data arrays by shuffle patterns are presented and analysed. The pattern analysis is based on evaluating the skew of each particular path of the shuffle interconnections. Geometric quantities of interest (deflection angle, path length of spatial and frequency pattern) are derived. The switch preserving transformation of 2D shuffle interstage patterns into their equivalent 1D shuffles and vice versa, the way a 1D shuffle overlaps into a 2D shuffle in the 3D physical space, is presented. The costs of these different interconnection schemes are evaluated and the results are compared. (The applied cost measure is the total length of the interconnections.) For example, the interconnection of 256 data has the least costs if the arrays are interconnected by a 4D shuffle.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
