351 |
Generalized Random Spreading Performance Analysis Of Cdma Over Gwssus Fading ChannelsErtug, Ozgur 01 December 2005 (has links) (PDF)
Since direct-sequence code-division multiple-access
(DS-CDMA) is an interference-limited random multiple-access
scheme, the reduction of co-channel interference with either
interference suppression or interference cancellation multiuser
receivers and/or power control to prevent detrimental near-far
situations is vital for improved performance. Up to date, some
contributions investigated randomly-spread asymptotically - large
number of users and large bandwidth - large CDMA systems with
multiuser receivers and power control via random matrix theoretic
and free probability theoretic tools especially over Gaussian and
single-path fading channels. As complement within this thesis, we
analyze also within the generalized random spreading framework but
at finite system sizes and without power control the capacity
achievable with linear multichannel multiuser receivers / i.e.
RAKE, zero-forcing decorrelator, linear minimum mean-squared error
(LMMSE) multiuser receivers, within a single-cell setting over
generalized time-varying GWSSUS - Rayleigh/Ricean - fading
channels via random matrix theoretic tools. Assuming maximal-ratio
combining (MRC) of resolved frequency - multipath - diversity
channels due to wideband transmission, the signal-to-interference
ratios (SIRs) with multichannel multiuser receivers that set the
basis for further derivations are statistically characterized. The
information-theoretic ergodic and outage sum-rates spectral
efficiencies are then derived and analyzed.
|
352 |
Avaliação do algoritmo de busca de sequencias de espalhamento em canais com desvanecimento seletivo em frequencia com codigos corretores de erros / Evaluation of the spread sequences selection algorithm over frequency selective fading channels with error correcting codesMataveli, Luis Otavio, 1983- 08 April 2008 (has links)
Orientador: Celso de Almeida / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-12T06:34:19Z (GMT). No. of bitstreams: 1
Mataveli_LuisOtavio_M.pdf: 877476 bytes, checksum: afc5fb9153e7311af03669d45d798a73 (MD5)
Previous issue date: 2008 / Resumo: O desempenho dos sistemas de comunicação sem fio que utilizam a técnica de múltiplo acesso CDMA é limitado pela interferência. A proposição de um algoritmo de escolha de seqüências de espalhamento foi feita para buscar uma diminuição na interferência média do sistema. Nos padrões atuais, como CDMA2000 e WCDMA, não são definidos nenhum critério para escolha das seqüências. Por isso, nesta dissertação será analisado o desempenho do algoritmo de escolha de seqüências de espalhamento proposto anteriormente juntamente com o uso de códigos corretores de erro em canais com desvanecimento seletivo em freqüência. Será analisado o comportamento das seqüências Walsh, Gold e m-deslocadas. O algoritmo analisado apresenta bons resultados sem o uso de codificação, mas, como maneira de analisar um sistema mais próximo do real, serão utilizados os códigos convolucionais e turbo. Palavras-chave: Algoritmo de busca, sistemas CDMA, espalhamento espectral, códigos convolucionais, códigos turbo. / Abstract: The performance of wireless communication systems that use the multiple access code division technique, CDMA, is interference-limited. A sequence selection algorithm allows a reduction in the mean interference of the system. In the standards like CDMA2000 and WCDMA no algorithm is defined for choosing the sequences. For this reason, in this dissertation we evaluate the performance of the proposed spread sequences selection algorithm together with error correcting codes over frequency selective fading channels. It is analyzed the behavior of Walsh, Gold, and shifted-m sequences. The algorithm had shown good results without channel coding, but to analyze a system similar to a real one, convolutional and turbo codes are going to be used. Key words: Selection algorithm, CDMA systems, spread spectrum, convolutional codes, turbo codes. / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica
|
353 |
Controle de congestionamento do protocolo TCP em sistemas de comunicação sem fio CDMA usando estrategia de detecção multiusuario, arranjo de antenas e correção de erro FEC / A new TCP congestioned window algorithm for wireless CDMA system using multiuser decorrelating detection, antenna array and FECOlmedo Cifuentes, Gonzalo Fernando 12 August 2018 (has links)
Orientador: Celso de Almeida / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-12T12:24:43Z (GMT). No. of bitstreams: 1
OlmedoCifuentes_GonzaloFernando_D.pdf: 1566286 bytes, checksum: 91619aa7cb33f0594cf4dd4e9b185238 (MD5)
Previous issue date: 2008 / Resumo: Neste trabalho foi proposto um novo algoritmo para o controle da janela de congestionamento do protocolo TCP, que melhora o desempenho da vazão de dados em redes sem
fio. A estimação da banda disponível responsável pela melhoria do sistema, se dá pois os segmentos TCP com erro produzidos pelo canal sem fio são reconhecidos por uma confirmação negativa NACK, ou quando o buffer do sistema enche. Para o mecanismo proposto, uma expressão analítica da vazão de dados em função da probabilidade de erro de segmentos TCP no canal sem fio é obtida. No sistema sem fio é analisado o enlace reverso de sistemas CDMA de sequencia direta, tanto síncrono, como assíncrono, considerando um canal seletivo em frequencia com desvanecimento do tipo Rayleigh e modulação BPSK. São comparados diferentes tipos de receptores, que usam detecção multiusuário descorrelacionadora, arranjo de antenas e codificação de canal do tipo convolucional ou turbo. Foram obtidas expressões simples e precisas, antes não encontradas na literatura da eficincia assintotica média e da probabilidade de erro de bit que foram comparadas com resultados de simulação. Foram comparadas tres estratégias propostas de decodificação iterativa turbo. Expressões de complexidade computacional do receptor também foram elaboradas. / Abstract: In this work, we propose a new TCP congestioned window algorithm that improves the
performance for wireless networks, where the TCP segments with errors caused by the wireless channel are recognized by a negative acknowledgement (NACK) or when the system buffer is full, the protocol estimate the available bandwidth. For the proposed strategy, a simple analytic characterization of the steady state throughput as a function of the TCP segment error probability for the wireless channel is obtained. In the wireless system, we consider the reverse link of synchronous and asynchronous direct-sequences code division multiple access (DS-CDMA) systems in frequency-selective Rayleigh fading channels and BPSK modulation. Different types of receivers using multiuser decorrelating detection, antenna array and convolutional or turbo coding are compared. Simple and precise novel close-form analytic expressions for the asymptotic multiuser efficiency and for the mean bit error probability are derived. The proposed expressions of the analytic model developed to evaluate the performance of those systems are verified by the results of computer simulations. For turbo code, three iterative turbo decoding strategies are
proposed and compared. Expressions for computational complexity are also obtained. / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica
|
354 |
Podpora kvalitativních požadavků služeb v rádiových přístupových sítích vysokorychlostních variant mobilních sítí / Support of service quality demands in radio access networks of high speed variants of mobile networksKuruc, Jiří January 2009 (has links)
The work deals with the developmental stages (Releases) of the third generation UMTS net-works. It explains a partial improvement from Release 99 to Release 5 and Release 6 to im-prove the quality parameters of a mobile data transmission. In the practical part, there are measured qualitative parameters of the third generation networks that are available in the Czech Republic: UMTS, HSDPA, CDMA 1xEV-DO Rev.0 and Rev.A and UMTS-TDD. The measurements give reasonably achievable data rates in both directions (downlink & uplunk), a response time, quality of VoIP calls, a dispersion, a data-loss and an ability to transmit video with different data flows. The other aspects especially an availability of coverage and end-user terminals have been assessed wihin the each network. The work is supplemeted with a laboratory, which is focused on a practical comparison of the basic parameters of data transmissions of 2G and 3G networks.
|
355 |
Wireless body area networks : co-channel interference mitigation & avoidance / Planification des réseaux de capteurs médicaux sous contrainte d'optimisation de l'énergieAli, Mohamad Jaafar 09 September 2017 (has links)
L’amélioration de la qualité et de l’efficacité en santé est un réel enjeu sociétal. Elle implique la surveillance continue des paramètres vitaux ou de l’état mental du sujet. Les champs d’applications sont vastes : l’application la plus importante est la surveillance des patients à distance. Les avancées en micro-électronique, capteurs et réseaux sans-fil permettent aujourd’hui le développement de systèmes ambulatoires performants pour le monitoring de paramètres physiologiques, capables de prendre en compte d’importantes contraintes techniques : forte intégration pour la réduction de la taille et faible consommation pour une plus grande autonomie [1]. Cependant, la conception de ce type de réseaux de capteurs médicaux WBANs (Wireles Body Area Networks) se heurte à un certain nombre de difficultés techniques, provenant des contraintes imposées par les capacités réduites des capteurs individuels : basse puissance, énergie limitée et faible capacité de stockage. Ces difficultés requièrent des solutions différentes, encore très embryonnaires, selon l’application visée (monitoring à but médical). La forte mobilité et le changement rapide de la topologie du réseau dévoilent un verrou scientifique et social. En outre, l’interférence de différents capteurs constituant le WBAN augmente la difficulté de la mise en place de ce type de réseaux. De nombreuses solutions dans la littérature ont été étudiées, comme nous allons illustrer dans ce manuscrit, néanmoins elles restent limitées. Nous nous intéresserons tout particulièrement à la gestion des interférences Intra- et Inter-WBAN, leur impacte sur la fiabilité des transmissions (des liens) et la durée de vie de ce type de réseaux. Plus précisément, nous abordons ces problématiques en se basant sur des modélisations théoriques et analytiques et avec une conception pratique des solutions proposées. Afin d’atteindre les objectifs cités ci-dessous, nous abordons quatre solutions : • Une gestion des interférences intra-WBAN • Une gestion coopérative des interférences Inter-WBAN • Une gestion non coopérative des interférences, Inter-WBAN • Une gestion des interférences WBAN dans un contexte IoT Dans la première partie de cette thèse et afin de répondre en partie aux problèmes de gestion des interférences Intra-WBAN. Nous présentons deux mécanismes pour le WBAN : (a) CFTIM qui alloue dynamiquement des slots et des canaux dit- stables (avec un taux d’interférences le bas possible dans le temps) pour réduire les interférences intra-WBAN. (b) IAA ajuste dynamiquement la taille du superframe et limite le nombre de canaux à 2 pour abaisser les interférences Intra-WBAN et ainsi économiser l’énergie. Une validation avec un model probabiliste est proposé afin de valider théoriquement l’efficacité de notre solution. Les résultats de la simulation démontrent l’efficacité du CFTIM et de l’IAA en termes de réduction de la probabilité d’interférence, l’extension de la durée de vie du réseau et l’amélioration du débit et de la fiabilité des transmissions. Notre seconde contribution, propose une gestion coopératives des interférences Inter-WBAN en utilisant des codes orthogonaux. Motivé par un approvisionnement temporel distribué basé sur la norme [2] IEEE 802.15.6, nous proposons deux solutions. (a) DTRC qui fournit à chaque WBAN les connaissances sur les superframes qui se chevauchent. Le second, (b) OCAIM qui attribue des codes orthogonaux aux capteurs appartenant à deux listes de groupe de capteur en interférences de deux WBAN différents (SIL). Les résultats démontrent qu’OCAIM diminue les interférences, améliore le débit et préserve la ressources énergétiques. La troisième partie nous a permis d’aborder la gestion des interférences, mais cette fois ci d’une manière non-coopérative en se basant sur l’affectation couple Slot/Canal. Plus précisément, nous proposons deux schémas basés sur les carrés latins. (...) / A Wireless Body Area Network (WBAN) is a short-range network that consists of a coordinator (Crd) and a collection of low-power sensors that can be implanted in or attached to the human body. Basically, WBANs can provide real-time patient monitoring and serve in various applications such as ubiquitous health-care, consumer electronics, military, sports, etc. [1]. As the license-free 2.4 GHz ISM band is widely used among WBANs and across other wireless technologies, the fundamental problem is to mitigate the resulting co-channel interference. Other serious problems are to extend the network lifetime and to ensure reliable transmission within WBANs, which is an urgent requirement for health-care applications. Therefore, in this thesis, we conduct a systematic research on a few number of research problems related to radio co-channel interference, energy consumption, and network reliability. Specifically, we address the following problems ranging from theoretical modeling and analysis to practical protocol design: • Intra-WBAN interference mitigation and avoidance • Cooperative inter-WBAN interference mitigation and avoidance • Non-cooperative inter-WBAN interference mitigation and avoidance • Interference mitigation and avoidance in WBANs with IoT Firstly, to mitigate the intra-WBAN interference, we present two mechanisms for a WBAN. The first is called CSMA to Flexible TDMA combination for Interference Mitigation, namely, CFTIM, which dynamically allocates time-slots and stable channels to lower the intra-WBAN interference. The second is called Interference Avoidance Algorithm, namely IAA that dynamically adjusts the superframe length and limits the number of channels to 2 to lower the intra-WBAN interference and save energy. Theoretically, we derive a probabilistic model that proves the SINR outage probability is lowered. Simulation results demonstrate the effectiveness and the efficiency of CFTIM and IAA in terms of lowering the probability of interference, extending network lifetime, improving throughput and reliability. Secondly, we address the problem of interference among cooperative WBANs through using orthogonal codes. Motivated by distributed time provisioning supported in IEEE 802.15.6 standard [2], we propose two schemes. The first is called Distributed Time Correlation Reference, namely, DTRC that provides each WBAN with the knowledge about which superframes overlap with each other. The second is called Orthogonal Code Allocation Algorithm for Interference Mitigation, namely, OCAIM, that allocates orthogonal codes to interfering sensors belonging to sensor interference lists (SILs), which are generated based on the exchange of power-based information among WBANs. Mathematically, we derive the successful and collision probabilities of frames transmissions. Extensive simulations are conducted and the results demonstrate that OCAIM can diminish the interference, improve the throughput and save the power resource. Thirdly, we address the problem of co-channel interference among non-cooperative WBANs through time-slot and channel hopping. Specifically, we propose two schemes that are based on Latin rectangles. The first is called Distributed Algorithm for Interference mitigation using Latin rectangles, namely, DAIL that allocates a single channel to a timeslot combination to each sensor to diminish inter-WBAN interference and to yield better schedules of the medium access within each WBAN. The second is called Channel Hopping for Interference Mitigation, namely, CHIM, which generates a predictable interference free transmission schedule for all sensors within a WBAN. CHIM applies the channel switching only when a sensor experiences interference to save the power resource. Furthermore, we present an analytical model that derives bounds on collision probability and throughput for sensors transmissions. (...)
|
356 |
Applications of Integer Quadratic Programming in Control and CommunicationAxehill, Daniel January 2005 (has links)
The main topic of this thesis is integer quadratic programming with applications to problems arising in the areas of automatic control and communication. One of the most widespread modern control principles is the discrete-time method Model Predictive Control (MPC). The main advantage with MPC, compared to most other control principles, is that constraints on control signals and states can easily be handled. In each time step, MPC requires the solution of a Quadratic Programming (QP) problem. To be able to use MPC for large systems, and at high sampling rates, optimization routines tailored for MPC are used. In recent years, the range of application of MPC has been extended from constrained linear systems to so-called hybrid systems. Hybrid systems are systems where continuous dynamics interact with logic. When this extension is made, binary variables are introduced in the problem. As a consequence, the QP problem has to be replaced by a far more challenging Mixed Integer Quadratic Programming (MIQP) problem. Generally, for this type of optimization problems, the computational complexity is exponential in the number of binary optimization variables. In modern communication systems, multiple users share a so-called multi-access channel, where the information sent by different users is separated by using almost orthogonal codes. Since the codes are not completely orthogonal, the decoded information at the receiver is slightly correlated between different users. Further, noise is added during the transmission. To estimate the information originally sent, a maximum likelihood problem involving binary variables is solved. The process of simultaneously estimating the information sent by multiple users is called multiuser detection. In this thesis, the problem to efficiently solve MIQP problems originating from MPC is addressed. Two different algorithms are presented. First, a polynomial complexity preprocessing algorithm for binary quadratic programming problems is presented. By using the algorithm, some, or all, binary variables can be computed efficiently already in the preprocessing phase. In simulations, the algorithm is applied to unconstrained MPC problems with a mixture of real and binary control signals. It has also been applied to the multiuser detection problem, where simulations have shown that the bit error rate can be significantly reduced by using the proposed algorithm as compared to using common suboptimal algorithms. Second, an MIQP algorithm tailored for MPC is presented. The algorithm uses a branch and bound method where the relaxed node problems are solved by a dual active set QP algorithm. In this QP algorithm, the KKT-systems are solved using Riccati recursions in order to decrease the computational complexity. Simulation results show that both the QP solver and the MIQP solver proposed have lower computational complexity than corresponding generic solvers. / <p>Report code: LiU-TEK-LIC-2005:71.</p>
|
357 |
Simulación del estándar IS-95 en MATLABCorzo Gálvez, Miguel Ángel 23 November 2011 (has links)
En el primer capítulo se explica la importancia del sistema CDMA en el
desarrollo de los futuros sistemas celulares y el motivo del desarrollo de esta
tesis.
En el segundo capítulo se explica la evolución de la tecnología celular, en la
cual fueron apareciendo diferentes tecnologías, las cuales ofrecían mejores
prestaciones para el usuario final.
En el tercer capítulo se describen todas las técnicas de acceso múltiple
empleados por los diversos sistemas de comunicación.
En el cuarto capítulo se desarrolla el cálculo de las pérdidas en el trayecto; de
tal manera que con este cálculo se puede encontrar la cobertura de la señal.
Además, se explican algunos modelos utilizados en la práctica tales como
Okumura, Hata y Link Budget. También define algunos conceptos útiles para
este capítulo y por último se muestra las bandas asignadas en Perú.
En el quinto capitulo se explican los temas relacionados con el estándar IS-95,
la cual engloba diferentes técnicas para procesar la señal; los conceptos para
entender el funcionamiento y los canales que posee en los dos sentidos
downlink & uplink.
En el sexto capítulo se desarrollan los diagramas de flujo del programa
principal y los subprogramas. Los subprogramas ayudan a organizar las tareas
de cada una de las técnicas utilizadas simular el estándar, de tal manera que el
programa principal haga uso de los subprogramas para el procesamiento de la
señal. Adicionalmente, en este capítulo se explica las perdidas de datos en la
codificación de la voz, la clave de la técnica del CDMA con ayuda de la
correlación de las secuencias pseudoaleatorias y por último un manual, donde
explica cómo se debe usar el programa.
En el séptimo y octavo capítulo se presentan las observaciones y
recomendaciones que se observaron durante el desarrollo del trabajo de tesis.
En el noveno capítulo se dan las referencias bibliográficas utilizadas para el
desarrollo de la tesis, cabe destacar que la mayor fuente de información fue
Internet. Al final de la tesis se muestra un pequeño glosario de las palabras
técnicas empleadas en la tesis.
|
358 |
Diseño de una red rural CDMA 450, en las cuencas de los ríos Apurímac, Paruro y Acomayo / Jaime Pilco VargasPilco Vargas, Jaime 09 May 2011 (has links)
La presente tesis se ocupa del diseño de una Red de Telecomunicaciones Rurales para las poblaciones ubicadas en las cuencas
de los ríos Paruro, Apurimac y Acomayo dentro de las provincias de Paruro y
Acomayo, en la Región Cusco, haciendo uso de la tecnología CDMA en la frecuencia de 450 MHz (CDMA 450 en adelante).
|
359 |
Algoritmos para Sistemas de Comunicaciones Multi-Usuario con Múltiples AntenasBotella Mascarell, Carmen 30 June 2008 (has links)
Los sistemas MIMO (Multiple-Input Multiple-Output) multi-usuario multi-celda coordinados se definen como una configuración avanzada y cooperativa de sistema MIMO. En estos sistemas, varias estaciones base cooperan perfectamente en datos a través de un enlace de alta capacidad, y transmiten de forma coordinada a todos los usuarios de una determinada área. Además, cada estación base del sistema está sujeta a una restricción en la potencia total que puede transmitir. El objetivo general de la Tesis es estudiar algoritmos que combinan control de potencia y beamforming óptimo para resolver el problema de minimización de potencia en el enlace downlink de un sistema W-CDMA MIMO multi-usuario multi-celda coordinado. Al mismo tiempo, se propone un modelo de sistema matricial y lineal que caracteriza completamente los procesos que tienen lugar en transmisión y en recepción en este tipo de sistemas. Paralelamente, a lo largo de la Tesis se contemplan soluciones a problemas de tipo práctico, como por ejemplo, limitaciones en el tipo de información que se dispone en transmisión. / Botella Mascarell, C. (2008). Algoritmos para Sistemas de Comunicaciones Multi-Usuario con Múltiples Antenas [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/2421
|
360 |
Development and Testing of A Space-borne GPS Signal Strength SensorLu, Dianhong 13 October 2003 (has links)
The Global Positioning System (GPS) satellite signals provide not only traditional radionavigation service but inexpensive and convenient radio beacons for signal propagation studies on ionosphere and atmosphere. This thesis describes the development and testing of a specialized GPS sensor which measures, plots and records real-time high-resolution L1 (1575.42MHz) GPS signal strength at a data rate of up to 10Hz. The instrument is based on an open architecture GPS receiver development kit that can be modified and rebuilt. The signal strength is defined as mean-square signal strength in the thesis. The coarse/acquisition code (C/A-code) correlation is applied and the raw correlation data from a GPS correlator chip is obtained to calculate the signal strength. The gain variation of the automatic gain control (AGC) in the GPS signal link is considered, and a model is designed and implemented in data post-processing to reduce the AGC distortion to GPS signal strength measurements. Speed limitation of 1,000 knots and height limitation of 60,000 feet are removed so that it can track spacecraft such as low earth orbit (LEO) satellite. Four testing plans are developed and conducted to test the GPS signal strength sensor. A GPS simulator is used and the testing results prove that the space-borne sensor is fully operational and the signal strength resolution can be smaller than 0.05dB. Additionally, a COM-port-to-TCP/IP GPS simulation remote control gateway is designed and implemented for the senor and the GPS simulator to conduct formation flying. A graphic user interface (GUI) program is also built to retrieve data from a commercial high-performance space-borne GPS receiver for comparison. A Red Hat Linux signal strength sensor based on the National Aeronautics and Space Administration (NASA) PiVoT GPS receiver is achieved by modifications. The NASA PiVoT sensor, working together with the former signal strength sensor and the commercial space-borne GPS receiver, will strengthen our academic research strength in the studies on the ionospheric and atmospheric effects and irregularities which cause GPS signal degradation and scintillations. / Master of Science
|
Page generated in 0.0277 seconds