Please use this identifier to cite or link to this item:
|Title:||DISCRETE-TIME POISSON CHANNEL: CAPACITY AND SIGNALLING DESIGN|
|Department:||Electrical and Computer Engineering|
|Keywords:||Discrete-time Poisson;Channel Capacity;Signalling desing;intersatellite optical communication;capacity-achieving distribution;multiple access channel;Other Electrical and Computer Engineering;Other Electrical and Computer Engineering|
|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>|
|Description:||<h2 id="x-x-x-bp_categories-h"> </h2>|
|Appears in Collections:||Open Access Dissertations and Theses|
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.