arXiv subjects

Jinseok Choi

Publications and source records attributed to Jinseok Choi.

At least 37 records · Page 2Linked to original sources

arXiv2024

Learning-Based One-Bit Maximum Likelihood Detection for Massive MIMO Systems: Dithering-Aided Adaptive Approach

In this paper, we propose a learning-based detection framework for uplink massive multiple-input and multiple-output (MIMO) systems with one-bit analog-to-digital converters. The learning-based detection only requires counting the occurrences of the quantized outputs of -1 and +1 for estimating a likelihood probability at each antenna. Accordingly, the key advantage of this approach is to perform maximum likelihood detection without explicit channel estimation which has been one of the primary challenges of one-bit quantized systems. However, due to the quasi-deterministic reception in the high signal-to-noise ratio (SNR) regime, one-bit observations in the high SNR regime are biased to either +1 or -1, and thus, the learning requires excessive training to estimate the small likelihood probabilities. To address this drawback, we propose a dither-and-learning technique to estimate likelihood functions from dithered signals. First, we add a dithering signal to artificially decrease the SNR and then infer the likelihood function from the quantized dithered signals by using an SNR estimate derived from a deep neural network-based estimator which is trained offline. We extend our technique by developing an adaptive dither-and-learning method that updates the dithering power according to the patterns observed in the quantized dithered signals. The proposed framework is also applied to channel-coded MIMO systems by computing a bit-wise and user-wise log-likelihood ratio from the refined likelihood probabilities. Simulation results validate the performance of the proposed methods in both uncoded and coded systems.

eess.SP↗

arXiv2024

Nonlinear Self-Interference Cancellation With Learnable Orthonormal Polynomials for Full-Duplex Wireless Systems

Nonlinear self-interference cancellation (SIC) is essential for full-duplex communication systems, which can offer twice the spectral efficiency of traditional half-duplex systems. The challenge of nonlinear SIC is similar to the classic problem of system identification in adaptive filter theory, whose crux lies in identifying the optimal nonlinear basis functions for a nonlinear system. This becomes especially difficult when the system input has a non-stationary distribution. In this paper, we propose a novel algorithm for nonlinear digital SIC that adaptively constructs orthonormal polynomial basis functions according to the non-stationary moments of the transmit signal. By combining these basis functions with the least mean squares (LMS) algorithm, we introduce a new SIC technique, called as the adaptive orthonormal polynomial LMS (AOP-LMS) algorithm. To reduce computational complexity for practical systems, we augment our approach with a precomputed look-up table, which maps a given modulation and coding scheme to its corresponding basis functions. Numerical simulation indicates that our proposed method surpasses existing state-of-the-art SIC algorithms in terms of convergence speed and mean squared error when the transmit signal is non-stationary, such as with adaptive modulation and coding. Experimental evaluation with a wireless testbed confirms that our proposed approach outperforms existing digital SIC algorithms.

eess.SP↗

arXiv2023

Coordinated Per-Antenna Power Minimization for Multicell Massive MIMO Systems with Low-Resolution Data Converters

A multicell-coordinated beamforming solution for massive multiple-input multiple-output orthogonal frequency-division multiplexing (OFDM) systems is presented when employing low-resolution data converters and per-antenna level constraints. For a more realistic deployment, we aim to find the downlink (DL) beamformer that minimizes the maximum power on transmit antenna array of each basestation under received signal quality constraints while minimizing per-antenna transmit power. We show that strong duality holds between the primal DL formulation and its manageable Lagrangian dual problem which can be interpreted as the virtual uplink (UL) problem with adjustable noise covariance matrices. For a fixed set of noise covariance matrices, we claim that the virtual UL solution is effectively used to compute the DL beamformer and noise covariance matrices can be subsequently updated with an associated subgradient. Our primary contributions are then (1) formulating the quantized DL OFDM antenna power minimax problem and deriving its associated dual problem, (2) showing strong duality and interpreting the dual as a virtual quantized UL OFDM problem, and (3) developing an iterative minimax algorithm based on the dual problem. Simulations validate the proposed algorithm in terms of the maximum antenna transmit power and peak-to-average-power ratio.

eess.SP↗

arXiv2023

On the Learning of Digital Self-Interference Cancellation in Full-Duplex Radios

