Mintaek Oh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mintaek Oh has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jinseok Choi
Korea Advanced Institute of Science and Technology
10 shared publications - Jeonghun Park
Yonsei University
5 shared publications - Namyoon Lee
POSTECH
5 shared publications - Seunghyeong Yoo
Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea
3 shared publications - Eunsung Choi
School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea
2 shared publications - Jaehyun Kim
Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea
1 shared publication
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 25397-25402
Hybrid Precoding Revisited: Low-Dimensional Subspace Perspective for MU-MIMO Systems
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 25397-25402
Hybrid Precoding Revisited: Low-Dimensional Subspace Perspective for MU-MIMO Systems
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 9742-9757
Full-Duplex Multiuser MISO Under Coarse Quantization: Per-Antenna SQNR Analysis and Beamforming Design
We investigate full-duplex (FD) multi-user multiple-input single-output systems with coarse quantization, aiming to characterize the impact of employing low-resolution analog-to-digital converters (ADCs) on self-interference (SI) and to develop a quantization- and SI-aware beamforming method that alleviates quantization-induced performance degradation in the FD systems. We first present an analysis on the perantenna signal-to-quantization noise ratio for conventional linear beamformers to provide the desired range of the number of analog-to-digital converter (ADC) bits, providing system insights for reliable FD operation in regard to the ADC resolution and beamforming strategy. Motivated by the insights, we then propose an SI-aware beamforming method that mitigates residual SI and quantization distortion. The resulting spectral efficiency (SE) maximization problem is decomposed into two tractable subproblems solved via alternating optimization: precoder and combiner design. The precoder optimization is formulated as a generalized eigenvalue problem, where the dominant eigenvector yields the best stationary solution through power iteration, while the combiner is derived as a quantization-aware minimum mean-squared error (MMSE) filter. Numerical studies show that the number of required ADC bits with the proposed beamforming falls within the derived theoretical range while achieving the highest SE compared to benchmarks.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 9742-9757
Full-Duplex Multiuser MISO Under Coarse Quantization: Per-Antenna SQNR Analysis and Beamforming Design
We investigate full-duplex (FD) multi-user multiple-input single-output systems with coarse quantization, aiming to characterize the impact of employing low-resolution analog-to-digital converters (ADCs) on self-interference (SI) and to develop a quantization- and SI-aware beamforming method that alleviates quantization-induced performance degradation in the FD systems. We first present an analysis on the perantenna signal-to-quantization noise ratio for conventional linear beamformers to provide the desired range of the number of analog-to-digital converter (ADC) bits, providing system insights for reliable FD operation in regard to the ADC resolution and beamforming strategy. Motivated by the insights, we then propose an SI-aware beamforming method that mitigates residual SI and quantization distortion. The resulting spectral efficiency (SE) maximization problem is decomposed into two tractable subproblems solved via alternating optimization: precoder and combiner design. The precoder optimization is formulated as a generalized eigenvalue problem, where the dominant eigenvector yields the best stationary solution through power iteration, while the combiner is derived as a quantization-aware minimum mean-squared error (MMSE) filter. Numerical studies show that the number of required ADC bits with the proposed beamforming falls within the derived theoretical range while achieving the highest SE compared to benchmarks.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 26335-26351
Scalable and Convergent Generalized Power Iteration Precoding for Massive MIMO Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 26335-26351
Scalable and Convergent Generalized Power Iteration Precoding for Massive MIMO Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 22718-22733
Scalable Beamforming Design for Multi-RIS-Aided MU-MIMO Systems With Imperfect CSIT
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 22718-22733
Scalable Beamforming Design for Multi-RIS-Aided MU-MIMO Systems With Imperfect CSIT
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 11908-11913
Generalized Power Iteration-Based Precoding With Low-Complexity Matrix Inversion Approaches for Massive MIMO Systems
Generalized power iteration-based precoding (GPIP) exhibits superior performance in maximizing spectral efficiency for multi-antenna communications. Increasing the number of antennas, however, makes GPIP less practical due to its cubic complexity with respect to the number of antennas in computing matrix inversion. To resolve this, we propose efficient GPIP methods with imperfect channel knowledge. Exploiting the GPIP matrix structure, we use two low-complexity matrix inversion approaches: the matrix inversion lemma-based low-dimension matrix inversion and Gauss-Seidel iteration. These approaches decrease complexity order to the square of the number of antennas. Simulations validate the computational efficiency of the proposed methods while maintaining performance.
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 11908-11913
Generalized Power Iteration-Based Precoding With Low-Complexity Matrix Inversion Approaches for Massive MIMO Systems
Generalized power iteration-based precoding (GPIP) exhibits superior performance in maximizing spectral efficiency for multi-antenna communications. Increasing the number of antennas, however, makes GPIP less practical due to its cubic complexity with respect to the number of antennas in computing matrix inversion. To resolve this, we propose efficient GPIP methods with imperfect channel knowledge. Exploiting the GPIP matrix structure, we use two low-complexity matrix inversion approaches: the matrix inversion lemma-based low-dimension matrix inversion and Gauss-Seidel iteration. These approaches decrease complexity order to the square of the number of antennas. Simulations validate the computational efficiency of the proposed methods while maintaining performance.
- 10 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (5) , 8390-8395
Artificial Noise-Aided Max-Min Fairness Secrecy Precoding With Partial Wiretap Channel Knowledge
We propose an artificial noise (AN)-aided max-min fairness (MMF) secure precoding algorithm. The algorithm jointly optimizes precoders and AN covariance matrix without alternation for a multiuser multiple-input multiple-output system with multiple colluding eavesdroppers. The formulated AN-aided MMF problem involves several challenges such as non-convexity, non-smoothness, coupled optimization variables, and partial wiretap channel state information at a transmitter (CSIT). To address the challenges, we first consider the perfect wiretap CSIT and approximate the reformulated problem as a smooth problem. Then, we derive the first-order optimality condition and interpret it as a nonlinear eigenvalue problem. Finally, we adopt a power iteration method to solve the condition. To extend the algorithm to the partial wiretap CSIT scenario, we reformulate the problem with an average wiretap rate by deriving an approximate lower bound of the rate. This enables us to exploit the partial channel knowledge. Subsequently, we propose the algorithm for the partial wiretap CSIT. Simulations validate the proposed methods.
- 10 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (5) , 8390-8395
Artificial Noise-Aided Max-Min Fairness Secrecy Precoding With Partial Wiretap Channel Knowledge
We propose an artificial noise (AN)-aided max-min fairness (MMF) secure precoding algorithm. The algorithm jointly optimizes precoders and AN covariance matrix without alternation for a multiuser multiple-input multiple-output system with multiple colluding eavesdroppers. The formulated AN-aided MMF problem involves several challenges such as non-convexity, non-smoothness, coupled optimization variables, and partial wiretap channel state information at a transmitter (CSIT). To address the challenges, we first consider the perfect wiretap CSIT and approximate the reformulated problem as a smooth problem. Then, we derive the first-order optimality condition and interpret it as a nonlinear eigenvalue problem. Finally, we adopt a power iteration method to solve the condition. To extend the algorithm to the partial wiretap CSIT scenario, we reformulate the problem with an average wiretap rate by deriving an approximate lower bound of the rate. This enables us to exploit the partial channel knowledge. Subsequently, we propose the algorithm for the partial wiretap CSIT. Simulations validate the proposed methods.
- 11 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 894-896
OFDM Simulator for Underwater Acoustic Communications
Underwater acoustic (UWA) communication holds immense potential for military applications due to the unique challenges posed by the underwater environment. While traditional radio-frequency (RF) communication is effective in open air, its effectiveness is significantly diminished underwater due to high absorption, scattering, and signal degradation caused by the water medium. In contrast, UWA leverages sound waves to transmit data, overcoming many of these obstacles and offering several compelling motivations for military use. For achieving a deeper comprehension of underwater acoustic (UWA) communication, the development of an OFDM simulator is essential. To this end, we first analyze basic OFDM simulator designed for the typical path-delayed channel model that consists of 6 delay taps. Applying this to the UWA channels, we observe the severe performance loss occurs. In concluding this paper, we underscore the imperative of addressing the challenges of UWA channels.
- 11 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 894-896
OFDM Simulator for Underwater Acoustic Communications
Underwater acoustic (UWA) communication holds immense potential for military applications due to the unique challenges posed by the underwater environment. While traditional radio-frequency (RF) communication is effective in open air, its effectiveness is significantly diminished underwater due to high absorption, scattering, and signal degradation caused by the water medium. In contrast, UWA leverages sound waves to transmit data, overcoming many of these obstacles and offering several compelling motivations for military use. For achieving a deeper comprehension of underwater acoustic (UWA) communication, the development of an OFDM simulator is essential. To this end, we first analyze basic OFDM simulator designed for the typical path-delayed channel model that consists of 6 delay taps. Applying this to the UWA channels, we observe the severe performance loss occurs. In concluding this paper, we underscore the imperative of addressing the challenges of UWA channels.
- 3 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (12) , 9457-9472
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.
- 3 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (12) , 9457-9472
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.
- 7 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (3) , 1564-1578
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 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 methods.
- 7 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (3) , 1564-1578
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 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 methods.
- 10 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2500-2505
Energy-Efficient Precoding for Massive MIMO Systems with Low-Resolution Quantizers
In this paper, we propose a precoding method to maximize energy efficiency (EE) in a downlink multiuser massive multiple-input multiple-output system with low-resolution quantizers. To this end, we formulate an EE maximization problem with respect to precoders by incorporating the quantization errors caused by the low-resolution quantizers. The main challenges exist: i) the quantization errors are entangled with the precoders, ii) a objective function is non-convex, and iii) unlike a spectral efficiency (SE) maximization problem, a precoding power needs to be jointly optimized. To address these challenges, we first adopt a Dinkenbach method and reformulate the EE problem to a more tractable form. We further decompose the problem into an optimal precoding direction and transmit power problems. To find the optimal direction, we derive a first-order Karush–Kuhn–Tucker (KKT) condition and interpret the condition as a generalized eigenvalue problem. Accordingly, adopting a generalized power iteration-based precoding method, we find the principal eigenvector which is the best sub-optimal precoder. Regarding the transmit power optimization, the objective function becomes concave for given other variables. Hence, the transmit power level is optimized by using a gradient descent method. Via simulations, we demonstrate that the proposed algorithm provides the highest EE performance compared to baseline methods.
- 10 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2500-2505
Energy-Efficient Precoding for Massive MIMO Systems with Low-Resolution Quantizers
In this paper, we propose a precoding method to maximize energy efficiency (EE) in a downlink multiuser massive multiple-input multiple-output system with low-resolution quantizers. To this end, we formulate an EE maximization problem with respect to precoders by incorporating the quantization errors caused by the low-resolution quantizers. The main challenges exist: i) the quantization errors are entangled with the precoders, ii) a objective function is non-convex, and iii) unlike a spectral efficiency (SE) maximization problem, a precoding power needs to be jointly optimized. To address these challenges, we first adopt a Dinkenbach method and reformulate the EE problem to a more tractable form. We further decompose the problem into an optimal precoding direction and transmit power problems. To find the optimal direction, we derive a first-order Karush–Kuhn–Tucker (KKT) condition and interpret the condition as a generalized eigenvalue problem. Accordingly, adopting a generalized power iteration-based precoding method, we find the principal eigenvector which is the best sub-optimal precoder. Regarding the transmit power optimization, the objective function becomes concave for given other variables. Hence, the transmit power level is optimized by using a gradient descent method. Via simulations, we demonstrate that the proposed algorithm provides the highest EE performance compared to baseline methods.