Abstract
We use d-dimensional shuffle patterns to describe optical frequency division multiplexing. A complexity measure is derived from the geometry of common shuffle patterns and is extended to evaluate d-dimensional shuffle patterns. The least complexity of the generated patterns is determined with respect to the size and the dimension of the data sets. Trade-offs between the dimension of the data sets and the frequency-conversion-based processing of the pattern generation are discussed. A comparison of multiplexing on vectors and arrays is presented. The relation of the complexity analysis to the design of optical frequency division multiplexing systems is briefly discussed.
© 1992 Optical Society of America
Full Article |
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Figures (13)
You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Tables (6)
You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Equations (8)
You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription