Thesis (M.S.)--University of Missouri-Columbia, 2004. / Typescript. Includes bibliographical references (leaves 110-112). Also available on the Internet.

Thesis (Ph. D.)--University of Texas at Austin, 2005. / Supervisor: Gustavo de Veciana. Vita. Includes bibliographical references. Also available from UMI.

Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2005. / Includes bibliographical references (leaves 150-160). Also available in electronic version.

After establishing itself in the radio domain, Spread spectrum code-division multiplexing/multiple-access (CDMA) has seen a recent upsurge in optical domain as well. Due to its fairness, flexibility, service differentiation and increased inherent security, CDMA is proved to be more suitable for the bursty nature of local area networks than synchronous multiplexing techniques like Frequency/Wavelength Division Multiplexing (F/WDM) and Time Division Multiplexing (TDM). In optical domain, CDMA techniques are commonly known as Optical-CDMA (O-CDMA). All optical CDMA systems are plagued with the problem of multiple-access interference (MAI). Spectral amplitude coding (SAC) is one of the techniques used in the literature to deal with the problem of MAI. The choice of spreading code in any CDMA system is another way to ensure the successful recovery of data at the receiving end by minimizing the effect of MAI and it also dictates the hardware design of the encoder and decoder. This thesis focuses on the efficient design of encoding and decoding hardware. Perfect difference codes (PDC) are chosen as spreading sequences due to their good correlation properties. In most of the literature, evaluation of error probability is based on the assumptions of ideal conditions. Such assumptions ignore major physical impairments such as power splitting losses at the multiplexers of transmitters and receivers, and gain losses at the receivers, which may in practice be an overestimate or underestimate of the actual probability of error. This thesis aims to investigate thoroughly with the consideration of practical impairments the applications of PDCs and other spreading sequences in optical communications systems based on spectral-amplitude coding and utilizing codedivision as multiplexing/multiple-access technique. This work begins with a xix general review of optical CDMA systems. An open-ended practical approach has been used to evaluate the actual error probabilities of OCDM/A systems under study. It has been concluded from results that mismatches in the gains of photodetectors, namely avalanche photodiode (APDs), used at the receiver side and uniformity loss in the optical splitters results in the inaccurate calculation of threshold level used to detect the data and can seriously degrade the system bit error rate (BER) performance. This variation in the threshold level can be compensated by employing techniques which maintain a constant interference level so that the decoding architecture does not have to estimate MAI every time to make a data bit decision or by the use of balanced sequences. In this thesis, as a solution to the above problem, a novel encoding and decoding architecture is presented for perfect difference codes based on common zero code technique which maintains a constant interference level at all instants in CDM system and thus relieves the need of estimating interference. The proposed architecture only uses single multiplexer at the transmitters for all users in the system and a simple correlation based receiver for each user. The proposed configuration not only preserves the ability of MAI in Spectral-Amplitude Coding SAC-OCDM system, but also results in a low cost system with reduced complexity. The results show that by using PDCs in such system, the influence of MAI caused by other users can be reduced, and the number of active users can be increased significantly. Also a family of novel spreading sequences are constructed called Manchestercoded Modified Legendre codes (MCMLCs) suitable for SAC based OCDM systems. MCMLCs are designed to be used for both single-rate and Multirate systems. First the construction of MCMLCs is presented and then the bit error rate performance is analyzed. Finally the proposed encoding/decoding architecture utilizing perfect difference codes is applied in wireless infrared environment and the performance is found to be superior to other codes.

