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
Josef Giglmayr, "Generation and evaluation of d-dimensional (d ≥ 3) optical shuffle patterns," Appl. Opt. 31, 4662-4675 (1992)