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

Davoud Arasteh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Davoud Arasteh

Publication year - 2013

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2013.09.314

Subject(s) - computer science , encoder , convolutional code , decoding methods , algorithm , constraint (computer aided design) , computational complexity theory , coding (social sciences) , encryption , word error rate , error detection and correction , code (set theory) , theoretical computer science , speech recognition , mathematics , statistics , geometry , set (abstract data type) , programming language , operating system

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research