New constructions of low-complexity convolutional codes

Authors:
Alexandros Katsiotis;Panagiotis Rizomiliotis;Nicholas Kalouptsidis
Affiliations:
University of Athens, Dept. of Inf. and Telecom., Athens, Greece;University of the Aegean, Dept. of Inf. and Com. Systems Eng., Karlovassi, Samos, Greece;University of Athens, Dept. of Inf. and Telecom., Athens, Greece
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 6
Cited 1

On maximum length convolutional codes under a trellis complexity constraint

Journal of Complexity - Special issue on coding and cryptography
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

New constructions of high-performance low-complexity convolutional codes

IEEE Transactions on Communications

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.