Ji-Woong Jang

Dr. Ji-Woong Jang

Ulsan College, Ulsan, Republic of Korea
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 April 2017 in Entropy
Verified
Journal Article
Open access
PDF file
JKJong-Hwan Kim
Jong-Hwan Kim
SKSang-Hyo Kim
Sang-Hyo Kim
Ji-Woong JangJi-Woong Jang
Ji-Woong Jang
YKYoung-Sik Kim
Young-Sik Kim
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.

1 January 2010 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
Ji-Woong JangJi-Woong Jang
Ji-Woong Jang
YKYoung-Sik Kim
Young-Sik Kim
SKSang-Hyo Kim
Sang-Hyo Kim
DLDae-Woon Lim
Dae-Woon Lim
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 2009 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
Ji-Woong JangJi-Woong Jang
Ji-Woong Jang
YKYoung-Sik Kim
Young-Sik Kim
SKSang-Hyo Kim
Sang-Hyo Kim
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.

9 August 2022 in Sensors
Verified
Journal Article
Open access
PDF file
RPRajib Paul
Rajib Paul
Ji-Woong JangJi-Woong Jang
Ji-Woong Jang
YCYoung-June Choi
Young-June Choi
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.

5 February 2010 in ETRI Journal
Verified
Journal Article
Open access
PDF file
YKYoung-Sik Kim
Young-Sik Kim
Ji-Woong JangJi-Woong Jang
Ji-Woong Jang
DLDae-Woon Lim
Dae-Woon Lim
A true random number generator (TRNG) is widely used to generate secure random numbers for encryption, digital signatures, authentication, and so on in crypto-systems. Since TRNG is vulnerable to environmental changes, a deterministic function is normally used to reduce bias and improve the statistical properties of the TRNG output. In this paper, we propose a linear corrector for secure TRNG. The performance of a linear corrector is bounded by the minimum distance of the corresponding linear error correcting code. However, we show that it is possible to construct a linear corrector overcoming the minimum distance limitation. The proposed linear corrector shows better performance in terms of removing bias in that it can enlarge the acceptable bias range of the raw TRNG output. Moreover, it is possible to efficiently implement this linear corrector using only XOR gates, which must have a suitable hardware size for embedded security systems.