Performance evaluation of concatenated kernel codes

Abstract

Concatenated codes proposed by Forney are used extensively in digital communication. In this paper, concatenated kernel codes, a class of group codes is constructed with inner code and outer code. Binary and non — binary variants of concatenated kernel code is discussed with example. Constructed concatenated kernel code is represented over trellis. Minimal trellis representation is given for the concatenated kernel code and its state complexity profile is discussed. Performance evaluation of concatenated kernel code is derived in terms of BER. It is observed that the concatenated kernel codes with random selection of groups perform better than kernel codes with random selection of homomorphisms with coding gain.