Second-Order Coding Rates for Channels With State

Tomamichel, Marco; Tan, Vincent Y. F.

doi:10.1109/tit.2014.2324555

Cited by 51 publications

(43 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…8 An alternative way to derive a single letter characterization of the variance for the Markov chain was shown in [27,Lemma 20]. It should be also noted that a single letter characterization can be derived by using the fundamental matrix [28].…”

Section: A Information Measures For Single-shot Settingmentioning

confidence: 99%

Non-asymptotic and asymptotic analyses on Markov chains in several problems

Hayashi

Watanabe

2014

2014 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

Abstract-In this paper, we derive non-asymptotic achievability and converse bounds on the source coding with side-information and the random number generation with side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on the block length. We also characterize the asymptotic behaviors of the large deviation regime and the moderate deviation regime by using our bounds, which implies that our bounds are asymptotically tight in those regimes. We also show the second order rates of those problems, and derive single letter forms of the variances characterizing the second order rates.

show abstract

Section: A Information Measures For Single-shot Settingmentioning

confidence: 99%

Non-asymptotic and asymptotic analyses on Markov chains in several problems

Hayashi

Watanabe

2014

2014 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

show abstract

“…Another asymptotic question of interest is the behavior of mclass source-channel codes in the regime were m is allowed to scale in n. In that set up the more refined results of [11] may prove to be helpful. Finally, much of the normal approximation analysis cited here has been extended to Markov sources and Markov channels [8], [18]. The m-class source-channel coding results of Theorem 1 should also hold for a wider class of sources and channels than those studied here.…”

Section: Refined Asymptoticsmentioning

confidence: 90%

Second-order coding rate for m-class source-channel codes

Shkel

Tan

Draper

2015

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Self Cite

View full text Add to dashboard Cite

The second-order coding rate for source-channel codes with m levels of unequal message protection (UMP) is derived. The second-order coding rate takes the form of an optimization problem which reduces to separate source-channel coding rate for m = 2. A procedure for solving the given optimization problem is proposed. The proposed procedure exploits the structure of the problem to reduce the optimization search space to one dimension. Numerical results for the BSC are obtained and it is shown, empirically, that the second-order coding rate of source-channel codes with m levels of UMP approaches the optimal joint source-channel coding rate as m grows.

show abstract

“…Let p W,E n ,X n ,Y n ,Ŵ be the probability distribution induced by the (n, M, ε)-code constructed above, where p W,E n ,X n ,Y n ,Ŵ can be expressed according to (18). In view of (125), we assume without loss of generality that…”

Section: Obtaining a Lower Bound On The Error Probability In Terms Ofmentioning

confidence: 99%

On achievable rates of AWGN energy-harvesting channels with block energy arrival and non-vanishing error probabilities

Pong

Tan

Özgür

2017

2017 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

This paper investigates the achievable rates of an additive white Gaussian noise (AWGN) energy-harvesting (EH) channel with an infinite battery. The EH process is characterized by a sequence of blocks of harvested energy, which is known causally at the source. The harvested energy remains constant within a block while the harvested energy across different blocks is characterized by a sequence of independent and identically distributed (i.i.d.) random variables. The blocks have length L, which can be interpreted as the coherence time of the energy arrival process. If L is a constant or grows sublinearly in the blocklength n, we fully characterize the first-order term in the asymptotic expansion of the maximum transmission rate subject to a fixed tolerable error probability ε. The first-order term is known as the ε-capacity. In addition, we obtain lower and upper bounds on the second-order term in the asymptotic expansion, which reveal that the second order term scales as L n for any ε less than 1/2. The lower bound is obtained through analyzing the save-and-transmit strategy. If L grows linearly in n, we obtain lower and upper bounds on the ε-capacity, which coincide whenever the cumulative distribution function (cdf) of the EH random variable is continuous and strictly increasing. In order to achieve the lower bound, we have proposed a novel adaptive save-and-transmit strategy, which chooses different save-and-transmit codes across different blocks according to the energy variation across the blocks.

show abstract

Second-Order Coding Rates for Channels With State

Cited by 51 publications

References 35 publications

Non-asymptotic and asymptotic analyses on Markov chains in several problems

Non-asymptotic and asymptotic analyses on Markov chains in several problems

Second-order coding rate for m-class source-channel codes

On achievable rates of AWGN energy-harvesting channels with block energy arrival and non-vanishing error probabilities

Contact Info

Product

Resources

About