Young-Han Kim

Young-Han Kim

Auto-generated profile, based on publicly available information

Young-Han Kim

Department of Electrical and Computer Engineering, University of California at San Diego, La Jolla, CA, USA

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
19 April 2018 in IEEE Journal of Solid-State Circuits
Verified
Journal Article
Closed access
PWPo-Han Peter Wang
Po-Han Peter Wang
HJHaowei Jiang
Haowei Jiang
LGLi Gao
Li Gao
PSPinar Sen
Pinar Sen
YKYoung-Han Kim
Young-Han Kim
DHDrew Hall
Drew Hall
This paper presents the design of a wake-up receiver (WuRX) that both improves sensitivity and reduces power over prior art through a multi-faceted design featuring an off-chip impedance transformation network with large passive voltage gain, an active envelope detector with high input impedance to facilitate large passive voltage gain, a low-power precision comparator, and a low-leakage digital baseband correlator. Implemented in a 180-nm silicon on insulator CMOS process using dynamic threshold-voltage MOSFET (DTMOS) devices, the OOK-modulated WuRX operates at 113.5 MHz and achieves a sensitivity of -69 dBm, while consuming just 4.5 nW from a 0.4-V supply.

17 October 2018 in Foundations and Trends® in Communications and Information Theory
Verified
Journal Article
Open access
PDF file
FAFatemeh Arbabjolfaei
Fatemeh Arbabjolfaei
YKYoung-Han Kim
Young-Han Kim
Index coding is a canonical problem in network information theory that studies the fundamental limit and optimal coding schemes for broadcasting multiple messages to receivers with different side information. The index coding problem provides a simple yet rich model for several important engineering tasks such as satellite communication, content broadcasting, distributed caching, device-to-device relaying, and interference management. This monograph aims to provide a broad overview of this fascinating subject, focusing on the simplest form of multiple-unicast index coding. A unified treatment on coding schemes based on graph-theoretic, algebraic, and information-theoretic approaches is presented. Although the problem of characterizing the optimal communication rate is open in general, several bounds and structural properties are established. The relationship to other problems such as network coding and distributed storage is also discussed.

12 October 2018 in IEEE Solid-State Circuits Letters
Verified
Journal Article
Closed access
PWPo-Han Peter Wang
Po-Han Peter Wang
HJHaowei Jiang
Haowei Jiang
LGLi Gao
Li Gao
PSPinar Sen
Pinar Sen
YKYoung-Han Kim
Young-Han Kim
DHDrew Hall
Drew Hall
A wake-up receiver (WuRX) that achieves –80.5 dBm sensitivity with only 6.1 nW of power is presented. High sensitivity is achieved via a passive pseudo-balun envelope detector (ED) with a high input impedance (>750 kΩ || <1.4 pF) that enables a 30.6 dB passive voltage gain transformer while providing differential output and improving the conversion gain by 2× compared to a conventional single-ended input passive ED for a given input capacitance. The WuRX is implemented in a 180 nm CMOS process and operates from a 0.4 V supply.

1 June 2007
Verified
Conference Paper
Closed access
TCThomas M. Cover
Thomas M. Cover
YKYoung-Han Kim
Young-Han Kim
The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y1 = f(X,Y), and a separate communication link from the relay to the receiver with capacity R0, is shown to be C(R0) =max min{I(X;Y) + R0, I(X;Y,Y1)}. p(x) Thus every bit from the relay is worth exactly one bit to the receiver. Two alternative coding schemes are presented that achieve this capacity. The first scheme, "hash-and-forward", is based on a variation of the usual random binning on the relay outputs, while the second scheme uses the usual "compress-and- forward". In fact, these two schemes can be combined to give a class of optimal coding schemes. As a corollary, this relay capacity result confirms a conjecture by Ahlswede and Han on the capacity of a channel with rate-limited state information at the decoder in the special case when the channel state is recoverable from the channel input and output.

1 June 2007
Verified
Conference Paper
Closed access
YKYoung-Han Kim
Young-Han Kim
Amos LapidothAmos Lapidoth
Amos Lapidoth
TWTsachy Weissman
Tsachy Weissman
Upper and lower bounds are derived on the reliability function of the additive white Gaussian noise channel with output fed back to the transmitter over an independent additive white Gaussian noise channel. Special attention is paid to the regime of very low feedback noise variance and it is shown that the reliability function is asymptotically inversely proportional to the feedback noise variance. This result shows that the noise in the feedback link, however small, renders the communication with noisy feedback fundamentally different from the perfect feedback case. For example, it is demonstrated that with noisy feedback, linear coding schemes fail to achieve any positive rate. In contrast, an asymptotically optimal coding scheme is devised, based on a three-phase detection/retransmission protocol, which achieves an error exponent inversely proportional to the feedback noise variance for any rate less than capacity.

4 May 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
Sung Hoon LimSung Hoon Lim
Sung Hoon Lim
KKKwang Taik Kim
Kwang Taik Kim
YKYoung-Han Kim
Young-Han Kim
A new coding scheme for general N -node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode-forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover-El Gamal partial decode-forward coding scheme for three-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at the source by multicoding over multiple blocks. This encoding step allows these codewords to carry partial information of the messages implicitly without complicated rate splitting and routing. This partial information is then recovered at the relay nodes and forwarded further. For N-node Gaussian unicast, multicast, and broadcast relay networks, the scheme achieves within 0.5N bits from the cutset bound, and thus from the capacity (region), regardless of the network topology, channel gains, or power constraints. Roughly speaking, distributed decode-forward is dual to noisy network coding, which generalized compress-forward to unicast, multicast, and multiple access relay networks.