Full-duplex communication systems have the potential to achieve significantly higher data rates and lower latency compared to their half-duplex counterparts. This advantage stems from their ability to transmit and receive data simultaneously. However, to enable successful full-duplex operation, the primary challenge lies in accurately eliminating strong self-interference (SI). Overcoming this challenge involves addressing various issues, including the nonlinearity of power amplifiers, the time-varying nature of the SI channel, and the non-stationary transmit data distribution. In this article, we present a review of recent advancements in digital self-interference cancellation (SIC) algorithms. Our focus is on comparing the effectiveness of adaptable model-based SIC methods with their model-free counterparts that leverage data-driven machine learning techniques. Through our comparison study under practical scenarios, we demonstrate that the model-based SIC approach offers a more robust solution to the time-varying SI channel and the non-stationary transmission, achieving optimal SIC performance in terms of the convergence rate while maintaining low computational complexity. To validate our findings, we conduct experiments using a software-defined radio testbed that conforms to the IEEE 802.11a standards. The experimental results demonstrate the robustness of the model-based SIC methods, providing practical evidence of their effectiveness.

eess.SP↗

arXiv2023

Rate-Splitting Multiple Access for 6G Networks: Ten Promising Scenarios and Applications

In the upcoming 6G era, multiple access (MA) will play an essential role in achieving high throughput performances required in a wide range of wireless applications. Since MA and interference management are closely related issues, the conventional MA techniques are limited in that they cannot provide near-optimal performance in universal interference regimes. Recently, rate-splitting multiple access (RSMA) has been gaining much attention. RSMA splits an individual message into two parts: a common part, decodable by every user, and a private part, decodable only by the intended user. Each user first decodes the common message and then decodes its private message by applying successive interference cancellation (SIC). By doing so, RSMA not only embraces the existing MA techniques as special cases but also provides significant performance gains by efficiently mitigating inter-user interference in a broad range of interference regimes. In this article, we first present the theoretical foundation of RSMA. Subsequently, we put forth four key benefits of RSMA: spectral efficiency, robustness, scalability, and flexibility. Upon this, we describe how RSMA can enable ten promising scenarios and applications along with future research directions to pave the way for 6G.

cs.IT↗

arXiv2022

Adaptive Learning-Based Detection for One-Bit Quantized Massive MIMO Systems

We propose an adaptive learning-based framework for uplink massive multiple-input multiple-output (MIMO) systems with one-bit analog-to-digital converters. Learning-based detection does not need to estimate channels, which overcomes a key drawback in one-bit quantized systems. During training, learning-based detection suffers at high signal-to-noise ratio (SNR) because observations will be biased to +1 or -1 which leads to many zero-valued empirical likelihood functions. At low SNR, observations vary frequently in value but the high noise power makes capturing the effect of the channel difficult. To address these drawbacks, we propose an adaptive dithering-and-learning method. During training, received values are mixed with dithering noise whose statistics are known to the base station, and the dithering noise power is updated for each antenna element depending on the observed pattern of the output. We then use the refined probabilities in the one-bit maximum likelihood detection rule. Simulation results validate the detection performance of the proposed method vs. our previous method using fixed dithering noise power as well as zero-forcing and optimal ML detection both of which assume perfect channel knowledge.

eess.SP↗

arXiv2022

A Tractable Approach to Coverage Analysis in Downlink Satellite Networks

Satellite networks are promising to provide ubiquitous and high-capacity global wireless connectivity. Traditionally, satellite networks are modeled by placing satellites on a grid of multiple circular orbit geometries. Such a network model, however, requires intricate system-level simulations to evaluate coverage performance, and analytical understanding of the satellite network is limited. Continuing the success of stochastic geometry in a tractable analysis for terrestrial networks, in this paper, we develop novel models that are tractable for the coverage analysis of satellite networks using stochastic geometry. By modeling the locations of satellites and users using Poisson point processes on the surfaces of concentric spheres, we characterize analytical expressions for the coverage probability of a typical downlink user as a function of relevant parameters, including path-loss exponent, satellite height, density, and Nakagami fading parameter. Then, we also derive a tight lower bound of the coverage probability in tractable expression while keeping full generality. Leveraging the derived expression, we identify the optimal density of satellites in terms of the height and the path-loss exponent. Our key finding is that the optimal average number of satellites decreases logarithmically with the satellite height to maximize the coverage performance. Simulation results verify the exactness of the derived expressions.

