• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 160
  • 32
  • 31
  • 30
  • 22
  • 15
  • 10
  • 7
  • 7
  • 4
  • 4
  • 3
  • 2
  • 2
  • 2
  • Tagged with
  • 390
  • 64
  • 55
  • 50
  • 46
  • 45
  • 44
  • 43
  • 43
  • 40
  • 37
  • 37
  • 36
  • 33
  • 32
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

Performance analysis of a hybrid topology CDD/TDD-CDMA network architecture

Powell, Michael-Philip 01 March 2007 (has links)
Student Number : 0006936H - MSc research report - School of Electrical and Information Engineering - Faculty of Engineering and the Built Environment / Code division duplexing (CDD) has steadily garnered attention in the telecommunication community. In this project report we propose a physical layer implementation of CDD that utilizes orthogonal Gold codes as the means of differentiating transmission directions, in order to implement an ad-hoc networking infrastructure that is overlaid on a standard mobile networking topology, and hence creating a hybrid networking topology. The performance of the CDD based system is then comparatively assessed in two ways: from the perspective of the physical layer using point-to-point simulations and from the perspective of the network layer using an iterative snapshot based simulation where node elements are able to setup connections based on predefined rules.
102

Estudio de la aplicación de VSAT, CDMA 450 y MAR al transporte y distribución de servicios de telecomunicaciones rurales en el entorno nacional

Romaní Martínez, Guillermo Daniel 09 May 2011 (has links)
El desarrollo de las comunicaciones requiere la utilización de tecnologías de punta que se adecuen a la especial topografía de nuestro País y que permitan ejecutar los enlaces de larga distancia en corto tiempo. El uso de tecnologías como VSAT, basada en accesos satelitales de pequeña apertura; MAR, basada en enlaces de microondas con línea de vista y CDMA 450, basada en celdas de telefonía móvil sobre portadoras en banda UHF (450 MHz), permitirá una solución de la problemática de los servicios de telecomunicación del ámbito rural peruano. El presente trabajo tiene como principal objetivo el de mostrar cual de las tres tecnología sería recomendable usar en una determinada región (las 7 regiones habitables: Costa, Yunga, Quechua, Suni, Puna, Rupa Rupa y Omagua) del Perú basándose para ello en aspectos económicos y técnicos. Al término de este se mostrara cuadros comparativos que mostrara los resultados obtenidos. / Tesis
103

Diseño de una red de telefonía móvil de tercera generación WCDMA para la ciudad de Tacna / Daniel Guillén Guevara

Guillén Guevara, Daniel 09 May 2011 (has links)
El presente trabajo tiene como objetivo mostrar el diseño de una red de tercera generación con tecnología WCDMA en la ciudad de Tacna para lo cual se utilizará el estándar UMTS Release 99 aprobado por la IMT2000. / Tesis
104

Optimización de la probabilidad de error en un esquema de cooperación para un detector λ-MRC en canal rayleigh

Calderón Inga, Mitchell Omar 22 June 2012 (has links)
En el presente trabajo de tesis, se ha realizado un análisis del esquema de cooperación de usuarios, con el objetivo de obtener la menor probabilidad de error de bit del sistema. Este análisis es efectuado sobre la implementación CDMA detallada en el articulo User Cooperation Diversity-Part II, escrito por Sendonaris et al. Sin embargo, la probabilidad de error obtenida en este articulo sólo es válido para canales fijos, y sabemos que en la realidad este canal esta expuesto a diferentes tipos de desvanecimiento, lo cual lo hace variable. En este caso, el desvanecimiento multitrayectoria es lo que causa los mayores daños en la recuperación de la información y obedece a una distribución de probabilidad Rayleigh. En tal sentido, una expresión exacta para la probabilidad de error de bit media fue obtenida para el detector λ-MRC (maximal-ratio combining), sobre un canal con desvanecimiento Rayleigh. Sin embargo, dada la complejidad de la expresión exacta, una aproximación muy cercana fue obtenida para calcular la probabilidad de error de bit media, en el caso de cualquier esquema de asignación de potencia. Con esta aproximación, podemos hacer un análisis más exhaustivo y más real del sistema, en el sentido de conocer cuándo la cooperación es beneficiosa y cuándo no la es. Una vez identificado cuando cooperar, la idea es hacerlo con los parámetros adecuados para que la probabilidad de error del sistema sea la mínima. Nuestro análisis, consiste precisamente, en encontrar estos parámetros para tener un sistema de cooperación de usuarios óptimo. Aún con nuestra aproximación, manejar tantas variables resulta complejo. Por tal motivo, simplificaremos el análisis usando una asignación de potencia uniforme, ya que nuestro objetivo es demostrar que podemos llegar a tener un mejor sistema con el manejo adecuado de todas las variables involucradas. Aquí también, debemos considerar que el esfuerzo computacional demandado no debe ser alto, ya que esto le quitará eficiencia a nuestro análisis. Los resultados presentados, muestran que nuestra expresión permite investigar las diferentes situaciones del canal y con esta información crear estrategias, haciendo que el esquema de cooperación de usuarios sea más eficiente. / Tesis
105

