International Telemetering Conference Proceedings / October 23-26, 2000 / Town & Country Hotel and Conference Center, San Diego, California / Range to an orbiting satellite from a ground reference point (ground station) can be determined by measuring the round trip time for a waveform transmitted to the satellite and returned to the ground station (Turnaround Ranging) and more recently by using the Global Positioning System (GPS). This paper first summarizes and compares the two approaches. The paper then describes and analyzes a new turn-around ranging system which uses a flexible ranging waveform that provides spectral compatibility with existing Military, NASA, and Commercial satellite uplink/downlink signals.

Les systèmes de 3G offrent de nouveaux services support (bearer services) à plus hauts débits pour les modes de transmission "paquet". Ces services vont coexister avec la voix (ou d'autres services temps réels), des scénarios de trafic mixte, voix et données, doivent être envisagés. La norme UMTS permet effectivement aux utilisateurs d'avoir plus d'un service activé simultanément. Les différentes classes de trafic augmentent la complexité de la gestion des ressources radios. Dans ce contexte, deux types de fonctions sont étudiés: l'allocation de TFCI et l'ordonnancement de paquets. Leur impact sur la qualité de service (QoS) ainsi que sur la capacité du système est évalué. On propose des améliorations de ces mécanismes dans le but d'augmenter la capacité du système et par conséquent d'améliorer la QoS des utilisateurs. Les études se restreignent au sens montant, c'est à dire aux transmissions du mobile (User Equipment ou UE) vers le réseau. Un premier mécanisme pour lequel un effort d'amélioration est fait, est l'adaptation du lien radio par variation du débit instantané transmis. On simule le cas d'une transmission multiservice (voix et données). L'UE doit partager un débit global qui lui est alloué entre les différents services activés. Ces derniers sont véhiculés dans des radio bearers (tuyaux supports). À chaque intervalle élémentaire de transmission (Transmission Time Interval, TTI), l'UE sélectionne un sous-débit pour chaque bearer; ceci se fait par la sélection d'un "format de transport" à appliquer pendant la durée TTI. Cette procédure s'effectue dans la couche MAC (Medium Access Control); le résultat de la sélection est une combinaison de formats de transport (Transport Format Combination, TFC) que la couche physique doit utiliser. La procédure, nommée sélection de TFC, permet d'adapter la transmission des différents services aux conditions variables de la propagation radio: elle détermine notablement la performance de transmission. L'algorithme de sélection de TFC est tracé dans ses grandes lignes dans la norme. Un de ses principes est de favoriser le trafic temps réel au détriment des services de données par paquet. Cependant, le trafic temps réel peut être perturbé par le trafic de données sous certaines conditions, en particulier pour les mobiles éloignés de la station de base (Node B). On propose un algorithme de sélection de TFC qui limite ces perturbations et qui offre une plus large zone de couverture aux services temps réels. En plus, il améliore la QoS du service de données et le débit effectif de l'UE sans augmenter sa puissance de transmission. Un autre type d'études concerne l'ordonnancement de paquets entre les différents utilisateurs ou UEs. C'est une procédure qui est contrôlée par la partie fixe du réseau. Nous l'étudions principalement par simulation en considérant divers mécanismes ou variations. Un premier mécanisme est nommé fast Variable Spreading Factor (fast VSF): les UEs distants changent rapidement leur facteur d'étalement (SF) afin de conserver une puissance de transmission constante, ce qui vise à stabiliser l'interférence inter-cellulaire. Un deuxième mécanisme étudié est un accès paquet décentralisé (decentralized mode) utilisant une information en retour sur le niveau global d'interférence dans la cellule. Un troisième mécanisme nommé "fast scheduling" (ordonnancement rapide) raccourcit le cycle d'ordonnancement. Les résultats ont montré que dans le cas de faible ou moyenne charge dans la cellule, le mode décentralisé réduit le délai par paquet jusqu'à 25 %. L'ordonnancement rapide augmente la capacité du système jusqu' à 10%. En plus, il améliore la QoS perçue par les utilisateurs en terme de débit par utilisateur et délai par paquet transmis.

Conventional multicell wireless systems operate with out-of-cell interference treated as background noise; consequently, their performance faces two major limitations: 1)Signal processing is performed on a per-cell basis; and 2)Intercell interference detection is infeasible as intercell interference, although significantly above the noise level, is typically quite weak. In this thesis, we consider a multicell downlink scenario, where base-stations are equipped with multiple transmit antennas, the remote users are equipped with a single antenna, and multiple remote users are active simultaneously via spatial division multiplexing. We propose solutions for the above limitations by considering techniques for mitigating interference. The first part of the thesis proposes solutions for the first limitation. It considers the benefit of coordinating base-stations across multiple cells, where multiple base-stations may jointly optimize their respective beamformers to improve the overall system performance. It focuses on the design criteria of minimizing either the total weighted transmitted power or the maximum per-antenna power across the base-stations subject to signal-to-interference-and-noise-ratio (SINR) constraints at the remote users. The main contribution of this part is an efficient algorithm for finding the joint globally optimal beamformers across all base-stations. The proposed algorithm is based on a generalization of uplink-downlink duality to the multicell setting using the Lagrangian duality theory. An important feature is that it naturally leads to a distributed implementation in time-division duplex (TDD) systems. Simulation results suggest that coordinating the beamforming vectors alone already provides appreciable performance improvements as compared to the conventional per-cell optimized network. The second part of the thesis considers the transmission of both private and common messages for the sole purpose of intercell interference mitigation. It solves the issues of the second limitation mentioned above. It considers the benefit of designing decodable interference signals by allowing common-private message splitting at the transmitter and common message decoding by users in adjacent cells. It solves a network optimization problem of jointly determining the appropriate users in adjacent cells for rate splitting, the optimal beamforming vectors for both common and private messages, and the optimal common-private rates to minimize the total transmit power across the base-stations subject to service rate requirements for remote users. Observe that for fixed user selection and fixed common-private rate splitting, the optimization of beamforming vectors can be performed using a semidefinite programming approach. Further, this part of the thesis proposes a heuristic user-selection and rate splitting strategy to maximize the benefit of common message decoding. This part proposes a heuristic algorithm to characterize the improvement in the feasible rates with common-message decoding. Simulation results show that common message decoding can significantly improve both the total transmit power and the feasibility region for cell-edge users when base-stations are closely spaced from each other.

