Browsing by Author "Yang, G-C."
Results Per Page
Sort Options
Item New Codes and New Approaches for Code Division Multiple Access on Optical Fiber Networks(1992) Yang, G-C.; Fuja, T.E.; ISRThis thesis concerns the use of optical fiber in a multi-user communication networks. specifically, it considers the use of code-division multiple access (CDMA) techniques that permit many users to share a single optical channel through the assignment of unique "signature sequences".In most optical systems - where incoherent processing means that only signal intensity is measured - there are no negative signal components, and the effect on code design is profound. This was noted by Salehi and others in their design of optical orthogonal codes (OOC's).
The results in this thesis extend previous work on OOC's in several areas. First, we consider codes for which the auto- and cross- correlation constraints are not equal. We observe that the effects of the two constraints on system performance are not identical, and so considering only codes for which they are identical may lead to a sub-optimal code. Bounds on such OOC's are derived and techniques for constructing them are described.
OOC's with unequal auto- and cross-correlation constraints may be viewed as constant-weight unequal error protection (UEP) codes; therefore we in interpret the bounds and constructions in that context and compare them with previous work on UEP codes.
We develop bounds on the size of "variable weight" OOC's and demonstrate techniques for building them.
By considering the original CDMA system as an inner code and adding a channel encoder for each user as an outer code, we demonstrate a concatenated coding scheme that can improve system performance without increasing the weight of the OOC sequences.
A new approach to CDMA on optical fiber networks employing pulse position modulation (PPM) is developed. We propose assigning to each user in the network two signature sequences - a synchronization sequence and a data sequence. We stipulate the required properties of such sequences, and we demonstrate that in some cases more users can be accommodated with this approach than with the assignment of single sequences that "do it all".
Item Optical Orthogonal Codes with Unequal Auto- and Cross- Correlation Constraints(1992) Yang, G-C.; Fuja, Tom E.; ISRAn optical orthogonal code (OOC)is collection of binary sequences with good auto-and cross-correlation properties; they were defined by Salehi and others as a means of obtaining code division multiple access on optical networks. Up to now all work on OOC's have assumed that the constraint placed on the auto- correlation and that placed on the cross-correlation are the same. In this paper we consider codes for which the two constraints are not equal. Specifically, we develop bounds on the size of such OOC's and demonstrate construction techniques for building them. The results demonstrate that a significant increase in the code size is possible by letting the auto- correlation constraint exceed the cross-correlation constraint. These results suggest that for a given performance requirement the optimal OOC may be one with unequal constraints.This paper also views OOC's with unequal auto- and cross-correlation constraints as constant-weight unequal error protection (UEP) codes with two levels of protection. The bounds derived are interpreted from this viewpoint and are compared with previous work on UEP codes.