Abstract not available

<p>To take advantage of the high speed in an optic fiber, one of the basic concept in fiber optic communication is to allow several users to simultaneously transmit data over the channel. One technique that provides multiple access is it fiber optic-code division multiple access (FO-CDMA). In FO-CDMA each user is assigned one or more signature sequences called codewords, which are subsets of a type of optical orthogonal code (OOC). The channel input/output consists of the superposition of several users codewords and at the receiver end an optical correlator extracts the information. </p><p>In the parallel code constructions, presented in this report, each user j is assigned a subset Cj from a code C. The subsets are disjoint and their union is the whole set C. A new way to map the information bits is to insert up to L zeros before each codeword from Cj and let this represent information aswell. This gives high rates for active users but an investigation is needed to ensure that this does not compromise the systems wanted property of sending information with a small probability of errors for all users. Therefore a simulation environment has been implemented in Matlab. </p><p>The result from these simulations shows that BER for the L parallel codes is acceptable and not much higher than for the traditional constructions. Because of the higher rate these construction should be preferred but an analysis if a hardware implementation is possible.</p>

The stupendous growth in wireless and mobile devices in the recent years has prompted researchers to look at innovative approaches that enable effective use of the available resources. In this thesis, we propose a medium access control (MAC) protocol, referred to as EM-MAC, that enables wireless devices with multi-channel access capabilities while minimizing energy consumption. EM-MAC relies on iMAC's efficient channel selection mechanism to resolve the medium contention on the common control channel, and to select the best available data channel for data communication. Our protocol saves energy by allowing devices that have not gained access to the medium to switch to doze mode until the channel becomes idle again. The pair of devices that gains access to the data channel reserves and uses the channel until the end of the reservation period. At the end of each reservation period, devices belonging to a given data channel contend again for the medium, and only the pair of devices that wins access to the medium is allowed to communicate on the channel while all other devices switch to doze mode. Using simulations, we show that EM-MAC yields substantial energy savings when compared with iMAC. / Graduation date: 2012

Future cognitive radio networks are expected to come as a disruptive technological advance in the currently saturated field of wireless communications. The idea behind cognitive radios is to think of the wireless channels as a pool of communication resources, which can be accessed on-demand by a primary licensed network or opportunistically preempted (or overlaid) by a secondary network with lower access priority. From a physical layer point of view, the primary network is ideally oblivious of the existence of a co-localized secondary networks. The latter are therefore required to autonomously explore the air in search for resource left-overs, and then to optimally exploit the available resource. The exploration and exploitation procedures, which involve multiple interacting agents, are requested to be highly reliable, fast and efficient. The objective of the thesis is to model, analyse and propose computationally efficient and close-to-optimal solutions to the above operations.Regarding the exploration phase, we first resort to the maximum entropy principle to derive communication models with many unknowns, from which we derive the optimal multi-source multi-sensor Neyman-Pearson signal sensing procedure. The latter allows for a secondary network to detect the presence of spectral left-overs. The computational complexity of the optimal approach however calls for simpler techniques, which are recollected and discussed. We then proceed to the extension of the signal sensing approach to the more advanced blind user localization, which provides further valuable information to overlay occupied spectral resources.The second part of the thesis is dedicaded to the exploitation phase, that is, the optimal sharing of available resources. To this end, we derive an (asymptotically accurate) approximated expression for the uplink ergodic sum rate of a multi-antenna multiple-access channel and propose solutions for cognitive radios to adapt rapidly to the evolution of the primary network at a minimum feedback cost for the secondary networks.

A Delay-Locked Loop (DLL) for the generation of multiple clock phases/delays is proposed. Several new techniques are used to help enhance the DLLs performance, specifically, to achieve wide lock range, short locking time, and reduced jitter. The DLL can be used for a variety of applications which require precise time intervals or phase shifts. The phase detector (PD), charge pump (CP), and voltage-controlled delay line (VCDL) are the three most important blocks in a DLL. In our research, we have proposed a novel structure which integrates the functionality of both the PD and CP. By using this structure, a fast switching speed can be achieved. Moreover, the combined PD and CP also lead to reduced chip area and better jitter performance. A novel phase detection algorithm is developed and implemented in the combined PD and CP structure. This algorithm also involves a start-control circuit to avoid locking failure or false lock to harmonics. With the help of this algorithm, the proposed DLL is able to achieve lock as long as the minimum VCDL delay is less than one reference clock cycle, which is the largest possible lock range that can be achieved by the DLL. The VCDL uses fully differential signaling to minimize jitter. The delay stage of the VCDL is built with a differential topology using symmetrical loads and replica-feedback biasing, which provides a low sensitivity to supply and substrate noise as well as a wide tuning range. In addition, a shift-averaging technique is used to improve the matching between delay stages and thus to equalize the delay of each individual stage.

