DocumentCode :
831209
Title :
Channel capacity of (O, G/I) codes
Author :
Stefanovic, M.C. ; Vasic, B.V.
Author_Institution :
Nis Univ., Yugoslavia
Volume :
29
Issue :
2
fYear :
1993
Firstpage :
243
Lastpage :
245
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.
Keywords :
block codes; channel capacity; constraint theory; eigenvalues and eigenfunctions; magnetic recording; (O, G/I) codes; (O, G/I) constrained systems; Markov chain model; Viterbi algorithm; channel capacities; code efficiency; codeword lengths; critical path memory length; eigenvalue; eigenvector components; high density magnetic recording; partial response signalling; timing parameter;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19930167
Filename :
184614
Link To Document :
بازگشت