逐次干渉除去を用いた多元接続システムのパワー割り当てに関する研究

In future wireless communication networks, the number of devices is likely to increase dramatically due to potential development of new applications such as the Internet of Things (IoT). Consequently, radio access network is required to support multiple access of massive users and achieve high spectral efficiency. From the information theoretic perspective, orthogonal multiple access protocols are suboptimal. To achieve the multiple access capacity, non-orthogonal multiple access protocols and multiuser detection (MUD) are required. For the non-orthogonal code-division multiple access (CDMA), several MUD techniques have been proposed to improve the spectrum efficiency. Successive interference cancellation (SIC) is a promising MUD techniques due to its low complexity and good decoding performance. Random access protocols are designed for the system with bursty traffic to reduce the delay, compared to the channelized multiple access. Since the users contend for the channel instead of being assigned by the base station (BS), collisions happen with a certain probability. If the traffic load becomes relatively high, the throughput of these schemes steeply falls down because of collisions. However, it has been well-recognized that more complex procedures can permit decoding of interfering signals, which is referred to as multi-packet reception (MPR). Also, an SIC decoder might decode more packets by successively subtracting the correctly decoded packets from the collision. Cognitive radio (CR) is an emerging technology to solve the problem of spectrum scarcity by dynamically sharing the spectrum. In the CR networks, the secondary users (SUs) are allowed to dynamically share the frequency bands with primary users (PUs) under primary quality-of-service (QoS) protection such as the constraint of interference temperature at the primary base station (PBS). For the uplink multiple access to the secondary base station (SBS), transmit power allocation for the SUs is critical to control the interference temperature at the PBS. Transmit power allocation has been extensively studied in various multiple access scenarios. The power allocation algorithms can be classified into two types, depending on whether the process is controlled by the base station (BS). For the centralized power allocation (CPA) algorithms, the BS allocates the transmit powers to the users through the downlink channels. For the random access protocols, there are also efforts on decentralized power allocation (DPA) that the users select transmit powers according to given distributions of power and probability, instead of being assigned the transmit power at each time slot by the BS. In this dissertation, the DPA algorithms for the random access protocols with SIC are investigated and new methods are proposed. First a decentralized multilevel power allocation algorithm to improve the MAC throughput performance is proposed, for the general SIC receiver that can decode multiple packets from one collision. Then an improved DPA algorithm to maximize the overall system sum rate is proposed, taking into account of both the MAC layer and PHY layer. Finally, a DPA algorithm for the CR secondary random access is proposed, considering the constraint of interference temperature and the practical assumption of imperfect cancellation. An opportunistic transmission protocol for the fading environment to further reduce the interference temperature is also proposed. For the future work, the optimal DPA for the random access with the SIC receiver is still an open problem. Besides, advanced multiple access schemes that aim to approach the multiple access capacity by combining the advantages of the network coded cooperation, the repetition slotted ALOHA, and the SIC receiver are also interesting.電気通信大学201

Rate-Splitting Robustness in Multi-Pair Massive MIMO Relay Systems

Relay systems improve both coverage and system capacity. Toward this direction, a full-duplex (FD) technology, being able to boost the spectral efficiency by transmitting and receiving simultaneously on the same frequency and time resources, is envisaged to play a key role in future networks. However, its benefits come at the expense of self-interference (SI) from their own transmit signal. At the same time, massive multiple-input massive multiple-output systems, bringing unconventionally many antennas, emerge as a promising technology with huge degrees-of-freedom. To this end, this paper considers a multi-pair decode-and-forward FD relay channel, where the relay station is deployed with a large number of antennas. Moreover, the rate-splitting (RS) transmission has recently been shown to provide significant performance benefits in various multi-user scenarios with imperfect channel state information at the transmitter (CSIT). Engaging the RS approach, we employ the deterministic equivalent analysis to derive the corresponding sum-rates in the presence of interferences. Initially, numerical results demonstrate the robustness of RS in half-duplex (HD) systems, since the achievable sum-rate increases without bound, i.e., it does not saturate at high signal-to-noise ratio. Next, we tackle the detrimental effect of SI in FD. In particular, and most importantly, not only FD outperforms HD, but also RS enables increasing the range of SI over which FD outperforms HD. Furthermore, increasing the number of relay station antennas, RS appears to be more efficacious due to imperfect CSIT, since SI decreases. Interestingly, increasing the number of users, the efficiency of RS worsens and its implementation becomes less favorable under these conditions. Finally, we verify that the proposed DEs, being accurate for a large number of relay station antennas, are tight approximations even for realistic system dimensions.Peer reviewedFinal Accepted Versio

