Inseon Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Inseon Kim has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hong-Yeop Song
Department of Electrical and Electronic Engineering, Yonsei University, Seoul 03722, Republic of Korea
4 shared publications Gangsan Kim
Yonsei University
1 shared publicationJung-Hyun Kim
Yonsei University
1 shared publication- Tetsuya Kojima
Department of Computer Science, National Institute of Technology, Tokyo College
1 shared publication
Latest Publications
- Open Access
- 4 June 2022
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 58 (15) , 582-584
A construction for girth‐8 QC‐LDPC codes using Golomb rulers
In this paper, an algebraic construction of regular QC‐LDPC codes by using the modular multiplication table mod P and Golomb rulers are proposed. It is proved that the proposed QC‐LDPC codes based on a Golomb ruler of length L have girth at least 8 if . The error performance of the proposed QC‐LDPC codes are simulated with various Golomb rulers. The proposed codes of length around 300 from the optimal 6‐mark Golomb ruler have an additional coding gain of at least 0.1 dB over 5G NR LDPC codes, 0.5 dB over those given earlier by others, both at FER 10 −3 . Some non‐trivial techniques to increase the length of a given Golomb ruler with and without an additional mark for improving the performance of the codes from Golomb rulers up to 0.7 dB are also found.
- 4 June 2022
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 58 (15) , 582-584
Open AccessA construction for girth‐8 QC‐LDPC codes using Golomb rulers
In this paper, an algebraic construction of regular QC‐LDPC codes by using the modular multiplication table mod P and Golomb rulers are proposed. It is proved that the proposed QC‐LDPC codes based on a Golomb ruler of length L have girth at least 8 if . The error performance of the proposed QC‐LDPC codes are simulated with various Golomb rulers. The proposed codes of length around 300 from the optimal 6‐mark Golomb ruler have an additional coding gain of at least 0.1 dB over 5G NR LDPC codes, 0.5 dB over those given earlier by others, both at FER 10 −3 . Some non‐trivial techniques to increase the length of a given Golomb ruler with and without an additional mark for improving the performance of the codes from Golomb rulers up to 0.7 dB are also found.
- 14 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (6) , 1211-1215
Some Short-Length Girth-8 QC-LDPC Codes From Primes of the Form t 2 + 1
We propose a simple algebraic construction for girth-8 regular QC-LDPC codes of short lengths, a few hundreds, based on the square matrix from some prime integers of the form $t^{2}+1=P$ and a multiplication table method. We generalize the conventional multiplication table method in a way that the size $T$ of the circular permutation matrix (CPM) can be different from the modulus $M$ in the calculation of the exponent matrix. We classify and suggest the parameters $P\leq M\leq T$ with $M=kP$ so that the resulting codes have girth 8. In particular, we prove the existence of a threshold $T_{0}$ so that the resulting code will always have girth 8 if $T > T_{0}$ is used, given that $M=kP$ . Finally, we present various simulation results and theoretical analysis, one of which shows that the proposed codes of length around 250 have an additional coding gain of about 0.4 dB over the 5G NR LDPC codes.
- 14 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (6) , 1211-1215
Some Short-Length Girth-8 QC-LDPC Codes From Primes of the Form t 2 + 1
We propose a simple algebraic construction for girth-8 regular QC-LDPC codes of short lengths, a few hundreds, based on the square matrix from some prime integers of the form $t^{2}+1=P$ and a multiplication table method. We generalize the conventional multiplication table method in a way that the size $T$ of the circular permutation matrix (CPM) can be different from the modulus $M$ in the calculation of the exponent matrix. We classify and suggest the parameters $P\leq M\leq T$ with $M=kP$ so that the resulting codes have girth 8. In particular, we prove the existence of a threshold $T_{0}$ so that the resulting code will always have girth 8 if $T > T_{0}$ is used, given that $M=kP$ . Finally, we present various simulation results and theoretical analysis, one of which shows that the proposed codes of length around 250 have an additional coding gain of about 0.4 dB over the 5G NR LDPC codes.
- 14 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (12) , 3780-3784
Some New Constructions of Girth-8 QC-LDPC Codes for Future GNSS
In this letter, we propose a new construction of girth-8 Quasi-Cyclic Low-Density Parity-Check codes (QC-LDPC) with various lengths for the global navigation satellite systems (GNSS). This scheme combines two steps. The first is the construction of a family of regular girth-8 QC-LDPC codes of various lengths and rates with two designed sequences. The second is the performance improvement of those from the first construction of half-rate cases using a proposed weight matrix so that the result becomes type-II QC-LDPC codes. This results in some final codes with short lengths of 600, 1200, and 1800, especially for future GNSS. We performed a simulation and confirmed that the proposed QC-LDPC codes of lengths 600 and 1200 have an additional coding gain about 0.3 dB at frame error rate 10 −5 over the LDPC codes used in the Global Positioning System.
- 14 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (12) , 3780-3784
Some New Constructions of Girth-8 QC-LDPC Codes for Future GNSS
In this letter, we propose a new construction of girth-8 Quasi-Cyclic Low-Density Parity-Check codes (QC-LDPC) with various lengths for the global navigation satellite systems (GNSS). This scheme combines two steps. The first is the construction of a family of regular girth-8 QC-LDPC codes of various lengths and rates with two designed sequences. The second is the performance improvement of those from the first construction of half-rate cases using a proposed weight matrix so that the result becomes type-II QC-LDPC codes. This results in some final codes with short lengths of 600, 1200, and 1800, especially for future GNSS. We performed a simulation and confirmed that the proposed QC-LDPC codes of lengths 600 and 1200 have an additional coding gain about 0.3 dB at frame error rate 10 −5 over the LDPC codes used in the Global Positioning System.
- 1 January 2017
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E100.A (9) , 2052-2055
Reduced-Complexity Belief Propagation Decoding for Polar Codes
- 1 January 2017
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E100.A (9) , 2052-2055
Reduced-Complexity Belief Propagation Decoding for Polar Codes