Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ki-Il Kum

dblp:09/3751 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis › arithmetic-level optimization
bit-width optimization
0.012001
Combined word-length optimization and high-level synthesis ofdigital signal processing systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2001
Electronic design automation
high-level synthesis
0.012001
Combined word-length optimization and high-level synthesis ofdigital signal processing systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2001
Electronic design automation › high-level synthesis › resource binding
functional unit sharing
0.012001
Combined word-length optimization and high-level synthesis ofdigital signal processing systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2001

Methods — techniques the papers use, named apart from their topics

list scheduling · 0.0integer linear programming · 0.0fixed-point simulation · 0.0
YearPublicationVenuePosition
2001 Combined word-length optimization and high-level synthesis ofdigital signal processing systems
abstract
Conventional approaches for fixed-point implementation of digital signal processing algorithms require the scaling and word-length (WL) optimization at the algorithm level and the high-level synthesis for functional unit sharing at the architecture level. However, the algorithm-level WL optimization has a few limitations because it can neither utilize the functional unit sharing information for signal grouping nor estimate the hardware cost for each operation accurately. In this study, we develop a combined WL optimization and high-level synthesis algorithm not only to minimize the hardware implementation cost, but also to reduce the optimization time significantly. This software initially finds the WL sensitivity or minimum WL of each signal throughout fixed-point simulations of a signal flow graph, performs the WL conscious high-level synthesis where signals having the similar WL sensitivity are assigned to the same functional unit, and then conducts the final WL optimization by iteratively modifying the WLs of the synthesized hardware model. A list-scheduling-based and an integer linear-programming-based algorithms are developed for the WL conscious high-level synthesis. The hardware cost function to minimize is generated by using a synthesized hardware model. Since fixed-point simulation is used to measure the performance, this method can be applied to general, including nonlinear and time-varying, digital signal processing systems. A fourth-order infinite-impulse response filter, a fifth-order elliptic filter, and a 12th-order adaptive least mean square filter are implemented using this software.
Ki-Il Kum, Wonyong Sung
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1999 A floating-point to integer C converter with shift reduction for fixed-point digital signal processors
abstract
A floating-point to integer C program translator is developed for convenient programming and efficient use of fixed-point programmable digital signal processors (DSPs). It not only converts data types and supports automatic scaling, but also conducts shift optimization to enhance execution speed. Since the input and output of this translator are ANSI C compliant programs, it can be used for any fixed-point DSP that supports ANSI C compiler. A shift reduction method is developed for minimizing the scaling overhead of translated integer C programs. It considers the data-path of a target processor and profiling results. Using the shift reduction method, 4% to 37% speedup is obtained. The translated integer C codes are 20 to 400 times faster than the floating-point versions when applied to TMS320C50, TMS320C60 and Motorola 56000 DSPs.
Ki-Il Kum, Jiyang Kang, Wonyong Sung
ICASSP1
1994 Word-length determination and scaling software for a signal flow block diagram
abstract
Software for word-length determination and scaling of a general signal flow block diagram is developed for aiding the development of fixed-point digital signal processing algorithms. A fixed-point performance measure, such as signal to quantization noise ratio, and a hardware cost model are used as constraints to the optimization. Simulation using a real input signal is conducted for the evaluation of fixed-point performance. The number of simulations required for the optimization process is greatly reduced by employing netlist preprocessing and efficient search methods.>
Wonyong Sung, Ki-Il Kum
ICASSP (2)2
1992 Mapping locally recursive SEGs upon a multiprocessor system in a ring network
abstract
A multiprocessor code generation method for digital signal processing algorithms represented by SFGs (signal flow graphs) is developed. For reducing the number of communication operations as well as distributing the workload evenly among the processors, a multiprocessor scheduling method based on a parallel block processing scheme, which processes multiple blocks of input data concurrently, is employed. The developed method first divides an SFG into graph segments to reduce the dependency time. A segment merging process is followed, which results less number of temporary data storages and data transfers. A multiprocessor code is generated by applying a single processor code generation method to each of these segments. The implementation result for QR-RLS algorithm using the developed method is included.>
Wonyong Sung, Sanjit K. Mitra, Ki-Il Kum
ASAP3