Análisis de capacidad en sistemas CDMA y WCDMA, usando herramientas de planificación basadas en GIS y dinámica poliédrica

En este momento están entrando en operación los primeros sistemas UMTS en Europa, y están operando en varios países del mundo sistemas CDMA-2000 1xRTT, y aunque existen muchos trabajos publicados sobre la capacidad de estos sistemas, prácticamente todo lo existente se basa en el comportamiento de sistemas ideales que consideran celdas hexagonales o circulares y propagación basada en exponente inverso de la distancia y poco es lo que hay sobre el comportamiento real de dichos sistemas en entornos reales.

Sobre el exponente de pérdidas de propagación, es bien conocido que este afecta la capacidad de los sistemas CDMA; sin embargo hasta ahora no se ha considerado el efecto de los modelos de propagación que tienen en cuenta la difracción y otros fenómenos más cercanos a la realidad, y por lo tanto no se ha considerado el efecto del entorno urbano y el terreno sobre la capacidad real de los sistemas basados en CDMA.

Chaotic communication based on the particle-in-a-box electronic circuit

A secure communication system based on the error-feedback synchronization of the electronic model of the particle-in-a-box system is proposed. This circuit allows a robust and simple electronic emulation of the mechanical behavior of the collisions of a particle inside a box, exhibiting rich chaotic behavior. The required nonlinearity to emulate the box walls is implemented in a simple way when compared with other analog electronic chaotic circuits. A master/slave synchronization of two circuits exhibiting a rich chaotic behavior demonstrates the potentiality of this system to secure communication. In this system, binary data stream information modulates the bifurcation parameter of the particle-in-a-box electronic circuit in the transmitter. In the receiver circuit, this parameter is estimated using Pecora-Carroll synchronization and error-feedback synchronization. The performance of the demodulation process is verified through the eye pattern technique applied on the recovered bit stream. During the demodulation process, the error-feedback synchronization presented better performance compared with the Pecora-Carroll synchronization. The application of the particle-in-a-box electronic circuit in a secure communication system is demonstrated.

Distributed power control algorithm for multiple access systems based on Verhulst model

In this paper the continuous Verhulst dynamic model is used to synthesize a new distributed power control algorithm (DPCA) for use in direct sequence code division multiple access (DS-CDMA) systems. The Verhulst model was initially designed to describe the population growth of biological species under food and physical space restrictions. The discretization of the corresponding differential equation is accomplished via the Euler numeric integration (ENI) method. Analytical convergence conditions for the proposed DPCA are also established. Several properties of the proposed recursive algorithm, such as Euclidean distance from optimum vector after convergence, convergence speed, normalized mean squared error (NSE), average power consumption per user, performance under dynamics channels, and implementation complexity aspects, are analyzed through simulations. The simulation results are compared with two other DPCAs: the classic algorithm derived by Foschini and Miljanic and the sigmoidal of Uykan and Koivo. Under estimated errors conditions, the proposed DPCA exhibits smaller discrepancy from the optimum power vector solution and better convergence (under fixed and adaptive convergence factor) than the classic and sigmoidal DPCAs. (C) 2010 Elsevier GmbH. All rights reserved.

Local search multiuser detection

In this work, a wide analysis of local search multiuser detection (LS-MUD) for direct sequence/code division multiple access (DS/CDMA) systems under multipath channels is carried out considering the performance-complexity trade-off. It is verified the robustness of the LS-MUD to variations in loading, E(b)/N(0), near-far effect, number of fingers of the Rake receiver and errors in the channel coefficients estimates. A compared analysis of the bit error rate (BER) and complexity trade-off is accomplished among LS, genetic algorithm (GA) and particle swarm optimization (PSO). Based on the deterministic behavior of the LS algorithm, it is also proposed simplifications over the cost function calculation, obtaining more efficient algorithms (simplified and combined LS-MUD versions) and creating new perspectives for the MUD implementation. The computational complexity is expressed in terms of the number of operations in order to converge. Our conclusion pointed out that the simplified LS (s-LS) method is always more efficient, independent of the system conditions, achieving a better performance with a lower complexity than the others heuristics detectors. Associated to this, the deterministic strategy and absence of input parameters made the s-LS algorithm the most appropriate for the MUD problem. (C) 2008 Elsevier GmbH. All rights reserved.

