Sung-Joon Jang

Mr. Sung-Joon Jang

orcid

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
20 January 2023 in Sensors
Verified
Journal Article
Open access
PDF file
KKkyungho kim
kyungho kim
SJSung-Joon Jang
Sung-Joon Jang
JPJonghee Park
Jonghee Park
ELEUNCHONG LEE
EUNCHONG LEE
SLSang-Seol Lee
Sang-Seol Lee
Tiny machine learning (TinyML) has become an emerging field according to the rapid growth in the area of the internet of things (IoT). However, most deep learning algorithms are too complex, require a lot of memory to store data, and consume an enormous amount of energy for calculation/data movement; therefore, the algorithms are not suitable for IoT devices such as various sensors and imaging systems. Furthermore, typical hardware accelerators cannot be embedded in these resource-constrained edge devices, and they are difficult to drive real-time inference processing as well. To perform the real-time processing on these battery-operated devices, deep learning models should be compact and hardware-optimized, and hardware accelerator designs also have to be lightweight and consume extremely low energy. Therefore, we present an optimized network model through model simplification and compression for the hardware to be implemented, and propose a hardware architecture for a lightweight and energy-efficient deep learning accelerator. The experimental results demonstrate that our optimized model successfully performs object detection, and the proposed hardware design achieves 1.25× and 4.27× smaller logic and BRAM size, respectively, and its energy consumption is approximately 10.37× lower than previous similar works with 43.95 fps as a real-time process under an operating frequency of 100 MHz on a Xilinx ZC702 FPGA.

22 December 2023 in IEEE Journal of Solid-State Circuits
Verified
Journal Article
Closed access
SSSadhana Shanmuga Sundaram
Sadhana Shanmuga Sundaram
YKYugandhar Khodke
Yugandhar Khodke
YLYidong Li
Yidong Li
SJSung-Joon Jang
Sung-Joon Jang
SLSang-Seol Lee
Sang-Seol Lee
MKMingu Kang
Mingu Kang
A high degree of sparsity in machine learning (ML) models has been highlighted as a significant opportunity to improve energy and delay efficiencies by skipping the computation of zero elements in operands. Despite the potential, its unstructured positions of zeros and a wide range of sparsity make it challenging to exploit this nature in hardware implementations that are often built on regular structures. To address these challenges, this article presents a low-power and high-performance AI accelerator, the so-called FreFlex, via sparsity-adaptive dynamic frequency modulation (SA-DFM) conjointly with the proposed processing element (PE) in a 2-D systolic array. The sparsity of each layer is determined by counting zero elements from the output while the layer is being computed. Then, the clock frequency is optimally modulated based on the sparsity level obtained from the previous layer’s output, which becomes an input of the next layer. The unused power slack due to the sparsity is exploited to boost performance while fully using the power budget. The proposed technique achieves up to 1.8 $\times $ performance improvement by exploiting the sparsity while incurring less than 7% power overhead, even when there is no sparsity. The silicon prototype, fabricated in a 65-nm CMOS node, demonstrates 0.6–1.0-TOPS/W efficiency for convolution and attention computations, with a performance of 160 GOPS/s/mm2 with a maximum frequency of 1.1 GHz.

21 August 2020 in Sensors
Verified
Journal Article
Open access
PDF file
SJSung-Joon Jang
Sung-Joon Jang
Youngbae HwangYoungbae Hwang
Youngbae Hwang
The range kernel of bilateral filter degrades image quality unintentionally in real environments because the pixel intensity varies randomly due to the noise that is generated in image sensors. Furthermore, the range kernel increases the complexity due to the comparisons with neighboring pixels and the multiplications with the corresponding weights. In this paper, we propose a noise-aware range kernel, which estimates noise using an intensity difference-based image noise model and dynamically adjusts weights according to the estimated noise, in order to alleviate the quality degradation of bilateral filters by noise. In addition, to significantly reduce the complexity, an approximation scheme is introduced, which converts the proposed noise-aware range kernel into a binary kernel while using the statistical hypothesis test method. Finally, blue a fully parallelized and pipelined very-large-scale integration (VLSI) architecture of a noise-aware bilateral filter (NABF) that is based on the proposed binary range kernel is presented, which was successfully implemented in field-programmable gate array (FPGA). The experimental results show that the proposed NABF is more robust to noise than the conventional bilateral filter under various noise conditions. Furthermore, the proposed VLSI design of the NABF achieves 10.5 and 95.7 times higher throughput and uses 63.6–97.5% less internal memory than state-of-the-art bilateral filter designs.

