Exact moderate deviation asymptotics in streaming data transmission

Lee, Si-Hyeon; Tan, Vincent Y. F.; Khisti, Ashish

doi:10.1109/isit.2017.8006729

Cited by 5 publications

(5 citation statements)

References 23 publications

(53 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A natural next step is to attempt to derive a converse (cf. [43]), possibly leveraging on feedforward decoders [21], [49]. However, we envision significant challenges in obtaining a matching converse.…”

Section: Discussionmentioning

confidence: 99%

“…If we adopt (3), we can assert the existence of deterministic codes by invoking the union bound and Markov's inequality as in [42]. 1 This error criterion was also used by Lee, Tan, and Khisti in [43]. We remark that given fixed blocklength n, an (n, N 1 , N 2 , T, ǫ n )-code for streaming SW coding consists of a sequence of encoding and decoding functions.…”

Section: B System Model and Problem Formulationmentioning

confidence: 99%

“…Since the future source block cannot lead to an error in decoding the current source block (X k , Y k ) (cf. [19], [43]), it suffices to first decode past source blocks (X 15 13 , Y 15 13 ) in order to remove uncertainty in using {(M 1,τ , M 2,τ )} τ ∈{16,17} to decode the current source block pair. To decode (X 13 , Y 13 ), we need to use codewords {(M 1,τ , M 2,τ )} τ ∈ [13:17] .…”

Section: Decoding: Basic Idea and One Examplementioning

confidence: 99%

See 2 more Smart Citations

Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources

Zhou

Tan

Motani

2018

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

Motivated by streaming multi-view video coding and wireless sensor networks, we consider the problem of blockwise streaming compression of a pair of correlated sources, which we term streaming Slepian-Wolf coding. We study the moderate deviations regime in which the rate pairs of a sequence of codes converge, along a straight line, to various points on the boundary of the Slepian-Wolf region at a speed slower than the inverse square root of the blocklength n, while the error probability decays subexponentially fast in n. Our main result focuses on directions of approaches to corner points of the Slepian-Wolf region. It states that for each correlated source and all corner points, there exists a non-empty subset of directions of approaches such that the moderate deviations constant (the constant of proportionality for the subexponential decay of the error probability) is enhanced (over the non-streaming case) by at least a factor of T , the block delay of decoding source block pairs. We specialize our main result to the setting of streaming lossless source coding and generalize this result to the setting where we have different delay requirements for each of the two source blocks. The proof of our main result involves the use of various analytical tools and amalgamates several ideas from the recent information-theoretic streaming literature. We adapt the so-called truncated memory encoding idea from Draper and Khisti (2011) and Lee, Tan, and Khisti (2016) to ensure that the effect of error accumulation is nullified in the limit of large blocklengths. We also adapt the use of the so-called minimum weighted empirical suffix entropy decoder which was used by Draper, Chang, and Sahai (2014) to derive achievable error exponents for symbolwise streaming Slepian-Wolf coding.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: B System Model and Problem Formulationmentioning

confidence: 99%

Section: Decoding: Basic Idea and One Examplementioning

confidence: 99%

See 1 more Smart Citation

Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources

Zhou

Tan

Motani

2018

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…In our previous work [11], we proposed a code that uses an adapted SED rule [8] to instantaneously transmit k < ∞ randomly arriving bits and that leads to an achievability bound on the reliability function for binary-input DMCs with instantaneous encoding, and designed a polynomial-time version of it. While the instantaneous encoding schemes in [18]- [24], [11] employ feedback, transmission schemes for streaming data without feedback have been investigated for finite memory encoders [25], for distributed sources [26], and for point-to-point channels in the moderate deviations [27] and the central limit theorem [28] regimes.…”

Section: Introductionmentioning

confidence: 99%

Reliability Function for Streaming Over a DMC With Feedback

Guo

Kostina

2023

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Conventionally, posterior matching is investigated in channel coding and block encoding contexts -the source symbols are equiprobably distributed and are entirely known by the encoder before the transmission. In this paper, we consider a streaming source, whose symbols progressively arrive at the encoder at a sequence of deterministic times. We derive the joint source-channel coding (JSCC) reliability function for streaming over a discrete memoryless channel (DMC) with feedback. We propose a novel instantaneous encoding phase that operates during the symbol arriving period and that achieves the JSCC reliability function for streaming when followed by a block encoding scheme that achieves the JSCC reliability function for a classical source whose symbols are fully accessible before the transmission. During the instantaneous encoding phase, the evolving message alphabet is partitioned into groups whose priors are close to the capacity-achieving distribution, and the encoder determines the group index of the actual sequence of symbols arrived so far and applies randomization to exactly match the distribution of the transmitted index to the capacity-achieving one. Surprisingly, the JSCC reliability function for streaming is equal to that for a fully accessible source, implying that the knowledge of the entire symbol sequence before the transmission offers no advantage in terms of the reliability function. For streaming over a symmetric binary-input DMC, we propose a one-phase instantaneous small-enough difference (SED) code that not only achieves the JSCC reliability function, but also, thanks to its single-phase time-invariant coding rule, can be used to stabilize an unstable linear system over a noisy channel. For equiprobably distributed source symbols, we design low complexity algorithms to implement both the instantaneous encoding phase and the instantaneous SED code. The algorithms group the source sequences into sets we call types, which enable the encoder and the decoder to track the priors and the posteriors of source sequences jointly, leading to a log-linear complexity in time. While the reliability function is derived for non-degenerate DMCs, i.e., DMCs whose transition probability matrix has all positive entries, for degenerate DMCs we design a code with instantaneous encoding that achieves zero error for all rates below Shannon's joint source-channel coding limit.

show abstract

“…Asmussen and Albrecher (2010)), nonparametric estimation in statistics (see, e.g., Bahadur and Rao (1960), van der Vaart (1998), Joutard (2006Joutard ( , 2013), and in network information theory (cf. Lee et al (2016Lee et al ( , 2017).…”

Section: Introductionmentioning

confidence: 99%

Cramér Type Moderate Deviations for Random Fields

Beknazaryan,

Sang,

Xiao

2019

Preprint

View full text Add to dashboard Cite

show abstract

Exact moderate deviation asymptotics in streaming data transmission

Cited by 5 publications

References 23 publications

Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources

Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources

Reliability Function for Streaming Over a DMC With Feedback

Cramér Type Moderate Deviations for Random Fields

Contact Info

Product

Resources

About