상세 보기
초록
In this letter, a numerically efficient algorithm is presented to compute the performance upper bounds for terminated convolutional codes based on a modified trellis diagram. A weight enumerator of one variable is defined with a new set of coefficients. The coefficients of the weight enumerator are shown to form a semiring.
키워드
Upper bound; convolutional code; weight enumerator; semiring; PUNCTURED CONVOLUTIONAL-CODES; PERFORMANCE; COMPLEXITY
- 제목
- Numerically Efficient Algorithm for Modified Trellis Approaches
- 저자
- Moon, Hichan; Yoon, Sungroh
- 발행일
- 2010-02
- 유형
- Article
- 권
- 58
- 호
- 2
- 페이지
- 385 ~ 389