DocumentCode
1605627
Title
An upper bound on the capacity of channels with memory and constraint input
Author
Vontobel, Pascal O. ; Arnold, Dieter M.
Author_Institution
Lab. for Signal & Inf. Process., Eidgenossische Tech. Hochschule, Zurich, Switzerland
fYear
2001
fDate
6/23/1905 12:00:00 AM
Firstpage
147
Lastpage
149
Abstract
A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels. Numerical results are provided for selected channels having memory and constraint (binary) input
Keywords
channel capacity; information theory; channel capacity; constraint input; finite-input memoryless channels; memory channels; numerical results; time-invariant finite state channels; upper bounds; AWGN; Additive white noise; Channel capacity; Gaussian noise; Information rates; Integrated circuit noise; Laboratories; Memory management; Power capacitors; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2001. Proceedings. 2001 IEEE
Conference_Location
Cairns, Qld.
Print_ISBN
0-7803-7119-4
Type
conf
DOI
10.1109/ITW.2001.955166
Filename
955166
Link To Document