Jointly multi-user detection and channel estimation with genetic algorithm

This work aims at proposing the use of the evolutionary computation methodology in order to jointly solve the multiuser channel estimation (MuChE) and detection problems at its maximum-likelihood, both related to the direct sequence code division multiple access (DS/CDMA). The effectiveness of the proposed heuristic approach is proven by comparing performance and complexity merit figures with that obtained by traditional methods found in literature. Simulation results considering genetic algorithm (GA) applied to multipath, DS/CDMA and MuChE and multi-user detection (MuD) show that the proposed genetic algorithm multi-user channel estimation (GAMuChE) yields a normalized mean square error estimation (nMSE) inferior to 11%, under slowly varying multipath fading channels, large range of Doppler frequencies and medium system load, it exhibits lower complexity when compared to both maximum likelihood multi-user channel estimation (MLMuChE) and gradient descent method (GrdDsc). A near-optimum multi-user detector (MuD) based on the genetic algorithm (GAMuD), also proposed in this work, provides a significant reduction in the computational complexity when compared to the optimum multi-user detector (OMuD). In addition, the complexity of the GAMuChE and GAMuD algorithms were (jointly) analyzed in terms of number of operations necessary to reach the convergence, and compared to other jointly MuChE and MuD strategies. The joint GAMuChE-GAMuD scheme can be regarded as a promising alternative for implementing third-generation (3G) and fourth-generation (4G) wireless systems in the near future. Copyright (C) 2010 John Wiley & Sons, Ltd.

TEA: Timing and Energy Aware compression architecture for Efficient Configuration in CGRAs

Coarse Grained Reconfigurable Architectures (CGRAs) are emerging as enabling platforms to meet the high performance demanded by modern applications (e.g. 4G, CDMA, etc.). Recently proposed CGRAs offer time-multiplexing and dynamic applications parallelism to enhance device utilization and reduce energy consumption at the cost of additional memory (up to 50% area of the overall platform). To reduce the memory overheads, novel CGRAs employ either statistical compression, intermediate compact representation, or multicasting. Each compaction technique has different properties (i.e. compression ratio, decompression time and decompression energy) and is best suited for a particular class of applications. However, existing research only deals with these methods separately. Moreover, they only analyze the compaction ratio and do not evaluate the associated energy overheads. To tackle these issues, we propose a polymorphic compression architecture that interleaves these techniques in a unique platform. The proposed architecture allows each application to take advantage of a separate compression/decompression hierarchy (consisting of various types and implementations of hardware/software decoders) tailored to its needs. Simulation results, using different applications (FFT, Matrix multiplication, and WLAN), reveal that the choice of compression hierarchy has a significant impact on compression ratio (up to 52%), decompression energy (up to 4 orders of magnitude), and configuration time (from 33 n to 1.5 s) for the tested applications. Synthesis results reveal that introducing adaptivity incurs negligible additional overheads (1%) compared to the overall platform area.

Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e Computadores

Redes de acesso aleatório com capacidade de receção de múltiplos pacotes

Com o aumento do número de dispositivos móveis, os sistemas de comunicação sem fios têm evoluído de forma a aumentar os débitos de transferência de dados. Nos sistemas de comunicação sem fios tradicionais, um nó recetor apenas permite a receção de um sinal de cada vez (Single Packet Reception - SPR). Com o aparecimento de técnicas de receção múltipla (ex. CDMA, UWB, MU-MIMO), tornou-se possível a receção de múltiplos pacotes em simultâneo (Multipacket Reception - MPR). Porém, os protocolos de controlo de acesso ao meio (MAC) não foram adaptados de forma a tirar partido da capacidade de MPR no recetor. Esta dissertação aborda a condição de receção de múltiplos pacotes em simultâneo, caracterizando o número médio de pacotes recebidos, tendo em conta o número total de transmissões. A partir desta caracterização, é estudado o desempenho de três protocolos MAC. Os protocolos são baseados numa fase de negociação seguida de uma fase de transmissão. A caracterização do número médio de pacotes recebidos permite avaliar de uma forma integrada (nível físico e MAC) o desempenho dos diferentes protocolos MAC. Finalmente, a avaliação de desempenho evidencia o aumento de débito quando é utilizado MPR nas duas fases (negociação e transmissão), o que constitui um bom ponto de partida para o desenho de futuros protocolos MAC para sistemas MPR.

