Han Wu

Mr. Han Wu

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
13 December 2024 in Entropy
Verified
Journal Article
Open access
PDF file
HWHan Wu
Han Wu
HJHamdi Joudeh
Hamdi Joudeh
We consider a basic joint communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends a codeword to the receiver through a discrete memoryless channel, and the receiver is interested in decoding the transmitted codeword. At the same time, the sensor picks up a noisy version of the transmitted codeword through one of two possible discrete memoryless channels. The sensor knows the codeword and wishes to discriminate between the two possible channels, i.e., to identify the channel that has generated the output given the input. We study the trade-off between communication and sensing in the asymptotic regime, captured in terms of the channel coding rate against the two types of discrimination error exponents. We characterize the optimal trade-off between the rate and the exponents for general discrete memoryless channels with an input cost constraint.

16 December 2025 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
HWHan Wu
Han Wu
HJHamdi Joudeh
Hamdi Joudeh
The information bottleneck channel, also known as oblivious relaying, is a two-hop channel where a transmitter sends messages to a remote receiver via an intermediate relay node. A codeword sent by the transmitter passes through a discrete memoryless channel to reach the relay, which then processes the noisy channel output and forwards it to the receiver through a noiseless rate-limited link. The relay is oblivious, in the sense that it has no knowledge of the channel codebook used in transmission. Previous works on oblivious relaying focus on characterizing achievable rates. In this work, we study error exponents and explore connections to lossless source coding with a helper, also known as the Wyner-Ahlswede-Körner (WAK) problem. We first establish an achievable error exponent for oblivious relaying under constant compositions codes. A key feature of our analysis is the use of the type covering lemma to design the relay’s compress-forward scheme. We then show that employing constant composition code ensembles does not improve the rates achieved with their IID counterparts. We also derive a sphere packing upper bound for the error exponent. In the second part of this paper, we establish a connection between the information bottleneck channel and the WAK problem. We show that good codes for the latter can be produced through permuting codes designed for the former. This is accomplished by revisiting Ahlswede’s covering lemma, and extending it to achieve simultaneous covering of a type class by several distinct sets using the same sequence of permutations. We then apply our approach to attain the best known achievable error exponent for the WAK problem, previously established by Kelly and Wagner. As a byproduct of our derivations, we also establish error exponents and achievable rates under mismatched decoding rules.

16 April 2026 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
HWHan Wu
Han Wu
HJHamdi Joudeh
Hamdi Joudeh
We study the information bottleneck (IB) source coding problem, also known as remote lossy source coding under logarithmic loss. Based on a rate-limited description of noisy observations, the receiver produces a soft estimate for the remote source, i.e., a probability distribution, evaluated under the logarithmic loss. We focus on the excess distortion probability of IB source coding and investigate how fast it converges to 0 or 1, depending on whether the rate is above or below the rate-distortion function. The latter case is also known as the exponential strong converse. We establish both the exact error exponent and the exact strong converse exponent for IB source coding by deriving matching upper and lower exponential bounds. The obtained exponents involve optimizations over auxiliary random variables. The matching converse bounds are derived through non-trivial extensions of existing sphere packing and single-letterization techniques, which we adapt to incorporate auxiliary random variables. In the second part of this paper, we establish a code-level connection between IB source coding and source coding with a helper, also known as the Wyner-Ahlswede-Körner (WAK) problem. We show that every code for the WAK problem is a code for IB source coding. This requires noticing that IB source coding, under the excess distortion criterion, is equivalent to source coding with a helper available at both the transmitter and the receiver; the latter in turn relates to the WAK problem. Through this connection, we re-derive the best known sphere packing exponent of the WAK problem, and provide it with an operational interpretation.

16 August 2022 in arXiv
Verified
Preprint
Open access
PDF file
HWHan Wu
Han Wu
HJHamdi Joudeh
Hamdi Joudeh
We consider a basic joint communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends a codeword to the receiver through a discrete memoryless channel, and the receiver is interested in retrieving the underlying encoded message. On the other hand, the sensor picks up a noisy version of the transmitted codeword through one of two possible discrete memoryless channels. The sensor knows the codeword and wishes to discriminate between the two possible channels, i.e. to identify the channel that has generated the output given the input. We study the trade-off between communication and sensing in the asymptotic regime, captured in terms of the message coding rate against the two types of discrimination error exponents. We characterize the optimal trade-off between the rate and the exponents for general discrete memoryless channels with an input cost constraint.

10 May 2022 in arXiv
Verified
Preprint
Open access
PDF file
HWHan Wu
Han Wu
HJHamdi Joudeh
Hamdi Joudeh
We consider a basic communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends an encoded sequence to the receiver through a discrete memoryless channel, and the receiver is interested in decoding the sequence. On the other hand, the sensor picks up a noisy version of the transmitted sequence through one of two possible discrete memoryless channels. The sensor knows the transmitted sequence and wishes to discriminate between the two possible channels, i.e. to identify the channel that has generated the output given the input. We study the trade-off between communication and sensing in the asymptotic regime, captured in terms of the coding rate to the receiver against the discrimination error exponent at the sensor. We characterize the optimal rate-exponent trade-off for general discrete memoryless channels with an input cost constraint.

24 November 2023
Verified
Conference Paper
Closed access
YFYuanliang Fan
Yuanliang Fan
XHXinghua Huang
Xinghua Huang
HWHan Wu
Han Wu
JCJinyu Chen
Jinyu Chen
ZLZewen Li
Zewen Li
JWJianhua Wang
Jianhua Wang
A LVDC distribution network pole-to-pole short-circuit fault model is established within this paper, with the aim to derive the pole-to-pole short-circuit fault characteristics of the LVDC distribution network through theoretical means. Detailed analysis reveals that the inter-pole short circuit fault can be partitioned into three distinct stages, each of which is meticulously elucidated while providing the corresponding response equations for voltage and current at every stage subsequent to the occurrence of the fault. At the same time, the impact of this fault on the AC current is analyzed. On the basis of the above, the characteristics of the fault current differential initial value are determined, a fault location method using current differential initial value characteristics is proposed, and a detailed fault location process is given. Finally, the MTLAB/Simulink simulation model was established. After simulation verification, it was confirmed that this method can accurately identify the fault location.