Search: WFRF:(Hug Florian) >
Searching for high-...
Searching for high-rate convolutional codes via binary syndrome trellises
-
- Hug, Florian (author)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
- Bocharova, Irina (author)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
- Johannesson, Rolf (author)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
show more...
-
- Kudryashov, Boris (author)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
show less...
-
(creator_code:org_t)
- 2009
- 2009
- English.
-
In: [Host publication title missing]. ; , s. 1358-1362
- Related links:
-
https://portal.resea... (primary) (free)
-
show more...
-
http://dx.doi.org/10...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- 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.
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Publication and Content Type
- kon (subject category)
- ref (subject category)
To the university's database