Optimisation of Iterative Multi-user Receivers using Analytical Tools

Shepherd, David Peter, RSISE [sic] January 2008 (has links)
The objective of this thesis is to develop tools for the analysis and optimization of an iterative receiver. These tools can be applied to most soft-in soft-out (SISO) receiver components. For illustration purposes we consider a multi-user DS-CDMA system with forward error correction that employs iterative multi-user detection based on soft interference cancellation and single user decoding. Optimized power levels combined with adaptive scheduling allows for efficient utilization of receiver resources for heavily loaded systems.¶ Metric transfer analysis has been shown to be an accurate method of predicting the convergence behavior of iterative receivers. EXtrinsic Information (EXIT), fidelity (FT) and variance (VT) transfer analysis are well-known methods, however the relationship between the different approaches has not been explored in detail. We compare the metrics numerically and analytically and derive functions to closely approximate the relationship between them. The result allows for easy translation between EXIT, FT and VT methods. Furthermore, we extend the $J$ function, which describes mutual information as a function of variance, to fidelity and symbol error variance, the Rayleigh fading channel model and a channel estimate. These $J$ functions allow the \textit{a priori} inputs to the channel estimator, interference canceller and decoder to be accurately modeled. We also derive the effective EXIT charts which can be used for the convergence analysis and performance predictions of unequal power CDMA systems.¶ The optimization of the coded DS-CDMA system is done in two parts; firstly the received power levels are optimized to minimize the power used in the terminal transmitters, then the decoder activation schedule is optimized such that the multi-user receiver complexity is minimized. The uplink received power levels are optimized for the system load using a constrained nonlinear optimization approach. EXIT charts are used to optimize the power allocation in a multi-user turbo-coded DS-CDMA system. We show through simulation that the optimized power levels allow for successful decoding of heavily loaded systems with a large reduction in the convergence SNR.¶ We utilize EXIT chart analysis and a Viterbi search algorithm to derive the optimal decoding schedule for a multi component receiver/decoder. We show through simulations that decoding delay and complexity can be significantly reduced while maintaining BER performance through optimization of the decoding schedule.
106

Random Matrix Theory Analysis of Fixed and Adaptive Linear Receivers

Peacock, Matthew James McKenzie January 2006 (has links)
Doctor of Philosophy (PhD) / This thesis considers transmission techniques for current and future wireless and mobile communications systems. Many of the results are quite general, however there is a particular focus on code-division multiple-access (CDMA) and multi-input multi-output (MIMO) systems. The thesis provides analytical techniques and results for finding key performance metrics such as signal-to-interference and noise power ratios (SINR) and capacity. This thesis considers a large-system analysis of a general linear matrix-vector communications channel, in order to determine the asymptotic performance of linear fixed and adaptive receivers. Unlike many previous large-system analyses, these results cannot be derived directly from results in the literature. This thesis considers a first-principles analytical approach. The technique unifies the analysis of both the minimum-mean-squared-error (MMSE) receiver and the adaptive least-squares (ALS) receiver, and also uses a common approach for both random i.i.d. and random orthogonal precoding. The approach is also used to derive the distribution of sums and products of free random matrices. Expressions for the asymptotic SINR of the MMSE receiver are derived, along with the transient and steady-state SINR of the ALS receiver, trained using either i.i.d. data sequences or orthogonal training sequences. The results are in terms of key system parameters, and allow for arbitrary distributions of the power of each of the data streams and the eigenvalues of the channel correlation matrix. In the case of the ALS receiver, we allow a diagonal loading constant and an arbitrary data windowing function. For i.i.d. training sequences and no diagonal loading, we give a fundamental relationship between the transient/steady-state SINR of the ALS and the MMSE receivers. We demonstrate that for a particular ratio of receive to transmit dimensions and window shape, all channels which have the same MMSE SINR have an identical transient ALS SINR response. We demonstrate several applications of the results, including an optimization of information throughput with respect to training sequence length in coded block transmission.
107

