Abstract

This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the better one is revealed when channel inclusion holds between two DMCs. For the exploitation of this sparsity, an effective iterative algorithm is established based on modifying the orthogonal matching pursuit algorithm.

Original languageEnglish (US)
Article number6623108
Pages (from-to)72-83
Number of pages12
JournalIEEE Transactions on Information Theory
Volume60
Issue number1
DOIs
StatePublished - Jan 2014

Fingerprint

inclusion
general conditions
Convex optimization
equivalence
exploitation
symbol

Keywords

  • Channel inclusion
  • convex optimization
  • majorization
  • partial ordering

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Analytical and numerical characterizations of shannon ordering for discrete memoryless channels. / Zhang, Yuan; Tepedelenlioglu, Cihan.

In: IEEE Transactions on Information Theory, Vol. 60, No. 1, 6623108, 01.2014, p. 72-83.

Research output: Contribution to journalArticle

@article{a7afbf93c4f549f595a857e8554f2de0,
title = "Analytical and numerical characterizations of shannon ordering for discrete memoryless channels",
abstract = "This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the better one is revealed when channel inclusion holds between two DMCs. For the exploitation of this sparsity, an effective iterative algorithm is established based on modifying the orthogonal matching pursuit algorithm.",
keywords = "Channel inclusion, convex optimization, majorization, partial ordering",
author = "Yuan Zhang and Cihan Tepedelenlioglu",
year = "2014",
month = "1",
doi = "10.1109/TIT.2013.2284771",
language = "English (US)",
volume = "60",
pages = "72--83",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Analytical and numerical characterizations of shannon ordering for discrete memoryless channels

AU - Zhang, Yuan

AU - Tepedelenlioglu, Cihan

PY - 2014/1

Y1 - 2014/1

N2 - This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the better one is revealed when channel inclusion holds between two DMCs. For the exploitation of this sparsity, an effective iterative algorithm is established based on modifying the orthogonal matching pursuit algorithm.

AB - This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the better one is revealed when channel inclusion holds between two DMCs. For the exploitation of this sparsity, an effective iterative algorithm is established based on modifying the orthogonal matching pursuit algorithm.

KW - Channel inclusion

KW - convex optimization

KW - majorization

KW - partial ordering

UR - http://www.scopus.com/inward/record.url?scp=84891536438&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891536438&partnerID=8YFLogxK

U2 - 10.1109/TIT.2013.2284771

DO - 10.1109/TIT.2013.2284771

M3 - Article

AN - SCOPUS:84891536438

VL - 60

SP - 72

EP - 83

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

M1 - 6623108

ER -