3632

JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 26, NO. 22, NOVEMBER 15, 2008

Design and Analysis of 2-D Codes With the Maximum Cross-Correlation Value of Two for Optical CDMA
Jen-Hao Tien, Guu-Chang Yang, Senior Member, IEEE, Cheng-Yuan Chang, Member, IEEE, and Wing C. Kwong, Senior Member, IEEE

AbstractIn this paper, a new family of two-dimensional (2-D) optical codes with the maximum cross-correlation value of two is constructed and analyzed for optical code-division multiple access. Our 2-D codes employ wavelength hopping, controlled by the permutations of synchronized prime sequences, onto the pulses of a time-spreading optical orthogonal code (OOC). The new construction supports larger code cardinality (for more subscribers) and heavier code weight (for better code performance) without increasing the code length or number of wavelengths. Under certain conditions, our analysis shows that the new codes can perform better than our multiple-wavelength OOCs, which have cross-correlation values of at most one. Index TermsOptical code-division multiple access, optical orthogonal code, time spreading, two-dimensional optical codes, wavelength hopping.

TABLE I SYNCHRONIZED PRIME SEQUENCES OVER GF(5)

I. INTRODUCTION

PTICAL code-division multiple access (O-CDMA) is currently receiving renewed attention due to the advancement of two-dimensional (2-D) coding techniques, which combine wavelength hopping and time spreading in optical codes [1][5]. Two-dimensional optical codes with low cross-correlation values can support more subscribers and simultaneous users than one-dimensional (1-D) optical codes, such as the prime codes [3] and optical orthogonal codes (OOCs) [6], for a given code length. The study of 2-D optical codes was traditionally concentrated on the constructions of code matrices with the cross-correlation values of at most one in order to minimize multiple-access interference (MAI) [1][5]. However, this kind of construction signicantly restricts code cardinality. It is known that we can support larger
Manuscript received September 14, 2007; revised April 7, 2008. Current version published January 28, 2009. This work was supported in part by the National Science Council of the Republic of China under Grant NSC 95-2221-E-005-023-MY3, in part by the Ministry of Education, Taiwan, R.O.C., under the ATU plan, in part by the U.S. Defense Advanced Research Projects Agency under Grant MDA972-03-1-0006, and in part by the Presidential Research Award and Faulty Development and Research Grants, Hofstra University. J.-H. Tien and G.-C. Yang are with the Department of Electrical Engineering, National Chung-Hsing University, Taichung 402, Taiwan, R.O.C. (e-mail: gcyang@dragon.nchu.edu.tw). C.-Y. Chang is with the Department of Electrical Engineering, National United University, Miaoli, Taiwan, R.O.C. (e-mail: chengyuan@nuu.edu.tw). W. C. Kwong is with the Department of Engineering, Hofstra University, Hempstead, NY 11549 USA (e-mail: eggwck@hofstra.edu). Digital Object Identier 10.1109/JLT.2008.925029

code cardinality and, in turn, more subscribers by relaxing the maximum cross-correlation value, but this means larger MAI as well [3], [6][11]. In [7], Mashhadi and Salehi computed the optimal values of that the code weight and maximum cross-correlation value minimize the error probability of optical codes for given code length and cardinality. They concluded that the optimal value of should be either two or three, and these optical codes were more benecial than optical codes, from a practical point of view. It is because the former support larger code cardinality with slightly worsening in code performance (or error probability), according to their analysis in [7]. As a result, codes provide a better compromise in terms of code cardinality optical codes. and error probability than Nevertheless, previous work in the design of 2-D codes overlooked the fact that larger cross-correlation values would allow us to pack more pulses (i.e., heavier code weight) into code matrices, resulting in higher autocorrelation peaks. Higher autocorrelation peaks mean better discrimination against MAI and, in turn, give better code performance. Therefore, by relaxing , we now have the question of whether larger MAI or heavier code weight has a stronger effect in terms of code performance. In Section II of this paper, we construct a new class of 2-D optical codes by relaxing the maximum cross-correlation value from one to two in order to increase the code weight and cardinality. In Section III, our performance analysis shows that codes reheavier code weight supported by the new sults in better code performance than our multiple-wavelength OOCs (MWOOCs) [5] under certain conditions and, at the same time, supports more possible subscribers. This contracodes create stronger MAI dicts a common belief that and should always perform worse than codes for the benet of achieving larger code cardinality.

