|
|
|
|
LEADER |
02034 am a22002053u 4500 |
001 |
73525 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Guha, Saikat
|e author
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
100 |
1 |
0 |
|a Shapiro, Jeffrey H.
|e contributor
|
700 |
1 |
0 |
|a Dutton, Zachary
|e author
|
700 |
1 |
0 |
|a Shapiro, Jeffrey H.
|e author
|
245 |
0 |
0 |
|a On quantum limit of optical communications: Concatenated codes and joint-detection receivers
|
260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2012-10-01T18:51:45Z.
|
856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/73525
|
520 |
|
|
|a 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.
|
520 |
|
|
|a United States. Defense Advanced Research Projects Agency. Information in a Photon Program (Contract # HR0011-10-C-0159)
|
546 |
|
|
|a en_US
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t Proceedings on the IEEE International Symposium on Information Theory Proceedings (ISIT), 2011
|