Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/13276
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hranilovic, Steve | en_US |
dc.contributor.advisor | Chen, Jun | en_US |
dc.contributor.author | Cao, Jihai | en_US |
dc.date.accessioned | 2014-06-18T17:03:29Z | - |
dc.date.available | 2014-06-18T17:03:29Z | - |
dc.date.created | 2013-08-26 | en_US |
dc.date.issued | 2013-10 | en_US |
dc.identifier.other | opendissertations/8097 | en_US |
dc.identifier.other | 9134 | en_US |
dc.identifier.other | 4500708 | en_US |
dc.identifier.uri | http://hdl.handle.net/11375/13276 | - |
dc.description | <h2 id="x-x-x-bp_categories-h"> </h2> | en_US |
dc.description.abstract | <p>The discrete-time Poisson (DTP) channel models a wide range of optical communication channels. The channel capacity and capacity-achieving distributions are generally unknown. This thesis addresses system design of DTP channels and presents novel contributions to the capacity of DTP channel, properties and closed-form expression of the capacity-achieving distribution under peak and average constraints, signalling design, and sum-capacity-achieving distributions of DTP multiple access channel (MAC) with peak amplitude constraints.</p> <p>Two algorithms are developed to compute the channel capacity of DTP channel as well as the capacity-achieving distribution with average and peak amplitude constraints. Tight lower bounds based on input distributions with simple forms are presented. Non-uniform signalling algorithms to achieve the channel capacity are also demonstrated. Fundamental properties of capacity-achieving distributions for DTP channels are established. Furthermore, necessary and sufficient conditions on the optimality of binary distributions are presented. Analytical expressions for the capacity-achieving distributions of the DTP channel are derived when there is no dark current and when the dark current is large enough. A two-user DTP multiple access channel model is proposed and it is shown that the sum-capacity-achieving distributions under peak amplitude constraints are discrete with a finite number of mass points.</p> | en_US |
dc.subject | Discrete-time Poisson | en_US |
dc.subject | Channel Capacity | en_US |
dc.subject | Signalling desing | en_US |
dc.subject | intersatellite optical communication | en_US |
dc.subject | capacity-achieving distribution | en_US |
dc.subject | multiple access channel | en_US |
dc.subject | Other Electrical and Computer Engineering | en_US |
dc.subject | Other Electrical and Computer Engineering | en_US |
dc.title | DISCRETE-TIME POISSON CHANNEL: CAPACITY AND SIGNALLING DESIGN | en_US |
dc.type | thesis | en_US |
dc.contributor.department | Electrical and Computer Engineering | en_US |
dc.description.degree | Doctor of Philosophy (PhD) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 1.51 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.