Capacity of a certain asymmetrical binary channel with finite memory

The capacity of a certain asymmetrical binary channel is studied under the following conditions. 1) Blocks of equal numbers of binary digits are used as the transmitting symbols. 2) The channel resumes its quiescent state at the beginning of each block. 3) The memory of the channel is characterized...

Full description

Saved in:
Bibliographic Details
Published in:I.R.E. transactions on information theory 1958-12, Vol.4 (4), p.152-159
Main Author: Chang, Sze-Hou
Format: Article
Language:English
Subjects:
Capacity planning
Channel capacity
Educational institutions
Entropy
Finite element analysis
Noise
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The capacity of a certain asymmetrical binary channel is studied under the following conditions. 1) Blocks of equal numbers of binary digits are used as the transmitting symbols. 2) The channel resumes its quiescent state at the beginning of each block. 3) The memory of the channel is characterized by the dependence of the noise probabilities for each digit upon the preceding digit or digits in the same block. It is shown that, by means of simple rules and with the aid of a single set of curves or a table, the calculation of the capacity can be reduced to a routine process.
ISSN:0096-1000
2168-2712
DOI:10.1109/IRETIT.1958.6741949