Sungwook Kim

Learn More
A novel connection between digit-serial computing and skew-tolerant domino circuit design is developed and applied to the design of a 512-bit modular multiplier. In our design, a digit size of four bits is efficiently mapped onto a four-phase overlapping clocking scheme, so that four bits are processed during each full clock cycle. Our architecture is based(More)
Efficient bandwidth management is necessary in order to provide high quality service to users in a multimedia wireless/mobile network. In this paper, we propose an on-line load balancing algorithm with preemption. This technique is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth(More)
—Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high-quality service to users in a multimedia wireless/mobile network. In this paper, we propose new online bandwidth-management algorithms for bandwidth reservation, call admission, bandwidth migration,(More)
This paper presents high-performance encoder and de-coder architectures for a class of Low Density Parity Check (LDPC) codes. The codes considered here are based on the Parallelly Concatenated Parity Check encoder structure. A major advantage of these codes is that the generator matrix and the parity check matrix are both sparse, which leads to efficient(More)
A novel connection between digit-serial computing and skew-tolerant domino circuit design is developed and applied to the design of unsigned and signed multipliers. In our design methodology, a multiplier having a digit size of bits is naturally and efficiently mapped into a skew-tolerant domino implementation using overlapping clock phases. In order to(More)
Let E be an elliptic curve over a finite field Fq with a power of prime q, r a prime dividing #E(Fq), and k the smallest positive integer satisfying r|Φ k (p), called embedding degree. Then a bilinear map t : E(Fq)[r] × E(F q k)/rE(F q k) → F * q k is defined, called the Tate pairing. And the Ate pairing and other variants are obtained by reducing the(More)