Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction

Authors:
Masato Tajima;Koji Okino;Takashi Miyagoshi
Affiliations:
-;-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2007

Citing 10
Cited 0

Introduction to Convolutional Codes with Applications

Introduction to Convolutional Codes with Applications
Convolutional Codes: An Algebraic Approach

Convolutional Codes: An Algebraic Approach
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
On the trellis structure of block codes

IEEE Transactions on Information Theory - Part 2
On the BCJR trellis for linear block codes

IEEE Transactions on Information Theory
Trellis decoding complexity of linear block codes

IEEE Transactions on Information Theory - Part 1
The trellis complexity of convolutional codes

IEEE Transactions on Information Theory - Part 1
On classes of rate k/(k+1) convolutional codes and their decoding techniques

IEEE Transactions on Information Theory - Part 2
Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n-1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the proposed method can also be applied to an error-trellis construction with minor modification.