𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized concatenation of convolutional codes

✍ Scribed by Bossert, Martin ;Dieterich, Hans ;Shavgulidze, Sergo

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
735 KB
Volume
7
Category
Article
ISSN
1124-318X

No coin nor oath required. For personal study only.

✦ Synopsis

Generalized concatenation of inner and outer convolutional codes is studied. The essential problem is the partitioning of the inner code. A construction procedure to obtain a suitable equivalent description for a given code is derived, which gives the best possible distances in the partitioned subcodes. The construction rule is illustrated with two examples. A small code is studied to emphasize the ideas of the construction and a large code, namely the satellite standard code, demonstrates the considerable gains in decoding performance when using generalized concatenation. Furthermore, the possibilities for iterative decoding are pointed out.

πŸ“œ SIMILAR VOLUMES

Convolutional coded generalized nonlinea
Convolutional coded generalized nonlinear CPM
✍ Ken-ichiro Shinoi; Gunawan Wibisono; Iwao Sasase πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 235 KB

Continuous phase modulation (CPM) is known for its attractive spectral properties. Furthermore, CPM has the property that the modulation signal maintains a constant envelope, so CPM is effective for satellite communications. Recently, generalized nonlinear CPM (GNCPM), which can achieve a larger min

Word correction by means of convolutiona
Word correction by means of convolutional codes
✍ Ph. Piret πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 278 KB

A class of word-correcting convolutional codes is described. By a geometric argument it is proved that the minimum word distance of these codes is as large as possible.