cs.IT↗

arXiv2022

Joint Optimization for Secure and Reliable Communications in Finite Blocklength Regime

To realize ultra-reliable low latency communications with high spectral efficiency and security, we investigate a joint optimization problem for downlink communications with multiple users and eavesdroppers in the finite blocklength (FBL) regime. We formulate a multi-objective optimization problem to maximize a sum secrecy rate by developing a secure precoder and to minimize a maximum error probability and information leakage rate. The main challenges arise from the complicated multi-objective problem, non-tractable back-off factors from the FBL assumption, non-convexity and non-smoothness of the secrecy rate, and the intertwined optimization variables. To address these challenges, we adopt an alternating optimization approach by decomposing the problem into two phases: secure precoding design, and maximum error probability and information leakage rate minimization. In the first phase, we obtain a lower bound of the secrecy rate and derive a first-order Karush-Kuhn-Tucker (KKT) condition to identify local optimal solutions with respect to the precoders. Interpreting the condition as a generalized eigenvalue problem, we solve the problem by using a power iteration-based method. In the second phase, we adopt a weighted-sum approach and derive KKT conditions in terms of the error probabilities and leakage rates for given precoders. Simulations validate the proposed algorithm.

cs.IT↗

arXiv2022

Rate-Splitting Multiple Access for Quantized Multiuser MIMO Communications

This paper investigates the sum spectral efficiency maximization problem in downlink multiuser multiple-input multiple-output (MIMO) systems with low-resolution quantizers at an access point (AP) and users. In particular, we consider rate-splitting multiple access (RSMA) to enhance spectral efficiency by offering opportunities to boost achievable degrees of freedom. Optimizing RSMA precoders, however, is highly challenging due to the minimum rate constraint when determining the rate of the common stream. The quantization errors coupled with the precoders further make the problem more complicated and difficult to solve. In this paper, we develop a novel RSMA precoding algorithm incorporating quantization errors for maximizing the sum spectral efficiency. To this end, we first obtain an approximate spectral efficiency in a smooth function. Subsequently, we derive the first-order optimality condition in the form of the nonlinear eigenvalue problem (NEP). We propose a computationally efficient algorithm to find the principal eigenvector of the NEP as a sub-optimal solution. Simulation results validate the superior spectral efficiency of the proposed method. The key benefit of using RSMA over spatial division multiple access (SDMA) comes from the ability of the common stream to balance between the channel gain and quantization error in multiuser MIMO systems with different quantization resolutions.

cs.IT↗

arXiv2022

Joint Precoding and Artificial Noise Design for MU-MIMO Wiretap Channels

Secure precoding superimposed with artificial noise (AN) is a promising transmission technique to improve security by harnessing the superposition nature of the wireless medium. However, finding a jointly optimal precoding and AN structure is very challenging in downlink multi-user multiple-input multiple-output (MU-MIMO) wiretap channels with multiple eavesdroppers. The major challenge in maximizing the secrecy rate arises from the non-convexity and non-smoothness of the rate function. Traditionally, an alternating optimization framework that identifies beamforming vectors and AN covariance matrix has been adopted; yet this alternating approach has limitations in maximizing the secrecy rate. In this paper, we put forth a novel secure precoding algorithm that jointly and simultaneously optimizes the beams and AN covariance matrix for maximizing the secrecy rate when a transmitter has either perfect or partial channel knowledge of eavesdroppers. To this end, we first establish an approximate secrecy rate in a smooth function. Then, we derive the first-order optimality condition in the form of the nonlinear eigenvalue problem (NEP). We present a computationally efficient algorithm to identify the principal eigenvector of the NEP as a suboptimal solution for secure precoding. Simulations demonstrate that the proposed methods improve secrecy rate significantly compared to the existing secure precoding methods.

cs.IT↗

arXiv2022

Rate-Splitting Multiple Access for Downlink MIMO: A Generalized Power Iteration Approach