Loosely Synchronized (LS) codes can be used as spreading codes in quasi­ synchronous code-division multiple-access (QS-CDMA) systems. In such CDMA systems, close control of synchronization is achieved at the chip level, interme­ diate between that in synchronous CDMA and that in asynchronous CDMA. The LS code can then capitalize on zero correlation in a limited synchronization window to reduce code correlations and so reduce interference. LS codes are {O, +1, -1} codes constructed using Hadamard matrices and Golay pairs. A variation of LS codes inserts short strings of zeros between the components of the Golay pairs to increase the number of codewords, with only limited dete­ rioration in the correlations. These strings of zeros are known as internal padding. One of the advantages normally claimed for CDMA systems is resistance to eavesdropping and jamming. It might appear at first sight that the structure of LS codes is rather predictable in comparison with codes constructed using linear feedback shift registers, such as m-sequences or Gold codes. One way to overcome any such difficulty would be to evolve the code very quickly, in such a way that by the time a generation of the code is determined (or determined to a moderate correlation value) it is too late to exploit it. This thesis explores the way that LS codes can be evolved in order to achieve resistance to eavesdropping and jamming. The thesis starts with a detailed account of the necessary background and of the construction of Loosely Synchronized codes. The early part of the thesis then concentrates on showing that many generations of LS code can be constructed in such a way that the correlation between distinct generations is small. This prevents one observed generation of the code from being used for jamming or prediction in another generation. Specifically: •The construction of Golay pairs is investigated and a search is carried out over all possible Golay pairs and their mates to find a set of pairs that leads to the satisfaction of a suitable correlation criterion; •Bent functions, almost bent functions and other second order Boolean functions are used to create sets of Hadamard matrices that are guaranteed to satisfy the same correlation criterion; •A sequential search method to generate a set of arrangements of the internal padding that satisfies the same correlation criterion is described. Later in the thesis this approach is replaced by a recency list approach. This ensures that the correlation criterion is satisfied against recently used generations of the code, in place of all generations of the code; •The way in which these evolutions of the components combine together is also explored. Attention turns in the second part of the thesis to the mechanisms for evolution and the way that these might be predicted by a third party observer. Transform methods that the third party might use are described. Detailed simulations quantify the ability of the third party to identify the code during the transmission of a single bit. It is shown that theoretical resistance to early code prediction is not possible, although it might be possible to demonstrate security arising from the relative speed of the necessary computations for the user and the observer. This would require a detailed hardware study, and this is listed as future work. In fact it is shown here that LS codes are actually better than linear feedback shift register codes, as a result of the Berlekamp-Massey algorithm. Attention is also focussed on the scenario in which details of the algorithms of one user are obtained by the third party. Only the Hadamard matrix provides protection against this scenario, as all other components of the construction are shared between all users. From this second viewpoint the true weakness of LS codes becomes apparent. Although the Hadamard matrix constructions are satisfactory if the order of the Hadamard matrix is not too small, it seems that the sequence of Hadamard matrix rows of each user must be computed centrally and distributed to users as private keys if this scenario is not to remain a major concern. The volume of private key distribution necessary may seem unattractive to operators. Ultimately it seems that evolution of the Golay pairs may have little real role except to increase the workload of the observer. The recency list based evolution of internal padding can take the main role in ensuring low correlation between close generations of the code. The evolution of the Hadamard matrix should be designed to concentrate on the second viewpoint, where the third party has obtained details of the algorithms of one user.

Demand for high data rates is increasing rapidly for future wireless systems.This trend is due to the increase in the number of mobile subscribers that need bandwidth hungry multimedia applications anywhere, anytime. Fourth generation cellular systems like IMT-advanced are being developed to meet these requirements. The unreliable nature of the wireless medium is one of the main hinderance in providing high data rates. Cooperative communication in cellular networks is emerging as a new paradigm to deal with the channel impairments. User cooperation via fixed relays in cellular systems form multiple access relay channels (MARCs) and provide an effective and cost efficient solution to achieve spatial diversity gains. Network resources can be utilized efficiently by using network coding at cooperating nodes. A lot of research work has focused on highlighting the gains achieved by using network coding in MARCs. However, there are certain areas that are not fully explored yet. For instance, the kind of the detection scheme used at the base station receiver and its impact on the link performance has not been addressed. In most cases, the outage probability has been used as a performance measure of MARCs. However, it is well known that the outage probability gives information about the signal availability, but it does not give the complete picture about the reliability of the link and the achieved quality of service. This thesis work looks at the link performance, in terms of symbol error probability, of multiple access relay channels that employ network coding at the relay node. Different types of detection schemes are considered and their performance is compared under different link conditions. Analytical expressions for the average symbol error probability of the cooperating users are derived. Focusing on the uplink of cellular systems, certain rules are devised on how to group users at relay node to ensure mutual benefit for the cooperating users. As a way of improving the link performance of multiple access relay channels and their robustness, the thesis considers constellation selection for the different branches. This method takes advantage of the redundancy between the transmitted symbols created by network coding and the augmented signal space obtained at the base station receiver. The obtained results show that, with a proper selection of the constellation sets, the link performance of MARCs can be improved. The thesis further looks at the interaction between the channel coding schemes of the cooperating users and network coding. It is shown that joint channel-network coding in MARCs can be seen as a product code. This new representation provides considerable flexibility in selecting efficient decoding algorithms at the base station receiver and gives the possibility to use more powerful network coding schemes for MARCs. / QC 20101118 / Sino-Swedish Cooperative Program: IMT-Advanced and Beyond

[pt] Este trabalho examina um sistema de múltiplo acesso aleatório que pode ser empregado em um sistema de telecomunicações via satélite. A utilização de um código empregando multiplexação simultânea em tempo e freqüência permite que o sistema seja empregado sem qualquer sincronização entre seus usuários. A probabilidade de erro associada a um símbolo de um usuário qualquer é obtida, por simulação, em função do número de usuários e do nível de ruído térmico no receptor. / [en] This work is related to random multiple access systems to be used in connection with satellite communication systems. The use of a time-frequency code allows the system to be operated without any Kind of synchronization among users. The symbol error probability associated to any user is obtained, thourgh simulation, as a function of the number of users and thermal noise level in the receiver.

