Simplified convolutional self-doubly orthogonal codes: search algorithms and codes determination

• Published in: IEEE transactions on communications 2009-06, Vol.57 (6), p.1674-1682
• Main Authors: Cardinal, C., Roy, E., Haccoun, D.
• Format: Article
• Language: English
• Subjects: Applied sciences; Coders; Coding; Coding, codes; Computer errors; Convolution; Convolutional codes; Convolutional self-doubly orthogonal codes; Cost engineering; Costs; Decoders; Decoding; Degradation; Delay; Encoders; Error correction; Exact sciences and technology; Information, signal and communications theory; Iterative algorithms; Iterative decoding; iterative threshold decoder; Orthogonality; punctured convolutional codes; Signal and communications theory; Signal to noise ratio; Telecommunications and information theory
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2009.06.070529

A new class of convolutional self-doubly orthogonal codes which can be decoded by an iterative threshold decoder is presented. This new type of codes, called simplified convolutional self-doubly orthogonal codes (S-CSO2C), are obtained by simplifying some of the conditions on the double orthogonality of the convolutional self-doubly orthogonal codes (CSO2C). The relaxing of these conditions yields a substantial reduction of the total decoding delay induced by the memory length of the convolutional encoder at a cost of any a small degradation of the error performances. These simplified codes are also amenable to high coding rates R = b/(b + 1), b > 1 by puncturing a rate 1/2 systematic convolutional encoder. These new simplified CSO2C provide an interesting alternative for low complexity implementation error correcting schemes.