Technological progress in the field of wireless communications over the past few years has only been matched by the increasing demand for sophisticated services at lower costs. A significant breakthrough was achieved in the design of efficient wireless communication systems with the advent of the diversity concept. Spatial diversity exploits the availability of multiple spatial paths between the transmitter and receiver by placing antenna arrays at either end. In addition to improving the reliability of communication by creating redundant copies of the transmitted information at the receiver, wireless transceivers with multiple antennas exploit the spatial degrees of freedom to multiplex multiple streams of data and achieve significant gains in spectral efficiencies. In this thesis, we design spatial diversity techniques for slow-fading wireless channels. There are two parts to this thesis: In Part I we propose spatial diversity techniques for point-to-point single-user wireless systems, while in Part II we propose multiuser cooperative diversity techniques for multiuser wireless communication systems. In the first part, we propose a set of new wireless communication techniques for multiple-input, multiple-output (MIMO) channels over Rayleigh slow-fading wireless channels. We introduce MIMO transceivers that achieve high data rates and low error rates using a class of MIMO systems known as layered space-time (ST) architectures, which use low complexity, suboptimal decoders such as successive cancellation (SC) decoders. We propose a set of improved layered space-time architectures and show that it is possible to achieve near-optimal error performance over MIMO channels while requiring just SC decoding at the receiver. We show that these architectures achieve high rate and diversity gains. We also show that some of the proposed layered space-time architectures could find applications in multiple-access communications as low-complexity solutions for achieving near-optimum performance. In the second part of this thesis, we propose novel techniques for cooperative communication between terminals in multiuser wireless communication systems. Cooperative communication is a concept where neighboring terminals share their antennas and signal processing resources to create a virtual transmit array . In addition to transmitting their own information, users in a cooperative communication system listen to transmission from other users and relay this information to the destination, thus creating multiple paths between transmitter and receiver. This form of diversity, known as cooperative diversity, helps improve the overall reliability of all the users in a network. We start with a simple three node multiple-access system where two users are communicating with a common destination. We propose new high-rate cooperation strategies which achieve the full diversity gain offered by the cooperative channel for this simple system. We propose a new framework to address the tradeoff between cooperation and independent transmission over a multiple access channel and determine the conditions under which each idea is better than the other. Finally, we propose a high rate cooperation protocol which achieves the maximum diversity over a multiple access system with an arbitrary number of users and achieves high rates which scale favorably as the number of users increases.

In order to improve the drawback of the high peak-to-average power ratio (PAPR) on the multi-carrier systems, in this paper we derive a statistical characterization approach of the time domain signal power variance metric by means of every user¡¦s spreading code combination and subcarrier scrambling. We obviously reduce the PAPR on the multi-carrier code division multiple access (MC-CDMA) systems by resorting the combination of spreading codes and scrambling the polarities of subcarriers. Due to the large calculative number of exhaustive search, we use a low complexity Replacement Search Method (RSM) to reduce the calculation times of searching, and obtain a good result. Moreover, we can get a better PAPR reduction performance by increasing the number of iteration.

This dissertation studies fundamental limits of modern digital communication systems in presence/absence of delay and secrecy constraints. In the first part of this dissertation, we consider a typical time-division wireless communication system wherein the channel strengths of the wireless users vary with time with a power constraint at the base station and which is not subject to any delay constraint. The objective is to allocate resources to the wireless users in an equitable manner so as to achieve a specific throughput. This problem has been looked at in different ways by previous researchers. We address this problem by developing a systematic way of designing scheduling schemes that can achieve any point on the boundary of the rate region. This allows us to map a desired throughput to a specific scheduling scheme which can then be used to service the wireless users. We then propose a simple scheme by which users can cooperate and then show that a cooperative scheduling scheme enlarges the achievable rate region. A simple iterative algorithm is proposed to find the resource allocation parameters and the scheduling scheme for the cooperative system. In the second part of the dissertation, a downlink time-division wireless sys- tem that is subject to a delay constraint is studied, and the rate region and optimal scheduling schemes are derived. The result of this study concludes that the achievable throughput of users decrease as the delay constraint is increased. Next, we consider a problem motivated by cognitive radio applications which has been proposed as a means to implement efficient reuse of the licensed spectrum. Previous research on this topic has focussed largely on obtaining fundamental limits on achievable throughput from a physical layer perspective. In this dissertation, we study the impact of im- posing Quality of Service constraints (QoS) on the achievable throughput of users. The result of this study gives insights on how the cognitive radio system needs to be operated in the low and high QoS constraint regime. Finally, the third part of this dissertation is motivated by the need for commu- nicating information not only reliably, but also in a secure manner. To this end, we study a source coding problem, wherein multiple sources needs to be communicated to a receiver with the stipulation that there is no direct channel from the transmitter to the receiver. However, there are many \agents" that can help carry the information from the transmitter to the receiver. Depending on the reliability that the transmit- ter has on each of the agents, information is securely encoded by the transmitter and given to the agents, which will be subsequently given to the receiver. We study the overhead that the transmitter has to incur for transmitting the information to the receiver with the desired level of secrecy. The rate region for this problem is found and simple achievable schemes are proposed. The main result is that, separate secure coding of sources is optimal for achieving the sum-rate point for the general case of the problem and the rate region for simple case of this problem.

No description available.

No description available.