The need for multiple access strategies arises whenever a number of users have to share a communication resource, since it is usually either cost prohibitive or impractical to dedicate a communication channel to a particular user. A need for such algorithms arises in many instances, particularly in applications utilizing wireless systems where all users access a common channel or medium. Such random access techniques as ALOHA and slotted ALOHA have been successfully implemented in a number of wireless applications. One of the major drawbacks of these algorithms is the necessity of a return path from the central station to each system user, which makes their use both inefficient and expensive for applications where one-way communication would suffice. For such applications, a need remained for a random access algorithm which can maximize the probability of successful message transmission in a one-way communication environment. A random access technique that addresses the above-mentioned need is developed. With this technique, each user sends an original message of predetermined length to a central receiver. The user then retransmits the message a specified number of times in a predetermined interval reserved for the retransmission process. The time interval between each successive retransmission of a given message is random. Assuming total annihilation of all colliding messages, the expression for the probability of successful transmission of a given message in terms of the major channel parameters is theoretically formulated. This technique offers a significant improvement, compared to a single transmission, in ensuring that a message is successfully received. The actual message collision dynamics in this system are experimentally studied using two different types of direct-sequence spread spectrum receivers, one employing a sliding correlator and the other using a matched filter. The spreading code in such systems offers extra protection for messages against possible interferers. The results indicate that it is often possible to properly receive a given message in the presence of co-channel interferers, thus significantly improving the overall system performance. These results are subsequently incorporated with the propagation data for several different types of microcells to arrive at a more precise theory of the link. / Ph. D.

The realization of high data rate wireless communication and large-scale connectivity with seamless coverage has been enabled by the introduction of various advanced transmission technologies, such as multiple access (MAC) technology and relay-assisted communications. However, beyond the accurate representation and successful transmission of information, in many applications it is the semantic aspect of that information that is really of interest. This thesis makes contributions to both the technology of conventional wireless communications and the theory of semantic communication. The main work is summarized as follows: We first consider an uplink system with K single-antenna users and one base station equipped with a single antenna, where each user utilizes a binary constellation to carry data. By maximizing the minimum Euclidean distance of the received sum constellation, the optimal user constellations and sum constellation are obtained for K=3 users. Using the principle of lattice coding, that design is extended to the K-user case. In both settings, the sum constellation belongs to additively uniquely decomposable constellation group (AUDCG). That property enables us to reduce the maximum likelihood multi-user detector to a single-user quantization based receiver. The symbol error probability (SEP) formula is derived, showing that our proposed non-orthogonal multiple access (NOMA) scheme outperforms the existing time division multiple access (TDMA) designs for the same system. Our design also sheds light on the general complex constellation designs for the MAC channel with arbitrary user constellation size. Specifically, K-user constellations with any 2^Mk size can be obtained using combinations of the proposed binary constellations. Next we concentrate on a multi-hop relay network with two time slots, consisting of single-antenna source and amplify-and-forward relay nodes and a destination node with M antennas. We develop a novel uniquely-factorable constellation set (UFCS) based on a PSK constellation for such system to allow the source and relay nodes to transmit their own information concurrently at the symbol level. By taking advantage of the uniquely-factorable property, the optimal maximum likelihood (ML) detection was equivalently reduced to a symbol-by-symbol detection based on phase quantization. In addition, the SEP formula was given, while enable us to show that the diversity gain of the system is one. For semantic communication, a new source model is considered, which consists of an intrinsic state part and an extrinsic observation part. The intrinsic state corresponds to the semantic feature of the source. It is not observable, and can only be inferred from the extrinsic observation. As an instance of the general model, the case of Gaussian distributed extrinsic observations is studied, where we assume a linear relationship between the intrinsic and extrinsic parts. We derive the rate-distortion function (in both centralized encoding and distributed encoding) of semantic-aware source coding under quadratic distortion structure by converting the semantic distortion constraint of the source to a surrogate distortion constraint on the observations. With proposed AUDCG and UFCS-based designs, high data rates as well as low detection latency can be achieved. Our modulation division method will be one of the promising technologies for the next generation communication and the analysis of the source coding with semantic information constraints also provides some insights that will guide the future development of semantic communication systems. / Thesis / Doctor of Philosophy (PhD) / The proliferation of smart phones and electronic devices has spurred explosive growth in high-speed multimedia services over the next generation of wireless cellular networks. Indeed, high data rates and large-scale connectivity with seamless coverage are the dominant themes of wireless communication system design. Moreover, beyond the accurate representation and successful transmission of information, the interpretation of its meaning is being paid more attention nowadays, which requires the development of approaches to semantic communication. The goal of this thesis is to contribute to the development of both conventional and semantic communication systems. Two advanced transmission technologies, namely, multiple access and relay-assisted communications are considered. By taking advantage of the special structures of digital communication signals, new approaches to multiple access and relay-assisted communications are developed. These designs enable high data rates, while simultaneously facilitating low-latency detection. Since there has been very limited analysis of the source coding of a vector source subject to semantic information constraints, we also study the rate distortion to trade-off for vector sources in both the case of centralized encoding and the case of distributed encoding, and we establish some insights that will guide the future development of semantic communication systems.

No description available.