Conventional multicell wireless systems operate with out-of-cell interference treated as background noise; consequently, their performance faces two major limitations: 1)Signal processing is performed on a per-cell basis; and 2)Intercell interference detection is infeasible as intercell interference, although significantly above the noise level, is typically quite weak. In this thesis, we consider a multicell downlink scenario, where base-stations are equipped with multiple transmit antennas, the remote users are equipped with a single antenna, and multiple remote users are active simultaneously via spatial division multiplexing. We propose solutions for the above limitations by considering techniques for mitigating interference. The first part of the thesis proposes solutions for the first limitation. It considers the benefit of coordinating base-stations across multiple cells, where multiple base-stations may jointly optimize their respective beamformers to improve the overall system performance. It focuses on the design criteria of minimizing either the total weighted transmitted power or the maximum per-antenna power across the base-stations subject to signal-to-interference-and-noise-ratio (SINR) constraints at the remote users. The main contribution of this part is an efficient algorithm for finding the joint globally optimal beamformers across all base-stations. The proposed algorithm is based on a generalization of uplink-downlink duality to the multicell setting using the Lagrangian duality theory. An important feature is that it naturally leads to a distributed implementation in time-division duplex (TDD) systems. Simulation results suggest that coordinating the beamforming vectors alone already provides appreciable performance improvements as compared to the conventional per-cell optimized network. The second part of the thesis considers the transmission of both private and common messages for the sole purpose of intercell interference mitigation. It solves the issues of the second limitation mentioned above. It considers the benefit of designing decodable interference signals by allowing common-private message splitting at the transmitter and common message decoding by users in adjacent cells. It solves a network optimization problem of jointly determining the appropriate users in adjacent cells for rate splitting, the optimal beamforming vectors for both common and private messages, and the optimal common-private rates to minimize the total transmit power across the base-stations subject to service rate requirements for remote users. Observe that for fixed user selection and fixed common-private rate splitting, the optimization of beamforming vectors can be performed using a semidefinite programming approach. Further, this part of the thesis proposes a heuristic user-selection and rate splitting strategy to maximize the benefit of common message decoding. This part proposes a heuristic algorithm to characterize the improvement in the feasible rates with common-message decoding. Simulation results show that common message decoding can significantly improve both the total transmit power and the feasibility region for cell-edge users when base-stations are closely spaced from each other.

This thesis describes GSM communication, the method of its jamming and design of a jammer for this band. This document is mainly focused on design of the jammer with the variable bandwidth of jamming and the variable level of output power. Requested parameters of jamming are set by a control panel with a LCD display. In this document there is a detailed description of each function block and connection between them. At the end of this thesis there are released measured results of designed jammer.

