Low-complexity channel resolvability codes for the symmetric multiple-access channel

Remi A. Chou, Matthieu R. Bloch, Joerg Kliewer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

We investigate channel resolvability for the l-user multiple-access channel (MAC) with two different families of encoders. The first family consists of invertible extractors, while the second one consists of injective group homomorphisms, and was introduced by Hayashi for the point-to-point channel resolvability. The main benefit of these two families is to provide explicit low-complexity channel resolvability codes in the case of symmetric MACs. Specifically, we provide two examples of families of invertible extractors suitable for MAC resolvability with uniform input distributions, one based on finite-field multiplication, which can be implemented in O(n log n) for a limited range of values of the encoding blocklength n, and a second based on modified Toeplitz matrices, which can be implemented in O(n log n) for a wider range of values of n. We also provide an example of family of injective group homomorphisms based on finite-field multiplication suitable for MAC resolvability with uniform input distributions, which can be implemented in O(n log n) for some values of n.

Original languageEnglish (US)
Title of host publication2014 IEEE Information Theory Workshop, ITW 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages466-470
Number of pages5
ISBN (Electronic)9781479959990
DOIs
StatePublished - Dec 1 2014
Event2014 IEEE Information Theory Workshop, ITW 2014 - Hobart, Australia
Duration: Nov 2 2014Nov 5 2014

Publication series

Name2014 IEEE Information Theory Workshop, ITW 2014

Other

Other2014 IEEE Information Theory Workshop, ITW 2014
Country/TerritoryAustralia
CityHobart
Period11/2/1411/5/14

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Cite this