Interference suppression and diversity for CDMA systems

In code-division multiple-access (CDMA) systems, due to non-orthogonality of the spreading codes and multipath channels, the desired signal suffers interference from other users. Signal fading due to multipath propagation is another source of impairment in wireless CDMA systems, often severely impacting performance. In this dissertation, reduced-rank minimum mean square error (MMSE) receiver and reduced-rank minimum variance receiver are investigated to suppress interference; transmit diversity is applied to multicarrier CDMA (MC-CDMA) systems to combat fading; packet combing is studied to provide both interference suppression and diversity for CDMA random access systems. The reduced-rank MMSE receiver that uses a reduced-rank estimated covariance matrix is studied to improve the performance of MMSE receiver in CDMA systems. It is shown that the reduced-rank MMSE receiver has much better performance than the full-rank MMSE receiver when the covariance matrix is estimated by using a finite number of data samples and the desired signal is in a low dimensional subspace. It is also demonstrated that the reduced-rank minimum variance receiver outperforms the full-rank minimum variance receiver. The probability density function of the output SNR of the full-rank and reduced-rank linear MMSE estimators is derived for a general linear signal model under the assumption that the signals and noise are Gaussian distributed. Space-time coding that is originally proposed for narrow band systems is applied to an MC-CDMA system in order to get transmit diversity for such a wideband system. Some techniques to jointly decode the space-time code and suppress interference are developed. The channel estimation using either pilot channels or pilot symbols is studied for MC-CDMA systems with space-time coding. Performance of CDMA random access systems with packet combining in fading channels is analyzed. By combining the current retransmitted packet with all its previous transmitted copies, the receiver obtains a diversity gain plus an increased interference and noise suppression gain. Therefore, the bit error rate dramatically decreases with the number of transmissions increasing, which in turn improves the system throughput and reduces the average delay

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 ComputadoresThe forthcoming generation of mobile communications, 5G, will settle a new standard for a larger bandwidth and better Quality of Service (QoS). With the exploding growth rate of user generated data, wireless standards must cope with this growth and at the same time be energy efficient to avoid depleting the batteries of wireless devices. Besides these issues, in a broadband wireless setting QoS can be severely affected from a multipath dispersive channel and therefore be energy demanding. Cross-layered architectures are a good choice to enhance the overall performance of a wireless system. Examples of cross-layered Physical (PHY) - Medium Access Control (MAC) architectures are type-II Diversity Combining (DC) Hybrid-ARQ (H-ARQ) and Multi-user Detection (MUD) schemes. Cross-layered type-II DC H-ARQ schemes reuse failed packet transmissions to enhance data reception on posterior retransmissions; MUD schemes reuse data information from previously collided packets on posterior retransmissions to enhance data reception. For a multipath dispersive channel, a PHY layer analytical model is proposed for Single-Carrier with Frequency Domain Equalization (SC-FDE) that supports DC H-ARQ and MUD. Based on this analytical model, three PHY-MAC protocols are proposed. A crosslayered Time Division Multiple Access (TDMA) scheme that uses DC H-ARQ is modeled and its performance is studied in this document; the performance analysis shows that the scheme performs better with DC and achieves a better energy efficiency at the cost of a higher delay. A novel cross-layered prefix-assisted Direct-Sequence Code Division Multiple Access (DS-CDMA) scheme is proposed and modeled in this document, it uses principles of DC and MUD. This protocol performs better by means of additional retransmissions, achieving better energy efficiency, at the cost of higher redundancy from a code spreading gain. Finally, a novel cross-layered protocol H-ARQ Network Division Multiple Access (H-NDMA) is proposed and modeled, where the combination of DC H-ARQ and MUD is used with the intent of maximizing the system capacity with a lower delay; system results show that the proposed scheme achieves better energy efficiency and a better performance at the cost of a higher number of retransmissions. A comparison of the three cross-layered protocols is made, using the PHY analytical model, under normalized conditions using the same amount of maximum redundancy. Results show that the H-NDMA protocol, in general, obtains the best results, achieving a good performance and a good energy efficiency for a high channel load and low Signal-to-Noise Ratio (SNR). TDMA with DC H-ARQ achieves the best energy efficiency, although presenting the worst delay. Prefix-assisted DS-CDMA in the other hand shows good delay results but presents the worst throughput and energy efficiency

Role of Interference and Computational Complexity in Modern Wireless Networks: Analysis, Optimization, and Design

