Full-Duplex Amplify-and-Forward MIMO Relaying: Design and Performance Analysis Under Erroneous CSI and Hardware Impairments

Taghizadeh, Omid; Stańczak, Sławomir; Iimori, Hiroki; Abreu, Giuseppe

doi:10.1109/ojcoms.2021.3080239

Cited by 10 publications

(5 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most complicated operation associated with solving (19) is the computation of the corresponding quadratically constrained programs (QCPs) ε-solution, whose canonical arithmetic complexity C can be upper-bounded by [60], [61]…”

Section: ) Design Methods Of Convex Optimization Using Fpmentioning

confidence: 99%

Clustering and Beamforming for User-Centric Cell-Free Massive MIMO With Backhaul Capacity Limitation

Ito,

Fukue,

Ando

et al. 2024

IEEE Access

View full text Add to dashboard Cite

This paper addresses the joint design of a beamformer and user-centric clustering for scalable cell-free massive multiple-input multiple-output (CF-mMIMO) under severe quantization noise generated in backhaul links for central processing units (CPUs) cooperation. The system model comes up with a plan in which multiple CPUs exchange physical layer data under limited bandwidth to enhance performance while introducing clustering across multiple CPUs. We derive the joint optimization of the minimum meansquare error (MMSE) beamformer and user-centric clustering under quantization noise, and propose its lowcomplexity design. The superiority of our proposed design method is clarified by comparing its performance with cellular distributed MIMO systems. Throughout the paper, we first answer the problem of how much gain CF-mMIMO systems with multiple CPUs cooperation can obtain.

show abstract

Section: ) Design Methods Of Convex Optimization Using Fpmentioning

confidence: 99%

Clustering and Beamforming for User-Centric Cell-Free Massive MIMO With Backhaul Capacity Limitation

Ito,

Fukue,

Ando

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In turn, the improved sum-rate maximization and max-min rate SotA methods employed as benchmark are respectively described fundamentally by equations ( 48) and ( 49). Next, notice that the most expensive operation associated with all these optimization problems is the computation of the corresponding QCPs ε-solution, whose canonical arithmetic complexity C can be upper-bounded by [59], [60]…”

Section: Complexity Analysismentioning

confidence: 99%

Joint Access Configuration and Beamforming for Cell-Free Massive MIMO Systems With Dynamic TDD

et al. 2022

Self Cite

View full text Add to dashboard Cite

We address the trade-off between system throughput and user equipment (UE) fairness in dynamic time division duplex (TDD) cell-free (CF)-massive multiple-input multiple-output (mMIMO) systems, developing to that end a joint access point (AP) access configuration, power allocation, and beamforming design scheme. Unlike state-of-the-art (SotA) methods, which mostly focus on sum-rate maximization or max-min worst case optimization, our design approach is to maximize the geometric mean of the UEs' throughput performance under a constrained transmit power, which is shown to yield an excellent compromise between system throughput and user fairness. The direct reformulation of the resulting optimization problem is, however, hard to solve due not only to the non-convexity of the objective function, but also to the binary constraint induced by the AP access configuration. We thus present an efficient (i.e., polynomial time complexity) solution for the problem via a combination of fractional programming (FP) and convex-concave procedure (CCP), assisted by a negative entropy regularizer that promotes a binary solution. Numerical simulations are offered to evaluate the throughput performance and fairness index of the proposed algorithm in comparison not only to conventional TDD-based solutions, but also to recent dynamic TDD SotA designs, which illustrate the effectiveness of the proposed approach over existing methodologies both in throughput and fairness.INDEX TERMS Cell-free massive multiple-input multiple-output, convex optimization, convex-concave procedure, dynamic time-division duplex, geometric mean, fractional programming.

show abstract

“…It is worth mentioning that the values of κ, β depend on the implemented SIC scheme and reflect the quality of the cancellation. For more discussions on the used distortion model please see [43], [44], [54], [55], [58]- [62], and the references therein.…”

Section: A Residual Self-interferencementioning

confidence: 99%

Quantization-Aided Secrecy: FD C-RAN Communications with Untrusted Radios

Taghizadeh¹,

Yang²,

Iimori³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

In this work, we study a full-duplex (FD) cloud radio access network (C-RAN) from the aspects of infrastructure sharing and information secrecy, where the central unit utilizes FD remote radio units (RU)s belonging to the same operator, i.e., the trusted RUs, as well as the RUs belonging to other operators or private owners, i.e., the untrusted RUs. Furthermore, the communication takes place in the presence of untrusted external receivers, i.e., eavesdropper nodes. The communicated uplink (UL) and downlink (DL) waveforms are quantized in order to comply with the limited capacity of the fronthaul links. In order to provide information secrecy, we propose a novel utilization of the quantization noise shaping in the DL, such that it is simultaneously used to comply with the limited capacity of the fronthaul links, as well as to degrade decoding capability of the individual eavesdropper and the untrusted RUs for both the UL and DL communications. In this regard, expressions describing the achievable secrecy rates are obtained.An optimization problem for jointly designing the DL and UL quantization and precoding strategies are then formulated, with the purpose of maximizing the overall system weighted sum secrecy rate. Due to the intractability of the formulated problem, an iterative solution is proposed, following the successive inner approximation and semi-definite relaxation frameworks, with convergence to a stationary point.Numerical evaluations indicate a promising gain of the proposed approaches for providing information secrecy against the untrusted infrastructure nodes and/or external eavesdroppers in the context of FD C-RAN communications.

show abstract

Full-Duplex Amplify-and-Forward MIMO Relaying: Design and Performance Analysis Under Erroneous CSI and Hardware Impairments

Cited by 10 publications

References 57 publications

Clustering and Beamforming for User-Centric Cell-Free Massive MIMO With Backhaul Capacity Limitation

Clustering and Beamforming for User-Centric Cell-Free Massive MIMO With Backhaul Capacity Limitation

Joint Access Configuration and Beamforming for Cell-Free Massive MIMO Systems With Dynamic TDD

Quantization-Aided Secrecy: FD C-RAN Communications with Untrusted Radios

Contact Info

Product

Resources

About