On quantum limit of optical communications: Concatenated codes and joint-detection receivers
Author(s)
Guha, Saikat; Dutton, Zachary; Shapiro, Jeffrey H.
DownloadShapiro_On quantum limit.pdf (2.430Mb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
When classical information is sent over a channel with quantum-state modulation alphabet, such as the free-space optical (FSO) channel, attaining the ultimate (Holevo) limit to channel capacity requires the receiver to make joint measurements over long codeword blocks. In recent work, we showed a receiver for a pure-state channel that can attain the ultimate capacity by applying a single-shot optical (unitary) transformation on the received codeword state followed by simultaneous (but separable) projective measurements on the single-modulation-symbol state spaces. In this paper, we study the ultimate tradeoff between photon efficiency and spectral efficiency for the FSO channel. Based on our general results for the pure-state quantum channel, we show some of the first concrete examples of codes and laboratory-realizable joint-detection optical receivers that can achieve fundamentally higher (superadditive) channel capacity than receivers that physically detect each modulation symbol one at a time, as is done by all conventional (coherent or direct-detection) optical receivers.
Date issued
2011-10Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings on the IEEE International Symposium on Information Theory Proceedings (ISIT), 2011
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Guha, Saikat, Zachary Dutton, and Jeffrey H. Shapiro. “On Quantum Limit of Optical Communications: Concatenated Codes and Joint-detection Receivers.” IEEE International Symposium on Information Theory Proceedings (ISIT), 2011. 274–278.
Version: Author's final manuscript
ISBN
978-1-4577-0594-6
978-1-4577-0596-0
ISSN
2157-8095