Seokbum Ko

Dr. Seokbum Ko

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
16 January 2017 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
SVSuganthi Venkatachalam
Suganthi Venkatachalam
SKSeokbum Ko
Seokbum Ko
Approximate computing can decrease the design complexity with an increase in performance and power efficiency for error resilient applications. This brief deals with a new design approach for approximation of multipliers. The partial products of the multiplier are altered to introduce varying probability terms. Logic complexity of approximation is varied for the accumulation of altered partial products based on their probability. The proposed approximation is utilized in two variants of 16-bit multipliers. Synthesis results reveal that two proposed multipliers achieve power savings of 72% and 38%, respectively, compared to an exact multiplier. They have better precision when compared to existing approximate multipliers. Mean relative error figures are as low as 7.6% and 0.02% for the proposed approximate multipliers, which are better than the previous works. Performance of the proposed multipliers is evaluated with an image processing application, where one of the proposed models achieves the highest peak signal to noise ratio.

1 September 2018 in Computerized Medical Imaging and Graphics
Verified
Journal Article
Closed access
ZJZhexin Jiang
Zhexin Jiang
HZHao Zhang
Hao Zhang
YWYi Wang
Yi Wang
SKSeokbum Ko
Seokbum Ko

1 May 2020 in Ultrasound in Medicine & Biology
Verified
Journal Article
Closed access
YWYi Wang
Yi Wang
ECEun Jung Choi
Eun Jung Choi
YCYounhee Choi
Younhee Choi
HZHao Zhang
Hao Zhang
GJGong Yong Jin
Gong Yong Jin
SKSeokbum Ko
Seokbum Ko

7 April 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
AHArman Haghanifar
Arman Haghanifar
MMMahdiyar Molahasani Majdabadi
Mahdiyar Molahasani Majdabadi
YCYounhee Choi
Younhee Choi
SDS. Deivalakshmi
S. Deivalakshmi
SKSeokbum Ko
Seokbum Ko

2 July 2019 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
SVSuganthi Venkatachalam
Suganthi Venkatachalam
EAElizabeth Adams
Elizabeth Adams
HLHyuk-Jae Lee
Hyuk-Jae Lee
SKSeokbum Ko
Seokbum Ko
Approximate computing is an emerging technique in which power-efficient circuits are designed with reduced complexity in exchange for some loss in accuracy. Such circuits are suitable for applications in which high accuracy is not a strict requirement. Radix-4 modified Booth encoding is a popular multiplication algorithm which reduces the size of the partial product array by half. In this paper, three Approximate Booth Multiplier Models (ABM-M1, ABM-M2, and ABM-M3) are proposed in which approximate computing is applied to the radix-4 modified Booth algorithm. Each of the three designs features a unique approximation technique that involves both reducing the logic complexity of the Booth partial product generator and modifying the method of partial product accumulation. The proposed approximate multipliers are demonstrated to have better performance than existing approximate Booth multipliers in terms of accuracy and power. Compared to the exact Booth multiplier, ABM-M1 achieves up to a 23% reduction in area and 15% reduction in power with a Mean Relative Error Distance (MRED) value of $7.9 \times 10^4$ . ABM-M2 has area and power savings of up to 51% and 46% respectively with a MRED of $2.7 \times 10^2$ . ABM-M3 has area savings of up to 56% and power savings of up to 46% with a MRED of $3.4 \times 10^3$ . The proposed designs are compared with the state-of-the-art existing multipliers and are found to outperform them in terms of area and power savings while maintaining high accuracy. The performance of the proposed designs are demonstrated using image transformation, matrix multiplication, and Finite Impulse Response (FIR) filtering applications

25 January 2019 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
HZHao Zhang
Hao Zhang
DCDongdong Chen
Dongdong Chen
SKSeokbum Ko
Seokbum Ko