How to achieve the capacity of asymmetric channels

M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.


Journal Article | Published | English
Author
; ;
Abstract
We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances in coding for symmetric channels help provide more efficient solutions for the asymmetric case. We consider, in more detail, three basic coding paradigms. The first one is Gallager's scheme that consists of concatenating a linear code with a non-linear mapping so that the input distribution can be appropriately shaped. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Furthermore, we derive a scaling law between the gap to capacity, the cardinality of the input and output alphabets, and the required size of the mapper. The second one is an integrated scheme in which the code is used both for source coding, in order to create codewords distributed according to the capacity-achieving input distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates the two tasks of source coding and channel coding by a chaining construction that binds together several codewords. We present conditions for the source code and the channel code, and we describe how to combine any source code with any channel code that fulfill those conditions, in order to provide capacity-achieving schemes for asymmetric channels. In particular, we show that polar codes, spatially coupled codes, and homophonic codes are suitable as basic building blocks of the proposed coding strategy. Rather than focusing on the exact details of the schemes, the purpose of this tutorial is to present different coding techniques that can then be implemented with many variants. There is no absolute winner and, in order to understand the most suitable technique for a specific application scenario, we provide a detailed comparison that takes into account several performance metrics.
Publishing Year
Date Published
2018-05-01
Journal Title
IEEE Transactions on Information Theory
Volume
64
Issue
5
Page
3371-3393
IST-REx-ID

Cite this

Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 2018;64(5):3371-3393. doi:10.1109/tit.2018.2789885
Mondelli, M., Hassani, H., & Urbanke, R. (2018). How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory, 64(5), 3371–3393. https://doi.org/10.1109/tit.2018.2789885
Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory 64, no. 5 (2018): 3371–93. https://doi.org/10.1109/tit.2018.2789885.
M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric channels,” IEEE Transactions on Information Theory, vol. 64, no. 5, pp. 3371–3393, 2018.
Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 64(5), 3371–3393.
Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory, vol. 64, no. 5, IEEE, 2018, pp. 3371–93, doi:10.1109/tit.2018.2789885.

Link(s) to Main File(s)
Access Level
OA Open Access
Material in IST:
Earlier Version

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1406.7373

Search this title in

Google Scholar