On implementation aspects of decode and forward and compress and forward relay protocols

In this work, the common relay protocols Decode-and-Forward and Compress-and-Forward (CF) are investigated from a practical point of view: This involves on the one hand the impact of imperfections like channel and carrier phase stimation errors and on the other hand, the question of how to implement relay protocol specific signal processing like quantization for CF which is modeled in information theory simply by additive quantizer noise. To evaluate the performance, achievable rates are determined either numerically with the help of the Max-Flow Min-Cut theorem or by link level simulations.Diese Arbeit untersucht die Relay-Protokolle Decode-and-Forward und Compress-and-Forward (CF) mit dem Fokus auf einer praktischen Umsetzung. Es werden sowohl Störeinflüsse wie Kanal- und Phasenschätzfehler betrachtet als auch spezielle Kompressionsverfahren für das CF Protokoll implementiert. Von großer Bedeutung ist hier die Kompression in Form der Quantisierung, weil diese in der Informationstheorie lediglich durch Quantisierungsrauschen modelliert wird. Zur Auswertung der Leistungsfähigkeit der Protokolle werden die erzielbaren Raten entweder numerisch oder durch Simulation bestimmt

Adaptive Beam-Frequency Allocation Algorithm with Position Uncertainty for Millimeter-Wave MIMO Systems

Envisioned for fifth generation (5G) systems, millimeter-wave (mmWave) communications are under very active research worldwide. Although pencil beams with accurate beamtracking may boost the throughput of mmWave systems, this poses great challenges in the design of radio resource allocation for highly mobile users. In this paper, we propose a joint adaptive beam-frequency allocation algorithm that takes into account the position uncertainty inherent to high mobility and/or unstable users as, e.g., Unmanned Aerial Vehicles (UAV), for whom this is a major problem. Our proposed method provides an optimized beamwidth selection under quality of service (QoS) requirements for maximizing system proportional fairness, under user position uncertainty. The rationale of our scheme is to adapt the beamwidth such that the best trade-off among system performance (narrower beam) and robustness to uncertainty (wider beam) is achieved. Simulation results show that the proposed method largely enhances the system performance compared to reference algorithms, by an appropriate adaptation of the mmWave beamwidths, even under severe uncertainties and imperfect channel state information (CSIs).Comment: 5 pages, 6 figures, 1 table, 1 algorith

Mac-Phy Cross-Layer analysis and design of Mimo-Ofdm Wlans based on fast link adaptation

