Low-complexity decoding with the minimal function-equivalent trellis

Author

Peng, Xiao-Hong ; Farrell, Patrick G.

Author_Institution

Div. of Electr. Eng., Manchester Univ., UK

Volume

1

fYear

1996

fDate

18-22 Nov 1996

Firstpage

111

Abstract

In this paper, we examine the relation between the trellis complexity and the decoding complexity. It can be shown that the complexity of soft-decision decoding for block codes when using a trellis is dominated by the total number of branches in the trellis. The number of branches at each stage of the trellis is determined by using the rank/length profile of the generator matrix or the parity-check matrix for the given code. The problem of minimizing the decoding complexity will also be investigated, aiming to get the minimal trellis in a more general sense for a class of codes, called function-equivalent codes

Keywords

Viterbi decoding; block codes; computational complexity; matrix algebra; minimisation; trellis codes; Viterbi algorithm; block codes; decoding complexity; function-equivalent codes; generator matrix; low-complexity decoding; minimal trellis; parity-check matrix; rank/length profile; soft-decision decoding; trellis complexity; Bismuth; Block codes; Convolutional codes; Maximum likelihood decoding; Parity check codes; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity

Conference_Location

London

Print_ISBN

0-7803-3336-5

Type

conf

DOI

10.1109/GLOCOM.1996.594343

Filename

594343