The trellis-based decoding of Reed-Muller code (RM) has superior error performance amongst the RM decoding algorithms. However, the problem of the associated complexity limits its hardware implementation. The trellis complexity of the Reed-Muller codes, as any linear block codes, can be measured in terms of the state and branch complexities. To reduce the associated complexity of the trellis-based decoding, two major successful improvements have been introduced to the trellis structure of Reed-Muller code; sectionalization of a trellis, and parallel decomposition into sub-trellis. This work focuses on the decomposed implementation of the Reed-Muller trellis code into parallel identically sub-trellis (isomorphic) without any cross connection. We will introduce a novel complexity reduction approach to these decomposed RM code that can early terminate the decoding process of the conventional Viterbi algorithm (VA). The proposed early terminating Viterbi algorithm (ETVA) can eliminate 50% of the sub-trellises while maintaining the same error performance of the conventional VA. The gained results are of special interest for power limited space communication applications.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Early Terminating Viterbi Decoding of Reed-Muller Code


    Contributors:


    Publication date :

    2020-03-01


    Size :

    344687 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Joint Synchronization Of Viterbi And Reed-Solomon Decoders

    Statman, Joseph I. / Chauvin, Todd H. / Cheung, Kar-Ming et al. | NTRS | 1995




    A circular Viterbi algorithm for decoding tailbiting convolutional codes

    Cox,R.V. / Sindberg,C.E. / AT and T Bell Labs.,US | Automotive engineering | 1993


    Benchmark of Reed-Müller Codes for Short Packet Transmission

    Oster, Yann / Lacan, Jerome / Duverdier, Alban | AIAA | 2007