|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
Bounds on Complexity of Trellis Decoding of Linear Block Codes
V. V. Zyablov, V. R. Sidorenko
Abstract:
It is shown that the syndrome trellis [1,2] is minimal. A simple proof of the lower bound on the number of nodes of the minimal trellis is given. Asymptotic bounds on the complexity of soft maximum likelihood trellis decoding are proposed.
It is shown that virtually all codes meet the upper complexity bound. Nevertheless the block codes, constructed by termination of convolutional codes, have smaller trellis decoding complexity. The complexity is minimal if the Varshamov–Gilbert bound is tight for binary codes.
Received: 23.11.1992
Citation:
V. V. Zyablov, V. R. Sidorenko, “Bounds on Complexity of Trellis Decoding of Linear Block Codes”, Probl. Peredachi Inf., 29:3 (1993), 3–9; Problems Inform. Transmission, 29:3 (1993), 203–208
Linking options:
https://www.mathnet.ru/eng/ppi183 https://www.mathnet.ru/eng/ppi/v29/i3/p3
|
Statistics & downloads: |
Abstract page: | 526 | Full-text PDF : | 197 | First page: | 2 |
|