Owing to the popularity of smartphones, the recent widespread adoption of wireless broadband has resulted in a tremendous growth in the volume of mobile data traffic, and this growth is projected to continue unabated. In order to meet the needs of future systems, several novel technologies have been proposed, including cooperative communications, cloud radio access networks (RANs) and very densely deployed small-cell networks. For these novel networks, both interference and the limited availability of computational resources play a very important role. Therefore, the accurate modeling and analysis of interference and computation is essential to the understanding of these networks, and an enabler for more efficient design.;This dissertation focuses on four aspects of modern wireless networks: (1) Modeling and analysis of interference in single-hop wireless networks, (2) Characterizing the tradeoffs between the communication performance of wireless transmission and the computational load on the systems used to process such transmissions, (3) The optimization of wireless multiple-access networks when using cost functions that are based on the analytical findings in this dissertation, and (4) The analysis and optimization of multi-hop networks, which may optionally employ forms of cooperative communication.;The study of interference in single-hop wireless networks proceeds by assuming that the random locations of the interferers are drawn from a point process and possibly constrained to a finite area. Both the information-bearing and interfering signals propagate over channels that are subject to path loss, shadowing, and fading. A flexible model for fading, based on the Nakagami distribution, is used, though specific examples are provided for Rayleigh fading. The analysis is broken down into multiple steps, involving subsequent averaging of the performance metrics over the fading, the shadowing, and the location of the interferers with the aim to distinguish the effect of these mechanisms that operate over different time scales. The analysis is extended to accommodate diversity reception, which is important for the understanding of cooperative systems that combine transmissions that originate from different locations. Furthermore, the role of spatial correlation is considered, which provides insight into how the performance in one location is related to the performance in another location.;While it is now generally understood how to communicate close to the fundamental limits implied by information theory, operating close to the fundamental performance bounds is costly in terms of the computational complexity required to receive the signal. This dissertation provides a framework for understanding the tradeoffs between communication performance and the imposed complexity based on how close a system operates to the performance bounds, and it allows to accurately estimate the required data processing resources of a network under a given performance constraint. The framework is applied to Cloud-RAN, which is a new cellular architecture that moves the bulk of the signal processing away from the base stations (BSs) and towards a centralized computing cloud. The analysis developed in this part of the dissertation helps to illuminate the benefits of pooling computing assets when decoding multiple uplink signals in the cloud. Building upon these results, new approaches for wireless resource allocation are proposed, which unlike previous approaches, are aware of the computing limitations of the network.;By leveraging the accurate expressions that characterize performance in the presence of interference and fading, a methodology is described for optimizing wireless multiple-access networks. The focus is on frequency hopping (FH) systems, which are already widely used in military systems, and are becoming more common in commercial systems. The optimization determines the best combination of modulation parameters (such as the modulation index for continuous-phase frequency-shift keying), number of hopping channels, and code rate. In addition, it accounts for the adjacent-channel interference (ACI) and determines how much of the signal spectrum should lie within the operating band of each channel, and how much can be allowed to splatter into adjacent channels.;The last part of this dissertation contemplates networks that involve multi-hop communications. Building on the analytical framework developed in early parts of this dissertation, the performance of such networks is analyzed in the presence of interference and fading, and it is introduced a novel paradigm for a rapid performance assessment of routing protocols. Such networks may involve cooperative communications, and the particular cooperative protocol studied here allows the same packet to be transmitted simultaneously by multiple transmitters and diversity combined at the receiver. The dynamics of how the cooperative protocol evolves over time is described through an absorbing Markov chain, and the analysis is able to efficiently capture the interference that arises as packets are periodically injected into the network by a common source, the temporal correlation among these packets and their interdependence

Allocation designs for massive multiple access with interference cancellation

