Channel capacity of (O, G/I) codes

M. C. Stefanovic, Bane V Vasic

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The tables of channel capacities of the (O, G/I) constrained systems are presented. It is shown that for the given timing parameter G there exists a critical path memory length of the Viterbi algorithm, Icr, over which it is not possible to improve the code efficiency if data and codeword lengths are limited. These maximal code efficiencies for practically interesting values of G are listed.

Original languageEnglish (US)
Pages (from-to)243-245
Number of pages3
JournalElectronics Letters
Volume29
Issue number2
StatePublished - Jan 1 1993
Externally publishedYes

Fingerprint

Channel capacity
Viterbi algorithm
Data storage equipment

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Stefanovic, M. C., & Vasic, B. V. (1993). Channel capacity of (O, G/I) codes. Electronics Letters, 29(2), 243-245.

Channel capacity of (O, G/I) codes. / Stefanovic, M. C.; Vasic, Bane V.

In: Electronics Letters, Vol. 29, No. 2, 01.01.1993, p. 243-245.

Research output: Contribution to journalArticle

Stefanovic, MC & Vasic, BV 1993, 'Channel capacity of (O, G/I) codes', Electronics Letters, vol. 29, no. 2, pp. 243-245.
Stefanovic MC, Vasic BV. Channel capacity of (O, G/I) codes. Electronics Letters. 1993 Jan 1;29(2):243-245.
Stefanovic, M. C. ; Vasic, Bane V. / Channel capacity of (O, G/I) codes. In: Electronics Letters. 1993 ; Vol. 29, No. 2. pp. 243-245.
@article{2fbba93bda954da5a02ccb356d0c0e80,
title = "Channel capacity of (O, G/I) codes",
abstract = "The tables of channel capacities of the (O, G/I) constrained systems are presented. It is shown that for the given timing parameter G there exists a critical path memory length of the Viterbi algorithm, Icr, over which it is not possible to improve the code efficiency if data and codeword lengths are limited. These maximal code efficiencies for practically interesting values of G are listed.",
author = "Stefanovic, {M. C.} and Vasic, {Bane V}",
year = "1993",
month = "1",
day = "1",
language = "English (US)",
volume = "29",
pages = "243--245",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "2",

}

TY - JOUR

T1 - Channel capacity of (O, G/I) codes

AU - Stefanovic, M. C.

AU - Vasic, Bane V

PY - 1993/1/1

Y1 - 1993/1/1

N2 - The tables of channel capacities of the (O, G/I) constrained systems are presented. It is shown that for the given timing parameter G there exists a critical path memory length of the Viterbi algorithm, Icr, over which it is not possible to improve the code efficiency if data and codeword lengths are limited. These maximal code efficiencies for practically interesting values of G are listed.

AB - The tables of channel capacities of the (O, G/I) constrained systems are presented. It is shown that for the given timing parameter G there exists a critical path memory length of the Viterbi algorithm, Icr, over which it is not possible to improve the code efficiency if data and codeword lengths are limited. These maximal code efficiencies for practically interesting values of G are listed.

UR - http://www.scopus.com/inward/record.url?scp=0027306917&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027306917&partnerID=8YFLogxK

M3 - Article

VL - 29

SP - 243

EP - 245

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 2

ER -