Hong-Jun Noh

Hong-Jun Noh

Auto-generated profile, based on publicly available information

Hong-Jun Noh

Department of C4I R&D Center, LIG Nex1, 333 Pangyo-ro, Bundang-gu, Seongnam-si 13488, Republic of Korea

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
28 May 2015 in Sensors
Verified
Journal Article
Open access
PDF file
KLKyuman Lee
Kyuman Lee
HNHongjun Noh
Hongjun Noh
JLJaesung Lim
Jaesung Lim
Ground-based pseudolite systems have some limitations, such as low vertical accuracy, multipath effects and near-far problems. These problems are not significant in airborne-based pseudolite systems. However, the monitoring of pseudolite positions is required because of the mobility of the platforms on which the pseudolites are mounted, and this causes performance degradation. To address these pseudolite system limitations, we propose an airborne relay-based regional positioning system that consists of a master station, reference stations, airborne relays and a user. In the proposed system, navigation signals are generated from the reference stations located on the ground and are relayed via the airborne relays. Unlike in conventional airborne-based systems, the user in the proposed system sequentially estimates both the locations of airborne relays and his/her own position. Therefore, a delay due to monitoring does not occur, and the accuracy is not affected by the movement of airborne relays. We conducted several simulations to evaluate the performance of the proposed system. Based on the simulation results, we demonstrated that the proposed system guarantees a higher accuracy than airborne-based pseudolite systems, and it is feasible despite the existence of clock offsets among reference stations.

22 January 2026 in Entropy
Verified
Journal Article
Open access
PDF file
HCHyojeong Choi
Hyojeong Choi
GKGangsan Kim
Gangsan Kim
HSHong-Yeop Song
Hong-Yeop Song
SSSangung Shin
Sangung Shin
CLChulho Lee
Chulho Lee
HNHongjun Noh
Hongjun Noh
In this paper, we first prove (Theorem 1) that any two inputs producing the same output in a symmetric pair of discrete skew tent maps always have the same parity, meaning that they are either both even or both odd. Building on this property, we then propose (Definition 1) a new discrete chaotic map and prove that (Theorem 2) the proposed map is a bijection for all control parameters. We further prove that (Theorem 3) the discrete Lyapunov exponent (dLE) of the proposed map is not only positive but also approaches the maximum value among all permutation maps over the integers {0,1,…,2m−1} as m gets larger. In other words, (Corollary 1) the proposed map asymptotically achieves the highest possible chaotic divergence among the permutation maps over the integers {0,1,…,2m−1}. To provide some further evidence that the proposed map is highly chaotic, we present at the end some results from the numerical experiments. We calculate the approximation and permutation entropy of the output integer sequences. We also show the NIST SP800-22 tests results and correlation properties of some derived binary sequences.

4 July 2025 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
HCHyojeong Choi
Hyojeong Choi
GKGangsan Kim
Gangsan Kim
HSHong-Yeop Song
Hong-Yeop Song
HNHongjun Noh
Hongjun Noh
In this brief, we investigate the chaotic characteristics of the integer sequences generated by primitive linear feedback shift registers (LFSRs) by interpreting the internal states as integers. We prove that the discrete Lyapunov exponent (dLE) of the permutations induced by these sequences from an L-stage primitive LFSR approches to the range between $\ln (\sqrt {3})$ and $\ln (2)$ as L increases indefinitely and hence the dynamic systems satisfy the definition of discrete chaos. Furthermore, the 0–1 test of the sequences yields statistics close to 1, supporting the conclusion that these sequences exhibit chaotic dynamics under both theoretical and empirical evaluations.

31 January 2017 in The Journal of Korean Institute of Communications and Information Sciences
Verified
Journal Article
Closed access
HLHyo-Young Lim
Hyo-Young Lim
WKWan-Ju Kim
Wan-Ju Kim
HNHong-Jun Noh
Hong-Jun Noh
JLJae-Sung Lim
Jae-Sung Lim

27 March 2014 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JLJong-Kwan Lee
Jong-Kwan Lee
KLKyuman Lee
Kyuman Lee
HNHong-Jun Noh
Hong-Jun Noh
JLJaesung Lim
Jaesung Lim
In this paper, we propose a novel dynamic slot-assignment scheme using artificial collisions called artificial collision-based dynamic slot assignment (AC-DSA) for multi-hop networks, which is based on the in-band control mechanism. In-band control-based networks have no exclusively reserved slots for newly arrived nodes; thus, the throughput can be improved compared with that of the out-of-band control-based networks. In in-band control based networks, a newly arrived node can use idle slots to transmit its control packet to request a slot assignment. However, if no idle slots are available, the node cannot transmit its control packet even though it has a higher priority than the existing nodes in the network, because a newly arrived node has to wait until idle slots are available in conventional schemes. To address this issue, AC-DSA uses the duration information of artificial packet collisions as a control message for slot assignment, which enables nodes with high priority to deprive a non-idle slot of nodes with low priority to guarantee quality of service requirements when no idle slots are available. We formulate an analytical model for the proposed slot-assignment scheme and compare it with the conventional one. Further, we demonstrate the feasibility and efficiency of the AC-DSA during high-traffic conditions considering the capture effect.

28 November 2014 in The Journal of Korean Institute of Communications and Information Sciences
Verified
Journal Article
Closed access
HNHong-Jun Noh
Hong-Jun Noh
YLYoon-Seong Lee
Yoon-Seong Lee
JLJae-Sung Lim
Jae-Sung Lim
HPHyung-Won Park
Hyung-Won Park
HLHo-Sub Lee
Ho-Sub Lee