By Topic

Construction of encoders with small decoding look-ahead 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
$31 $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

3 Author(s)
Ashley, J.J. ; Res. Div., IBM Almaden Res. Center, San Jose, CA, USA ; Marcus, B.H. ; Roth, R.M.

An input-constrained channel is defined as the set S of finite sequences generated by a finite labeled directed graph which defines the channel. A construction based on a result of Adler, Goodwyn, and Weiss (1977) is presented for finite-state encoders for input-constrained channels. Let G=(V, E) denote a smallest deterministic presentation of S. For a given input-constrained channel S and for any rate p: q up to the capacity c(S) of S, the construction provides finite-state encoders of fixed-rate p: q that can be implemented in hardware with a number of gates which is at most polynomially large in |V|. When p/q<c(S), the encoders have order ⩽12|V|, namely, they can be decoded by looking ahead at up to 12|V| symbols, thus improving slightly on the order of previously known constructions. A stronger result holds when p/q⩽c(S)-((log2, e)/(2Pq)) and S is of finite memory, where the encoders can. Be decoded by a sliding-block decoder with look-ahead ⩽2|V|+1

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 1 )