Filters








633 Hits in 2.8 sec

Lossy joint source-channel coding in the finite blocklength regime

Victoria Kostina, Sergio Verdu
2012 2012 IEEE International Symposium on Information Theory Proceedings  
This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance  ...  For memoryless sources and channels, it is demonstrated that the parameters of the best joint source-channel code must satisfy , where and are the channel capacity and channel dispersion, respectively;  ...  strong converse does not hold and the second-order term is of order , not , as in (193).  ... 
doi:10.1109/isit.2012.6283533 dblp:conf/isit/KostinaV12 fatcat:oukaiimfcbesro4a3uhryvl4tu

Lossy Joint Source-Channel Coding in the Finite Blocklength Regime

Victoria Kostina, Sergio Verdu
2013 IEEE Transactions on Information Theory  
This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance  ...  For memoryless sources and channels, it is demonstrated that the parameters of the best joint source-channel code must satisfy , where and are the channel capacity and channel dispersion, respectively;  ...  strong converse does not hold and the second-order term is of order , not , as in (193).  ... 
doi:10.1109/tit.2013.2238657 fatcat:ppsoqwzmsfbavedngwnqghfuqu

Nonasymptotic noisy lossy source coding

Victoria Kostina, Sergio Verdu
2013 2013 IEEE Information Theory Workshop (ITW)  
This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through  ...  While this problem is asymptotically equivalent to a noiseless lossy source coding problem with a modified distortion function, nonasymptotically there is a difference in how fast their minimum achievable  ...  In this paper, we give new nonasymptotic achievability and converse bounds for the noisy source coding problem, which generalize the noiseless source coding bounds in [9] .  ... 
doi:10.1109/itw.2013.6691295 dblp:conf/itw/KostinaV13 fatcat:wwt2gy4lzbdatp4wbu4pgfstx4

Nonasymptotic Noisy Lossy Source Coding

Victoria Kostina, Sergio Verde
2016 IEEE Transactions on Information Theory  
This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through  ...  While this problem is asymptotically equivalent to a noiseless lossy source coding problem with a modified distortion function, nonasymptotically there is a difference in how fast their minimum achievable  ...  In this paper, we give new nonasymptotic achievability and converse bounds for the noisy source coding problem, which generalize the noiseless source coding bounds in [9] .  ... 
doi:10.1109/tit.2016.2562008 fatcat:gvf4tpxkyrgczjzaxzxl4zxaca

Variable-length coding with stop-feedback for the common-message broadcast channel

Kasper Floe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski
2016 2016 IEEE International Symposium on Information Theory (ISIT)  
We present nonasymptotic achievability and converse bounds for the maximum coding rate, which strengthen and generalize the bounds previously reported in Trillingsgaard et al. (2015) for the two-user case  ...  Furthermore, we identify conditions under which our converse and achievability bounds are tight up to the second order.  ...  ., the converse bound in Theorem 4 is tight up to second order. The same is not true for (19). Indeed, by computing (24) and (25), we find that Ξ c = 0.2630 and Ξ a = 0.3175. and P.  ... 
doi:10.1109/isit.2016.7541784 dblp:conf/isit/TrillingsgaardY16 fatcat:l6uadrhh3vfehe2sgxisohikaa

Minimum Energy to Send $k$ Bits Through the Gaussian Channel With and Without Feedback

Yury Polyanskiy, H. Vincent Poor, Sergio Verdu
2011 IEEE Transactions on Information Theory  
In particular, without feedback achieving energy per bit of 1 57 dB requires coding over at least = 10 6 information bits, while we construct a feedback scheme that transmits a single information bit with  ...  energy 1 59 dB and zero error.  ...  ACKNOWLEDGMENT This paper has benefited significantly from comments and suggestions by Dr. A. Jain, Mr. Y. Wu and by the anonymous reviewers.  ... 
doi:10.1109/tit.2011.2159041 fatcat:nce6tsz6jrbrznvmspo6dkb7re

Nonasymptotic noisy lossy source coding [article]

Victoria Kostina, Sergio Verdú
2016 arXiv   pre-print
This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through  ...  While this problem is asymptotically equivalent to a noiseless lossy source coding problem with a modified distortion function, nonasymptotically there is a noticeable gap in how fast their minimum achievable  ...  In this paper, we give new nonasymptotic achievability and converse bounds for the noisy source coding problem, which generalize the noiseless source coding bounds in [15] .  ... 
arXiv:1401.5125v2 fatcat:uxefl46dpfdvthnmy2etvrrgdm

The impact of dark current on the wideband Poisson channel

Ligong Wang, Gregory W. Wornell
2014 2014 IEEE International Symposium on Information Theory  
We also show that pulse-position modulation with "soft-decision decoding" achieves data rates that accurately reflect such influence.  ...  Extending our previous work, we show that the influence of the dark current on channel capacity is mainly on the third-order term with respect to E .  ...  Fig. 1 . 1 Comparing the approximation (12) to nonasymptotic upper bound, and to lower bounds for simple PPM, soft-decision PPM, and on-off keying for three cases: c = 0.1, c = 1, and c = 10.  ... 
doi:10.1109/isit.2014.6875369 dblp:conf/isit/WangW14 fatcat:5tg6m3e5pfb4bpnuflksc7rpii

