Channel capacity of (O, G/l) codes

M. Stefanović; B. V. Vasić

doi:10.1049/el:19930167

Channel capacity of (O, G/l) codes

M. Stefanović, B. V. Vasić

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

The tables of channel capacities of the (0, 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, I_cr, 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 language	English (US)
Pages (from-to)	243-245
Number of pages	3
Journal	Electronics Letters
Volume	29
Issue number	2
DOIs	https://doi.org/10.1049/el:19930167
State	Published - Jan 1993
Externally published	Yes

Keywords

Codes and coding
Digital communication systems
Partial response signalling

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1049/el:19930167

Cite this

@article{2fbba93bda954da5a02ccb356d0c0e80,

title = "Channel capacity of (O, G/l) codes",

abstract = "The tables of channel capacities of the (0, 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.",

keywords = "Codes and coding, Digital communication systems, Partial response signalling",

author = "M. Stefanovi{\'c} and Vasi{\'c}, {B. V.}",

year = "1993",

month = jan,

doi = "10.1049/el:19930167",

language = "English (US)",

volume = "29",

pages = "243--245",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley & Sons Inc.",

number = "2",

}

TY - JOUR

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

AU - Stefanović, M.

AU - Vasić, B. V.

PY - 1993/1

Y1 - 1993/1

N2 - The tables of channel capacities of the (0, 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 (0, 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.

KW - Codes and coding

KW - Digital communication systems

KW - Partial response signalling

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

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

U2 - 10.1049/el:19930167

DO - 10.1049/el:19930167

M3 - Article

AN - SCOPUS:0027306917

SN - 0013-5194

VL - 29

SP - 243

EP - 245

JO - Electronics Letters

JF - Electronics Letters

IS - 2

ER -

Channel capacity of (O, G/l) codes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this