Desempenho de técnicas de acesso distribuído em sistemas de comunicação sem fios de múltipla receção

Nas redes sem fios tradicionais, os nós recetores permitem apenas uma única receção individual. Contudo com o aumento do número de dispositivos móveis nas redes sem fios, tem-se explorado novas técnicas que permitem múltiplas receções em simultâneo (Multipacket Reception) (MPR), tais como CDMA, OFDMA e MU-MIMO. Estas técnicas permitem melhorar o desempenho dos sistemas, aumentando também os débitos de transferências de dados. Apesar deste desenvolvimento, os protocolos de controlo de acesso ao meio não estão desenhados para suportar múltiplas receções, admitindo ainda os pressupostos originais. Isto faz com que se estejam a desperdiçar recursos do canal, não aproveitando ao máximo as capacidades que os sistemas MPR têm para oferecer. Nesta dissertação estuda-se a condição de receção com sucesso de múltiplas transmissões. Isto permite obter um modelo para caracterizar o número de transmissões recebidas com sucesso tendo em conta o número de nós que transmitem em simultâneo e modelando também a probabilidade de receção com sucesso individual. A partir desta caracterização, é verificado o desempenho de cinco protocolos MAC diferentes com suporte para múltiplas receções em simultâneo. Realizando uma avaliação integrada (tendo em conta o nível físico e o nível MAC) para os diferentes protocolos estudados, realiza-se uma avaliação comparativa relativamente ao débito atingido por cada um deles. Propõem-se por fim dois novos protocolos MAC com suporte para múltiplas transmissões em simultâneo para que se faça um melhor aproveitamento das capacidades permitidas pelos sistemas MPR, atingindo também melhores débitos.

Capacity-approaching rate function for layered multiantenna architectures

The simultaneous use of multiple transmit and receive antennas can unleash very large capacity increases in rich multipath environments. Although such capacities can be approached by layered multi-antenna architectures with per-antenna rate control, the need for short-term feedback arises as a potential impediment, in particular as the number of antennas—and thus the number of rates to be controlled—increases. What we show, however, is that the need for short-term feedback in fact vanishes as the number of antennas and/or the diversity order increases. Specifically, the rate supported by each transmit antenna becomes deterministic and a sole function of the signal-to-noise, the ratio of transmit and receive antennas, and the decoding order, all of which are either fixed or slowly varying. More generally, we illustrate -through this specific derivation— the relevance of some established random CDMA results to the single-user multi-antenna problem.

Multiuser detection in a dynamic environment — Part II: Joint user identification and parameter estimation

The problem of jointly estimating the number, the identities, and the data of active users in a time-varying multiuser environment was examined in a companion paper (IEEE Trans. Information Theory, vol. 53, no. 9, September 2007), at whose core was the use of the theory of finite random sets on countable spaces. Here we extend that theory to encompass the more general problem of estimating unknown continuous parameters of the active-user signals. This problem is solved here by applying the theory of random finite sets constructed on hybrid spaces. We doso deriving Bayesian recursions that describe the evolution withtime of a posteriori densities of the unknown parameters and data.Unlike in the above cited paper, wherein one could evaluate theexact multiuser set posterior density, here the continuous-parameter Bayesian recursions do not admit closed-form expressions. To circumvent this difficulty, we develop numerical approximationsfor the receivers that are based on Sequential Monte Carlo (SMC)methods (“particle filtering”). Simulation results, referring to acode-divisin multiple-access (CDMA) system, are presented toillustrate the theory.

Spatial filtering for pilot-aided WCDMA systems: a semi-blind subspace approach

