Decoding of convolutional codes using a syndrome trellis
From MaRDI portal
Recommendations
Cited in
(24)- Generalized punctured convolutional codes with unequal error protection
- Maximum-likelihood list decoding using trellises
- On the trellis complexity of block and convolutional codes
- On maximum length convolutional codes under a trellis complexity constraint
- A rate-k/n heuristic soft-output Viterbi algorithm (SOVA) that is postdetector-compatible
- A comparison of trellis modules for binary convolutional codes
- Error-trellises for convolutional codes. I: Construction
- Variable-complexity trellis decoding of binary convolutional codes
- Table based decoding of rate one-half convolutional codes
- Scarce-state-transition syndrome-former error-trellis decoding of (n,n-1) convolutional codes
- Error-trellises for convolutional codes. II: Decoding methods
- On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
- The VLSI Design of an Error-Trellis Syndrome Decoder for Certain Convolutional Codes
- Systolic array processing of the Viterbi algorithm
- scientific article; zbMATH DE number 1284126 (Why is no real title available?)
- Two-step trellis decoding of partial unit memory convolutional codes
- Simplified trellis decoder
- Simplified Viterbi decoding of geometrically uniform TCM codes
- Differential trellis decoding of convolutional codes
- scientific article; zbMATH DE number 1792628 (Why is no real title available?)
- scientific article; zbMATH DE number 820487 (Why is no real title available?)
- Syndrome Decoding Estimator
- Convolutional codes and complexity
- Structural analysis of convolutional codes via dual codes
This page was built for publication: Decoding of convolutional codes using a syndrome trellis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324147)