Complexity Analysis of Chaotically Encrypted Rate-1/n Convolutional Encoders

In this paper we have studied the performance of chaotically encrypted rate-1/n convolutional encoders. The design goal is to achieve a crypto-coding system that possesses the error correction and encryption features. The proposed system is able to achieve reasonable error correction performance for the proposed configuration with a certain encoder rate and constraint length. The performance of each system was determined by calculating the algorithmic complexity of the system outputs. Complexity of each decoding algorithm is compared to the results of the alternative algorithm. Numerical evidence indicates that algorithmic complexity associated with particular rate-1/n convolutional encoders increases as constraint length increases, while error correcting capacity of the decoder expands. Both code design and constraint length are control architectural parameters that have significant effect on system performance.