Embedded Files
Early Decoding in Gaussian Broadcast Channels
o Successive interference cancellation in broadcast channels with
heterogeneous blocklength constraints
➡️ Early Decoding (ED): Decoding incompletely received interference
o We derived [1,2]:
A sufficient condition on the length of (the shorter) codeword 2
Inner and outer bounds on the 2nd-order rate region of ED
➡️ ED helps user 2 to meet the stricter latency requirement
while allowing for a good rate of performance.
o Extension to an interference channel is also available [3].
[1] P. -H. Lin, S. -C. Lin, P. -W. Chen, M. A. Mross and E. A. Jorswieck, "Second Order Rate Regions of Gaussian Broadcast Channels Under Heterogeneous Blocklength Constraints," in IEEE Trans. Commun., vol. 72, no. 2, pp. 801-814, Feb. 2024
[2] M. A. Mross, P. -H. Lin and E. A. Jorswieck, "Gaussian Broadcast Channels with Heterogeneous Finite Blocklength Constraints: Inner and Outer Bounds," in IEEE Trans. Commun., vol. 72, no. 5, pp. 2731-2745, May. 2024
[3] K. Dong, P.-H. Lin, M. A. Mross, and E. A. Jorswieck, “Second-order Rate Analysis of a Two-user Gaussian Interference Channel with Heterogeneous Blocklength Constraints,” in Proc. 2024 IEEE 25th Int. Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Lucca, Italy, Sep. 2024, pp. 921–925.
Asynchronous Unsourced Multiple Access
o We investigated the asynchronous case for the unsourced multiple access model
o Due to the asynchronicity, we lose some symmetry properties which makes the derivation of bounds more challenging
o We assume a maximal delay constraint with a decoding window equal to the codeword length, and known delays at the receiver
o We derived a bound for the error probability under the worst-case delay distribution using saddlepoint approximations [4]
o We evaluated that under these assumptions, additional transmit energy is necessary to reliably recover the messages
[4] J.-S. Wu, P.-H. Lin, M. A. Mross, and E. A. Jorswieck, “Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple Access,” in 2024 IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2024, pp. 3207–3212.
Latent-Variable secrecy
o Keeping the entire message hidden from eavesdropper Eve may be inefficient and result in a penalty of the secrecy rate:
Not hide the complete message, but only the most sensitive attributes.
o In latent variable secrecy (LVS) [1], the transmitter is interested in sending the message M to the intended receiver while keeping the latent variable S secret from Eve.
o Based on a practical database from daily life (IMDb) as an example for LVS, we conduct a complete system design with Hayashi's wiretap coding and use numerical simulation to validate the performances of reliability at Bob and leakage at Eve.
[5] J. Zhang, P. -H. Lin, K. -L. Besser and E. A. Jorswieck, "Practical Design of a Transmission with Latent Variable Secrecy," 2024 IEEE 25th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Lucca, Italy, 2024, pp. 196-200
Capacity Regions of Multi-User Fading Channels with Statistical Channel State Information at The TX
o Capacity regions for fast-fading multi-user channels without channel state information at TX (CSIT) is an open problem.
o We found conditions of the fading distributions to guarantee the trichotomy order of different users' channel strengths is the same within a code blocklength, then the fading multi-user channels are equivalent to ones with information-theoretic orders like degradedness, to help us to derive the ergodic capacity regions, including some of the interference channels, broadcast channel, and wiretap channel.
[6] P. -H. Lin, E. A. Jorswieck, C. R. Janda, M. Mittelbach and R. F. Schaefer, "On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSIT," 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, pp. 1497-1501
[7] P. -H. Lin, E. A. Jorswieck, R. F. Schaefer, M. Mittelbach and C. R. Janda, "New Capacity Results for Fading Gaussian Multiuser Channels With Statistical CSIT," in IEEE Transactions on Communications, vol. 68, no. 11, pp. 6761-6774, Nov. 2020
Google Sites
Report abuse