Rate-splitting multiple access (RSMA) is a general multiple access scheme for downlink multi-antenna systems embracing both classical spatial division multiple access and more recent non-orthogonal multiple access. Finding a linear precoding strategy that maximizes the sum spectral efficiency of RSMA is a challenging yet significant problem. In this paper, we put forth a novel precoder design framework that jointly finds the linear precoders for the common and private messages for RSMA. Our approach is first to approximate the non-smooth minimum function part in the sum spectral efficiency of RSMA using a LogSumExp technique. Then, we reformulate the sum spectral efficiency maximization problem as a form of the log-sum of Rayleigh quotients to convert it into a tractable form. By interpreting the first-order optimality condition of the reformulated problem as an eigenvector-dependent nonlinear eigenvalue problem, we reveal that the leading eigenvector of the derived optimality condition is a local optimal solution. To find the leading eigenvector, we propose an algorithm inspired by a power iteration. Simulation results show that the proposed RSMA transmission strategy provides significant improvement in the sum spectral efficiency compared to the state-of-the-art RSMA transmission methods.

eess.SP↗

arXiv2021

Coordinated Beamforming in Quantized Massive MIMO Systems with Per-Antenna Constraints

In this work, we present a solution for coordinated beamforming for large-scale downlink (DL) communication systems with low-resolution data converters when employing a per-antenna power constraint that limits the maximum antenna power to alleviate hardware cost. To this end, we formulate and solve the antenna power minimax problem for the coarsely quantized DL system with target signal-to-interference-plus-noise ratio requirements. We show that the associated Lagrangian dual with uncertain noise covariance matrices achieves zero duality gap and that the dual solution can be used to obtain the primal DL solution. Using strong duality, we propose an iterative algorithm to determine the optimal dual solution, which is used to compute the optimal DL beamformer. We further update the noise covariance matrices using the optimal DL solution with an associated subgradient and perform projection onto the feasible domain. Through simulation, we evaluate the proposed method in maximum antenna power consumption and peak-to-average power ratio which are directly related to hardware efficiency.

eess.SP↗

arXiv2021

Secure Transmission for Hierarchical Information Accessibility in Downlink MU-MIMO

Physical layer security is a useful tool to prevent confidential information from wiretapping. In this paper, we consider a generalized model of conventional physical layer security, referred to as hierarchical information accessibility (HIA). A main feature of the HIA model is that a network has a hierarchy in information accessibility, wherein decoding feasibility is determined by a priority of users. Under this HIA model, we formulate a sum secrecy rate maximization problem with regard to precoding vectors. This problem is challenging since multiple non-smooth functions are involved into the secrecy rate to fulfill the HIA conditions and also the problem is non-convex. To address the challenges, we approximate the minimum function by using the LogSumExp technique, thereafter obtain the first-order optimality condition. One key observation is that the derived condition is cast as a functional eigenvalue problem, where the eigenvalue is equivalent to the approximated objective function of the formulated problem. Accordingly, we show that finding a principal eigenvector is equivalent to finding a local optimal solution. To this end, we develop a novel method called generalized power iteration for HIA (GPI-HIA). Simulations demonstrate that the GPI-HIA significantly outperforms other baseline methods in terms of the secrecy rate.

eess.SP↗

arXiv2021

Energy Efficiency Maximization Precoding for Quantized Massive MIMO Systems

The use of low-resolution digital-to-analog and analog-to-digital converters (DACs and ADCs) significantly benefits energy efficiency (EE) at the cost of high quantization noise in implementing massive multiple-input multiple-output (MIMO) systems. For maximizing EE in quantized downlink massive MIMO systems, this paper formulates a precoding optimization problem with antenna selection; yet acquiring the optimal joint precoding and antenna selection solution is challenging due to the intricate EE characterization. To resolve this challenge, we decompose the problem into precoding direction and power optimization problems. For precoding direction, we characterize the first-order optimality condition, which entails the effects of quantization distortion and antenna selection. For precoding power, we obtain the optimum solution using a gradient descent algorithm to maximize EE for given precoding direction. We cast the derived condition as a functional eigenvalue problem, wherein finding the principal eigenvector attains the best local optimal point. To this end, we propose generalized power iteration based algorithm. Alternating these two methods, our algorithm identifies a joint solution of the active antenna set and the precoding direction and power. In simulations, the proposed methods provide considerable performance gains. Our results suggest that a few-bit DACs are sufficient for achieving high EE in massive MIMO systems.

eess.SP↗

arXiv2021

Coordinated Multicell Beamforming and Power Allocation for Massive MIMO with Low-Resolution ADC/DAC

