The need for d-dimensional (d ≥ 3) interconnection patterns occurs if d-dimensional data cubes have to be interconnected. The formal definition of such patterns, presented here, is based on the mixed radix numbering of the d-tuple data points. Because each coordinate of a d-dimensional data cube may be factorized in a different way, a family of interconnection patterns is obtained that increases with respect to the dimension of the data cubes. The properties of d-dimensional patterns are analyzed, and their realization in the frequency domain is described. Methods for the three-dimensional layout of the patterns are presented. The application of d-dimensional patterns within multistage interconnection networks is discussed.

© 1992 Optical Society of America

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Article level metrics are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription