Noise (AWGN) Avoidance in CDMA Systems Using the Mechanism of Spread Spectrum

In today communication systems the most probable problems are that of channel capacity, jamming and interference or noise. The channel capacity can be maximized by multiplexing the channel. While the jamming problem and for noise reduction the most important technique that we can apply is spread spectrum. That by spreading the spectrum of the original message signal, the impact of noise upon the message signal can be reduced. For that purpose, two different techniques that is DSSS(Direct Sequence Spread Spectrum) and FHSS (Frequency Hoping Spread Spectrum) can be applied. Since the two approaches are core ideas upon which CDMA system is based, so in this paper we have analyzed both the techniques to observe that h up to what extent they are efficacious in removing AWGN in CDMA systems communication. IndexTerms:DSSS, FHSS, Code Division Multiple Access (CDMA), Additive White Gaussian Noise (AWGN), spread spectrum

Transmitter Optimization in Multiuser Wireless Systems with Quality of Service Constraints

In this dissertation, transmitter adaptation for optimal resource allocation in wireless communication systems are investigated. First, a multiple access channel model is considered where many transmitters communicate with a single receiver. This scenario is a basic component of a. wireless network in which multiple users simultaneously access the resources of a wireless service provider. Adaptive algorithms for transmitter optimization to meet Quality-of-Service (QoS) requirements in a distributed manner are studied. Second, an interference channel model is considered where multiple interfering transmitter-receiver pairs co-exist such that a given transmitter communicates with its intended receiver in the presence of interference from other transmitters. This scenario models a wireless network in which several wireless service providers share the spectrum to offer their services by using dynamic spectrum access and cognitive radio (CR) technologies. The primary objective of dynamic spectrum access in the CR approach is to enable use of the frequency band dynamically and opportunistically without creating harmful interference to licensed incumbent users. Specifically, CR users are envisioned to be able to provide high bandwidth and efficient utilization of the spectrum via dynamic spectrum access in heterogeneous networks. In this scenario, a distributed method is investigated for combined precoder and power adaptation of CR transmitters for dynamic spectrum sharing in cognitive radio systems. Finally, the effect of limited feedback for transmitter optimization is analyzed where precoder adaptation uses the quantized version of interference information or the predictive vector quantization for incremental updates. The performance of the transmitter adaptation algorithms is also studied in the context of fading channels

Random Access Channel Coding in the Finite Blocklength Regime

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. Inspired by the model recently introduced for the Multiple Access Channel (MAC) with a fixed, known number of transmitters by Polyanskiy, we assume that the channel is invariant to permutations on its inputs, and that all active transmitters employ identical encoders. Unlike Polyanskiy, we consider a scenario in which neither the transmitters nor the receiver know which or how many transmitters are active. We refer to this agnostic communication setup as the Random Access Channel, or RAC. Limited feedback is used to ensure that the collection of active transmitters remains fixed during each epoch. The decoder is tasked with determining from the channel output the number of active transmitters (k) and their messages but not which transmitter sent which message. The central result of this work demonstrates the achievability on a RAC of performance that is first-order optimal for the MAC in operation during each coding epoch. While prior multiple access schemes for a fixed number of transmitters require 2^k - 1 simultaneous threshold rules, the proposed scheme uses a single threshold rule and achieves the same dispersion

Uplink capacity of a variable density cellular system with multicell processing

In this work we investigate the information theoretic capacity of the uplink of a cellular system. Assuming centralised processing for all base stations, we consider a power-law path loss model along with variable cell size (variable density of Base Stations) and we formulate an average path-loss approximation. Considering a realistic Rician flat fading environment, the analytical result for the per-cell capacity is derived for a large number of users distributed over each cell. We extend this general approach to model the uplink of sectorized cellular system. To this end, we assume that the user terminals are served by perfectly directional receiver antennas, dividing the cell coverage area into perfectly non-interfering sectors. We show how the capacity is increased (due to degrees of freedom gain) in comparison to the single receiving antenna system and we investigate the asymptotic behaviour when the number of sectors grows large. We further extend the analysis to find the capacity when the multiple antennas used for each Base Station are omnidirectional and uncorrelated (power gain on top of degrees of freedom gain). We validate the numerical solutions with Monte Carlo simulations for random fading realizations and we interpret the results for the real-world systems

Random Access Channel Coding in the Finite Blocklength Regime

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. Inspired by the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known number of transmitters, we assume that the channel is invariant to permutations on its inputs, and that all active transmitters employ identical encoders. Unlike Polyanskiy, we consider a scenario where neither the transmitters nor the receiver know which transmitters are active. We refer to this agnostic communication setup as the Random Access Channel, or RAC. Scheduled feedback of a finite number of bits is used to synchronize the transmitters. The decoder is tasked with determining from the channel output the number of active transmitters ($k$) and their messages but not which transmitter sent which message. The decoding procedure occurs at a time $n_t$ depending on the decoder's estimate $t$ of the number of active transmitters, $k$, thereby achieving a rate that varies with the number of active transmitters. Single-bit feedback at each time $n_i, i \leq t$, enables all transmitters to determine the end of one coding epoch and the start of the next. The central result of this work demonstrates the achievability on a RAC of performance that is first-order optimal for the MAC in operation during each coding epoch. While prior multiple access schemes for a fixed number of transmitters require $2^k - 1$ simultaneous threshold rules, the proposed scheme uses a single threshold rule and achieves the same dispersion.Comment: Presented at ISIT18', submitted to IEEE Transactions on Information Theor