A major challenge for uplink multiuser massive multiple-input and multiple-output (MIMO) systems is the data detection problem at the receiver due to the substantial increase in the dimensions of MIMO systems. The optimal maximum likelihood detector is impractical for such large wireless systems, because it suffers from exponential complexity in terms of the number of users. Therefore, suboptimal alternatives with reduced complexity, such as the linear minimum mean square error (LMMSE) detector, are necessary. However, the LMMSE detector still introduces high computational complexity, mainly caused by the computation of the Gram matrix and matrix inversion. To reduce the computational complexity of data detection while achieving satisfactory bit error rate (BER) performance, we initially proposed an iterative data detection algorithm that exploits the coordinate descent method (CDM)-based algorithmic framework for uplink multiuser massive MIMO systems. We then developed a reduced-complexity hardware implementation algorithm by leveraging the “one-at-a-time” update property of the CDM-based algorithmic framework. Simulation results revealed that the proposed CDM-based detector provides the same or improved BER performance than the classical LMMSE algorithm at a lower complexity for different test scenarios.
This letter considers the use of the tone injection (TI) scheme to reduce the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal. TI is a distortionless technique that can reduce PAPR significantly without data rate loss and does not require the extra side information. However, the optimal TI scheme requires an exhaustive search over all combinations of possible permutations of the expanded constellation, which is a potential problem for practical applications. To reduce the computational complexity while still improving PAPR statistics, this letter first formulates the PAPR reduction with TI scheme as a particular combinatorial optimization problem. Next, it proposes the application of the cross-entropy (CE) method to solve the problem. Computer simulation results show that the proposed CE method obtains the desired PAPR reduction with low computational complexity.
4 December 2017 in IEEE Transactions on Vehicular Technology
When the number of base station (BS) antennas is considerably larger than the number of user terminals (UTs), a simple linear minimum mean square error (LMMSE) data detection algorithm is near–optimal for uplink massive multiuser multiple–input and multiple–output (MIMO) systems. However, the LMMSE detector suffers significant performance loss when the number of UTs is comparable to the number of BS antennas. To alleviate the performance loss caused by the decrease in the BS–antenna–to–UT ratio, known data detection algorithm, namely “TASER,” can yield bit error rate (BER) performance close to that of the optimal detector in symmetric massive multiuser MIMO systems, where the BS–antenna–to–UT ratio is 1. However, this TASER algorithm can only handle binary and quadratic phase shift keying (PSK) modulations. Moreover, the computational complexity of the TASER algorithm is still remarkably high. Thus, a novel data detection algorithm is proposed in this study to reduce the computational complexity of the detection algorithm while achieving acceptable BER performance. The proposed algorithm is developed from the retraction-based Riemannian manifold optimization (RMO) framework for symmetric massive multiuser MIMO systems. Unlike the TASER-based detector, the proposed RMO–based detector can be applied for general M-ary PSK modulations. Simulation results show that the proposed detector significantly outperforms the LMMSE detector in terms of BER performance. In addition, the required complexity of RMO is substantially lower than that of TASER. These findings indicate that the proposed RMO–based detector exhibits a highly desirable tradeoff between BER performance and complexity.
15 May 2018 in IEEE Transactions on Vehicular Technology
The use of low-cost and power-efficient hardware components has elicited considerable interest in the context of massive multiuser multiple-input and multiple-output (MIMO) systems because such hardware architecture enables significant power and cost savings at the base station (BS). In this study, we focus on the downlink precoding problem in massive multiuser MIMO systems, where each BS antenna element is equipped with 1-bit digital-to-analog converters (DACs). We aim to find the optimal precoding vector and the associated precoding factor, such that multiuser interference can be minimized for all users. However, such precoding design problem with 1-bit DACs at the BS is non-convex and challenging because of the coupled precoding vector and associated precoding factor. To deal with this problem, we propose a two-step iterative procedure that applies the alternating minimization (AltMin) framework to alternately solve for the precoding vector and the associated precoding factor while keeping the other constant. The primary difficulty is the precoding vector design, which we address by proposing a low-complexity algorithm developed from the coordinate descent framework to find the optimal precoding vector. Simulation results show that the proposed AltMin algorithm not only exhibits low complexity but can also achieve a bit error rate performance that is comparable with or higher than those of state-of-the-art algorithms under various test scenarios.
25 June 2025 in IEEE Open Journal of the Communications Society
Within the surface-wave communication paradigm, pinching-antenna systems employ dielectric waveguides as both transmission media and reconfigurable radiators, enabling dynamic antenna repositioning to mitigate path-loss limitations inherent in static arrays. This paper integrates pinching-antenna systems into a downlink multiuser multiple-input single-output (MU-MISO) multicast architecture. We first formulate a single-group multicast design problem where we optimize antenna locations along a waveguide under a total power budget to maximize the minimum signal-to-noise ratio (SNR) across users in a max-min fairness sense. Subsequently, we extend this study to a multigroup multicast scenario with multiple waveguides where antenna placement and transmit beamforming are jointly optimized to maximize the minimum signal-to-interference-plus-noise ratio (SINR) across users in all groups. Intergroup interference is eliminated via block-diagonalization beamforming, resulting in a tractable antenna-placement problem. To accommodate different hardware capabilities, we consider both continuous and discrete activation of pinching antennas, yielding four distinct optimization formulations. For each problem, we develop a probability-learning algorithm within a cross-entropy optimization (CEO) framework, iteratively refining a parameterized sampling distribution via closed-form updates. Simulation results demonstrate that all of the proposed algorithms outperform conventional baselines. Notably, the discrete CEO variant achieves performance comparable to its continuous counterpart with significantly lower complexity, offering a favorable performance-complexity trade-off for practical deployment.
This study considers the use of alternating minimization (AltMin) framework as the main design principle in determining the optimal weights of hybrid digital and analog beamforming in millimeter-wave massive multiple-input multipleoutput systems. However, such framework experiences analog beamformer design problem because analog beamformers are normally constructed using phase shifters (PSs), which result in non-convex constraints, and known solutions suffer from high computational complexity. We address this issue by proposing a simple yet efficient gradient projection (GP)-based AltMin (GPAltMin) algorithm for hybrid beamforming design problems. In addition, when quantized PSs are adopted, we propose nonuniform PSs on the basis of the Lloyd-Max algorithm for minimizing the performance loss caused by quantization. Simulation results demonstrate that the proposed GP-AltMin algorithm not only has lower complexity but can also achieve spectral efficiency, which is comparable with or higher than those of state-of-the-art algorithms that use unquantized and low-resolution PSs.