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.
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.
