Searching for high-rate convolutional codes via binary syndrome trellises

Summary, in English

Rate R=(c-1)/c convolutional codes of constraint length nu can be represented by conventional syndrome trellises with a state complexity of s=nu or by binary syndrome trellises with a state complexity of s=nu or s=nu+1, which corresponds to at most 2^s states at each trellis level. It is shown that if the parity-check polynomials fulfill certain conditions, there exist binary syndrome trellises with optimum state complexity s=nu.



The BEAST is modified to handle parity-check matrices and used to generate code tables for optimum free distance rate R=(c-1)/c, c=3,4,5, convolutional codes for conventional syndrome trellises and binary syndrome trellises with optimum state complexity. These results show that the loss in distance properties due to the optimum state complexity restriction for binary trellises is typically negligible.

• Author: Florian Hug; Irina Bocharova; Rolf Johannesson; Boris Kudryashov
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2009
• Language: English
• Pages: 1358-1362
• Publication/Series: [Host publication title missing]
• Full text: - 320 kB; Download statistics
• Links: http://dx.doi.org/10.1109/ISIT.2009.5205916
• Document type: Conference paper
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: IEEE International Symposium on Information Theory (ISIT), 2009
• Conference date: 2009-06-28 - 2009-07-03
• Conference place: Seoul, Korea, Democratic People's Republic of
• Status: Published
• Research group: Information Theory