Numerically efficient algorithm for modified trellis approaches

Authors:
Hichan Moon;Sungroh Yoon
Affiliations:
Telecom. R&D center, Samsung Electronics Co., Suwon, South Korea;School of Electrical Engineering, Korea University, Seoul, South Korea
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 4
Cited 0

A Tree Representation of Combinational Networks

IEEE Transactions on Computers
Convolutional codes under a minimal trellis complexity measure

IEEE Transactions on Communications
Performance of unequally punctured convolutional codes

IEEE Transactions on Wireless Communications
The trellis complexity of convolutional codes

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.