In the transition towards the next generation of wireless technology systems, the increasing number of devices curbs the potential of current wireless networks to cope with such increases in network density. Wireless communications via satellite constitute a cost effective option to achieve high transmission reliability in remote areas or to create resilient networks to be used in emergency situations. To counterbalance the growing network density, one of the main goals in the uplink is to increase the spectral efficiency of the network. By working on the application of non-orthogonal multiple access and the exploitation of the collision domain through interference cancellation, this dissertation tackles the problem of massive multiple access. A consensual scheme that meets the main goal and the aim of reducing the interaction between devices and the satellite in the control plane is Enhanced Spread Spectrum ALOHA, which combines spreading-based short-packet transmissions with successive interference cancellation (SIC) on the receiver's side. This combination opens up several design avenues in terms of energy and code allocation to users when a certain amount of channel state information is available to them. Motivated by this scheme, this thesis studies the best allocation strategies when the SIC receiver operates nonideally: firstly, it investigates a system model for a receiver that, inspired by the demodulator adopted in the Enhanced Spread Spectrum ALOHA system, deals with the problems of user ordering and iterative decoding with short packets; and secondly, it delves into the user-asymptotic regime and the application of the calculus of variations to derive the stationary point equations corresponding to the optimal allocation rules.The first part of this thesis investigates the impact of nonideal decoding and imperfect cancellation on the first iteration of a SIC receiver aided by redundancy-check error control. The system model characterises both non-idealities using known functions of the signal-to-interference-plus-noise ratio. The propagation of packet decoding success/failure events throughout the stages of the receiver is circumvented in the user-asymptotic regime, since the model takes a deterministic form. The asymptotically optimal energy and rate allocation is studied for a wide variety of cases. The second part of this thesis investigates an iterative SIC receiver and extends the allocation designs derived previously to iterations beyond the first. The derivation of a system model is challenging, since each iteration of the receiver operates with memory with respect to the previous ones, and due to the fact that the decoding operations for the same user in different iterations are statistically dependent. This thesis motivates and states a system model that solves said difficulties by adding minimal complexity to the one adopted previously. The user-asymptotic regime is investigated to reveal mathematical forms to the above model that allow for a thorough understanding of the adopted receiver. Finally, the chapter exploits the user-asymptotic model and conducts research to designing smooth allocation functions. The third part of this thesis studies the user-ordering problem for a SIC receiver to which the strengths received from all users are unknown. The thesis derives an accurate system model for a large-user SIC receiver, which proceeds to order users after estimating their symbol energies at the initial stage through preamble cross-correlations. Analytical findings are determined in the user-asymptotic regime. The asymptotically optimal energy allocation is shown to obey, in contrast to the practically exponential user-energy distributions obtained before, a piecewise constant function; fact that entails great computational advantages of its application.En la transició cap a la pròxima generació de sistemes tecnològics sense fils, el creixent nombre de dispositius frena el potencial de les xarxes sense fils actuals per fer front a tal augment en la densitat de xarxa. Les comunicacions sense fils via satèl·lit constitueixen una opció rentable per assolir una fiabilitat de transmissió alta en zones remotes o per crear xarxes que puguin ser utilitzades en situacions d'emergència. Per contrarestar la creixent densitat de xarxa, un dels objectius principals en l'enllaç ascendent és augmentar l'eficiència espectral d'aquesta. Aquesta tesi aborda el problema d'accés múltiple massiu combinant l'aplicació de tècniques d'accés múltiple no ortogonal amb esquemes de cancel·lació d’interferència. Un esquema consensuat que acompleix amb l’objectiu principal i amb la fita de reduir la interacció entre dispositius i satèl·lit en el pla de control és Enhanced Spread Spectrum ALOHA, que combina transmissions de paquets curts basades en l'eixamplament del senyal amb la cancel·lació successiva d'interferències (SIC) en recepció. Aquesta combinació obre diverses vies per l'assignació d'energia i codi als diferents usuaris quan aquests disposen d’informació sobre l'estat del canal. Motivat per l'esquema anterior, aquesta tesi estudia les millors estratègies d'assignació quan s'adopta un receptor SIC no ideal: en primer lloc, investiga un model de sistema per un receptor SIC que, inspirat en el desmodulador adoptat en el sistema Enhanced Spread Spectrum ALOHA, aborda els problemes d'ordenació d'usuaris i de descodificació iterativa amb paquets curts; i, en segon lloc, s’endinsa en el règim asimptòtic d'usuaris i en l'aplicació del càlcul de variacions per derivar les equacions de punt estacionari corresponents a les funcions d'assignació òptimes. La primera part d'aquesta tesi investiga l'impacte de la descodificació no ideal i de la cancel·lació imperfecta en la primera iteració d'un receptor SIC assistit per control d'errors. El model de sistema proposat caracteritza ambdues no idealitats fent ús de funcions conegudes de la relació senyal-a-soroll-més-interferència. La propagació dels esdeveniments d'èxit/fracàs en la descodificació de paquets al llarg de les etapes del receptor s'aborda en el règim asimptòtic d'usuaris, ja que el model pren forma determinista. Les funcions d'assignació s'estudien en el règim asimptòtic d'usuaris per varis casos. La segona part de la tesi investiga un receptor SIC iteratiu i estén les assignacions derivades en el capítol anterior per a iteracions del SIC més enllà de la primera. La derivació d'un model de sistema suposa un repte, ja que cada iteració del receptor opera amb memòria respecte a iteracions anteriors i degut a que les operacions de descodificació per a un mateix usuari en iteracions diferents són estadísticament dependents. Es proposa un model de sistema que resol tals dificultats afegint complexitat mínima al model adoptat anteriorment. S'investiga el règim asimptòtic d'usuaris amb l'objectiu d’evidenciar expressions matemàtiques del model que permetin la completa comprensió del receptor adoptat. Per últim, es dissenyen funcions d'assignació contínuament diferenciables fent ús del model asimptòtic anterior. La tercera i última part d'aquesta tesi estudia el problema d'ordenació d'usuaris aplicat a un receptor SIC que desconeix les potències rebudes de tots ells. Es deriva un model de sistema per un receptor que gestiona nombrosos usuaris i els ordena després d'estimar les energies de tots ells en l'etapa inicial mitjançant correlacions de preamble. Els resultats analítics s’obtenen en el règim asimptòtic d'usuaris. Es demostra que, contràriament a les distribucions pràcticament exponencials obtingudes anteriorment, l'assignació d'energia òptima derivada per a infinits usuaris presenta una estructura constant a trossos; fet que comporta grans avantatges computacionals en la seva aplicació.En la transición hacia la próxima generación de sistemas tecnológicos inalámbricos, el creciente número de dispositivos frena el potencial de las redes inalámbricas actuales para hacer frente a esos aumentos en la densidad de red. Impulsadas por las innovaciones en tecnología satelital, las comunicaciones inalámbricas vía satélite constituyen una opción rentable para lograr una alta fiabilidad de transmisión en zonas remotas o para crear redes reservadas para situaciones de emergencia. Para contrarrestar la creciente densidad de la red, uno de los objetivos principales en el enlace ascendente es aumentar la eficiencia espectral de la misma. En favor de este objetivo, se identifican tres técnicas no excluyentes: (i) la aplicación de técnicas de acceso múltiple no ortogonal, para hacer frente a la limitada disponibilidad de recursos ortogonales requeridos en el acceso múltiple convencional, (ii) la explotación del dominio de colisión por el receptor, mediante la cancelación de interferencias, y (iii) la utilización de satélites multihaz, que, usando la tecnología multiantena, permiten una reutilización más eficiente del dominio espacial. Esta tesis aborda el problema de acceso múltiple masivo trabajando en los dos primeros puntos. Un esquema consensuado que cumple con el objetivo principal y con el fin de reducir la interacción entre los dispositivos y el satélite en el plano de control es Enhanced Spread Spectrum ALOHA, que combina transmisiones de paquetes cortos basadas en el ensanchamiento de la señal con la cancelación sucesiva de interferencias (SIC) en recepción. Esta combinación abre diversas vías para la asignación de energía y código a los usuarios cuando estos disponen de cierta información sobre el estado del canal. Motivado por el esquema anterior, esta tesis reexamina resultados previos bajo análisis teóricos de capacidad y cancelación perfecta, y estudia las mejores estrategias de asignación cuando el receptor SIC opera de forma no ideal. Los análisis anteriores se amplían en dos frentes: en primer lugar, adoptando políticas de decodificación y cancelación adaptadas para paquetes cortos; y, en segundo lugar, explorando el desequilibrio de energía, tasa de transmisión y fiabilidad. Con respecto al primer punto, esta tesis investiga un modelo de sistema para un receptor SIC que, inspirado en el demodulador adoptado en el sistema Enhanced Spread Spectrum ALOHA, aborda los problemas de ordenación de usuarios y decodificación iterativa con paquetes cortos. En cuanto al segundo punto, esta tesis se adentra en el régimen asintótico de usuarios y en la aplicación del cálculo de variaciones para derivar las ecuaciones de punto estacionario correspondientes a las funciones de asignación óptimas. Una de las principales contribuciones de esta tesis es el descubrimiento de funciones discontinuas (continuamente diferenciables a trozos) como una clase de distribuciones de energía ordenada para maximizar la eficiencia espectral; un enfoque que ha demostrado ser abrumadoramente exitoso. En concreto, el modelo derivado en la presente tesis incorpora, progresivamente y a lo largo de tres capítulos independientes, aspectos prácticos del cancelador de interferencias adoptado: 1. La primera parte de esta tesis investiga el impacto de la decodificación no ideal y de la cancelación imperfecta en la primera iteración de un receptor SIC asistido por control de errores. El modelo de sistema caracteriza ambas no idealidades utilizando funciones conocidas de la relación señal-a-ruido-más-interferencia (SINR) bajo la suposición de interferencia gaussiana: las funciones tasa de error de paquete (PER) y energía residual. La propagación de los eventos de éxito/fracaso en la decodificación de paquetes a lo largo de las etapas del receptor SIC se sortea en el régimen asintótico de usuarios, puesto que el modelo de sistema adopta expresiones deterministas. La asignación de energía y código se estudia en el régimen asintótico de usuarios para una amplia variedad de casos, incluyendo conjuntos formados por un número finito o infinito de esquemas de modulación y corrección de errores para paquetes de longitud finita e infinita. 2. La segunda parte de esta tesis investiga un receptor SIC iterativo y extiende las asignaciones derivadas anteriormente para iteraciones del SIC más allá de la primera. La derivación de un modelo para tal sistema supone un reto, ya que cada iteración del receptor opera con memoria respecto a las anteriores y porque las operaciones de decodificación para un mismo usuario en distintas iteraciones son estadísticamente dependientes. Esta tesis propone justificadamente un modelo de sistema que resuelve dichas dificultades añadiendo complejidad mínima al adoptado con anterioridad. En concreto, el modelo usa funciones PER multivariable, cuyos argumentos corresponden a las SINRs que experimenta un usuario a lo largo de las iteraciones del receptor, y define biyecciones para relacionar los índices de los usuarios que permanecen decodificados sin éxito en cada iteración. Se investiga el régimen asintótico de usuarios para revelar expresiones matemáticas del modelo anterior que permitan un completo entendimiento del receptor adoptado. Por último, se investiga el diseño de funciones de asignación continuamente diferenciables con extremos libres haciendo uso del modelo asintótico anterior. 3. La tercera y última parte de esta tesis estudia el problema de ordenación de usuarios en un receptor SIC que desconoce las potencias recibidas de todos ellos. La tesis deriva un modelo de sistema para un receptor SIC que gestiona un gran número de usuarios y los ordena tras estimar sus energías en la etapa inicial mediante correlaciones de preámbulo. En el régimen asintótico de usuarios, se obtienen resultados analíticos en los que el rendimiento del sistema se rige por un kernel conocido. Se demuestra que, contrariamente a las distribuciones prácticamente exponenciales obtenidas anteriormente, la asignación óptima de energía derivada para un número infinito de usuarios obedece una función constante a trozos; hecho que conlleva grandes ventajas computacionales en su aplicación.Postprint (published version

Q-learning Channel Access Methods for Wireless Powered Internet of Things Networks

The Internet of Things (IoT) is becoming critical in our daily life. A key technology of interest in this thesis is Radio Frequency (RF) charging. The ability to charge devices wirelessly creates so called RF-energy harvesting IoT networks. In particular, there is a hybrid access point (HAP) that provides energy in an on-demand manner to RF-energy harvesting devices. These devices then collect data and transmit it to the HAP. In this respect, a key issue is ensuring devices have a high number of successful transmissions. There are a number of issues to consider when scheduling the transmissions of devices in the said network. First, the channel gain to/from devices varies over time. This means the efficiency to deliver energy to devices and to transmit the same amount of data is different over time. Second, during channel access, devices are not aware of the energy level of other devices nor whether they will transmit data. Third, devices have non-causal knowledge of their energy arrivals and channel gain information. Consequently, they do not know whether they should delay their transmissions in hope of better channel conditions or less contention in future time slots or doing so would result in energy overflow

Proceedings of the Second International Mobile Satellite Conference (IMSC 1990)

Presented here are the proceedings of the Second International Mobile Satellite Conference (IMSC), held June 17-20, 1990 in Ottawa, Canada. Topics covered include future mobile satellite communications concepts, aeronautical applications, modulation and coding, propagation and experimental systems, mobile terminal equipment, network architecture and control, regulatory and policy considerations, vehicle antennas, and speech compression

Performance analysis of biological resource allocation algorithms for next generation networks.

Masters Degree. University of KwaZulu-Natal, Durban.Abstract available in PDF.Publications listed on page iii

D13.2 Techniques and performance analysis on energy- and bandwidth-efficient communications and networking

Deliverable D13.2 del projecte europeu NEWCOM#The report presents the status of the research work of the various Joint Research Activities (JRA) in WP1.3 and the results that were developed up to the second year of the project. For each activity there is a description, an illustration of the adherence to and relevance with the identified fundamental open issues, a short presentation of the main results, and a roadmap for the future joint research. In the Annex, for each JRA, the main technical details on specific scientific activities are described in detail.Peer ReviewedPostprint (published version