Saddlepoint Approximations for Short-Packet Wireless Communications

Alejandro Lancho, Johan Ostman, Giuseppe Durisi, Tobias Koch, Gonzalo Vazquez-Vilar
2020 IEEE Transactions on Wireless Communications  
In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained attention in the information  ...  This paper presents saddlepoint approximations of state-of-theart converse and achievability bounds for noncoherent, singleantenna, Rayleigh block-fading channels.  ...  The nonasymptotic bounds considered in this paper are the meta-converse (MC) bound [3, Th. 31] and the random coding union bound with parameter s (RCU s ) [5, Th. 1] .  ... 
doi:10.1109/twc.2020.2987573 fatcat:fsrwa57lnreplcpxyixt6nwiey

Saddlepoint Approximations for Short-Packet Wireless Communications [article]

Alejandro Lancho, Jöhan Ostman, Giuseppe Durisi, Tobias Koch and Gonzalo Vazquez-Vilar
2020 arXiv   pre-print
In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained attention in the information  ...  This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels.  ...  The nonasymptotic bounds considered in this paper are the meta-converse (MC) bound [3, Th. 31] and the random coding union bound with parameter s (RCU s ) [5, Th. 1] .  ... 
arXiv:1904.10442v5 fatcat:sqxzgssewjaufmtcgfyeaj5gsi

Fixed-Length Lossy Compression in the Finite Blocklength Regime

Victoria Kostina, Sergio Verdu
2012 IEEE Transactions on Information Theory  
Tight general achievability and converse bounds are derived that hold at arbitrary fixed blocklength.  ...  This paper studies the minimum achievable source coding rate as a function of blocklength n and probability ϵ that the distortion exceeds a given level d.  ...  for some constant . Armed with (195) and (388), we are ready to proceed to the second-order analysis of (176).  ... 
doi:10.1109/tit.2012.2186786 fatcat:nxadatdyxzg6fehvgejiik2vcy

Refined analysis of the Poisson channel in the high-photon-efficiency regime

Ligong Wang, Gregory W. Wornell
2012 2012 IEEE Information Theory Workshop  
We also show that pulse-position modulation is optimal on this channel up to the second-order term in capacity. IEEE Information Theory Workshop 978-1-4673-0223-4/12/$31.00 ©2012 IEEE  ...  We consider the wideband, high-photon-efficiency extreme where E approaches zero, and where the channel's "dark current" approaches zero proportionally with E.  ...  ACKNOWLEDGMENTS The authors wish to thank Hye Won Chung, Yuval Kochman, Amos Lapidoth and Lizhong Zheng for helpful discussions.  ... 
doi:10.1109/itw.2012.6404742 dblp:conf/itw/WangW12 fatcat:q2xuljqnejdyji74toej5ibsnu

Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information [article]

Shun Watanabe, Shigeaki Kuzuoka, Vincent Y. F. Tan
2014 arXiv   pre-print
We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory.  ...  Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esseen theorem to our new non-asymptotic bounds.  ...  The work of third author is supported in part by NUS startup grant R-263-000-A98-750/133 and in part by A*STAR, Singapore.  ... 
arXiv:1301.6467v5 fatcat:oaeiwum32zg5dlhejnkyrdpzyq

Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels

Alejandro Lancho, Johan Ostman, Giuseppe Durisi, Tobias Koch, Gonzalo Vazquez-Vilar
2019 2019 IEEE International Symposium on Information Theory (ISIT)  
This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels.  ...  These approximations can be calculated efficiently and are shown to be accurate for SNR values as small as 0 dB, blocklengths of 168 channel uses or more, and when the channel's coherence interval is not  ...  To prove that the right-hand side (RHS) of (26) is achievable, we evaluate (19a) for s = 1 and τ L = Q −1 − k1,ρ √ L Lψ ρ,1 (0) (27) where k 1,ρ > 0 is independent of L and bounded in ρ.  ... 
doi:10.1109/isit.2019.8849659 dblp:conf/isit/LanchoODKV19 fatcat:gpnygca3kbgpvjzmvto4hmkqw4

Common-Message Broadcast Channels with Feedback in the Nonasymptotic Regime: Full Feedback [article]

Kasper Fløe Trillingsgaard and Wei Yang and Giuseppe Durisi and Petar Popovski
2018 arXiv   pre-print
For the fixed-blocklength-code setup, we establish nonasymptotic converse and achievability bounds.  ...  An asymptotic analysis of these bounds reveals that feedback improves the second-order term compared to the no-feedback case.  ...  VARIABLE-LENGTH FEEDBACK CODES We first present a Fano-type converse bound and a nonasymptotic achievability bound for VLF codes.  ... 
arXiv:1706.07731v2 fatcat:nxakp3xw2jd6pi23arfjazkzqy
« Previous Showing results 1 — 15 out of 633 results