In this work, we present a solution for coordinated beamforming and power allocation when base stations employ a massive number of antennas equipped with low-resolution analog-to-digital and digital-to-analog converters. We address total power minimization problems of the coarsely quantized uplink (UL) and downlink (DL) communication systems with target signal-to-interference-plus-noise ratio (SINR) constraints. By combining the UL problem with minimum mean square error combiners and deriving the Lagrangian dual of the DL problem, we prove UL-DL duality and show there is no duality gap even with coarse data converters. Inspired by strong duality, we devise an iterative algorithm to determine the optimal UL transmit powers, and then linearly amplify the UL combiners with proper weights to acquire the optimal DL precoder. Simulation results validate strong duality and evaluate the proposed method in terms of total power consumption and achieved SINR.

cs.IT↗

arXiv2020

Quantized Massive MIMO Systems with Multicell Coordinated Beamforming and Power Control

In this paper, we investigate a coordinated multipoint (CoMP) beamforming and power control problem for base stations (BSs) with a massive number of antenna arrays under coarse quantization at low-resolution analog-to-digital converters (ADCs) and digital-to-analog converter (DACs). Unlike high-resolution ADC and DAC systems, non-negligible quantization noise that needs to be considered in CoMP design makes the problem more challenging. We first formulate total power minimization problems of both uplink (UL) and downlink (DL) systems subject to signal-to-interference-and-noise ratio (SINR) constraints. We then derive strong duality for the UL and DL problems under coarse quantization systems. Leveraging the duality, we propose a framework that is directed toward a twofold aim: to discover the optimal transmit powers in UL by developing iterative algorithm in a distributed manner and to obtain the optimal precoder in DL as a scaled instance of UL combiner. Under homogeneous transmit power and SINR constraints per cell, we further derive a deterministic solution for the UL CoMP problem by analyzing the lower bound of the SINR. Lastly, we extend the derived result to wideband orthogonal frequency-division multiplexing systems to optimize transmit power and beamformer for all subcarriers. Simulation results validate the theoretical results and proposed algorithms.

cs.IT↗

arXiv2020

Advanced Receiver Architectures for Millimeter Wave Communications with Low-Resolution ADCs

Employing low-resolution analog-to-digital converters (ADCs) for millimeter wave receivers with large antenna arrays provides opportunity to efficiently reduce power consumption of the receiver. Reducing ADC resolution, however, results in performance degradation due to non-negligible quantization error. In addition, the large number of radio frequency (RF) chains is still not desirable. Accordingly, conventional low-resolution ADC systems require more efficient designs to minimize the cost and complexity while maximizing performance. In this article, we discuss advanced low-resolution ADC receiver architectures that further improve the spectral and energy efficiency tradeoff. To reduce both the numbers of RF chains and ADC bits, hybrid analog-and-digital beamforming is jointly considered with low-resolution ADCs. We explore the challenges in designing such receivers and present key insights on how the advanced architectures overcome such challenges. As an alternative low-resolution ADC receiver, we also introduce receivers with learning-based detection. The receiver does not require explicit channel estimation, thereby is suitable for one-bit ADC systems. Finally, future challenges and research issues are discussed.

cs.IT↗

arXiv2019

A Framework for Automated Cellular Network Tuning with Reinforcement Learning

Tuning cellular network performance against always occurring wireless impairments can dramatically improve reliability to end users. In this paper, we formulate cellular network performance tuning as a reinforcement learning (RL) problem and provide a solution to improve the performance for indoor and outdoor environments. By leveraging the ability of Q-learning to estimate future performance improvement rewards, we propose two algorithms: (1) closed loop power control (PC) for downlink voice over LTE (VoLTE) and (2) self-organizing network (SON) fault management. The VoLTE PC algorithm uses RL to adjust the indoor base station transmit power so that the signal to interference plus noise ratio (SINR) of a user equipment (UE) meets the target SINR. It does so without the UE having to send power control requests. The SON fault management algorithm uses RL to improve the performance of an outdoor base station cluster by resolving faults in the network through configuration management. Both algorithms exploit measurements from the connected users, wireless impairments, and relevant configuration parameters to solve a non-convex performance optimization problem using RL. Simulation results show that our proposed RL based algorithms outperform the industry standards today in realistic cellular communication environments.

cs.NI↗