Construction of convolutional codes for sequential decoding

Daniel J. Costello · NASA STI Repository (National Aeronautics and Space Administration) · 1969

A broad look a t t h e problems of convolutional encoding and sequential decoding of d i g i t a l data f o r r e l i a b l e t r a n smission over a noisy channel i s presented.Various distance measures f o r convolutional encoders a r e c a r e f u l l y defined.A distance measure c a l l e d t h e f r e e distance, and introduced by Massey [9) , M c E l i e c e and Rumsey [lo] , and Neumann [ll] , i s shown t o be a more important parameter f o r codes used with sequential decoding than the convent i o n a l m i n i m u m distance.T h e notion of equivalent encoders i s c a r e f u l l y considered, and a new d e f i n i t i o n of encoder equivalence which preserves the distance p r o p e r t i e s of t h e encoder i s given.For those non-systematic encoders t h a t do not have a systema t i c equivalent which preserves distance p r o p e r t i e s , a method i s presented f o r converting t h e encoder t o a better systematic encoder.Also, general parity-check matrices and syndrome forming c i r c u i t s f o r non-systematic encoders of a l l r a t e s a r e presented.A new lower bound on f r e e distance i s given, and McEliece and Rumsey's [lo] upper bound i s generalized.a new lower bound on d e f i n i t e decoding minimum distance, f o r both systematic and non-systematic codes, i s derived, a s w e l l a s G i l b e r t lower bounds on feedback decoding minimum distance f o r two simply implemented subclasses of convolut i o n a l codes.F i n a l l y , some new methods f o r c a l c u l a t i n g t h e f r e e distance a r e discussed.A l s o , Construction algorithms a r e given which produce longer good codes than any previously known.A sequential decoding system was simulated f o r both t h e Gaussian and binary symmetric channels.Various codes w e r e tested over d i f f e re n t channels f o r t h e i r performance a s regards decoding proba b i l i t y of e r r o r and decoding speed (number of computations).A simply implemented non-systematic r a t e 1/2 code was found t o be f a r superior t o a l l o t h e r codes tested w i t h the same c o n s t r a i n t length.F i n a l l y , a technique introduced by McEliece [lo] f o r constructing good convolutional codes from known block codes was extended, and some convolutional codes discovered by Wyner [34] and Sullivan [ 3 5 1 w e r e discussed.

Cited by 28 works. Open-access PDF

Authors