Hyeong-Cheol Oh

Learn More
An edge-flag rendering algorithm for supersampling antialiasing with low hardware cost is presented. The proposed algorithm works differently from the common rendering algorithm, using only one counter per pixel instead of one counter per sample point. Compared to the common rendering algorithm, the proposed one uses about 83% less memory capacity for(More)
In this paper, we examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O (cdη + cLη logP ) time with high probability, where L is the number of flits in a packet, and η = min {d, L}; only(More)
In this paper, we examine the packet routing problem for networks with wires of di ering length. We consider this problem in a network independent context, in which routing time is expressed in terms of \congestion" and \dilation" measures for a set of packet paths. We give, for any constant > 0, a randomized on-line algorithm for routing any set of N(More)
EISC (Extendable Instruction Set Computer) is a compressed code architecture developed for embedded applications. In this paper, we propose a DSP-enhanced embedded microprocessor based on the 32-bit EISC architecture. We present how we could exploit the special features, and how we could overcome the deficits, of the EISC architecture to accelerate DSP(More)
Loeffler discrete cosine transform (DCT) algorithm is recognized as the most efficient one because it requires the theoretically least number of multiplications. However, many applications still encounter difficulty in performing the 11 multiplications required by the algorithm to calculate a 1D eight-point DCT. To avoid expensive multipliers in the(More)