An information theoretic perspective over an extremal entropy inequality

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

Abstract

This paper focuses on developing an alternative proof for an extremal entropy inequality, originally presented in [1]. The proposed alternative proof is simply based on the classical entropy power inequality and the data processing inequality. Compared with the proofs in [1], the proposed alternative proof is simpler, more direct, and information theoretic, and presents the advantage of providing the structure of the optimal solution covariance matrix. Also, the proposed proof might also be used as a novel method to address applications such as calculation of the vector Gaussian broadcast channel capacity, establishing a lower bound for the achievable rate of distributed source coding with a single quadratic distortion constraint, and the secrecy capacity of the Gaussian wire-tap channel.

Original languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages1266-1270
Number of pages5
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 1 Jul 20126 Jul 2012

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
CountryUnited States
CityCambridge, MA
Period1/7/126/7/12

Fingerprint

Entropy Inequality
Entropy
Channel capacity
Covariance matrix
Wire
Alternatives
Distributed Source Coding
Broadcast Channel
Channel Capacity
Optimal Solution
Lower bound

ASJC Scopus subject areas

  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Park, S., Serpedin, E., & Qaraqe, K. (2012). An information theoretic perspective over an extremal entropy inequality. In 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012 (pp. 1266-1270). [6283060] https://doi.org/10.1109/ISIT.2012.6283060

An information theoretic perspective over an extremal entropy inequality. / Park, Sangwoo; Serpedin, Erchin; Qaraqe, Khalid.

2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. p. 1266-1270 6283060.

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

Park, S, Serpedin, E & Qaraqe, K 2012, An information theoretic perspective over an extremal entropy inequality. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6283060, pp. 1266-1270, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/7/12. https://doi.org/10.1109/ISIT.2012.6283060
Park S, Serpedin E, Qaraqe K. An information theoretic perspective over an extremal entropy inequality. In 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. p. 1266-1270. 6283060 https://doi.org/10.1109/ISIT.2012.6283060
Park, Sangwoo ; Serpedin, Erchin ; Qaraqe, Khalid. / An information theoretic perspective over an extremal entropy inequality. 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. pp. 1266-1270
@inproceedings{a08709f3f7164504b5f6329dd2c0d7a7,
title = "An information theoretic perspective over an extremal entropy inequality",
abstract = "This paper focuses on developing an alternative proof for an extremal entropy inequality, originally presented in [1]. The proposed alternative proof is simply based on the classical entropy power inequality and the data processing inequality. Compared with the proofs in [1], the proposed alternative proof is simpler, more direct, and information theoretic, and presents the advantage of providing the structure of the optimal solution covariance matrix. Also, the proposed proof might also be used as a novel method to address applications such as calculation of the vector Gaussian broadcast channel capacity, establishing a lower bound for the achievable rate of distributed source coding with a single quadratic distortion constraint, and the secrecy capacity of the Gaussian wire-tap channel.",
author = "Sangwoo Park and Erchin Serpedin and Khalid Qaraqe",
year = "2012",
doi = "10.1109/ISIT.2012.6283060",
language = "English",
isbn = "9781467325790",
pages = "1266--1270",
booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

}

TY - GEN

T1 - An information theoretic perspective over an extremal entropy inequality

AU - Park, Sangwoo

AU - Serpedin, Erchin

AU - Qaraqe, Khalid

PY - 2012

Y1 - 2012

N2 - This paper focuses on developing an alternative proof for an extremal entropy inequality, originally presented in [1]. The proposed alternative proof is simply based on the classical entropy power inequality and the data processing inequality. Compared with the proofs in [1], the proposed alternative proof is simpler, more direct, and information theoretic, and presents the advantage of providing the structure of the optimal solution covariance matrix. Also, the proposed proof might also be used as a novel method to address applications such as calculation of the vector Gaussian broadcast channel capacity, establishing a lower bound for the achievable rate of distributed source coding with a single quadratic distortion constraint, and the secrecy capacity of the Gaussian wire-tap channel.

AB - This paper focuses on developing an alternative proof for an extremal entropy inequality, originally presented in [1]. The proposed alternative proof is simply based on the classical entropy power inequality and the data processing inequality. Compared with the proofs in [1], the proposed alternative proof is simpler, more direct, and information theoretic, and presents the advantage of providing the structure of the optimal solution covariance matrix. Also, the proposed proof might also be used as a novel method to address applications such as calculation of the vector Gaussian broadcast channel capacity, establishing a lower bound for the achievable rate of distributed source coding with a single quadratic distortion constraint, and the secrecy capacity of the Gaussian wire-tap channel.

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

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

U2 - 10.1109/ISIT.2012.6283060

DO - 10.1109/ISIT.2012.6283060

M3 - Conference contribution

SN - 9781467325790

SP - 1266

EP - 1270

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

ER -