Capacity of noisy, discrete memoryless channels under input constraints

Simple item page
buir.advisorArıkan, Erdal
dc.contributor.authorKaraşan, Ezhan
dc.date.accessioned2016-01-08T20:09:00Z
dc.date.available2016-01-08T20:09:00Z
dc.date.issued1990
dc.descriptionAnkara : The Department of Electrical and Electronics Engineering and Institute of Engineering and Sciences Bilkent Univ., 1990.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1990.en_US
dc.descriptionIncludes bibliographical references leaves 26en_US
dc.description.abstractIn this thesis work, we examine the capacity of discrete memoryless channels under input constraints. We consider a certain class of input-restricted channels for which constrained sequences can be modeled as outputs of a finite-state machine(FSM). No efficient algorithm is known for computing the capacity of such a channel. For the noiseless case, i.e., when the channel input letter and the corresponding output letter are identical, it is shown that [1] the channel capacity is the logarithm of the largest eigenvalue of the adjacency matrix of the state-transition diagram of the FSM generating the allowed channel input sequences. Furthermore, the probability distribution on the input sequences achieving the channel capacity is first-order markovian. Here, we discuss the noisy case. For a specific input-restricted channel, we show that unlike the noiseless case, the capacity is no longer achieved by a first-order distribution. We derive upper and lower bounds on the maximum rate achievable by a K-th order markovian distribution on the allowed input sequences. The computational results show that the second-order distribution does strictly better than the first-order distribution for this particular channel. A sequence of upper bounds on the capacity of an input-restricted channel is also given. We show that this sequence converges to the channel capacity. The numerical results clarify that markovian distribution may achieve rates close to the capacity for the channel considered in this work.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T20:09:00Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5)en
dc.description.statementofresponsibilityKaraşan, Ezhanen_US
dc.format.extentvii, 26 leavesen_US
dc.identifier.itemidBILKUTUPB003067
dc.identifier.urihttp://hdl.handle.net/11693/17297
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectChannel capacityen_US
dc.subjectMarkovian distributionen_US
dc.subjectFinite-state machineen_US
dc.subjectInput-restricted channelen_US
dc.subject.lccQA267 .K37 1990en_US
dc.subject.lcshMachine theory.en_US
dc.subject.lcshFormal languages.en_US
dc.titleCapacity of noisy, discrete memoryless channels under input constraintsen_US
dc.typeThesisen_US
thesis.degree.disciplineElectrical and Electronic Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B003067.pdf
Size:
943.98 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science