By Topic

Lower bounds on the anticipation of encoders for input-constrained channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ruckenstein, G. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; Roth, R.M.

An input-constrained channel S is defined as the set of words generated by a finite labeled directed graph. It is shown that every finite-state encoder with finite anticipation (i.e., with finite decoding delay) for S can be obtained through state-splitting rounds applied to some deterministic graph presentation of S, followed by a reduction of equivalent states. Furthermore, each splitting round can be restricted to follow a certain prescribed structure. This result, in turn, provides a necessary and sufficient condition on the existence of finite-state encoders for S with a given rate p:q and a given anticipation a. A second condition is derived on the existence of such encoders; this condition is only necessary, but it applies to every deterministic graph presentation of S. Based on these two conditions, lower bounds are derived on the anticipation of finite-state encoders. Those lower bounds improve on previously known bounds and, in particular, they are shown to be tight for the common rates used for the (1,7)-runlength-limited (RLL) and (2,7)-RLL constraints

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 5 )