Searcharxiv⌕ Search

arXiv subjects

Duy H. N. Nguyen

Publications and source records attributed to Duy H. N. Nguyen.

25 records · Page 2Linked to original sources

Linear Receivers for Massive MIMO Systems with One-Bit ADCs

In this letter, we propose three linear receivers including Bussgang-based Maximal Ratio Combining (BMRC), Bussgang-based Zero-Forcing (BZF), and Bussgang-based Minimum Mean Squared Error (BMMSE) for massive MIMO systems with one-bit analog-to-digital converters (ADCs). Closed-form expressions of the proposed receivers are obtained by using the Bussgang decomposition to cope with the non-linear effect of the one-bit ADCs. Simulation results show significantly lower bit error rate floors obtained by the proposed receivers than those of conventional linear receivers.

eess.SP↗

Linear and Deep Neural Network-based Receivers for Massive MIMO Systems with One-Bit ADCs

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 propose several linear receivers based on the Bussgang decomposition, that show significant performance gain over existing 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 (DNN-based) receiver, 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.

eess.SP↗

Neural Network-Optimized Channel Estimator and Training Signal Design for MIMO Systems with Few-Bit ADCs

This paper is concerned with channel estimation in MIMO systems with few-bit ADCs. In these systems, a linear minimum mean-squared error (MMSE) channel estimator obtained in closed-form is not an optimal solution. We first consider a deep neural network (DNN) and train it as a non-linear MMSE channel estimator for few-bit MIMO systems. We then present a first attempt to use DNN in optimizing the training signal and the MMSE channel estimator concurrently. Specifically, we propose an autoencoder with a specialized first layer, whose weights embed the training signal matrix. Consequently, the trained autoencoder prompts a new training signal design that is customized for the MIMO channel model under consideration.

eess.SP↗

SVM-based Channel Estimation and Data Detection for One-Bit Massive MIMO Systems

The use of low-resolution Analog-to-Digital Converters (ADCs) is a practical solution for reducing cost and power consumption for massive Multiple-Input-Multiple-Output (MIMO) systems. However, the severe nonlinearity of low-resolution ADCs causes significant distortions in the received signals and makes the channel estimation and data detection tasks much more challenging. In this paper, we show how \textit{Support Vector Machine} (\textit{SVM}), a well-known supervised-learning technique in machine learning, can be exploited to provide efficient and robust channel estimation and data detection in massive MIMO systems with one-bit ADCs. First, the problem of channel estimation for uncorrelated channels is formulated as a conventional SVM problem. The objective function of this SVM problem is then modified for estimating spatially correlated channels. Next, a two-stage detection algorithm is proposed where SVM is further exploited in the first stage. The performance of the proposed data detection method is very close to that of Maximum-Likelihood (ML) data detection when the channel is perfectly known. We also propose an SVM-based joint Channel Estimation and Data Detection (CE-DD) method, which makes use of both the to-be-decoded data vectors and the pilot data vectors to improve the estimation and detection performance. Finally, an extension of the proposed methods to OFDM systems with frequency-selective fading channels is presented. Simulation results show that the proposed methods are efficient and robust, and also outperform existing ones.

eess.SP↗

System Energy-Efficient Hybrid Beamforming for mmWave Multi-user Systems

This paper develops energy-efficient hybrid beamforming designs for mmWave multi-user systems where analog precoding is realized by switches and phase shifters such that radio frequency (RF) chain to transmit antenna connections can be switched off for energy saving. By explicitly considering the effect of each connection on the required power for baseband and RF signal processing, we describe the total power consumption in a sparsity form of the analog precoding matrix. However, these sparsity terms and sparsity-modulus constraints of the analog precoding make the system energy-efficiency maximization problem non-convex and challenging to solve. To tackle this problem, we first transform it into a subtractive-form weighted sum rate and power problem. A compressed sensing-based re-weighted quadratic-form relaxation method is employed to deal with the sparsity parts and the sparsity-modulus constraints. We then exploit alternating minimization of the mean-squared error to solve the equivalent problem where the digital precoding vectors and the analog precoding matrix are updated sequentially. The energy efficiency upper bound and a heuristic algorithm are also examined for comparison purposes. Numerical results confirm the superior performances of the proposed algorithm over benchmark energy-efficiency hybrid precoding algorithms and heuristic ones.

eess.SP↗

Supervised and Semi-Supervised Learning for MIMO Blind Detection with Low-Resolution ADCs

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.

eess.SP↗

Optimal Dynamic Point Selection for Power Minimization in Multiuser Downlink CoMP

This paper examines a CoMP system where multiple base-stations (BS) employ coordinated beamforming to serve multiple mobile-stations (MS). Under the dynamic point selection mode, each MS can be assigned to only one BS at any time. This work then presents a solution framework to optimize the BS associations and coordinated beamformers for all MSs. With target signal-to-interference-plus-noise ratios at the MSs, the design objective is to minimize either the weighted sum transmit power or the per-BS transmit power margin. Since the original optimization problems contain binary variables indicating the BS associations, finding their optimal solutions is a challenging task. To circumvent this difficulty, we first relax the original problems into new optimization problems by expanding their constraint sets. Based on the nonconvex quadratic constrained quadratic programming framework, we show that these relaxed problems can be solved optimally. Interestingly, with the first design objective, the obtained solution from the relaxed problem is also optimal to the original problem. With the second design objective, a suboptimal solution to the original problem is then proposed, based on the obtained solution from the relaxed problem. Simulation results show that the resulting jointly optimal BS association and beamforming design significantly outperforms fixed BS association schemes.

cs.IT↗