TR#:  CS0776 
Class:  CS 
Title:  CONSTRUCTION OF
ENCODERS WITH SMALL DECODING LOOKAHEAD FOR INPUTCONSTRAINED
CHANNELS. 
Authors:  J.J. Ashley, B.H. Marcus and R.M. Roth 
CS0776.pdf  
Abstract: 
An inputconstrained 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 is presented for finitestate encoders for inputconstrained channels. Let G = (V,E) denote a smallest deterministic presentation of S. For a given inputconstrained channel S and for any rate p:q up to the capacity C(S) of S, the construction provides finitestate encoders of fixedratep: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 \Leq 12V, namely, they can be decoded by looking ahead at up to 12V symbols, thus improving slightly on the order of previouslyknown constructions. Furthermore, when P/Q \Leq C(S)  ((\Log_2 E)/(2^P Q)) and S is of finite memory, the encoders can be decoded by a slidingblock decoder with lookahead \Leq 2V+1.

Copyright  The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information 
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgibin/trinfo.cgi/1993/CS/CS0776), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1993
To the main CS technical reports page