Trellis decoding of some decomposable codes

Abstract

This paper presents a maximum likelihood identical minimal trellises of d4SP codes and it (ML) soft decision decoding scheme to implement Viterbi significantly reduces the decoding complexity by Algorithm for some constructed decomposable codes of performing iterations for each sub-trellis. Bit error rate Hamming distance four and show that the decoding performances of some d4SP codes are obtained in additive complexity is simple, hence, it may be employed in trellis- white Gaussian channel (AWGN) and also complexity of based decoders. A bit error rate performance of some decoding processes is analyzed in detail. Decomposable codes that were obtained employing the technique in AWGN channel are also presented. © 2015 Elsevier B.V., All rights reserved.