NDLI: Upper Bounds on the Capacities of Noncontrollable Finite-State Channels With/Without Feedback

Content Provider	IEEE Xplore Digital Library
Author	Xiujie Huang Kavcic, A. Xiao Ma
Copyright Year	1963
Abstract	Noncontrollable finite-state channels (FSCs) are FSCs in which the channel inputs have no influence on the channel states, i.e., the channel states evolve freely. Since single-letter formulas for the channel capacities are rarely available for general noncontrollable FSCs, computable bounds are usually utilized to numerically bound the capacities. In this paper, we take the delayed channel state as part of the channel input and then define the directed information rate from the new channel input (including the source and the delayed channel state) sequence to the channel output sequence. With this technique, we derive a series of upper bounds on the capacities of noncontrollable FSCs with/without feedback. These upper bounds can be achieved by conditional Markov sources and computed by solving an average reward per stage stochastic control problem (ARSCP) with a compact state space and a compact action space. By showing that the ARSCP has a uniformly continuous reward function, we transform the original ARSCP into a finite-state and finite-action ARSCP that can be solved by a value iteration method. Under a mild assumption, the value iteration algorithm is convergent and delivers a near-optimal stationary policy and a numerical upper bound.
Sponsorship	IEEE Information Theory Society
Starting Page	5233
Ending Page	5247
Page Count	15
File Size	3938063
File Format	PDF
ISSN	00189448
Volume Number	58
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-08-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Power capacitors Upper bound Channel capacity Feedforward neural networks Information rates Markov processes Vectors upper bound Average reward per stage stochastic control problem (ARSCP) channel capacity delayed feedback directed information dynamic programming feedback capacity noncontrollable finite-state channel (FSC)
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods

Upper bounds on the capacities of non-controllable finite-state machine channels using dynamic programming methods

Upper bounds on the capacities of non-controllable finite-state machine channels using dynamic programming methods

Delayed feedback capacity of finite-state machine channels: upper bounds on the feedforward capacity

Upper bounds on the capacities of non-controllable finite-state channles using dynamic programming methods (2009)

Insertion/deletion channels: reduced-state lower bounds on channel capacities

A lower bound on the feedback capacity of finite-state ISI channels

Industry Consortium. (2004)

Capacity of Finite-State Channels with Time-Invariant Deterministic Feedback

Upper Bounds on the Capacities of Noncontrollable Finite-State Channels With/Without Feedback

Similar Documents

Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods

Upper bounds on the capacities of non-controllable finite-state machine channels using dynamic programming methods

Upper bounds on the capacities of non-controllable finite-state machine channels using dynamic programming methods

Delayed feedback capacity of finite-state machine channels: upper bounds on the feedforward capacity

Upper bounds on the capacities of non-controllable finite-state channles using dynamic programming methods (2009)

Insertion/deletion channels: reduced-state lower bounds on channel capacities

A lower bound on the feedback capacity of finite-state ISI channels

Industry Consortium. (2004)

Capacity of Finite-State Channels with Time-Invariant Deterministic Feedback

Upper Bounds on the Capacities of Noncontrollable Finite-State Channels With/Without Feedback