Heunchul Lee
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
Heunchul Lee has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Inkyu Lee
Korea University
6 shared publications Seokhwan Park
School of Electrical Engineering, Korea University, Seoul 136-701, Korea
3 shared publications- Byeongsi Lee
School of Electrical Engineering, Korea University, Seoul, Korea
1 shared publication - Jongkyu Kim
School of Electrical Engineering, Korea University, Seoul, Korea
1 shared publication - Jungho Cho
School of Electrical Engineering, Korea University, Seoul, Korea
1 shared publication - Seokhwan Park
School of Electrical Eng., Korea University, Seoul, Korea
1 shared publication
Latest Publications
- 2 May 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 8 (4) , 2067-2075
Transmit beamforming method based on maximum-norm combining for MIMO systems
In this paper, we present a low-complexity method to generate a transmit beamforming vector for multiple-input-multiple-output (MIMO) systems. We begin by introducing new definitions regarding orthogonality between two complex valued vectors and then present new expressions of complex rotation matrices for the complex vector orthogonalization. The rotation matrices are utilized to derive the weight vector for the maximum-norm combining (MNC) process of two complex vectors, which provides a constructive basis for a new beamforming method. The proposed transmit beamforming method uses successive column combining of MIMO channel matrices based on MNC, and as a result, an approximate solution to the optimum beamforming vector is obtained. The proposed method offers a good tradeoff between complexity and performance. Simulation results demonstrate that the proposed beamforming method achieves the near-optimal performance with much reduced computational complexity, compared to the optimal beamforming scheme using singular-value decomposition (SVD) of the channel matrix.
- 2 May 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 8 (4) , 2067-2075
Transmit beamforming method based on maximum-norm combining for MIMO systems
In this paper, we present a low-complexity method to generate a transmit beamforming vector for multiple-input-multiple-output (MIMO) systems. We begin by introducing new definitions regarding orthogonality between two complex valued vectors and then present new expressions of complex rotation matrices for the complex vector orthogonalization. The rotation matrices are utilized to derive the weight vector for the maximum-norm combining (MNC) process of two complex vectors, which provides a constructive basis for a new beamforming method. The proposed transmit beamforming method uses successive column combining of MIMO channel matrices based on MNC, and as a result, an approximate solution to the optimum beamforming vector is obtained. The proposed method offers a good tradeoff between complexity and performance. Simulation results demonstrate that the proposed beamforming method achieves the near-optimal performance with much reduced computational complexity, compared to the optimal beamforming scheme using singular-value decomposition (SVD) of the channel matrix.
- 10 March 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 57 (3) , 861-870
A new two-step precoding strategy for closed-loop MIMO systems
In this paper, we present a new precoding technique using rotation transformations for closed loop multiple-input multiple-output (MIMO) wireless systems, which does not require the singular value decomposition (SVD) operation of the channel transfer matrix and allows a simple maximum-likelihood (ML) decoding at the receiver. We divide the precoding process into two steps: orthogonalization transformation which induces orthogonality between transmitted signals and beamforming transformation which achieves diversity gain. In the proposed method, we utilize a design criterion based on the minimum Euclidean distance between the received signals and then the vector orthogonalization is connected to the vector-norm maximization. In this paper, we focus on spatial multiplexing systems transmitting two independent data streams. Compared with the SVD based schemes, the proposed approach maintains a low complexity by relying only on three different kinds of rotation matrices for both the orthogonalization and beamforming transformation. Simulation results confirm that the proposed two step precoding achieves the better performance than the conventional SVD based MIMO precodings with reduced complexity.
- 10 March 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 57 (3) , 861-870
A new two-step precoding strategy for closed-loop MIMO systems
In this paper, we present a new precoding technique using rotation transformations for closed loop multiple-input multiple-output (MIMO) wireless systems, which does not require the singular value decomposition (SVD) operation of the channel transfer matrix and allows a simple maximum-likelihood (ML) decoding at the receiver. We divide the precoding process into two steps: orthogonalization transformation which induces orthogonality between transmitted signals and beamforming transformation which achieves diversity gain. In the proposed method, we utilize a design criterion based on the minimum Euclidean distance between the received signals and then the vector orthogonalization is connected to the vector-norm maximization. In this paper, we focus on spatial multiplexing systems transmitting two independent data streams. Compared with the SVD based schemes, the proposed approach maintains a low complexity by relying only on three different kinds of rotation matrices for both the orthogonalization and beamforming transformation. Simulation results confirm that the proposed two step precoding achieves the better performance than the conventional SVD based MIMO precodings with reduced complexity.
- 10 October 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 26 (8) , 1556-1566
Optimal precoding for orthogonalized spatial multiplexing in closed-loop MIMO systems
In this paper, we propose a new precoding algorithm for orthogonalized spatial multiplexing (OSM) systems over flat-fading multiple-input multiple-output (MIMO) channels. The OSM scheme was recently introduced for closed-loop MIMO systems which allows single symbol decodable maximum likelihood detection. To further improve the performance of the OSM system, we propose a new precoding method by maximizing the minimum Euclidean distance between constellation points in the effective channel. In order to efficiently identify the parameters of a precoder which maximizes the minimum distance, we introduce a partitioning approach. Through analysis, it is shown that one real value parameter and two bits are required for feedback information for precoding in 16-QAM systems. Simulation results demonstrate that our algorithm provides 9 dB and 7.5 dB gains at a bit error rate (BER) of 10-4 over the conventional OSM systems for 4-QAM and 16-QAM, respectively. We also confirm that the performance of the proposed scheme is the same as that of the optimum closed-loop MIMO systems in terms of the minimum distance. Consequently, our precoding algorithm significantly improves the system performance with a small increase of feedback amount.
- 10 October 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 26 (8) , 1556-1566
Optimal precoding for orthogonalized spatial multiplexing in closed-loop MIMO systems
In this paper, we propose a new precoding algorithm for orthogonalized spatial multiplexing (OSM) systems over flat-fading multiple-input multiple-output (MIMO) channels. The OSM scheme was recently introduced for closed-loop MIMO systems which allows single symbol decodable maximum likelihood detection. To further improve the performance of the OSM system, we propose a new precoding method by maximizing the minimum Euclidean distance between constellation points in the effective channel. In order to efficiently identify the parameters of a precoder which maximizes the minimum distance, we introduce a partitioning approach. Through analysis, it is shown that one real value parameter and two bits are required for feedback information for precoding in 16-QAM systems. Simulation results demonstrate that our algorithm provides 9 dB and 7.5 dB gains at a bit error rate (BER) of 10-4 over the conventional OSM systems for 4-QAM and 16-QAM, respectively. We also confirm that the performance of the proposed scheme is the same as that of the optimum closed-loop MIMO systems in terms of the minimum distance. Consequently, our precoding algorithm significantly improves the system performance with a small increase of feedback amount.
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Pseudo-Orthogonal Space-Time Block Codes for MIMO-OFDM Systems over Frequency-Selective Channels
This paper proposes a new class of space-time block code, which is manipulated from the existing transmit diversity schemes. We analyze the performance and the receiver complexity of the proposed scheme and confirm that the new diversity scheme can yield performance gain over other existing four-transmit antenna cases. By relaxing the diversity criterion on code designs, the proposed space-time code provides a full transmission rate for four-transmit antennas and makes it possible to approach the open-loop Shannon channel capacity. Outage capacity and simulation results are used to show that substantial improvements in performance while maintaining a simple linear processing receiver structure are obtained in frequency selective channels
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Pseudo-Orthogonal Space-Time Block Codes for MIMO-OFDM Systems over Frequency-Selective Channels
This paper proposes a new class of space-time block code, which is manipulated from the existing transmit diversity schemes. We analyze the performance and the receiver complexity of the proposed scheme and confirm that the new diversity scheme can yield performance gain over other existing four-transmit antenna cases. By relaxing the diversity criterion on code designs, the proposed space-time code provides a full transmission rate for four-transmit antennas and makes it possible to approach the open-loop Shannon channel capacity. Outage capacity and simulation results are used to show that substantial improvements in performance while maintaining a simple linear processing receiver structure are obtained in frequency selective channels
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 5558-5563
An Efficient Decoding Algorithm for STBC with Multi-dimensional Rotated Constellations
In this paper, we present a novel maximum likelihood (ML) decoding algorithm for space-time block codes (STBC) over fading channels. Using a lattice representation for space-time codes by transforming complex channel models into real matrix equations, we propose a new efficient ML decoding algorithm with performance identical to the conventional ML decoder. We show that the complex orthogonal space-time codes, in fact, allow a separate ML decoding for each inphase and quadrature-phase component. For rate one quasiorthogonal designs with N transmit antennas (N > 4), the proposed decoding scheme reduces the decoding complexity from O(McN/2) to O(McN/4) in a Mc-QAM constellation. Moreover, multidimensional rotated constellations are constructed by which the quasi-orthogonal codes can achieve full diversity, while the proposed ML decoding method offers significant computational savings as compared with previous approaches.
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 5558-5563
An Efficient Decoding Algorithm for STBC with Multi-dimensional Rotated Constellations
In this paper, we present a novel maximum likelihood (ML) decoding algorithm for space-time block codes (STBC) over fading channels. Using a lattice representation for space-time codes by transforming complex channel models into real matrix equations, we propose a new efficient ML decoding algorithm with performance identical to the conventional ML decoder. We show that the complex orthogonal space-time codes, in fact, allow a separate ML decoding for each inphase and quadrature-phase component. For rate one quasiorthogonal designs with N transmit antennas (N > 4), the proposed decoding scheme reduces the decoding complexity from O(McN/2) to O(McN/4) in a Mc-QAM constellation. Moreover, multidimensional rotated constellations are constructed by which the quasi-orthogonal codes can achieve full diversity, while the proposed ML decoding method offers significant computational savings as compared with previous approaches.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12 (15503607) , 5377-5382
Iterative Detection and Decoding with an Improved V-BLAST for MIMO-OFDM systems
This paper proposes an improved vertical Bell Labs Layered Space-Time (V-BLAST) with iterative detection and decoding (IDD) scheme for coded layered space-time architectures in MIMO-OFDM systems. For the iterative process, a low-complexity demapper is developed by making use of both nonlinear interference cancellation and linear filtering. Also a simple cancellation method based on hard decision is presented to reduce the overall complexity. Simulation results demonstrate that the proposed V-BLAST with IDD scheme offers the performance close to the optimal turbo-MIMO approach, while providing tremendous savings in computational complexity.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12 (15503607) , 5377-5382
Iterative Detection and Decoding with an Improved V-BLAST for MIMO-OFDM systems
This paper proposes an improved vertical Bell Labs Layered Space-Time (V-BLAST) with iterative detection and decoding (IDD) scheme for coded layered space-time architectures in MIMO-OFDM systems. For the iterative process, a low-complexity demapper is developed by making use of both nonlinear interference cancellation and linear filtering. Also a simple cancellation method based on hard decision is presented to reduce the overall complexity. Simulation results demonstrate that the proposed V-BLAST with IDD scheme offers the performance close to the optimal turbo-MIMO approach, while providing tremendous savings in computational complexity.