Finite blocklength coding for multiple access channels

Huang, Yen-Wei; Moulin, Pierre

doi:10.1109/isit.2012.6284677

Cited by 45 publications

(55 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead, we can assign essentially all the average error probability ✏ to the joint outage event. Therefore, upon repeating the same procedure as in Theorem 4, but with the jointoutage bound in Theorem 3 and the multi-dimensional CLT, we obtain the following achievable region for the Gaussian MAC, which is similar to the results of [13] and [14] for the discrete MAC.…”

Section: Gaussian Macsupporting

confidence: 63%

A random coding approach to Gaussian multiple access channels with finite blocklength

MolavianJazi¹,

Laneman²

2012

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-Contrary to the common use of random coding and typicality decoding for the achievability proofs in information theory, the tightest achievable rates for point-to-point Gaussian channels build either on geometric arguments or composite hypothesis testing, for which direct generalization to multi-user settings appears challenging. In this paper, we provide a new perspective on the procedure of handling input cost constraints for tight achievability results. In particular, we show with a proper choice of input distribution and using a change of measure technique, tight bounds can be achieved via the common random coding argument and a modified typicality decoding. It is observed that a codebook generated randomly according to a uniform distribution on the "power shell" is optimal, at least up to the second order. Such insights are then extended to a Gaussian multiple access channel, for which independent uniform distributions on power shells are shown to be very close to optimal, at least up to second order.

show abstract

Section: Gaussian Macsupporting

confidence: 63%

A random coding approach to Gaussian multiple access channels with finite blocklength

MolavianJazi¹,

Laneman²

2012

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…This was re-popularized in recent times by Kontoyiannis [40], Baron-Khojastepour-Baraniuk [41], Hayashi [11], [12], and Polyanskiy-Poor-Verdú [22] among others. Second-order analysis for network information theory problems were considered in Tan and Kosut [23] as well as other authors [42]- [45]. However, this is the first work that considers second-order rates for problems with sideinformation.…”

Section: B Related Workmentioning

confidence: 99%

“…Instead of simply applying the Berry-Esséen theorem to the information spectrum term within the simplified CS-type bound in (57), we enlarge our inner bound by using a "time-sharing" variable T , which is independent of (X, Y ). This technique was also used for the multiple access channel (MAC) by Huang and Moulin [42]. Note that in the finite blocklength setting, the region R WAK (n, ε) does not have to be convex unlike in the asymptotic case; cf.…”

Section: A Achievable Second-order Coding Rates For the Wak Problemmentioning

confidence: 99%

See 1 more Smart Citation

Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

Watanabe

Kuzuoka

Tan

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the WynerAhlswede-Körner (WAK) problem of almost-lossless source coding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and (iii) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous non-asymptotic bounds on the error probability of the WAK, WZ and GP problems-in particular those derived by Verdú. Using our novel non-asymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esséen theorem to our new non-asymptotic bounds. Numerical results show that the second-order coding rates obtained using our non-asymptotic achievability bounds are superior to those obtained using existing finite blocklength bounds.

show abstract

“…Extension of the techniques therein to multiuser settings are quite challenging [4], [5], [6], [7], [8], [9], [10]. In this paper we derive a new outer region for multiple-access channels which essentially matches the inner region of [7].…”

Section: Introductionmentioning

confidence: 99%

A new metaconverse and outer region for finite-blocklength MACs

Moulin

2013

2013 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

Abstract-An outer rate region for the Discrete Memoryless Multiple Access Channel is given, and is shown to coincide with a recently derived inner rate region within a o(1/ √ n) term-except in the vicinity of the corner points of the Ahlswede-Liao pentagonal region, where the gap is O(1/ √ n). The derivation is based on a new metaconverse under the maximum error probability criterion and on strong large deviations for NeymanPearson tests.

show abstract

Finite blocklength coding for multiple access channels

Cited by 45 publications

References 4 publications

A random coding approach to Gaussian multiple access channels with finite blocklength

A random coding approach to Gaussian multiple access channels with finite blocklength

Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

A new metaconverse and outer region for finite-blocklength MACs

Contact Info

Product

Resources

About