In cellular communication systems, the estimation of Doppler spread has a wide range of applications such as handoff, channel assignment scheme, adaptivetransmission, power control, etc. A great quantity of Doppler spread estimation algorithms have been proposed in the literature. But there has been few investigations which gives a comprehensive comparison of these algorithms. Therefore, it is of great signicance to compare and evaluate the performance of the existing algorithms in the same simulation framework. In this report, the uplink of WCDMA is considered. Four different types of Doppler spread estimation algorithms are evaluated and compared in a link level baseband simulator. The performance and the ability to implement are considered as the metrics for evaluation. Both Rayleigh and Rician fading channel model are applied, and the effect of speed, signal to noise ratio, Rician factor and the angle of arrived line of sight component are also tested. Moreover, the computational complexity is analysed to evaluate the practical value for implementation. / Estimatering av en mobils hastighet i form av Dopplerspridning har ett brett spektrum av tillmpningar i cellulra kommunikationssystem ssom fr yttningen avmobiler mellan celler, kanaltilldelningsschema, adaptiv sndning, eektstyrning,etc. En stor mngd algoritmer fr estimering av Dopplerspriding har frslagitsi litteraturen, men det r ovanligt med heltckande jmfrelser mellan med dessaalgoritmer. Drfr r det av stor betydelse att jmfra och utvrdera resultaten avbentliga algoritmer inom ramen fr samma simuleringsvertyg.I denna rapport anvnds upplnken fr WCDMA fr utvrdering av fyra olikatyper av algoritmer fr estimering av Dopplerspridning. Metriker fr utvrderingenr prestanda och implementeringsvnlighet. Bde Rayleigh och Rician fdningskanalmodeller har utvrderas, samt eekten av mobilens hastighet, signaltill brus frhllande, Rician faktor och infallsvinkel i ppet flt scenario. Dessutomhar den berkningsmssiga komplexiteten analyseras fr att utvrdera den praktiskaanvndbarheten i riktiga system.

This dissertation designs linear transceivers for the multiuser downlink in multiple-input multiple-output (MIMO) systems. The designs rely on an uplink/downlink duality for the mean squared error (MSE) of each individual data stream. We first consider the design of transceivers assuming channel state information (CSI) at the transmitter. We consider minimization of the sum-MSE over all users subject to a sum power constraint on each transmission. Using MSE duality, we solve a computationally simpler convex problem in a virtual uplink. The transformation back to the downlink is simplified by our demonstrating the equality of the optimal power allocations in the uplink and downlink. Our second set of designs maximize the sum throughput for all users. We establish a series of relationships linking MSE to the signal-to-interference-plus-noise ratios of individual data streams and the information theoretic channel capacity under linear minimum MSE decoding. We show that minimizing the product of MSE matrix determinants is equivalent to sum-rate maximization, but we demonstrate that this problem does not admit a computationally efficient solution. We simplify the problem by minimizing the product of mean squared errors (PMSE) and propose an iterative algorithm based on alternating optimization with near-optimal performance. The remainder of the thesis considers the more practical case of imperfections in CSI. First, we consider the impact of delay and limited-rate feedback. We propose a system which employs Kalman prediction to mitigate delay; feedback rate is limited by employing adaptive delta modulation. Next, we consider the robust design of the sum-MSE and PMSE minimizing precoders with delay-free but imperfect estimates of the CSI. We extend the MSE duality to the case of imperfect CSI, and consider a new optimization problem which jointly optimizes the energy allocations for training and data stages along with the sum-MSE/PMSE minimizing transceivers. We prove the separability of these two problems when all users have equal estimation error variances, and propose several techniques to address the more challenging case of unequal estimation errors.

This dissertation designs linear transceivers for the multiuser downlink in multiple-input multiple-output (MIMO) systems. The designs rely on an uplink/downlink duality for the mean squared error (MSE) of each individual data stream. We first consider the design of transceivers assuming channel state information (CSI) at the transmitter. We consider minimization of the sum-MSE over all users subject to a sum power constraint on each transmission. Using MSE duality, we solve a computationally simpler convex problem in a virtual uplink. The transformation back to the downlink is simplified by our demonstrating the equality of the optimal power allocations in the uplink and downlink. Our second set of designs maximize the sum throughput for all users. We establish a series of relationships linking MSE to the signal-to-interference-plus-noise ratios of individual data streams and the information theoretic channel capacity under linear minimum MSE decoding. We show that minimizing the product of MSE matrix determinants is equivalent to sum-rate maximization, but we demonstrate that this problem does not admit a computationally efficient solution. We simplify the problem by minimizing the product of mean squared errors (PMSE) and propose an iterative algorithm based on alternating optimization with near-optimal performance. The remainder of the thesis considers the more practical case of imperfections in CSI. First, we consider the impact of delay and limited-rate feedback. We propose a system which employs Kalman prediction to mitigate delay; feedback rate is limited by employing adaptive delta modulation. Next, we consider the robust design of the sum-MSE and PMSE minimizing precoders with delay-free but imperfect estimates of the CSI. We extend the MSE duality to the case of imperfect CSI, and consider a new optimization problem which jointly optimizes the energy allocations for training and data stages along with the sum-MSE/PMSE minimizing transceivers. We prove the separability of these two problems when all users have equal estimation error variances, and propose several techniques to address the more challenging case of unequal estimation errors.

