Search

The use of one-bit analog-to-digital converters (ADCs) is a practical solution for reducing cost and power consumption in massive Multiple-Input-Multiple-Output (MIMO) systems. However, the distortion caused by one-bit ADCs makes the data detection task much more challenging. In this paper, we propose a two-stage detection method for massive MIMO systems with one-bit ADCs. In the first stage, we present several linear receivers based on the Bussgang decomposition that show significant performance gains over conventional linear receivers. Next, we reformulate the maximum-likelihood (ML) detection problem to address its non-robustness. Based on the reformulated ML detection problem, we propose a model-driven deep neural network-based detector, namely OBMNet, whose performance is comparable with an existing support vector machine-based receiver, albeit with a much lower computational complexity. A nearest-neighbor search method is then proposed for the second stage to refine the first stage solution. Unlike existing search methods that typically perform the search over a large candidate set, the proposed search method generates a limited number of most likely candidates and thus limits the search complexity. Numerical results confirm the low complexity, efficiency, and robustness of the proposed two-stage detection method.

This paper investigates a symbiotic unmanned aerial vehicle (UAV)-assisted intelligent reflecting surface (IRS) radio system, where the UAV is leveraged to help the IRS reflect its own signals to the base station, and meanwhile enhance the UAV transmission by passive beamforming at the IRS. First, we consider the weighted sum bit error rate (BER) minimization problem among all IRSs by jointly optimizing the UAV trajectory, IRS phase shift matrix, and IRS scheduling, subject to the minimum primary rate requirements. To tackle this complicated problem, a relaxation-based algorithm is proposed. We prove that the converged relaxation scheduling variables are binary, which means that no reconstruct strategy is needed, and thus the UAV rate constraints are automatically satisfied. Second, we consider the fairness BER optimization problem. We find that the relaxation-based method cannot solve this fairness BER problem since the minimum primary rate requirements may not be satisfied by the binary reconstruction operation. To address this issue, we first transform the binary constraints into a series of equivalent equality constraints. Then, a penalty-based algorithm is proposed to obtain a suboptimal solution. Numerical results are provided to evaluate the performance of the proposed designs under different setups, as compared with benchmarks.

Intelligent reflecting surfaces (IRSs) have emerged as a revolutionary solution to enhance wireless communications by changing propagation environment in a cost-effective and hardware-efficient fashion. In addition, symbol-level precoding (SLP) has attracted considerable attention recently due to its advantages in converting multiuser interference (MUI) into useful signal energy. Therefore, it is of interest to investigate the employment of IRS in symbol-level precoding systems to exploit MUI in a more effective way by manipulating the multiuser channels. In this article, we focus on joint symbol-level precoding and reflecting designs in IRS-enhanced multiuser multiple-input single-output (MU-MISO) systems. Both power minimization and quality-of-service (QoS) balancing problems are considered. In order to solve the joint optimization problems, we develop an efficient iterative algorithm to decompose them into separate symbol-level precoding and block-level reflecting design problems. An efficient gradient-projection-based algorithm is utilized to design the symbol-level precoding and a Riemannian conjugate gradient (RCG)-based algorithm is employed to solve the reflecting design problem. Simulation results demonstrate the significant performance improvement introduced by the IRS and illustrate the effectiveness of our proposed algorithms.

The use of low-resolution analog-to-digital converters (ADCs) is considered to be an effective technique to reduce the power consumption and hardware complexity of wireless transceivers. However, in systems with low-resolution ADCs, obtaining channel state information (CSI) is difficult due to significant distortions in the received signals. The primary motivation of this paper is to show that learning techniques can mitigate the impact of CSI unavailability. We study the blind detection problem in multiple-input-multiple-output (MIMO) systems with low-resolution ADCs using learning approaches. Two methods, which employ a sequence of pilot symbol vectors as the initial training data, are proposed. The first method exploits the use of a cyclic redundancy check (CRC) to obtain more training data, which helps improve the detection accuracy. The second method is based on the perspective that the to-be-decoded data can itself assist the learning process, so no further training information is required except the pilot sequence. For the case of 1-bit ADCs, we provide a performance analysis of the vector error rate for the proposed methods. Based on the analytical results, a criterion for designing transmitted signals is also presented. Simulation results show that the proposed methods outperform existing techniques and are also more robust.

In this contribution, we investigate a coarsely quantized multi-user multiple-input single-output downlink communication system, where we assume 1-bit digital-to-analog converters at the base station antennas. First, we analyze the achievable sum rate lower-bound using the Bussgang decomposition under new assumptions. In the presence of the non-linear quantization, our analysis indicates the potential merit of reconsidering traditional signal processing techniques in coarsely quantized systems, i.e., reconsidering transmit covariance matrices whose rank is equal to the rank of the channel. Furthermore, in the latter part of this paper, we propose a linear precoder design that achieves the predicted increase in performance compared with a state-of-the-art linear precoder design. Moreover, our linear signal processing algorithm allows for higher order modulation schemes to be employed.

Coarsely quantized massive multiple-input multiple-output (MIMO) systems are gaining more interest due to their power efficiency. We present a new precoding technique to mitigate the multi-user interference and the quantization distortions in a downlink multi-user MIMO system with coarsely quantized constant envelope (QCE) signals at the transmitter. The transmit signal vector is optimized for every desired received vector taking into account a relaxed version of the QCE constraint. The optimization is based on maximizing the safety margin to the decision thresholds of the receiver constellation modulation. Due to the linear property of the objective function and the constraints, the optimization problem is formulated as a linear programming problem. The simulation results show a significant gain in terms of the uncoded bit error rate compared to the existing precoding techniques.

We study multi-user massive multiple-input single-output systems and focus on downlink transmission for PSK modulation, where the base station employs a large antenna array with low-cost 1-bit digital-to-analog converters (DACs). The direct combination of existing beamforming schemes with 1-bit DACs is shown to lead to an error floor at medium-to-high SNR regime, due to the coarse quantization of the DACs with limited precision. In this paper, based on the constructive interference, we consider both a quantized linear beamforming scheme where we analytically obtain the optimal beamforming matrix and a non-linear mapping scheme where we directly design the transmit signal vector. Due to the 1-bit quantization, the formulated optimization for the non-linear mapping scheme is shown to be non-convex. The non-convex constraints of the 1-bit DACs are first relaxed into convex, followed by an element-wise normalization to satisfy the 1-bit DAC transmission. We further propose a low-complexity symbol scaling scheme that consists of three stages, in which the quantized transmit signal on each antenna element is selected sequentially. Numerical results show that the proposed symbol scaling scheme achieves a comparable performance to the optimization-based non-linear mapping approach, while the corresponding performance-complexity tradeoff is more favorable for the proposed symbol scaling method.

Theoretical studies on physical layer security often adopt the secrecy outage probability as the performance metric for wireless communications over quasi-static fading channels. The secrecy outage probability has two limitations from a practical point of view: 1) it does not give any insight into the eavesdropper's decodability of confidential messages and 2) it cannot characterize the amount of information leakage to the eavesdropper when an outage occurs. Motivated by the limitations of the secrecy outage probability, we propose three new secrecy metrics for secure transmissions over quasi-static fading channels. The first metric establishes a link between the concept of secrecy outage and the decodability of messages at the eavesdropper. The second metric provides an error-probability-based secrecy metric which is typically used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics collectively give a more comprehensive understanding of physical layer security over fading channels and enable one to appropriately design secure communication systems with different views on how secrecy is measured.