Kyu Hyun Choi
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
Kyu Hyun Choi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Seon Wook Kim
Korea University, Seongbuk-Gu, Seoul, Republic of Korea
2 shared publications - Byung-Soo Kim
Korea Electronics Technology Institute, Seongnam-si, Republic of Korea
1 shared publication - HoKwon Kim
CASC, Department of Materials, Imperial College London, London SW7 2AZ, UK
1 shared publication - Jae Hyung Ko
Korea Electronics Technology Institute, Seongnam, Gyeonggi-do, Republic of Korea
1 shared publication JaeYung Jun
School of Electrical Engineering, Korea University
1 shared publication- Jaeyung Jun
Korea University, Seoul, Korea
1 shared publication
Latest Publications
- Open Access
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 196040-196049
A Compute-in-Memory Decoding Architecture for Posit-to-Floating-Point Conversion
Modern computing systems are increasingly adopting low-precision floating-point formats to reduce memory overhead, particularly in large-scale applications such as large language models and scientific computing. Low-precision formats, however, are vulnerable to reduced numerical accuracy and provide only a limited dynamic range. The posit format, which incorporates a variable-length regime structure, has gained attention for providing higher precision and a broader dynamic range compared to conventional low-precision floating-point representations. Despite such advantages, conventional computing architectures are still based on IEEE 754 floating-point arithmetic, where achieving parallel and efficient posit-to-floating-point decoding remains a significant challenge. This paper proposes a Compute-in-Memory (CIM) architecture for posit-to-floating-point conversion that leverages the inherent parallelism of memory arrays to perform concurrent conversion of multiple posit values in a fixed number of cycles with negligible hardware overhead. The architecture implements key modules for posit decoding through bitwise in-memory logic operations, extending the state-of-the-art PIM microarchitecture to enable a wider range of micro-operations. Experimental results based on RRAM crossbar simulation demonstrate an average improvements of 3.3× and 5.04× in throughput and energy efficiency, respectively, compared to a baseline CMOS decoding architecture.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 196040-196049
Open AccessA Compute-in-Memory Decoding Architecture for Posit-to-Floating-Point Conversion
Modern computing systems are increasingly adopting low-precision floating-point formats to reduce memory overhead, particularly in large-scale applications such as large language models and scientific computing. Low-precision formats, however, are vulnerable to reduced numerical accuracy and provide only a limited dynamic range. The posit format, which incorporates a variable-length regime structure, has gained attention for providing higher precision and a broader dynamic range compared to conventional low-precision floating-point representations. Despite such advantages, conventional computing architectures are still based on IEEE 754 floating-point arithmetic, where achieving parallel and efficient posit-to-floating-point decoding remains a significant challenge. This paper proposes a Compute-in-Memory (CIM) architecture for posit-to-floating-point conversion that leverages the inherent parallelism of memory arrays to perform concurrent conversion of multiple posit values in a fixed number of cycles with negligible hardware overhead. The architecture implements key modules for posit decoding through bitwise in-memory logic operations, extending the state-of-the-art PIM microarchitecture to enable a wider range of micro-operations. Experimental results based on RRAM crossbar simulation demonstrate an average improvements of 3.3× and 5.04× in throughput and energy efficiency, respectively, compared to a baseline CMOS decoding architecture.
- Open Access
- 10 July 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 24 (5) , 1-31
Reducing DRAM Refresh Rate Using Retention Time Aware Universal Hashing Redundancy Repair
As the device capacity of Dynamic Random Access Memory (DRAM) increases, refresh operation becomes a significant contributory factor toward total power consumption and memory throughput of the device. To reduce the problems associated with the refresh operation, a multi-rate refresh technique that changes the refresh period based on the retention time of DRAM cells has been proposed. Unfortunately, the multi-rate refresh technique has a scalability issue, because the additional storage and logic overhead on a memory controller increases as the device capacity increases. In this article, we propose a novel redundancy repair technique to increase the refresh period of DRAM by using a universal hashing technique. Our redundancy repair technique efficiently repairs both hard faults, which occur during the manufacturing process, and weak cells that have short retention time using the remaining spare elements after the process. Also, our technique solves the Variable Retention Time problem by repairing weak cells at boot time by exploiting the Built-in self-repair (BISR) technique and Error Correction Code. Our technique outperforms a conventional BISR redundancy repair with very little hardware overhead, and ensure reliability with more extended refresh period in the entire system. In particular, our experimental results show that our BISR technique achieves 100% repair rate at a 384ms refresh period in 1.0e-6 hard fault BER configuration, and reduces the refresh energy consumption by 83.9% compared to the 64ms refresh and 12% compared to the conventional multi-rate refresh technique for the state-of-the-art 4Gb device.
- 10 July 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 24 (5) , 1-31
Open AccessReducing DRAM Refresh Rate Using Retention Time Aware Universal Hashing Redundancy Repair
As the device capacity of Dynamic Random Access Memory (DRAM) increases, refresh operation becomes a significant contributory factor toward total power consumption and memory throughput of the device. To reduce the problems associated with the refresh operation, a multi-rate refresh technique that changes the refresh period based on the retention time of DRAM cells has been proposed. Unfortunately, the multi-rate refresh technique has a scalability issue, because the additional storage and logic overhead on a memory controller increases as the device capacity increases. In this article, we propose a novel redundancy repair technique to increase the refresh period of DRAM by using a universal hashing technique. Our redundancy repair technique efficiently repairs both hard faults, which occur during the manufacturing process, and weak cells that have short retention time using the remaining spare elements after the process. Also, our technique solves the Variable Retention Time problem by repairing weak cells at boot time by exploiting the Built-in self-repair (BISR) technique and Error Correction Code. Our technique outperforms a conventional BISR redundancy repair with very little hardware overhead, and ensure reliability with more extended refresh period in the entire system. In particular, our experimental results show that our BISR technique achieves 100% repair rate at a 384ms refresh period in 1.0e-6 hard fault BER configuration, and reduces the refresh energy consumption by 83.9% compared to the 64ms refresh and 12% compared to the conventional multi-rate refresh technique for the state-of-the-art 4Gb device.
- Open Access
- 1 January 2017
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 14 (13) , 20170385
A decoupled bit shifting technique using data encoding/decoding for DRAM redundancy repair
- 1 January 2017
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 14 (13) , 20170385
Open AccessA decoupled bit shifting technique using data encoding/decoding for DRAM redundancy repair
- 30 April 2015
- Published by The Institute of Electronics Engineers of Korea in IEIE Transactions on Smart Processing & Computing
- Vol. 4 (2) , 78-82
Study of Cache Performance on GPGPU
- 30 April 2015
- Published by The Institute of Electronics Engineers of Korea in IEIE Transactions on Smart Processing & Computing
- Vol. 4 (2) , 78-82
Study of Cache Performance on GPGPU