On the discreteness of capacity-achieving distributions for fading and signal-dependent noise channels with amplitude-limited inputs

Simple item page
buir.contributor.authorDuman, Tolga
dc.citation.epage1177en_US
dc.citation.issueNumber2en_US
dc.citation.spage1163en_US
dc.citation.volumeNumber64en_US
dc.contributor.authorElmoslimany A.en_US
dc.contributor.authorDuman, Tolgaen_US
dc.date.accessioned2019-02-21T16:05:37Z
dc.date.available2019-02-21T16:05:37Z
dc.date.issued2018en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe address the problem of finding the capacity of two classes of channels with amplitude-limited inputs. The first class is frequency flat fading channels with an arbitrary (but finite support) channel gain with the channel state information available only at the receiver side; while the second one we consider is the class of additive noise channels with signal-dependent Gaussian noise. We show that for both channel models and under some regularity conditions, the capacity-achieving distribution is discrete with a finite number of mass points. Furthermore, finding the capacity-achieving distribution turns out to be a finite-dimensional optimization problem, and efficient numerical algorithms can be developed using standard optimization techniques to compute the channel capacity. We demonstrate our findings via several examples. In particular, we present an example for a block fading channel where the channel gain follows a truncated Rayleigh distribution, and two instances of signal-dependent noise that are used in the literature of magnetic recording and optical communication channels.
dc.description.provenanceMade available in DSpace on 2019-02-21T16:05:37Z (GMT). No. of bitstreams: 1 Bilkent-research-paper.pdf: 222869 bytes, checksum: 842af2b9bd649e7f548593affdbafbb3 (MD5) Previous issue date: 2018en
dc.description.sponsorshipManuscript received June 5, 2016; revised March 11, 2017 and July 11, 2017; accepted September 20, 2017. Date of publication October 17, 2017; date of current version January 18, 2018. This work was supported in part by the National Science Foundation under Contract NSF-ECCS 1102357 and in part by the EC Marie Curie Career Integration under Grant PCIG12-GA-2012-334213. This paper was presented at the 2016 IEEE International Symposium on Information Theory.
dc.identifier.doi10.1109/TIT.2017.2763818
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/11693/50263
dc.language.isoEnglish
dc.publisherInstitute of Electrical and Electronics Engineers
dc.relation.isversionofhttps://doi.org/10.1109/TIT.2017.2763818
dc.relation.projectNational Science Foundation, NSF: NSF-ECCS 1102357 - PCIG12-GA-2012-334213 - IEEE Foundation, IEEE
dc.source.titleIEEE Transactions on Information Theoryen_US
dc.subjectAmplitude-limited inputsen_US
dc.subjectChannel capacityen_US
dc.subjectFading channelsen_US
dc.subjectPeak power constraintsen_US
dc.subjectSignal-dependent noiseen_US
dc.titleOn the discreteness of capacity-achieving distributions for fading and signal-dependent noise channels with amplitude-limited inputsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
On-the-Discreteness-of-Capacity-Achieving-Distributions-for-Fading-and-Signal-Dependent-Noise-Channels-With-Amplitude-Limited-Inputs.pdf
Size:
652.83 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering