Reduced The Complexity of Soft Input Soft Output Maximum A posteriori Decoder of Linear Block Code By Using Parallel Trellises Structure

Abstract

This search present trellis structures of linear block code capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. First we describe minimal trellis of linear block code that minimizes one or more measures of trellis complexity for the code. We identify the primitive structures that can appear in a minimal trellis , then we applied the sectionalized to trellis, where only uniform sectionalizations of the code trellis diagram are considered .Next, parallel and structurally identical subtrellises for a code without exceeding the maximum state complexity of the minimal trellis of the code is discussed. The complexity of decoder based on a sectionalized trellis diagram for a code is described. In This paper we describe how to apply SISO(soft input soft output) max-log-MAP decoder using parallel structure of sectionalized trellis for block code. The (8,4) and (16,5)RM (Reed Muller) code are included here because they offers parallel and structurally identical subtrellises without cross connections among them that will reduces the decoding complexity and improves decoding speed. This paper also gives simulation results for iterative decoding of parallel concatenated block code of these two codes over AWGN channel by using SISO max-log-MAP decoder based on parallel trellises structure.