Imperial College London
Portrait Picture

Dr Mahdi Cheraghchi

Faculty of Engineering, Department of Computing

Honorary Senior Lecturer
 
 
 
//

Contact

 

m.cheraghchi Website CV

 
 
//

Location

 

353ACE ExtensionSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Cheraghchi:2018:10.1109/ISIT.2018.8437514,
author = {Cheraghchi, M and Ribeiro, J},
doi = {10.1109/ISIT.2018.8437514},
pages = {1769--1773},
publisher = {IEEE},
title = {Improved capacity upper bounds for the discrete-time poisson channel},
url = {http://dx.doi.org/10.1109/ISIT.2018.8437514},
year = {2018}
}
Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the average-power constraint does not approach zero was due to Martinez (JOSA B, 2007), which we re-derive as a special case of our framework. Furthermore, we instantiate our framework to obtain a closed-form bound that noticeably improves the result of Martinez everywhere.
AU  - Cheraghchi,M
AU  - Ribeiro,J
DO  - 10.1109/ISIT.2018.8437514
EP  - 1773
PB  - IEEE
PY  - 2018///
SN  - 2157-8095
SP  - 1769
TI  - Improved capacity upper bounds for the discrete-time poisson channel
UR  - http://dx.doi.org/10.1109/ISIT.2018.8437514
UR  - http://hdl.handle.net/10044/1/63212
ER  -
Download