Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Ultimate capacity of a linear time-invariant bosonic channel

Ultimate capacity of a linear time-invariant bosonic channel

Thumbnail Image
Download
Name

PhysRevA.93.032342.pdf

Size

440.26 KB

Format

Adobe PDF

Checksum (MD5)

78619fcbcc485c5f0844705d15258dca

Download all files submitted through automated deposit
PhysRevA.93.032342-mets.zip (348.24 KB)
Author(s)
Roy Bardhan, Bhaskar
•
Shapiro, Jeffrey H.
Date Issued
March 2016
Journal
Physical Review A
Publisher
American Physical Society
Citation
Roy Bardhan, Bhaskar, and Jeffrey H. Shapiro. “Ultimate Capacity of a Linear Time-Invariant Bosonic Channel.” Physical Review A 93, no. 3 (March 31, 2016). © 2016 American Physical Society
Version
Final published version
Abstract
We determine the ultimate classical information capacity of a linear time-invariant bosonic channel with additive phase-insensitive Gaussian noise. This channel can model fiber-optic communication at power levels below the threshold for significant nonlinear effects. We provide a general continuous-time result that gives the ultimate capacity for such a channel operating in the quasimonochromatic regime under an average power constraint. This ultimate capacity is compared with corresponding results for heterodyne and homodyne detection over the same channel.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/102080
DOI of Published Version
https://doi.org/10.1103/PhysRevA.93.032342
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.