Ji-Woong Jang
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
Ji-Woong Jang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Young-Sik Kim
DGIST
6 shared publications - Sang-Hyo Kim
Dept. of Electrical and Computer Engineering Sungkyunkwan University Suwon South Korea
4 shared publications - Dae-Woon Lim
Department of Chemistry and Medical Chemistry
2 shared publications - Dongsup Jin
Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 44610, Republic of Korea
2 shared publications - Young-June Choi
Department of Artificial Intelligence, Ajou University, Suwon, South Korea
2 shared publications - Dae-Woon Lim
Department of ICE, Dongguk University, Seoul 100-715, Korea
1 shared publication
Latest Publications
- Open Access
- 23 December 2025
- Published by MDPI AG in Applied Sciences
- Vol. 16 (1) , 156
Priority Based Channel Searching Sequence Allocation for Rendezvous of Cognitive Radio
This paper proposes a scheme for a cognitive radio system that differentiates user rendezvous performance based on priority. We categorize users into primary CR users (PCUs) and secondary CR users (SCUs) and assign them distinct channel searching sequences. The proposed scheme is based on the method introduced by Paul, Choi, Jang, and Kim, where PCUs utilize a p-ary m-sequence of period , and SCUs use a p-ary m-sequence of period . A key advantage of this approach is its ability to transition a legacy system, which does not consider priority, into a priority-based system simply by adding a low-priority SCU group and assigning them a dedicated channel searching sequence. Furthermore, we demonstrate the effectiveness of the proposed scheme through computer simulations that show a clear difference in rendezvous performance between PCUs and SCUs. Additionally, we verify the distinction between our scheme and methods that restrict channel allocation with primary sequence for SCUs, also through simulation.- 23 December 2025
- Published by MDPI AG in Applied Sciences
- Vol. 16 (1) , 156
Open AccessPriority Based Channel Searching Sequence Allocation for Rendezvous of Cognitive Radio
This paper proposes a scheme for a cognitive radio system that differentiates user rendezvous performance based on priority. We categorize users into primary CR users (PCUs) and secondary CR users (SCUs) and assign them distinct channel searching sequences. The proposed scheme is based on the method introduced by Paul, Choi, Jang, and Kim, where PCUs utilize a p-ary m-sequence of period , and SCUs use a p-ary m-sequence of period . A key advantage of this approach is its ability to transition a legacy system, which does not consider priority, into a priority-based system simply by adding a low-priority SCU group and assigning them a dedicated channel searching sequence. Furthermore, we demonstrate the effectiveness of the proposed scheme through computer simulations that show a clear difference in rendezvous performance between PCUs and SCUs. Additionally, we verify the distinction between our scheme and methods that restrict channel allocation with primary sequence for SCUs, also through simulation. - Open Access
Channel-Hopping Sequence and Searching Algorithm for Rendezvous of Spectrum Sensing
In this paper, we propose a method for applying the p-ary m-sequence as a channel-searching pattern for rendezvous in the asymmetric channel model of cognitive radio. We mathematically analyzed and calculated the ETTR when the m-sequence is applied to the conventional scheme, and our simulation results demonstrated that the ETTR performance is significantly better than that of the JS algorithm. Furthermore, we introduced a new channel-searching scheme that maximizes the benefits of the m-sequence and proposed a method to adapt the generation of the m-sequence for use in the newly proposed scheme. We also derived the ETTR mathematically for the new scheme with the m-sequence and showed through simulations that the performance of the new scheme with the m-sequence is superior to that of the conventional scheme with the m-sequence. Notably, when there is only one common channel, the new scheme with the m-sequence achieved approximately four times the improvement in the ETTR compared to the conventional scheme.
Open AccessChannel-Hopping Sequence and Searching Algorithm for Rendezvous of Spectrum Sensing
In this paper, we propose a method for applying the p-ary m-sequence as a channel-searching pattern for rendezvous in the asymmetric channel model of cognitive radio. We mathematically analyzed and calculated the ETTR when the m-sequence is applied to the conventional scheme, and our simulation results demonstrated that the ETTR performance is significantly better than that of the JS algorithm. Furthermore, we introduced a new channel-searching scheme that maximizes the benefits of the m-sequence and proposed a method to adapt the generation of the m-sequence for use in the newly proposed scheme. We also derived the ETTR mathematically for the new scheme with the m-sequence and showed through simulations that the performance of the new scheme with the m-sequence is superior to that of the conventional scheme with the m-sequence. Notably, when there is only one common channel, the new scheme with the m-sequence achieved approximately four times the improvement in the ETTR compared to the conventional scheme.
- Open Access
- 5 December 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (23) , 11369
Channel-Hopping Using Reinforcement Learning for Rendezvous in Asymmetric Cognitive Radio Networks
This paper addresses the rendezvous problem in asymmetric cognitive radio networks (CRNs) by proposing a novel reinforcement learning (RL)-based channel-hopping algorithm. Traditional methods like the jump-stay (JS) algorithm, while effective, often struggle with high time-to-rendezvous (TTR) in asymmetric scenarios where secondary users (SUs) have varying channel availability. Our proposed RL-based algorithm leverages the actor-critic policy gradient method to learn optimal channel selection strategies by dynamically adapting to the environment and minimizing TTR. Extensive simulations demonstrate that the RL-based algorithm significantly reduces the expected TTR (ETTR) compared to the JS algorithm, particularly in asymmetric scenarios where M-sequence-based approaches are less effective. This suggests that RL-based approaches not only offer robustness in asymmetric environments but also provide a promising alternative in more predictable settings.
- 5 December 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (23) , 11369
Open AccessChannel-Hopping Using Reinforcement Learning for Rendezvous in Asymmetric Cognitive Radio Networks
This paper addresses the rendezvous problem in asymmetric cognitive radio networks (CRNs) by proposing a novel reinforcement learning (RL)-based channel-hopping algorithm. Traditional methods like the jump-stay (JS) algorithm, while effective, often struggle with high time-to-rendezvous (TTR) in asymmetric scenarios where secondary users (SUs) have varying channel availability. Our proposed RL-based algorithm leverages the actor-critic policy gradient method to learn optimal channel selection strategies by dynamically adapting to the environment and minimizing TTR. Extensive simulations demonstrate that the RL-based algorithm significantly reduces the expected TTR (ETTR) compared to the JS algorithm, particularly in asymmetric scenarios where M-sequence-based approaches are less effective. This suggests that RL-based approaches not only offer robustness in asymmetric environments but also provide a promising alternative in more predictable settings.
- Open Access
- 15 June 2023
- Published by Elsevier in ICT Express
- Vol. 10 (1) , 53-57
Signal design and analysis for cell identification in Sub-THz OFDM systems
- 15 June 2023
- Published by Elsevier in ICT Express
- Vol. 10 (1) , 53-57
Open AccessSignal design and analysis for cell identification in Sub-THz OFDM systems
- Open Access
Channel-Hopping Sequence and Rendezvous MAC for Cognitive Radio Networks
In cognitive radio networks (CRNs), two secondary users (SUs) need to meet on a channel among multiple channels within a finite time to establish a link, which is called rendezvous. For blind rendezvous, researchers have devised ample well-grounded channel hopping (CH) sequences that guarantee smaller time-to-rendezvous. However, the best part of these works lacks the impact of network factors, particularly channel availability and collision during rendezvous. In this study, a new CH scheme is investigated by jointly considering the medium access control (MAC) protocol for single-hop multi-user CRNs. The analysis of our new variable hopping sequence (V-HS) guarantees rendezvous for the asymmetric channel model within a finite time. Although this mathematical concept guarantees rendezvous between two SUs, opportunities can be overthrown because of the unsuccessful exchange of control packets on that channel. A successful rendezvous also requires the exchange of messages reliably while two users visit the same channel. We propose a MAC protocol, namely ReMAC, that can work with V-HS and CH schemes. This design allows multiple rendezvous opportunities when a certain user visits the channel and modifies the conventional back-off strategy to maintain the channel list. Both simulation and analytical results exhibited improved performance over the previous approaches.
Open AccessChannel-Hopping Sequence and Rendezvous MAC for Cognitive Radio Networks
In cognitive radio networks (CRNs), two secondary users (SUs) need to meet on a channel among multiple channels within a finite time to establish a link, which is called rendezvous. For blind rendezvous, researchers have devised ample well-grounded channel hopping (CH) sequences that guarantee smaller time-to-rendezvous. However, the best part of these works lacks the impact of network factors, particularly channel availability and collision during rendezvous. In this study, a new CH scheme is investigated by jointly considering the medium access control (MAC) protocol for single-hop multi-user CRNs. The analysis of our new variable hopping sequence (V-HS) guarantees rendezvous for the asymmetric channel model within a finite time. Although this mathematical concept guarantees rendezvous between two SUs, opportunities can be overthrown because of the unsuccessful exchange of control packets on that channel. A successful rendezvous also requires the exchange of messages reliably while two users visit the same channel. We propose a MAC protocol, namely ReMAC, that can work with V-HS and CH schemes. This design allows multiple rendezvous opportunities when a certain user visits the channel and modifies the conventional back-off strategy to maintain the channel list. Both simulation and analytical results exhibited improved performance over the previous approaches.
- Open Access
Low Complexity List Decoding for Polar Codes with Multiple CRC Codes
Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC) codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.
Open AccessLow Complexity List Decoding for Polar Codes with Multiple CRC Codes
Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC) codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.
- 21 October 2015
- Published by Springer Nature in Cryptography and Communications
- Vol. 8 (4) , 593-604
Large low probability of intercept properties of the quaternary sequence with optimal correlation property constructed by legendre sequences
- 21 October 2015
- Published by Springer Nature in Cryptography and Communications
- Vol. 8 (4) , 593-604
Large low probability of intercept properties of the quaternary sequence with optimal correlation property constructed by legendre sequences
- Open Access
- 5 February 2010
- Published by Wiley in ETRI Journal
- Vol. 32 (1) , 93-101
Linear Corrector Overcoming Minimum Distance Limitation for Secure TRNG from (17, 9, 5) Quadratic Residue Code
- 5 February 2010
- Published by Wiley in ETRI Journal
- Vol. 32 (1) , 93-101
Open AccessLinear Corrector Overcoming Minimum Distance Limitation for Secure TRNG from (17, 9, 5) Quadratic Residue Code
- Open Access
- 1 January 2010
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 4 (1) , 61-68
New construction methods of quaternary periodic complementary sequence sets
In this paper, two new construction methods of quaternary periodic complementary sequence (PCS) sets are proposed using a binary PCS set with even period. The proposed methods apply the Gray mapping to a binary PCS set. The only necessary condition to apply the proposed methods is that the employed binary PCS set should have an even period.
- 1 January 2010
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 4 (1) , 61-68
Open AccessNew construction methods of quaternary periodic complementary sequence sets
In this paper, two new construction methods of quaternary periodic complementary sequence (PCS) sets are proposed using a binary PCS set with even period. The proposed methods apply the Gray mapping to a binary PCS set. The only necessary condition to apply the proposed methods is that the employed binary PCS set should have an even period.
- Open Access
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 3 (2) , 115-124
New design of quaternary LCZ and ZCZ sequence set from binary LCZ and ZCZ sequence set
In this paper, we suggest two construction methods of quaternary low and zero correlation zone (LCZ and ZCZ) sequence set. The new construction methods use a binary LCZ/ZCZ sequence set and the Gray mapping to produce new quaternary LCZ/ZCZ sequence sets. The parameters of the generated quaternary LCZ/ZCZ sequence set are the same as those of the employed binary LCZ/ZCZ sequence set. That means, an optimal quaternary LCZ/ZCZ sequence set can be constructed from an optimal binary LCZ/ZCZ sequence set.
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 3 (2) , 115-124
Open AccessNew design of quaternary LCZ and ZCZ sequence set from binary LCZ and ZCZ sequence set
In this paper, we suggest two construction methods of quaternary low and zero correlation zone (LCZ and ZCZ) sequence set. The new construction methods use a binary LCZ/ZCZ sequence set and the Gray mapping to produce new quaternary LCZ/ZCZ sequence sets. The parameters of the generated quaternary LCZ/ZCZ sequence set are the same as those of the employed binary LCZ/ZCZ sequence set. That means, an optimal quaternary LCZ/ZCZ sequence set can be constructed from an optimal binary LCZ/ZCZ sequence set.