Two-dimensional spatial signature patterns

An optical orthogonal signature pattern code (OOSPC) is a collection of (0,1) two-dimensional (2-D) patterns with good correlation properties (i.e., high autocorrelation peaks with low sidelobes, and low cross-correlation functions). Such codes find applications, for example, to parallelly transmit and access images in "multicore-fiber" code-division multiple-access (CDMA) networks. Up to now all work on OOSPCs has been based on an assumption that at most one pulse per column or one pulse per row and column is allowed in each two-dimensional pattern. However, this restriction may not be required in such multiple-access networks if timing information can be extracted from other means, rather than from the autocorrelation function. A new class of OOSPCs is constructed without the restriction. The relationships between two-dimensional binary discrete auto- and cross-correlation arrays and their corresponding "sets" for OOSPCs are first developed. In addition, new bounds on the size of this special class of OOSPCs are derived. Afterwards, four algebraic techniques for constructing these new codes are investigated. Among these constructions, some of them achieve the upper bounds with equality and are thus optimal. Finally, the codes generated from some constructions satisfy the restriction of at most one pulse per row or column and hence can be used in applications requiring, for example, frequency-hopping patterns.

[1]  A.J. Mendez,et al.  Temporal/spatial optical CDMA networks-design, demonstration, and comparison with temporal networks , 1992, IEEE Photonics Technology Letters.

[2]  Fan Chung Graham,et al.  Optical orthogonal codes: Design, analysis, and applications , 1989, IEEE Trans. Inf. Theory.

[3]  P. Vijay Kumar,et al.  Optical orthogonal codes-New bounds and an optimal construction , 1990, IEEE Trans. Inf. Theory.

[4]  F. MacWilliams,et al.  Pseudo-random sequences and arrays , 1976, Proceedings of the IEEE.

[5]  Wing C. Kwong,et al.  Ultrafast All-Optical Code-Division Multiple-Access (CDMA) Fiber-Optic Networks , 1994, Comput. Networks ISDN Syst..

[6]  A. A. Shaar,et al.  Prime sequences: quasi-optimal sequences for OR channel code division multiplexing , 1983 .

[7]  Edward Titlebaum,et al.  Time-Frequency HOP Signals Part II: Coding Based upon Quadratic Congruences , 1981, IEEE Transactions on Aerospace and Electronic Systems.

[8]  Ken-ichi Kitayama,et al.  Novel spatial spread spectrum based fiber optic CDMA networks for image transmission , 1994, IEEE J. Sel. Areas Commun..

[9]  P. Vijay Kumar,et al.  On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function , 1988, IEEE Transactions on Information Theory.

[10]  Joseph Y. Hui Pattern Code Modulation and Optical Decoding - A Novel Code-Division Multiplexing Technique for Multifiber Networks , 1985, IEEE Journal on Selected Areas in Communications.

[11]  Guu-chang Yang,et al.  Optical orthogonal codes with unequal auto- and cross-correlation constraints , 1995, IEEE Trans. Inf. Theory.

[12]  Solomon W. Golomb,et al.  Two-dimensional synchronization patterns for minimum ambiguity , 1982, IEEE Trans. Inf. Theory.

[13]  Nabeel A. Riza,et al.  Spatial Optical CDMA , 1995, IEEE J. Sel. Areas Commun..

[14]  Mohsen Kavehrad,et al.  Slotted Aloha and reservation Aloha protocols for very high-speed optical fiber local area networks using passive star topology , 1991 .

[15]  Jin Fan,et al.  Disjoint difference sets, difference triangle sets, and related codes , 1992, IEEE Trans. Inf. Theory.

[16]  R. C. Bose,et al.  Introduction to Combinatorial Theory , 1984 .

[17]  S. Golomb,et al.  Constructions and properties of Costas arrays , 1984, Proceedings of the IEEE.

[18]  László Györfi,et al.  Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.