activity
20092021
most citedError-Trellis Construction for Tailbiting Convolutional Codes

3 citations · 3 across the 10 of their papers we have counts for

collaborators

10 papers

cs.IT2021

A Further Note on an Innovations Approach to Viterbi Decoding of Convolutional Codes

Masato Tajima

In this paper, we show that the soft-decision input to the main decoder in an SST Viterbi decoder is regarded as the innovation as well from the viewpoint of mutual information and…

cs.IT2020

Corrections to "An Innovations Approach to Viterbi Decoding of Convolutional Codes"

Masato Tajima

We correct errors in Section III-B of the above-titled paper. The corrections are related to the joint distribution of the inputs to the main decoder which corresponds to a branch…

cs.IT2019

Non-Linear Estimation of Convolutionally Encoded Sequences

Masato Tajima

Suppose that a convolutionally encoded sequence is transmitted symbol by symbol over an AWGN channel using BPSK modulation. In this case, pairs of the signal (i.e., code symbol) an…

cs.IT2017

Characteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes

Masato Tajima

Basic properties of a characteristic matrix for a tail-biting convolutional code are investigated. A tail-biting convolutional code can be regarded as a linear block code. Since th…

cs.IT2015

Algebraic Construction of Tail-Biting Trellises for Linear Block Codes

Masato Tajima

In this paper, we present an algebraic construction of tail-biting trellises. The proposed method is based on the state space expressions, i.e., the state space is the image of the…

cs.IT2014

Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences

Masato Tajima, Koji Okino, Tatsuto Murayama

In this paper, we discuss the reduction of error-trellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor (with i…