Sujin Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sujin Kim has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Joonhyuk Kang
School of Engineering, Information and Communications University, 119 Munjiro, Yuseong-gu, Dajeon, 305-732, Korea
2 shared publications - Gon-Woo Kim
Korea Institute of Industrial Technology
1 shared publication - Jeahwan Kim1 shared publication
- Jongsub Cha
School of Engineering, Information and Communications University, 103-6 Munji-dong Yuseong-gu Daejeon, 305-732, Korea
1 shared publication - Kyung-Tae Nam
Department of Electronic Engineering, Sungkyunkwan Univerity, Suwon 440-746, Korea
1 shared publication - Sang Moo Lee
Korea Institute of Industrial Technology
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.