Low Complexity Adaptive Iterative Receivers for Layered Space-Time Coded and CDMA Systems

Teekapakvisit, Chakree January 2007 (has links)
Doctor of Philosophy(PhD) / In this thesis, we propose and investigate promising approaches for interference mitigation in multiple input multiple output (MIMO) and code division multiple access (CDMA) systems. Future wireless communication systems will have to achieve high spectral efficiencies in order to meet increasing demands for huge data rates in emerging Internet and multimedia services. Multiuser detection and space diversity techniques are the main principles, which enable efficient use of the available spectrum. The main limitation for the applicability of the techniques in these practical systems is the high complexity of the optimal receiver structures. The research emphasis in this thesis is on the design of a low complexity interference suppression/cancellation algorithm. The most important result of our research is the novel design of interference cancellation receivers which are adaptive and iterative and which are of low computational complexity. We propose various adaptive iterative receivers, based on a joint adaptive iterative detection and decoding algorithm. The proposed receiver can effectively suppress and cancel co-channel interference from the adjacent antennas in the MIMO system with a low computation complexity. The proposed adaptive detector, based on the adaptive least mean square (LMS) algorithm, is investigated and compared with the non-adaptive iterative receiver. Since the LMS algorithm has a slow convergence speed, a partially filtered gradient LMS (PFGLMS) algorithm, which has a faster convergence speed, is proposed to improve the convergence speed of the system. The performance and computational complexity of this receiver are also considered. To further reduce the computational complexity, we apply a frequency domain adaptation technique into the adaptive iterative receivers. The system performance and complexity are investigated. It shows that the computational complexity of the frequency domain based receiver is significantly lower than that of the time domain based receiver with the same system performance. We also consider applications of MIMO techniques in CDMA systems, called MIMO-CDMA. In the MIMO-CDMA, the presence of the co-channel interference (CCI) from the adjacent antennas and multiple access interference (MAI) from other users significantly degrades the system performance. We propose an adaptive iterative receiver, which provides the capability to effectively suppress the interference and cancel the CCI from the adjacent antennas and the MAI from other users so as to improve the system performance. The proposed receiver structure is also based on a joint adaptive detection and decoding scheme. The adaptive detection scheme employs an adaptive normalized LMS algorithm operating in the time and frequency domain. We have investigated and compared their system performance and complexity. Moreover, the system performance is evaluated by using a semi-analytical approach and compared with the simulation results. The results show that there is an excellent agreement between the two approaches.
108

Approche multicouches pour la reconfigurabilité de systèmes de communications de 3ème génération

