New constructions of high-performance low-complexity convolutional codes

Authors:
Alexandros Katsiotis;Panagiotis Rizomiliotis;Nicholas Kalouptsidis
Affiliations:
National and Kapodistrian University of Athens, Department of Informatics and Telecommunications, Division of Communications and Signal Processing, Athens, Greece;University of the Aegean, Department of Information and Communication Systems Engineering, Karlovassi, Samos, Greece;National and Kapodistrian University of Athens, Department of Informatics and Telecommunications, Division of Communications and Signal Processing, Athens, Greece
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 12
Cited 0

Handbook of Coding Theory

Handbook of Coding Theory
On maximum length convolutional codes under a trellis complexity constraint

Journal of Complexity - Special issue on coding and cryptography
Convolutional codes under a minimal trellis complexity measure

IEEE Transactions on Communications
New constructions of low-complexity convolutional codes

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Optimal sectionalization of a trellis

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

IEEE Transactions on Information Theory
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
Rational rate punctured convolutional codes for soft-decision Viterbi decoding

IEEE Transactions on Information Theory
Some extended results on the search for good convolutional codes

IEEE Transactions on Information Theory
Minimal Trellis Modules and Equivalent Convolutional Codes

IEEE Transactions on Information Theory
Trellis Complexity of Short Linear Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, new constructions of low trellis complexity convolutional codes are presented. New codes are found by searching into a specific class of time varying convolutional codes, which is shaped by some basic properties and search restrictions. An efficient technique for obtaining minimal trellis modules for the proposed codes is provided. Finally, new low complexity convolutional codes of various code rates and memory sizes are tabulated.