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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have