dc.contributor.advisor | Arıkan, Erdal | |
dc.contributor.author | Karaşan, Ezhan | |
dc.date.accessioned | 2016-01-08T20:09:00Z | |
dc.date.available | 2016-01-08T20:09:00Z | |
dc.date.issued | 1990 | |
dc.identifier.uri | http://hdl.handle.net/11693/17297 | |
dc.description | Ankara : The Department of Electrical and Electronics Engineering and Institute of Engineering and Sciences Bilkent Univ., 1990. | en_US |
dc.description | Thesis (Master's) -- Bilkent University, 1990. | en_US |
dc.description | Includes bibliographical references leaves 26 | en_US |
dc.description.abstract | In 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.statementofresponsibility | Karaşan, Ezhan | en_US |
dc.format.extent | vii, 26 leaves | en_US |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Channel capacity | en_US |
dc.subject | Markovian distribution | en_US |
dc.subject | Finite-state machine | en_US |
dc.subject | Input-restricted channel | en_US |
dc.subject.lcc | QA267 .K37 1990 | en_US |
dc.subject.lcsh | Machine theory. | en_US |
dc.subject.lcsh | Formal languages. | en_US |
dc.title | Capacity of noisy, discrete memoryless channels under input constraints | en_US |
dc.type | Thesis | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.publisher | Bilkent University | en_US |
dc.description.degree | M.S. | en_US |
dc.identifier.itemid | BILKUTUPB003067 | |