Pushing wireless data traffic onto small cells is important for alleviating congestion in the over-loaded macrocellular network. However, the ultimate potential of such load balancing and its effect on overall system performance is not well understood. With the ongoing deployment of multiple classes of access points (APs) with each class differing in transmit power, employed frequency band, and backhaul capacity, the network is evolving into a complex and “organic” heterogeneous network or HetNet. Resorting to system-level simulations for design insights is increasingly prohibitive with such growing network complexity. The goal of this dissertation is to develop realistic yet tractable frameworks to model and analyze load balancing dynamics while incorporating the heterogeneous nature of these networks. First, this dissertation introduces and analyzes a class of user-AP association strategies, called stationary association, and the resulting association cells for HetNets modeled as stationary point processes. A “Feller-paradox”-like relationship is established between the area of the association cell containing the origin and that of a typical association cell. This chapter also provides a foundation for subsequent chapters, as association strategies directly dictate the load distribution across the network. Second, this dissertation proposes a baseline model to characterize downlink rate and signal-to-interference-plus-noise-ratio (SINR) in an M-band K-tier HetNet with a general weighted path loss based association. Each class of APs is modeled as an independent Poisson point process (PPP) and may differ in deployment density, transmit power, bandwidth (resource), and path loss exponent. It is shown that the optimum fraction of traffic offloaded to maximize SINR coverage is not in general the same as the one that maximizes rate coverage. One of the main outcomes is demonstrating the aggressive of- floading required for out-of-band small cells (like WiFi) as compared to those for in-band (like picocells). To achieve aggressive load balancing, the offloaded users often have much lower downlink SINR than they would on the macrocell, particularly in co-channel small cells. This SINR degradation can be partially alleviated through interference avoidance, for example time or frequency resource partitioning, whereby the macrocell turns off in some fraction of such resources. As the third contribution, this dissertation proposes a tractable framework to analyze joint load balancing and resource partitioning in co-channel HetNets. Fourth, this dissertation investigates the impact of uplink load balancing. Power control and spatial interference correlation complicate the mathixematical analysis for the uplink as compared to the downlink. A novel generative model is proposed to characterize the uplink rate distribution as a function of the association and power control parameters, and used to show the optimal amount of channel inversion increases with the path loss variance in the network. In contrast to the downlink, minimum path loss association is shown to be optimal for uplink rate coverage. Fifth, this dissertation develops a model for characterizing rate distribution in self-backhauled millimeter wave (mmWave) cellular networks and thus generalizes the earlier multi-band offloading framework to the co-existence of current ultra high frequency (UHF) HetNets and mmWave networks. MmWave cellular systems will require high gain directional antennas and dense AP deployments. The analysis shows that in sharp contrast to the interferencelimited nature of UHF cellular networks, mmWave networks are usually noiselimited. As a desirable side effect, high gain antennas yield interference isolation, providing an opportunity to incorporate self-backhauling. For load balancing, the large bandwidth at mmWave makes offloading users, with reliable mmWave links, optimal for rate. / text

Over the last few years, there has been a signifi cant rise in the mobile broadband users worldwide. Recently, operators around the world have been improving the 3G networks by providing Dual Carrier-High Speed Packet Access+ (DC-HSPA+) services in both uplink and downlink to the users. However, the delay performance of the operational DC-HSPA+ networks is not focused. Firstly, we investigate and analyze the e ffect of operator service on One-Way Delay (OWD) and Jitter. Secondly, we investigate the treatment of protocols by 3G network for random packet sizes and random Inter Packet Duration (IPD). Thirdly, we investigate the eff ect of background load on OWD for packets generated at very low rate. Fourthly, we investigate the impact of constant IPD and streaming. Fifthly, we investigate the effects of shrinking the interval of IPD on OWD in 3G networks. Lastly, we investigate the OWD for Constant-Bit-Rate (CBR) and Variable-Bit-Rate (VBR) transmission patterns. Firstly, results show that OWD in the DC-HSPA+ networks is lower compared to the OWD in the preceding HSUPA networks and OWD strongly depends on packet-size at lower rates. Secondly, the 3G networks treat User Datagram Protocol (UDP), Transmission Control Protocol (TCP) and Internet Control Message Protocol (ICMP) protocols similarly for random packet size and random IPD. Thirdly, at high rates OWD depends on E-TFCE-DCH Transport Format Combination (ETFC) grants. Thirdly, the results also indicate that background load has a signi ficant impact on the end-to-end OWD. Fourthly, for low rates, OWD depends on packet sizes and for high rates OWD depends on IPD and for higher rates, OWD depends on E-TFC grants. Fifthly, we also observe: Shrinking the interval of IPD does not necessarily improve the OWD performance. Lastly, results also indicate that the VBR pattern has a better OWD performance than the CBR pattern for low transmission rates.