Joonhyuk Kang
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
Joonhyuk Kang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Jongsub Cha
School of Engineering, Information and Communications University, 103-6 Munji-dong Yuseong-gu Daejeon, 305-732, Korea
4 shared publications - Keonkook Lee
School of Engineering, Information and Communications University, 103-6 Munji-dong Yuseong-gu Daejeon, 305-732, Korea
2 shared publications - Namseok Chang
Information and Communications University, 103-6, Munji-dong, Yuseong-gu, Daejeon, 705-732, Korea
2 shared publications - Sujin Kim
School of Engineering, Information and Communications University, 103-6 Munji-dong Yuseong-gu Daejeon, 305-732, Korea.
2 shared publications - Gon-Woo Kim
Korea Institute of Industrial Technology
1 shared publication - Gyetae Gil
R&D Group, Korea Telecom, Daejeon 305-811, Korea. Tel: 82-42-870-8193
1 shared publication
Latest Publications
- 1 January 2008
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 41 (2) , 1675-1678
High Accurate Two-Dimensional Geo-Location System for Social Safety Robot
- 1 January 2008
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 41 (2) , 1675-1678
High Accurate Two-Dimensional Geo-Location System for Social Safety Robot
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-5
Low Complexity Iterative Sequential Detection Algorithm for V-BLAST Systems
In this paper, we propose a computationally efficient iterative sequential detection algorithm that can achieve near-ML performance for V-BLAST systems. To reduce the receiver's efforts as much as possible while achieving the average bit error rate as small as possible, the proposed algorithm employs four essential ideas: i) adaptive number of iterative tree searching, ii) two early termination techniques, iii) branch metric calculation with limited constellation points, and iv) variable stack extension. More specifically, we first establish an M-ary tree structure using QR decomposition of the channel matrix. To make an iterative tree searching-friendly form, the full depth of this tree structure is then divided into the first tree depth and the remaining depths. Then, the algorithm generates an ordered list of candidate symbols at tree depth of one. It proceeds to iteratively search the remaining symbols followed by each candidate symbol at second-to-last depth, until it finds an optimal sequence. The proposed scheme features a very low receiver complexity and efficient storage usage. Its advantage stems from the well designed iterative tree searching based on the aforementioned ideas. Simulation results demonstrate that the proposed algorithm provides the near-ML performance with significant saving in complexity and storage.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-5
Low Complexity Iterative Sequential Detection Algorithm for V-BLAST Systems
In this paper, we propose a computationally efficient iterative sequential detection algorithm that can achieve near-ML performance for V-BLAST systems. To reduce the receiver's efforts as much as possible while achieving the average bit error rate as small as possible, the proposed algorithm employs four essential ideas: i) adaptive number of iterative tree searching, ii) two early termination techniques, iii) branch metric calculation with limited constellation points, and iv) variable stack extension. More specifically, we first establish an M-ary tree structure using QR decomposition of the channel matrix. To make an iterative tree searching-friendly form, the full depth of this tree structure is then divided into the first tree depth and the remaining depths. Then, the algorithm generates an ordered list of candidate symbols at tree depth of one. It proceeds to iteratively search the remaining symbols followed by each candidate symbol at second-to-last depth, until it finds an optimal sequence. The proposed scheme features a very low receiver complexity and efficient storage usage. Its advantage stems from the well designed iterative tree searching based on the aforementioned ideas. Simulation results demonstrate that the proposed algorithm provides the near-ML performance with significant saving in complexity and storage.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-6
Orthogonal Impulse Postfix OFDM Transmission for Efficient MIMO Channel Estimation
The estimation of channel state information in MIMO-OFDM systems is considered as a significant issue. In the conventional MIMO-OFDM systems, time divided or orthogonal pilot patterns are adopted to estimate the MIMO channel coefficients. However, the performance of the estimation sometimes becomes insufficient to make the full use of the MIMO benefits, especially under a fast varying channel environment. In the previous literature, we proposed a novel type of SISO-OFDM system, denoted as Impulse Postfix OFDM (IP-OFDM), which inherently posses a superior channel estimation performance. Our objective of this paper is to extend our IP-OFDM to MIMO case to resolve aforementioned channel estimation problem. The IP-OFDM scheme is characterized by the impulse postfix inserted in the guard interval with zero-padding. For the extension to MIMO, we propose to use orthogonal wave shapes as the impulse-postfix for each transmit antenna. These orthogonal shapes, stored at the receiver, are correlated to produce the time-domain channel response for each transmit-receive path. As the number of transmit antennas increases, the proposed scheme just needs to adopt additional orthogonal waves without the loss of data slots, which is unavoidable for the conventional pilot based scheme. Furthermore, the proposed MIMO-IP-OFDM scheme yields significantly improved bit-error-rate (BER) performance compared with the conventional pilot-aided MIMO-OFDM systems, providing the robustness against the time-frequency selectivity of the MIMO channel.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-6
Orthogonal Impulse Postfix OFDM Transmission for Efficient MIMO Channel Estimation
The estimation of channel state information in MIMO-OFDM systems is considered as a significant issue. In the conventional MIMO-OFDM systems, time divided or orthogonal pilot patterns are adopted to estimate the MIMO channel coefficients. However, the performance of the estimation sometimes becomes insufficient to make the full use of the MIMO benefits, especially under a fast varying channel environment. In the previous literature, we proposed a novel type of SISO-OFDM system, denoted as Impulse Postfix OFDM (IP-OFDM), which inherently posses a superior channel estimation performance. Our objective of this paper is to extend our IP-OFDM to MIMO case to resolve aforementioned channel estimation problem. The IP-OFDM scheme is characterized by the impulse postfix inserted in the guard interval with zero-padding. For the extension to MIMO, we propose to use orthogonal wave shapes as the impulse-postfix for each transmit antenna. These orthogonal shapes, stored at the receiver, are correlated to produce the time-domain channel response for each transmit-receive path. As the number of transmit antennas increases, the proposed scheme just needs to adopt additional orthogonal waves without the loss of data slots, which is unavoidable for the conventional pilot based scheme. Furthermore, the proposed MIMO-IP-OFDM scheme yields significantly improved bit-error-rate (BER) performance compared with the conventional pilot-aided MIMO-OFDM systems, providing the robustness against the time-frequency selectivity of the MIMO channel.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21626588,p. 905-909
Frequency Domain Equalizer Using Zero-padding for IR-UWB Systems
In this paper, we propose a zero padded single-carrier (SC) block transmission with minimum mean squared error-frequency domain equalization (MMSE-FDE) for impulse radio ultra-wideband (IR-UWB) systems. Moreover, the comparative study among the proposed scheme and the conventional one is presented. The proposed zero padded MMSE-FDE not only has the favorable advantages of the existing cyclic prefixed SC-FDE, but it also overcome the power loss due to the usage of the cyclic prefix. The validity of the proposed algorithm is demonstrated by simulation results with relevant discussions.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21626588,p. 905-909
Frequency Domain Equalizer Using Zero-padding for IR-UWB Systems
In this paper, we propose a zero padded single-carrier (SC) block transmission with minimum mean squared error-frequency domain equalization (MMSE-FDE) for impulse radio ultra-wideband (IR-UWB) systems. Moreover, the comparative study among the proposed scheme and the conventional one is presented. The proposed zero padded MMSE-FDE not only has the favorable advantages of the existing cyclic prefixed SC-FDE, but it also overcome the power loss due to the usage of the cyclic prefix. The validity of the proposed algorithm is demonstrated by simulation results with relevant discussions.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Reduced Complexity Stack-Based Limited Tree Searching Algorithm for V-BLAST Systems
The vertical Bell Labs layered space-time (V-BLAST) architecture is considered as an efficient technology for achieving high spectral efficiency in a rich-scattering environment. In this paper, we propose a computationally efficient near-optimal detection algorithm for V-BLAST systems. The proposed scheme employs QR decomposition (QRD) of the channel matrix and stack-based limited tree searching method. To reduce computational complexity, especially in low SNRs, the number of branches required for the extension of the tree structure is conditionally chosen according to the channel condition and SNR. The new algorithm requires a fraction of an effort to achieve a near-optimal performance in comparison with other near-optimal detection schemes
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Reduced Complexity Stack-Based Limited Tree Searching Algorithm for V-BLAST Systems
The vertical Bell Labs layered space-time (V-BLAST) architecture is considered as an efficient technology for achieving high spectral efficiency in a rich-scattering environment. In this paper, we propose a computationally efficient near-optimal detection algorithm for V-BLAST systems. The proposed scheme employs QR decomposition (QRD) of the channel matrix and stack-based limited tree searching method. To reduce computational complexity, especially in low SNRs, the number of branches required for the extension of the tree structure is conditionally chosen according to the channel condition and SNR. The new algorithm requires a fraction of an effort to achieve a near-optimal performance in comparison with other near-optimal detection schemes
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Impulse Symbol Based Channel Estimation in OFDM Systems
In real wireless environments, perfect channel state information is not available at the receiver. Thus, to obtain an accurate channel information, channel estimation is an important issue in the wireless communication systems. In general, pilot symbols are used to obtain channel information. In this paper, we propose a channel estimation technique exploiting impulse symbol for OFDM systems. Our proposed technique estimates the channel impulse response directly at the receiver in time-frequency-selective fading channels and yields better bit error rate (BER) performance than existing channel estimation methods
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Impulse Symbol Based Channel Estimation in OFDM Systems
In real wireless environments, perfect channel state information is not available at the receiver. Thus, to obtain an accurate channel information, channel estimation is an important issue in the wireless communication systems. In general, pilot symbols are used to obtain channel information. In this paper, we propose a channel estimation technique exploiting impulse symbol for OFDM systems. Our proposed technique estimates the channel impulse response directly at the receiver in time-frequency-selective fading channels and yields better bit error rate (BER) performance than existing channel estimation methods
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Fano-Based Iterative Sequential Detection Algorithm for Double-Sttd System
This paper presents iterative sequential detection (ISD) scheme using the modified Fano algorithm (MFA) for a double-STTD system. The proposed scheme can be decomposed into three interrelated steps to overcome the limitation of sequential detection for MIMO systems, which are preprocessing, iterative tree searching, and optimal decision. At the first step, preprocessing is performed to decide the number of iterations and to enumerate the candidate symbols. Then, the tree searching step is followed, where a modified version of Fano algorithm is performed to find the candidate symbol sequences. Finally, the optimal sequence is selected among the candidate sequences. In particular, the variable number of candidate symbols determined in the first and second steps plays an important role of reducing the receiver complexity significantly. Simulation results show that the proposed algorithm has a significant reduction in complexity with a small performance degradation
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Fano-Based Iterative Sequential Detection Algorithm for Double-Sttd System
This paper presents iterative sequential detection (ISD) scheme using the modified Fano algorithm (MFA) for a double-STTD system. The proposed scheme can be decomposed into three interrelated steps to overcome the limitation of sequential detection for MIMO systems, which are preprocessing, iterative tree searching, and optimal decision. At the first step, preprocessing is performed to decide the number of iterations and to enumerate the candidate symbols. Then, the tree searching step is followed, where a modified version of Fano algorithm is performed to find the candidate symbol sequences. Finally, the optimal sequence is selected among the candidate sequences. In particular, the variable number of candidate symbols determined in the first and second steps plays an important role of reducing the receiver complexity significantly. Simulation results show that the proposed algorithm has a significant reduction in complexity with a small performance degradation