Da-Ke He

Da-Ke He

Auto-generated profile, based on publicly available information

Da-Ke He

IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
17 November 2009 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
DHDa-Ke He
Da-Ke He
LLLuis A. Lastras-Montano
Luis A. Lastras-Montano
EYEn-Hui Yang
En-Hui Yang
AJAshish Jagmohan
Ashish Jagmohan
JCJun Chen
Jun Chen
In this paper, the redundancy of both variable and fixed rate Slepian-Wolf coding is considered. Given any jointly memoryless source-side information pair {(Xi, Yi)}i=1 infin with finite alphabet, the redundancy Rn(isinn) of variable rate Slepian-Wolf coding of X1 n with decoder only side information Y1 n depends on both the block length n and the decoding block error probability isinn, and is defined as the difference between the minimum average compression rate of order n variable rate Slepian-Wolf codes having the decoding block error probability less than or equal to isinn, and the conditional entropy H(X|Y), where H(X|Y) is the conditional entropy rate of the source given the side information. The redundancy of fixed rate Slepian-Wolf coding of X1 n with decoder only side information Y1 n is defined similarly and denoted by RF n(isinn). It is proved that under mild assumptions about isinn, Rn(isinn) = dvradic-log isinn/n + (oradic-log isinn/n) and RF n(isinn) - dfradic-log isinn/n + o(radic-log isinn/n), where df and dnu are two constants completely determined by the joint distribution of the source-side information pair. Since dv is generally smaller than df, our results show that variable rate Slepian-Wolf coding is indeed more efficient than fixed rate Slepian-Wolf coding.

1 June 2007
Verified
Conference Paper
Closed access
JCJun Chen
Jun Chen
DHDa-Ke He
Da-Ke He
AJAshish Jagmohan
Ashish Jagmohan
LLLuis A. Lastras-Montano
Luis A. Lastras-Montano
We characterize the redundancy-error tradeoff in Slepian-Wolf coding. Similar results are derived for a class of cyclic-symmetric channels. Through the linear codebook-level duality between Slepian-Wolf coding and channel coding, we show that, in Slepian-Wolf coding, linear codes are optimal in terms of redundancy-error tradeoff at rate close to the Slepian- Wolf limit but suboptimal at high rate.

1 July 2006
Verified
Conference Paper
Closed access
DHDa-Ke He
Da-Ke He
EYEn-Hui Yang
En-Hui Yang
In this paper we investigate the relationship between Slepian-Wolf (S-W) coding and channel coding. It is shown that any S-W coding problem is dual to a channel coding problem for a semi-symmetric channel. This result holds for any stationary, ergodic source-side information pair with finite alphabet

1 January 2007
Verified
Conference Paper
Closed access
LLLigang Lu
Ligang Lu
DHDake He
Dake He
AJAshish Jagmohan
Ashish Jagmohan
Side information (SI) generation is one of the key components of a Wyner-Ziv coder. In this paper we present a novel multi-frame SI generation approach which uses adaptive temporal filtering to estimate the pixel values for SI and motion vector filtering for refinement. For temporal filtering, we derive the optimal mean squared error temporal filter when the noise can be evaluated, and propose a similarity weighted temporal filter when the knowledge of the noise is not available. The temporal filter adapts on the quality of the motion estimation. The quality of SI generation is further improved by using motion vector filtering to reduce the noise effect from motion estimation. Experimental results indicate that the proposed SI generation approach yields good performance in terms of SI quality and conditional entropy.

1 July 2006
Verified
Conference Paper
Closed access
JCJun Chen
Jun Chen
DHDake He
Dake He
AJAshish Jagmohan
Ashish Jagmohan
We consider Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes for memoryless source-side information pairs. A density evolution formula, equipped with a concentration theorem, is derived for Slepian-Wolf coding based on LDPC coset codes. As a consequence, an intimate connection between Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, design of binary LDPC coset codes for Slepian-Wolf coding of an arbitrary memoryless source-side information pair reduces to design of binary LDPC codes for binary-input output-symmetric channels without loss of optimality. With this connection, many classic results in channel coding can be easily translated into the Slepian-Wolf setting

1 July 2006
Verified
Conference Paper
Closed access
DHDa-Ke He
Da-Ke He
LLLuis A. Lastras-Montano
Luis A. Lastras-Montano
EYEn-Hui Yang
En-Hui Yang
In this paper we analyze the redundancy of variable rate Slepian-Wolf coding. For any memoryless source-side information pair (X, Y) = {(X i ,Y i )}Einfin i=1 with finite alphabet, the redundancy R n (epsi n ) of variable rate Slepian-Wolf coding is defined as the minimum of the difference between the compression rate of any variable-rate Slepian-Wolf code resulting from coding XEn 1 with decoding error probability epsi n , and the conditional entropy H(X|Y). It is proved that under mild assumptions, for sufficiently large n, R n (epsi n ) is lower bounded by dradiclog n/n, where d > 0 is a constant