Minimal Trellis Modules and Equivalent Convolutional Codes
Journal
IEEE Transactions on Information Theory
Journal Volume
52
Journal Issue
8
Pages
3738-3746
Date Issued
2006-08
Author(s)
Abstract
In this correspondence, it is shown that some convolutional codes with distinct memory sizes of minimal encoders are equivalent in the sense that the minimal trellises of these codes are the shifted versions of one another. For an (n,k) binary convolutional code, the weight spectrum obtained from the minimal trellis may be slightly different from that obtained from the conventional code trellis with n-bit branches. Code search is conducted to find some good (n,n-1) binary convolutional codes. Bounds on the trellis complexity, measured by the number of states and the number of branches in the minimal trellis module, of any convolutional code and its equivalent codes are also derived. © 2006 IEEE.
Subjects
Convolutional codes; Error-correction coding; Minimal trellis; Minimal trellis module; Trellis complexity
Other Subjects
Binary codes; Computational complexity; Convolutional codes; Error correction; Trellis codes; Minimal trellis module; Trellis complexity; Weight spectrum; Encoding (symbols)
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
556.pdf
Size
439.98 KB
Format
Adobe PDF
Checksum
(MD5):1667d41a59023d14706497f672b812ba