This paper proposes a spatial filtering technique forthe reception of pilot-aided multirate multicode direct-sequencecode division multiple access (DS/CDMA) systems such as widebandCDMA (WCDMA). These systems introduce a code-multiplexedpilot sequence that can be used for the estimation of thefilter weights, but the presence of the traffic signal (transmittedat the same time as the pilot sequence) corrupts that estimationand degrades the performance of the filter significantly. This iscaused by the fact that although the traffic and pilot signals areusually designed to be orthogonal, the frequency selectivity of thechannel degrades this orthogonality at hte receiving end. Here,we propose a semi-blind technique that eliminates the self-noisecaused by the code-multiplexing of the pilot. We derive analyticallythe asymptotic performance of both the training-only andthe semi-blind techniques and compare them with the actual simulatedperformance. It is shown, both analytically and via simulation,that high gains can be achieved with respect to training-onlybasedtechniques.

Probabilistic algorithms for blind adaptive multiuser detection

In this paper, two probabilistic adaptive algorithmsfor jointly detecting active users in a DS-CDMA system arereported. The first one, which is based on the theory of hiddenMarkov models (HMM’s) and the Baum–Wech (BW) algorithm,is proposed within the CDMA scenario and compared withthe second one, which is a previously developed Viterbi-basedalgorithm. Both techniques are completely blind in the sense thatno knowledge of the signatures, channel state information, ortraining sequences is required for any user. Once convergencehas been achieved, an estimate of the signature of each userconvolved with its physical channel response (CR) and estimateddata sequences are provided. This CR estimate can be used toswitch to any decision-directed (DD) adaptation scheme. Performanceof the algorithms is verified via simulations as well as onexperimental data obtained in an underwater acoustics (UWA)environment. In both cases, performance is found to be highlysatisfactory, showing the near–far resistance of the analyzed algorithms.

A Planar Compact Metamaterialinspired Broadband Antenna

An electrically small, broadband-modified, truncated ground metamaterial EZ antenna is presented. This, a modified EZ antenna system, achieves a larger bandwidth of the order of 650 MHz by adjusting the metamaterial-inspired meandered ground element fed by a top loaded monopole. The design is devoid of the large ground planes and the external parasitic elements used in conventional designs for achieving proper impedance matching characteristics. The antenna requires a small foot print of kg/5 3 kg/10, where kg is the guided wavelength corresponding to the lowest frequency of operation, when printed on a substrate of dielectric constant 4.4 and thickness 1.6 mm. The antenna offers a 2:1 VSWR bandwidth from 750 MHz to 1.4 GHz, which covers CDMA, GSM, and ISM bands

Análisis y diseño de soluciones ASP (Applications Services Provider - Proveedor de Servicios y Aplicaciones) sobre la plataforma de EEPPM y sus filiales para clientes corporativos inalámbricos Datamovil ASP

Las comunicaciones móviles, no aparecen a nivel comercial sino hasta finales del siglo XX. Las redes móviles terrestres se iniciaron en ámbitos restringidos para el establecimiento de comunicaciones en tareas de despacho, para la gestión de las actividades de flotas de vehículos en aplicaciones tales como servicios de policía, mantenimiento de servicios públicos de distribución de agua, gas, electricidad, servicios de emergencia, ambulancias, etc. Radiobúsquedas, redes móviles privadas o Trunking, y sistemas de telefonía móvil mejorados fueron el siguiente paso. Después llegó la telefonía móvil digital, las agendas personales, miniordenadores, laptops y un sinfín de dispositivos dispuestos a conectarse vía radio con otros dispositivos o redes. Y finalmente la unión entre comunicaciones móviles e Internet, el verdadero punto de inflexión tanto para uno como para otro. En la actualidad, las técnicas digitales para las comunicaciones móviles, permiten la utilización de nuevos métodos de acceso, como son las de acceso múltiple por división en el tiempo (Time Division Multiple Access, TDMA), con técnicas de banda estrecha, y el acceso múltiple por división de código (Code Division Multiple Access, CDMA) con técnicas de espectro ensanchado. Las primeras sufren un conocido problema denominado propagación multi-trayectoria Básicamente este fenómeno consiste en que la señal que llega al receptor se compone de la suma de un conjunto de señales idénticas en amplitud pero con fases distintas. En el peor caso la señal en el receptor puede llegar a ser nula, produciéndose un fenómeno de fading importante. Las técnicas de espectro ensanchado (CDMA) no sufren este tipo de problemas.