0733-8724/$25.00 2008 IEEE

TIEN et al.: 2-D CODES WITH MAXIMUM CROSS-CORRELATION VALUE OF TWO FOR OPTICAL CDMA

3633

TABLE II CODE MATRICES OF LENGTH 13 AND FIVE WAVELENGTHS BASED ON THE SYNCHRONIZED PRIME SEQUENCES OVER GF(5) AND THE CODEWORD 1100010010001 FROM THE (13,5,2,1) TIME-SPREADING OOC

II. CONSTRUCTION OF 2-D CODES An 2-D optical code is a family of (0,1) matrices with the number of wavelengths , code length , code weight , maximum autocorrelation sidelobe , and maximum cross-correlation value , such that we have the following. Autocorrelation: For any code matrix in the 2-D code, the periodic autocorrelation side, such that lobes are bounded by a positive integer for any integer delay , where is an element of at the th row and th column and denotes a moduloaddition. Cross-correlation: For any two distinct matrices and in the 2-D optical code, the periodic cross-correlation function is bounded by a positive for integer , such that , where is an element in any at the th row and th column. In essence, our new ( 2,2) 2-D optical codes are con2,1) one-dimensional (1-D) structed by rst choosing a ( OOC of length [6] as the time-spreading code. Afterwards, wavelength hopping is added by assigning wavelengths to the pulses of the time-spreading OOC algebraically. Wavelength assignment is determined by the synchronized prime sequences [3], as shown in the following. The synchronized prime sequences over Galois eld (GF) are obtained from , where , , and are all in GF , is a prime number, denotes a modulo- multiplication, and denotes a modulo- addition. The synchronized prime sequences can be classied in groups, indexed by . Each is used as a seed to generate prime sequence [3] with sequences in its group, resulting in a total of synother chronized prime sequences. This, in turn, gives permutations for assigning wavelengths to the pulses of the time-spreading synchronized OOC. For example, Table I shows the prime sequences over GF(5). Table II shows the 25 (5 13,5,2,2) code matrices, originated from the (13,5,2,1) 1-D OOC, 1100010010001, [4] with the wavelength indexes following the synchronized prime sequences of GF(5) in Table I. The new codes support variable-weight operations because the weight of the code matrices can be changed by simply dropping pulses without worsening the cross-correlation functions. , only the rst As shown in Table I, for a code weight th elements in each synchronized prime sequence are used for wavelength permutations. For example, if we want to lower the

weight of a code matrix from ve to four, all we need to do is to drop the last element in the corresponding synchronized prime sequence in Table I and, in turn, drop the last pulse in the code matrix in Table II. Since code weight determines the strength of the autocorrelation peak, code matrices with heavier weight have a better error probability and, thus, a greater chance to be transmitted successfully. As result, the new codes are able to support multimedia services in O-CDMA with services prioritization [12]. When is a prime number, the elements within each syn, are chronized prime sequence, excluding those in group all distinct (e.g., see Table I). This property keeps the cross-correlation functions of the new codes as low as possible (i.e., in our case). However, when is not a prime number, some of the synchronized prime sequences will have repeated elements owing to the multiplication property of Galois eld. These repeated elements worsen the cross-correlation functions. in our 2-D codes, those In this case, if we want to keep sequences with repeated elements need to be removed. In other words, if a nonprime is used, the code cardinality may be reduced, depending on the actual values of and in use. The rule of picking the desirable sequences for the case of a nonprime was detailed in [13]. For example, when and , there are valid permutations because all eight sequences , there have their rst two elements nonrepeating. If valid permutations because there are only are only four sequences with their rst four elements nonrepeating. In short, our code construction does not require to be a prime number. However, a prime will always maximize the cardinality and, at the same time, keep the cross-correlation values of the new codes being bounded to at most two. A. Cross-Correlation Property It is important to note that the cross-correlation property of the new codes changes with the group number (e.g., see Table I). As proved in this section, the cross-correlation value of code matrices originated from different groups is at most one. However, code matrices originated from the same group (i.e., the same codeword of the OOC) have cross-correlation values of at most two. B. Cardinality Let weight, be the cardinality upper bound of the OOC, where is the code length, is the code is the maximum autocorrelation sidelobe, and is

3634

JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 26, NO. 22, NOVEMBER 15, 2008

TABLE III EXAMPLES OF OVERALL CARDINALITIES OF THE NEW 2-D CODES AND MWOOCs

the maximum cross-correlation value. The upper bound is deto the Johnson bound in [6], such that rived by multiplying

(1) 2,1) OOC in When compared to (1), the cardinality of ( [6] is asymptotically optimal because its cardinality is equal to for odd for even (2)

, the auTheorem 2: From any group tocorrelation sidelobe of the proposed 2-D codes is reduced to 0,2) 2-D codes zero. The overall cardinality of these ( by scarifying the becomes matrices from group 0. Proof: The proof is similar to that of Theorem 1. Every is conpulse in each code matrix of group veyed with distinct wavelengths such that for and . Hence, the autocorrelation sidelobes of the proposed 2-D codes become zero. III. PERFORMANCE ANALYSES In this section, we introduce a combinatorial method to analyze the hard-limiting1 performance of the new 2-D codes for an interference limited O-CDMA system. In general, the code performance is determined by code parameters such as weight, length, the number of wavelengths, and the maximum cross-correlation value [1][5]. Let and denote the probabilities of the desired code ma, retrix (originated from group 0 and spectively) getting one hit in a time slot when it correlates with denote the probaa code matrix in the code set. Also, let bility of the desired code matrix (originated from group ) getting two hits in the cross correlation. (The term two hits denes the situation when a time slot of the desired code matrix is being hit by two interfering pulses at the same time. This causes the cross-correlation function to be two.) In the following derivations, we assume that the number , there are groups of synchroof wavelengths is nized prime sequences, and an ( 2,1) OOC of cardinality is used in the new ( 2,2) 2-D codes. (0,1) code Theorem 3: Let and be two distinct matrices in the code set. The number of times of getting two hits for odd weight in their cross-correlation is at most for even weight. Then, we have and at most (4)
1It is known that a hard-limiter can be placed at the front end of a receiver before correlation is performed in order to reduce the effects of MAI and the nearfar problem [2], [3], [14], [15], [18]. While the operation details of hardlimiters can be found in [21], their basic function is to clip the output light intensity to a xed level if the input light intensity at a time instant is greater than a preset threshold. Otherwise, the output of the hard-limiter is zero.

Equation (2) determines the number of time-spreading OOC codewords that can be used in our new 2-D codes, for given and . As mentioned earlier, the number of synchronized prime sequences (e.g., Table I) that can be used in the wavelength per. The number of synchronized mutations is given by prime sequences suitable for the permutations is maximized ) when is a prime number. For each codeword (i.e., OOC, the permutation algorithm can generate of the at most (e.g., Table II) code matrices. Therefore, the overall cardinality of the new 2-D codes is given by (3) For comparison, the overall cardinality of the MWOOCs [5] is given by , in accordance where with (1). The MWOOCs have almost half the number of code matrices of the new 2-D codes for a given because (for odd ) and 2( 1) (for even ). Numerical examples for the cardinality comparison of both codes are given in Table III. Theorem I: The cross-correlation functions and autocorrelation sidelobes of the new 2-D codes are both at most two. The . overall code cardinality is Proof: See Appendix I. By Theorem 1, the maximum autocorrelation sidelobe of the proposed 2-D codes worsens to at most two because each code matrix from group 0 uses the same wavelength in its pulses. By removing group 0, we can reduce the autocorrelation sidelobes 0,2) 2-D codes. However, to zero, giving a class of ( the number of synchronized prime sequences that can be used . for the wavelength permutations is reduced to

TIEN et al.: 2-D CODES WITH MAXIMUM CROSS-CORRELATION VALUE OF TWO FOR OPTICAL CDMA

3635

for odd weight. The derivation of for even weight follows the rationale of that of odd weight in (4), such that (5) Proof: See Appendix II. A. Hit Probabilities for Odd Weight From Section II, the length of the new 2-D codes is if is an odd integer. From Appendix III, we then have (6) (7) (8)

For comparison, the hard-limiting error probability of the MWOOCs is given by [2], [13], [15], [16] (16) where , , and

B. Hit Probabilities for Even Weight From Section II, the length of the new 2-D codes is if is an even integer. Similar to Section III-A, we then have (9) (10) (11)

were derived in [5]. The error-probability equations for 2-D codes have been , and higher values [7], [14], well developed for [18][20]. Basically, these equations are the same for 2-D codes value. The only difference is on the hit-probwith the same ability equations [e.g., (4)(14)] because they depend on the parameters (i.e., maximum cross-correlation values, length, weight, cardinality, and number of wavelengths) of the 2-D codes in study. In short, if two families of 2-D codes have the same parameters, they will perform identically. Nevertheless, 2-D codes is comparing the performances of various not the scope of this paper. Instead, this paper studies how we codes in order to achieve can pack more pulses in our better code performance and, at the same time, larger code cardinality. For example, we compare the error probabilities of codes with the MWOOCs of the same the new length in Figs. 4 and 5 of Section IV and show that the new codes can support better performance under certain conditions. IV. NUMERICAL EXAMPLES In Fig. 1, the error probability , from (15), of the new codes is plotted against the number of simultaneous users for various code length and code weight . Indicated 2,1) 1-D time-spreading OOCs next to the curves are the ( used to generate the correand number of wavelengths sponding 2-D codes. The (13,5,2,1) OOC, which can be equivalently denoted by the time-slot positions [0,1,5,8,12], is shown in the caption of Table II. Similarly, the time-slot positions of the (19,6,2,1) and (27,7,2,1) OOCs are given by [1,7,8,11,12,18] and [0,1,4,10,17,23,26], respectively. Also plotted in the gure are the computer-simulation results, which are found matching closely with the analytical results. To explain how the computer simulation is performed, we use the (13,5,2,1) curve as an example. The code matrix assigned to each user is arbitrarily selected from all 25 possible code matrices constructed from GF(5), as shown in Table II. The total number of data bits involved in the simulation ranges from 100 000 to 100 000 000, depending on the targeting error probability. Fig. 2 shows the error probability of the new 2-D codes versus for various code weight the number of simultaneous users , where , , and . Fig. 3 shows the error probability of the new 2-D codes versus for various code length the number of simultaneous users , where and . From Figs. 13, the error increases but improves probability in general gets worse as with or . Fig. 4 compares the error probabilities of the MWOOCs, based on the ( 1,1) time-spreading OOCs [i.e., 2-D codes, based on the ( 2,1) (16)] and our new time-spreading OOCs [i.e., (15)], for various code length ,

C. Error Probability Derivation Denoting as the probability of getting hits in a time slot out of the maximum cross-correlation value of , we have [3], [5] (12) (13) (14) The error probability of the new 2-D codes, based on the combinatorial analysis with hard-limiting detection, is given by [14, (16)]

(15) denotes the number of simultaneous users. To have where a good code performance, this error-probability equation indishould be small. cates that should be large but

3636

JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 26, NO. 22, NOVEMBER 15, 2008

Fig. 1. Error probability of the new 2-D codes versus the number of simultawith various ( 2,1) time-spreading OOCs. neous users

n; w;

Fig. 3. Error probability of the new 2-D codes versus the number of simul, , and taneous users for various , where .

w=6m=p=7

8 =

Fig. 2. Error probability of the new 2-D codes versus the number of si, , and for various , where multaneous users .

=1

n = 181 m = p = 19

Fig. 4. Error probabilities of the new 2-D codes and MWOOCs versus the . number of simultaneous users for various code-weight difference

number of wavelengths , and code weight . In general, the error probability gets worse as increases but improves and , the performance of with , , or . For the same our new 2-D codes is worse than that of the MWOOCs. Nevertheless, the new 2-D codes can have a larger for the same , hence compensating for the worsening in the performance due to a larger . For example, the new 2-D codes generated , while the MWOOCs by the (111,15,2,1) OOC has . When the generated by the (111,11,1,1) OOC has only difference of code weight between the new 2-D codes and MWOOCs is at least equal to three, the former performs better for the same and . As shown in than the latter for the gure, the performance difference increases with . Fig. 5 compares the error probabilities of the MWOOCs, 1,1) time-spreading OOC, and our new based on the ( time-spreading OOC, for 2-D codes, based on the , where is even in the new 2-D codes. In

general, the error probability gets worse as increases but im. It is important proves with the number of wavelengths to point out that the new 2-D codes support a larger for the same because the time-spreading OOCs supports a larger when the maximum cross-correlation value is relaxed from one to two. Furthermore, the increase in code weight is more than enough to compensate for the worsening in MAI, resulting a net gain in the code performance. In our numerical example, the performance difference increases with because increasing the number of available wavelengths reduces the probability of getting two hits. V. CONCLUSION In this paper, we proposed a new family of 2-D optical codes with the cross-correlation functions of at most two. The new codes could achieve larger code cardinality and supcodes, without the port heavier code weight than the

TIEN et al.: 2-D CODES WITH MAXIMUM CROSS-CORRELATION VALUE OF TWO FOR OPTICAL CDMA

3637

maximum cross-correlation value of the proposed 2-D codes is at most two. APPENDIX II PROOF OF THEOREM 3 Let the tion of 2-D code be dened as a collecmatrices [17]. Also, let

. . .

. . .

. . .

. . .

(17)

. . .

. . .

. . .

. . .

(18)

Fig. 5. Error probabilities of the new 2-D codes with even weight and the MWOOCs versus the number of simultaneous users , for various .

need of increasing the code length. The new codes were anaMWOOCs. While the new lyzed and compared to the codes supported almost twice as many code matrices as the MWOOCs, our numerical example showed that the heavier code weight supported by the new codes resulted in better code performance than the MWOOCs under certain conditions. This codes should always contradicted a common belief that codes for the benet of larger carperform worse than dinality. APPENDIX I PROOF OF THEOREM 1 In this Appendix, the correlation properties of the proposed 2-D codes, given in Theorem 1, are derived. Since every pulse within each code matrix from group 0 has the same wavelength, there will be at most two pulses colliding in the cross-correlations. This is due to the autocorrelation property OOC that the maximum autocorrelation of the sidelobe is two. For any groups other than group 0, every pulse within a code matrix is conveyed with distinct wavelengths such that their autocorrelation sidelobes are all zero. Therefore, the maximum autocorrelation value of the proposed 2-D codes is at most two if group 0 is included. In the following, we derive the cross-correlation property by and . If their considering two distinct code matrices, say, time delay is equal to zero, the cross-correlation value becomes less than or equal to one. It is because the cross-correlation value is at most one for any two different prime se, there are two cases to quences over GF . If consider. In the rst case, the cross-correlation value becomes less than or equal to one when the code matrices are from two 2,1) OOC. It is because the different codewords of the ( 2,1) OOC is one. maximum cross-correlation value of the ( In the second case, the cross-correlation value is less than or equal to two when the code matrices are from the same codeword of the ( 2,1) OOC. It is because the maximum auto2,1) OOC is two. Therefore, the correlation sidelobe of the (

such that and . While and determine the and permutation of wavelengths, denote the time positions of binary ones in code matrices and , respectively. and represent the sets of relative cyclic pulse deLet lays associated with and , respectively, as dened in [17]. and are the same, then we If any two elements from can derive the number of hits by the repeated cyclic pulse delays of the code matrices. The set of relative cyclic pulse delays of the code matrix with odd weight contains repeated elements. Since each element will contribute 1 rel1 elements, then the ative cyclic pulse delays with the other cyclic shifts of the code matrix with odd weight give a total of two hits. Therefore, the number of one hit is equal to [6]. Then, for the desired , the code matrix originated from group probability of getting two hits is given by (19) The factor 1/2 comes from the assumption of equiprobable onoff data bit transmission. The term represents the number of possible time shifts in a code matrix of length . The 1 represents the total number of two hits seen term by the desired code matrix with odd weight . Since each 2,1) time-spreading OOC can generate code matrices, ( code matrices and, thus, up there are in total interferers in the denominators. to The set of relative cyclic pulse delays of the code matrix with even weight is derived similar to that of the code matrix with odd weight. From [6], the cyclic shifts of the code matrix with even weight gives a total of (w 2) 2 two hits and one hit. The derivation of with even weight follows the rationale of that of with odd weight. APPENDIX III In this Appendix, we derive the hit probabilities of the new 2-D codes with odd weight. Assuming that the number of available wavelengths is and the code weight of the ( 2,1)

3638

JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 26, NO. 22, NOVEMBER 15, 2008

time-spreading OOC is . The desired 2-D code matrices originated from group 0 have

(20) After simple manipulations, (6) can be obtained. In (20), the assumption of onoff data-bit transmission with equal probability gives the factor 1/2 to all four terms in the braces. The factor 1 represents the number of possible time shifts between the two code matrices of length . Since each 2,1) time-spreading OOC can generate up to code ma( code matrices in total and, trices, there are thus, up to interferers in the denominators. The rst term in the braces of (20) relates to the hit probability of the desired code matrix from group 0 caused by an interfering 2,1) code matrix from different groups but using the same ( time-spreading OOC as the desired code matrix, and there is no 1 time shift between the two code matrices. The factor represents the number of interfering code matrices contributing one hit. The second term is derived similar to that of the rst 1 1 represents term but with a time shift. The factor the number of interfering code matrices, which can contribute one hit. The third and fourth terms relate to the hit probabilities of the desired code matrix from group 0 caused by interfering 1, respectively, code matrix from group 0 and groups 1 to 2,1) time-spreading OOC from the deusing a different ( sired code matrix. For the desired code matrix originated from group with the probability of getting one hit, we have

hit to the desired code matrix with a time shift and the interfering code matrix comes from group 0. The third term represents the case that the interfering code matrix comes from 1 and gives one hit with desired code matrix groups 1 to [i.e., with a time shift. The factor ( 1) from Appendix II] represents the number of interfering code matrices, which can contribute one hit. The fourth term relates to the hit probability of the desired code matrix from group caused by interfering code matrices originated from a different 2,1) time-spreading OOC from that of the desired code ( with even weight follows the ramatrix. The derivation of with odd weight. Moreover, the derivationale of that of with odd weight and even weight are explained in tions of Appendix II. REFERENCES
[1] L. Tan evski and I. Andonovic, Hybrid wavelength hopping/time c spreading schemes for use in massive optical networks with increased security, J. Lightw. Technol., vol. 14, pp. 26362647, Dec. 1996. [2] G.-C. Yang and W. C. Kwong, Performance comparison of multiwavelength CDMA and WDMA+CDMA for ber-optic networks, IEEE Trans. Commun., vol. 45, pp. 14261434, Nov. 1997. [3] G.-C. Yang and W. C. Kwong, Prime Codes With Applications to CDMA Optical and Wireless Networks. Norwood, MA: Artech House, 2002. [4] R. M. H. Yim, L. R. Chen, and J. Bajcsy, Design and performance of 2-D codes for wavelength-time optical CDMA, IEEE Photon. Technol. Lett., vol. 14, pp. 714716, May 2002. [5] W. C. Kwong, G.-C. Yang, V. Baby, C.-S. Brs, and P. R. Prucnal, Multiple-wavelength optical orthogonal codes under prime-sequence permutations for optical CDMA, IEEE Trans. Commun., vol. 53, pp. 117123, Jan. 2005. [6] G.-C. Yang and T. Fuja, Optical orthogonal codes with unequal autoand cross-correlation constraints, IEEE Trans. Inf. Theory, vol. 41, pp. 96106, Jan. 1995. [7] S. Mashhadi and J. A. Salehi, Code-division multiple-access techniques in optical ber networksPart III: Optical AND logic gate receiver structure with generalized optical orthogonal codes, IEEE Trans. Commun., vol. 54, pp. 14571468, Aug. 2006. [8] S.-S. Lee and S.-W. Seo, New construction of multiwavelength optical orthogonal codes, IEEE Trans. Commun., vol. 50, pp. 20032008, Dec. 2002. [9] T. Pu, Y. Q. Li, and S. W. Yang, Research of algebra congruent codes used in two-dimensional OCDMA system, J. Lightw. Technol., vol. 21, pp. 25572564, Nov. 2003. [10] C.-Y. Chang, G.-C. Yang, and W. C. Kwong, Wavelength-time codes with maximum cross-correlation functions of two for multicode keying optical CDMA, J. Lightw. Technol., vol. 24, pp. 10931100, Mar. 2006. [11] E. Narimanov, W. C. Kwong, G.-C. Yang, and P. R. Prucnal, Shifted carrier-hopping prime codes for multicode keying in wavelength-time O-CDMA, IEEE Trans. Commun., vol. 53, pp. 21502156, Dec. 2005. [12] V. Baby, W. C. Kwong, C.-Y. Chang, G.-C. Yang, and P. R. Prucnal, Performance analysis of variable-weight, multilength optical codes for wavelength-time O-CDMA multimedia systems, IEEE Trans. Commun., vol. 55, pp. 13251333, Jul. 2007. [13] H.-W. Hu, H.-T. Chen, G.-C. Yang, and W. C. Kwong, Synchronous Walsh-based bipolar-bipolar code for CDMA passive optical networks, J. Lightw. Technol., vol. 25, pp. 19101917, Aug. 2007. [14] J.-J. Chen and G.-C. Yang, CDMA ber-optic systems with optical hard limiters, J. Lightw. Technol., vol. 19, pp. 950958, Jul. 2001. [15] H. M. H. Shalaby, Chip-level detection in optical code division multiple access, J. Lightw. Technol., vol. 16, pp. 10771087, Jun. 1998. [16] S. Zahedi and J. A. Salehi, Analytical comparison of various ber-optic CDMA receiver structures, J. Lightw. Technol., vol. 18, pp. 17181727, Dec. 2000. [17] G.-C. Yang and W. C. Kwong, Two-dimensional spatial signature patterns, IEEE Trans. Commun., vol. 44, pp. 184191, Feb. 1996. [18] M. Azizoglu, J. A. Salehi, and Y. Li, Optical CDMA via temporal codes, IEEE Trans. Commun., vol. 40, pp. 11621170, Jul. 1992.

(21) After some manipulations, we nally have (7). The derivation of follows the rationales of that of . The rst three terms in the braces of (21) relate to the hit probabilities of the desired code matrix from group caused by interfering code matrices originated from the same ( 2,1) time-spreading OOC as that of the desired code matrix. The rst term represents the case that the desired and interfering code matrices are aligned without any time shift. The second term represents the case that the interfering code matrix gives one

TIEN et al.: 2-D CODES WITH MAXIMUM CROSS-CORRELATION VALUE OF TWO FOR OPTICAL CDMA

3639

[19] C.-C. Hsu, Y.-C. Chang, G.-C. Yang, C.-L. Chang, and W. C. Kwong, Performance analysis of 2-D optical codes without the chip-synchronous assumption, IEEE J. Sel. Areas Commun., vol. 25, pp. 135143, Aug. 2007. [20] C.-C. Hsu, G.-C. Yang, and W. C. Kwong, Performance analysis of 2-D optical codes with arbitrary cross-correlation values under the chip-asynchronous assumption, IEEE Commun. Lett., vol. 11, pp. 170172, Feb. 2007. [21] C.-C. Hsu, G.-C. Yang, and W. C. Kwong, Hard-limiting performance analysis of 2-D optical codes under the chip-asynchronous assumption, IEEE Trans. Commun., vol. 56, no. 5, pp. 762768, May 2008. Jen-Hao Tien received the B.S. degree in electrical engineering from National Chung-Hsing University, Taichung, Taiwan, R.O.C, in 2005, where he is currently pursuing the M.S. degree in electrical engineering. His research interests include optical communications and wireless communications.

Society Taipei Chapter from 1999 to 2000. He received the Distinguished Research Award from the National Science Council in 2004 and Excellent Young Electrical Engineering Award from the Chinese Institute of Electrical Engineering in 2003. He also received the Best Teaching Awards from the Department of Electrical Engineering from National Chung-Hsing University from 2001 to 2004.

Cheng-Yuan Chang (S04M07) received the B.S. degree from National Sun Yat-Sen University, Kaohsiung, Taiwan, R.O.C., in 1997 and the M.S. and Ph.D. degrees from National Chung-Hsing University, Taichung, Taiwan, in 2002 and 2007, respectively, all in electrical engineering. In 2007, he joined the Faculty of National United University, Miaoli, Taiwan, where he is presently an Assistant Professor in the Department of Electrical Engineering. His research interests include optical and wireless communications.

Guu-Chang Yang (S88M92SM05) received the B.S. degree from the National Taiwan University, Taipei, Taiwan, R.O.C., in 1985 and the M.S. and Ph.D. degrees from the University of Maryland, College Park, MD, in 1989 and 1992, respectively, all in electrical engineering. From 1988 to 1992, he was a Research Assistant with the System Research Center, University of Maryland. In 1992, he joined the Faculty of National Chung-Hsing University, Taichung, Taiwan, where he is currently a Professor in the Department of Electrical Engineering. He was Chairman of the Department of Electrical Engineering from 2001 to 2004. His research interests include wireless and optical communication systems, spreading code designs, and applications of code-division multiple access. He coauthored a rst-of-its-kind technical book on optical code-division multiple access, Prime Codes with Applications to CDMA Optical and Wireless Networks (Norwood, MA: Artech House, 2002) and contributed a chapter to Optical Code Division Multiple Access: Fundamentals and Applications (Boca Raton, FL: Taylor & Francis, 2006). Dr. Yang was Chairman of the IEEE Information Theory Society Taipei Chapter from 2003 to 2005 and Vice-Chairman of the IEEE Information Theory

Wing C. Kwong (S88M92SM97) received the B.S. degree from the University of California, San Diego, in 1987 and the Ph.D. degree from Princeton University, Princeton, NJ, in 1992, both in electrical engineering. In 1992, he joined the Faculty of Hofstra University, Hempstead, NY, where he is presently a Professor in the Department of Engineering. His research interests are centered on optical and wireless communication systems and multiple-access networks, optical interconnection networks, and ultrafast all-optical signal processing techniques. He has published more than 120 professional papers, chaired technical sessions, and served on technical program committees in various international conferences. He has given invited seminars in various countries, such as Canada, Korea, and Taiwan. He coauthored a rst-of-its-kind technical book on optical code-division multiple access, Prime Codes with Applications to CDMA Optical and Wireless Networks (Norwood, MA: Artech House, 2002) and contributed a chapter to Optical Code Division Multiple Access: Fundamentals and Applications (Boca Raton, FL: Taylor & Francis, 2006). Dr. Kwong is an Associate Editor of the IEEE TRANSACTIONS ON COMMUNICATIONS. He received an NEC Graduate Fellowship from NEC Research Institute in 1991. He received the Young Engineer Award from the IEEE (Long Island chapter) in 1998.