Options
1992
Journal Article
Titel
Generation and evaluation of d-dimensional (d > or = 3) optical shuffle patterns
Abstract
The author uses 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.
Tags
-
frequency division multiplexing
-
optical frequency conversion
-
optical information processing
-
optical interconnections
-
optical switches
-
multiplexing system design
-
d-dimensional
-
optical shuffle patterns
-
d-dimensional shuffle patterns
-
optical frequency division multiplexing
-
complexity measure
-
generated patterns
-
data sets
-
frequency-conversion-based processing
-
pattern generation
-
vectors
-
arrays
-
complexity analysis
-
optical frequency division multiplexing systems