Krikidis, Ioannis 11 1900 (has links) (PDF)
Un circuit de télécommunication est reconfigurable s'il est capable de changer de fonction en temps réel, comme par exemple le passage d'un standard de communication à un autre, ou l'optimisation des performances suite à une modification contextuelle. La reconfigurabilité nécessite de mener conjointement une étude au niveau algorithmique et au niveau architectural de façon à respecter les contraintes de flexibilité, rapidité et consommation. Dans cette thèse la reconfigurabilité a été étudiée dans le cadre du standard WCDMA de façon à optimiser conjointement la performance et la consommation de puissance lors d'un changement du canal de propagation ou des paramètres de communication. Une des contributions de cette thèse est une nouvelle méthode de reconfigurabilité appelée "Approche itérative". Cette approche essaye de tirer parti des algorithmes ayant des opérateurs similaires et se prêtant à la sérialisation des calculs. Les systèmes de communications et de traitement du signal utilisent de nombreux algorithmes itératifs propices à l'utilisation de cette méthode. L'approche itérative permet de disposer de grain de calcul fin qui joue en faveur de la diminution de la complexité et de la facilité à mettre en commun des ressources entre différents algorithmes. Un autre atout est d'autoriser l'ajustement de la qualité de l'algorithme en jouant sur le nombre d'itérations. La consommation dynamique d'une structure sérielle de ce type est généralement supérieure à la structure factorisation. En revanche la consommation statique qui devient non négligeable dans les technologies CMOS <0.1m est nettement inférieure du fait de la taille réduite du grain de calcul. Pour certaines fonctions, tous les opérateurs peuvent ne pas être utilisés, mais la faible granularité des opérateurs minimise l'utilisation sous optimale du matériel. Le nombre d'itérations peut aussi être limité par le temps imparti pour le traitement. Mais en considérant qu'un itération ne peut durer qu'un cycle d'horloge avec une architecture pipeline, le rapport entre la fréquence d'horloge (>>200Mmots/s) et les débits binaires (quelque Mbits/s à quelques 10Mb/s) offre un nombre d'itération suffisant pour de nombreuses fonctions. Les exemples décrits dans cette thèse illustrent l'intérêt de cette méthode. Plus précisément, nous nous sommes intéressés aux algorithmes de réception d'un système DS-CDMA et à leur implémentation matérielle. La similarité de calcul entre trois fonctions de base qui sont: la démodulation en râteau (RAKE), l'estimation du canal, et l'annulation d'interférence (IC); ainsi que leur nature itérative, a débouché sur quelques algorithmes de réception chargés d'adapter le comportement aux conditions environnementales. Ces algorithmes optimisent la performance du système et minimisent la surface de matériel. Cette approche est donc particulièrement efficace pour l'implémentation de terminaux qui ont des contraintes de puissance et de surface très critiques.
109

Optimized Power Control for CDMA System using Channel Prediction

Uurtonen, Tommi January 2005 (has links)
<p>In an optimal power control scheme for a Code Division Multiple Access (CDMA) system all mobile stations signals should arrive to the base station at equal power. If not, stronger singals may cause too much interference and block out weaker ones. Commonly used power control schemes utilizes the Signal to Interference Ratio (SIR) to design a Power Control Command (PCC) to adjust the transmit power of the mobile station. A significant problem within the conventional methods is the slow SIR recovery due to deep channel fades. Conventional methods base the PCC on the previous channel state when in fact, the channel state may have significantly changed when transmission occurs. These channel changes may cause the SIR to drop or rise drastically and lead to uncontrollable Multi Access Interference (MAI) resulting in power escalation and making the system unstable. In order to overcome power escalation and improve the recovery from deep fades a novel power control method has been developed. Based on Linear Quadratic Control and Kalman filtering for channel prediction this method designs the PCC based on the coming channel state instead of the current. This optimizes the PCC for the channel state where transmission occurs. Simulations show that this control scheme outperforms previous methods by making the impacts of the deep fades less severe on the SIR and also improves the overall SIR behaviour.</p>
110

Cardinality for optical orthogonal codes with variable length and weight

Isaksson, Erica January 2006 (has links)
<p>To let many users benefit from the high speed communication in an optical fiber, a way to share the channel is needed. One way to share the channel between the users is the multiple access technique of Code Division Multiple Access, CDMA. This technique is based on coding. By assigning the users different codewords, the receiver is able to distinguish the information sent from each user. One family of codes suitable to use in a fiber optic network is the constant weight Optical Orthogonal Codes, OOC.</p><p>To influence the users interference tolerability it is possible to assign the users codewords of the same length but with different weights. By letting the users have codewords of different length it is possible to have different data rates in the system. These two versions of optical orthogonal codes, with variable length and weight, are investigated in this thesis for their cardinality. The variable weight and variable length codes were created by combining optical orthogonal codes with different parameters.</p><p>I have found that for variable length OOC:s of weight 2 it seems to be possible to increase the cardinality of a code, but for codes with higer weights than that, it is better that all users are assigned codewords of the same length. But since an upper bound for the cardinality of these types of codes has not been found, it is not possible to verify if this conclusion is correct. For variable weight OOC:s it is found that it is only possible to increase the cardinality of small, not optimal, codes. For codes including many codewords it is rarely possible to include more codewords without breaking the conditions on cross correlation between the codewords.</p>

Page generated in 0.1093 seconds