CHANNEL CAPACITY OF (O, G I) CODES

Authors
STEFANOVIC MC VASIC BV
Citation
Mc. Stefanovic et Bv. Vasic, CHANNEL CAPACITY OF (O, G I) CODES, Electronics Letters, 29(2), 1993, pp. 243-245
Citations number
6
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Electronics Letters → ACNP
ISSN journal
00135194
Volume
29
Issue
2
Year of publication
1993
Pages
243 - 245
Database
ISI
SICI code
0013-5194(1993)29:2<243:CCO(GI>2.0.ZU;2-B
Abstract
The tables of channel capacities of the (O, G/I) constrained systems a re presented. It is shown that for the given timing parameter G them e xists a critical path memory length of the Viterbi algorithm, I(cr), o ver which it is not possible to improve the code efficiency if data an d codeword lengths are limited. These maximal code efficiencies for pr actically interesting values of G are listed.