Construction of minimal error-trellises for convolutional codes

Meir Ariel; Jakov Snyders

Construction of minimal error-trellises for convolutional codes

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

Abstract

A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is q^σ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search.

Original language	English
State	Published - 1994
Event	Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: 27 Jun 1994 → 1 Jul 1994

Conference

Conference	Proceedings of the 1994 IEEE International Symposium on Information Theory
City	Trodheim, Norw
Period	27/06/94 → 1/07/94

Cite this

@conference{e9272ec5d00d415794457a3f098a08de,

title = "Construction of minimal error-trellises for convolutional codes",

abstract = "A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is qσ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search.",

author = "Meir Ariel and Jakov Snyders",

year = "1994",

language = "אנגלית",

note = "Proceedings of the 1994 IEEE International Symposium on Information Theory ; Conference date: 27-06-1994 Through 01-07-1994",

}

TY - CONF

T1 - Construction of minimal error-trellises for convolutional codes

AU - Ariel, Meir

AU - Snyders, Jakov

PY - 1994

Y1 - 1994

N2 - A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is qσ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search.

AB - A method is presented to construct minimal error-trellises for convolutional codes over GF(q). The number of states of the error-trellis is qσ, where σ is a modified version of the constraint length of the parity check matrix of the code. In comparison with the Viterbi algorithm, substantial reduction in the computational complexity of maximum likelihood soft decoding is enabled by employing an appropriate error-trellis, in combination with methods for accelerated error-search.

UR - http://www.scopus.com/inward/record.url?scp=0028711511&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0028711511

T2 - Proceedings of the 1994 IEEE International Symposium on Information Theory

Y2 - 27 June 1994 through 1 July 1994

ER -

Construction of minimal error-trellises for convolutional codes

Abstract

Conference

Other files and links

Fingerprint

Cite this