1 July 2014 in Electronics Letters
Verified
Journal Article
Open access
PDF file
SLSang‐Seol Lee
Sang‐Seol Lee
SJSung-Joon Jang
Sung-Joon Jang
JKJungho Kim
Jungho Kim
YHYoungbae Hwang
Youngbae Hwang
BCByeongho Choi
Byeongho Choi
Among the image features for object recognition, speeded up robust features (SURF) have been widely implemented due to their hardware‐friendly characteristics and high accuracy. However, because of adopting a fully internal memory‐based architecture and a field programmable gate array having large memories for a high performance, most of them are infeasible to the application specific integrated chip (ASIC). A memory‐efficient architecture for implementing SURF in ASIC by analysing the characteristics of memory accesses of SURF is presented. In addition, a strategy of dividing an entire image into multiple sub‐images, processing them sequentially and overlapping each other to reduce the size of the internal memory while minimising the loss of information is proposed. The proposed architecture was implemented with 767 kb‐sized internal memories and 1.2 M logic gates while processing 60 frames per second.

20 April 2020 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
SJSung-Joon Jang
Sung-Joon Jang
CKChong-Min Kyung
Chong-Min Kyung
Most very-large-scale integration (VLSI) designs of the global optical flow method focus on reducing external memory accesses due to global and iterative processes for low-power operation in mobile systems. However, to achieve this goal, considerable amounts of resources are used and the throughput is decreased. To address these issues, we propose a multirow-based propagation approach and an efficient VLSI architecture. This approach divides an image into multiple small subimages. The flow of each subimage is then estimated sequentially using a small amount of internal memory without accessing any external memory. To avoid discontinuity artifacts stemming from the boundaries of the subimages, boundary conditions are imposed based on the smoothness of the optical flow. In addition, the main equations of the global optical flow method are simplified to boost the processing speed. The experimental results demonstrate that the external memory bandwidth is reduced by 96.7% with negligible accuracy degradation. Furthermore, the proposed design uses 63.4%-98% less internal memory and achieves 1.9x-18.8x higher throughput-per-watt compared to state-of-the-art designs of the global optical flow method.

18 March 2024 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
DYDonghyeon Yi
Donghyeon Yi
SLSeoyoung Lee
Seoyoung Lee
ICInjun Choi
Injun Choi
GYGichan Yun
Gichan Yun
ECEdward Jongyoon Choi
Edward Jongyoon Choi
MJMinkyu Je
Minkyu Je
In analog-mixed-signal (AMS) compute-in-memory (CIM) systems, the two’s-complement (2SC) format provides better area efficiency than the sign-and-magnitude (SNM) one. However, the 2SC format exacerbates the challenges of AMS-CIM systems, suffering from significant DNN accuracy drop under process variations and high computation currents from activating multiple WLs. In the 2SC format‘, 0’ and ‘1’ are nearly balanced for all logical-order bits, unlike ‘0’-skewed higher-order bits in the SNM format. Consequently, the 2SC-based AMS-CIM systems have much more on-cells than the SNM-based counterpart, deteriorating the above challenges. We propose Skew-CIM, a software-hardware co-design technique to relax these challenges. Our proposed weight skewing (WESK) breaks the ‘0’ and ‘1’ balance at the software level. The potential accuracy drops resulting from WESK are successfully compensated by retraining DNNs. The offsets caused by WESK can be easily corrected using online hardware-level processing. Our Skew-CIM technique can be applied to most AMS-CIM systems with memories showing large on-off cell current ratios. As an example, we use it in a custom-designed 8T-SRAM-based CIM device, demonstrating a significant reduction in the DNN classification error by 7.6 times compared to the 2SC-based AMS-CIM without our Skew-CIM technique. Furthermore, our Skew-CIM markedly enhances energy efficiency by up to 39.9%, outperforming conventional SNM-based AMS-CIM systems.