The latestWLAN standard, known as IEEE 802.11n, has notably increased the network capacity with respect to its predecessors thanks to the incorporation of the multipleinput multiple-output (MIMO) technology. Nonetheless, the new amendment, as its previous ones, does not specify how crucial configuration mechanisms, most notably the adaptive modulation and coding (AMC) algorithm should be implemented. The AMC process has proved essential to fully exploit the system resources in light of varying channel conditions. In this dissertation, a closed-loop AMC technique, referred to as fast link adaption (FLA) algorithm, that effectively selects themodulation and coding scheme (MCS) for multicarriermultiantennaWLAN networks is proposed. The FLA algorithm determines the MCS that maximizes the throughput while satisfying a quality of service (QoS) constraint, usually defined in the form of an objective packet error rate (PER). To this end, FLA uses a packet/bit error rate prediction methodology based on the exponential effective SNRmetric (EESM). The FLA algorithm performance has been evaluated under IEEE 802.11n systems that thanks to the incorporation of a feedbackmechanismare able to implement closed- loop AMC mechanisms. Initially, this AMC technique relies only on physical layer information but it is subsequently extended to also take into account themediumaccess control (MAC) sublayer performance. At the physical layer, the FLA algorithm has demonstrated its effectivity by performing very close to optimality in terms of throughput, while satisfying a prescribed PER constraint. The FLA algorithm has also been evaluated using imperfect channel information. It has been observed that the proposed FLA technique is rather robust against imperfect channel information, and only in highly-frequency selective channels, imperfect channel knowledge causes a noticeable degradation in throughput. At the MAC sublayer, the FLA algorithm has been complemented with a timeout strategy that weighs down the influence of the available channel information as this becomes outdated. This channel information outdate is caused by the MAC sublayer whose user multiplexing policy potentially results in large delays between acquiring the instant in which the channel state information is acquired and that in which the channel is accessed. Results demonstrate the superiority of FLA when compared to open-loop algorithms under saturated and non-saturated conditions and irrespective of the packet length, number of users, protocol (CSMA/CA or CDMA/E2CA) and access scheme (Basic Access or RTS/CTS). Additionally, several analytical models have been developed to estimate the system performance at the MAC sublayer. These models account for all operational details of the IEEE 802.11n MAC sublayer, such as finite number of retries, anomalous slot or channel errors. In particular, a semi-analytical model that assesses the MAC layer throughput under saturated conditions, considering the AMC performance is first introduced. Then, an analytical model that allows the evaluation of the QoS performance under non-saturated conditions is presented. This model focuses on single MCS and it is able to accurately predict very important system performance metrics such as blocking probability, delay, probability of discard or goodput thanks to the consideration of the finite queues on each station. Finally, the previous non-saturated analytical approach is used to define a semi-analytical model in order to estimate the system performance when considering AMC algorithms (i.e. whenmultiple MCSs are available)La darrera versió de l’estàndard deWLAN, anomenada IEEE 802.11n, ha augmentat la seva capacitat notablement en relació als sistemes anteriors gràcies a la incorporació de la tecnologia de múltiples antenes en transmissió i recepció (MIMO). No obstant això, la nova proposta, al igual que les anteriors, segueix sense especificar com s’han d’implementar elsmecanismes de configuraciómés crucials, un dels quals és l’algoritme de codificació imodulació adaptativa (AMC). Aquests algoritmes ja han demostrat la seva importància a l’hora demaximitzar el rendiment del sistema tenint en compte les condicions canviants del canal. En aquesta tesis s’ha proposat un algoritme AMC de llaç tancat, anomenat adaptació ràpida de l’enllaç (FLA), que selecciona eficientment l’esquema demodulació i codificació adaptativa per xarxes WLAN basades en arquitectures multiportadora multiantena. L’algoritme FLA determina el mode de transmissió capaç de maximitzar el throughput per les condicions de canal actuals, mentre satisfà un requisit de qualitat de servei en forma de taxa d’error per paquet (PER). FLA utilitza una metodologia de predicció de PER basada en l’estimació de la relació senyal renou (SNR) efectiva exponencial (EESM). El rendiment de l’algoritme FLA ha estat avaluat en sistemes IEEE 802.11n, ja que aquests, gràcies a la incorporació d’unmecanisme de realimentació demodes de transmissió, poden adoptar solucions AMC de llaç tancat. En una primera part, l’estudi s’ha centrat a la capa física i després s’ha estès a la subcapa MAC. A la capa física s’ha demostrat l’efectivitat de l’algoritme FLA aconseguint un rendiment molt proper al que ens proporcionaria un esquema AMC òptim en termes de throughput, alhora que es satisfan els requisits de PER objectiu. L’algoritme FLA també ha estat avaluat utilitzant informació imperfecte del canal. S’ha vist que l’algoritme FLA proposat és robust en front dels efectes d’estimació imperfecte del canal, i només en canals altament selectius en freqüència, la informació imperfecte del canal provoca una davallada en el rendiment en termes de throughput. A la subcapa MAC, l’algoritme FLA ha estat complementat amb una estratègia de temps d’espera que disminueix la dependència amb la informació de canal disponible a mesura que aquesta va quedant desfassada respecte de l’estat actual. Aquesta informació de canal desfassada és conseqüència de la subcapa MAC que degut a la multiplexació d’usuaris introdueix grans retards entre que es determina el mode de transmissió més adequat i la seva utilització per a l’accés al canal. Els resultats obtinguts han demostrat la superioritat de FLA respecte d’altres algoritmes de llaç obert en condicions de saturació i de no saturació, i independentment de la longitud de paquet, nombre d’usuaris, protocol (CSMA/CA i CSMA/E2CA) i esquema d’accés (Basic Access i RTS/CTS). Amés, s’han desenvolupat diversosmodels analítics per tal d’estimar el rendiment del sistema a la subcapa MAC. Aquests models consideren tots els detalls de funcionament de la subcapaMAC del 802.11n, comper exemple un nombre finit de retransmissions de cada paquet, l’slot anòmal o els errors introduïts pel canal. Inicialment s’ha proposat unmodel semi-analític que determina el throughtput en condicions de saturació, considerant el rendiment dels algoritmes AMC. Després s’ha presentat un model analític que estima el rendiment del sistema per condicions de no saturació, mitjançat elmodelat de cues finites a cada estació. Aquestmodel consideramodes de transmissió fixes i és capaç de determinar de manera molt precisa mètriques de rendimentmolt importants comsón la probabilitat de bloqueig de cada estació, el retard mitjà del paquets, la probabilitat de descart o la mesura del goodput. Finalment, el model analític de no saturació s’ha utilitzat per definir un model semi-analític per tal d’estimar el rendiment del sistema quan es considera l’ús d’algoritmes AMC