|Title:|| CONSTRUCTION OF
ENCODERS WITH SMALL DECODING LOOK-AHEAD FOR INPUT-CONSTRAINED
|Authors:|| J.J. Ashley, B.H. Marcus and R.M. Roth
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 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-ratep: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 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. 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 sliding-block decoder with look-ahead \Leq 2|V|+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/cgi-bin/tr-info.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
Computer science department, Technion