Name
Abstract | ||
|---|---|---|
Coset codes are considered as terminated convolutional codes. Based on this approach, three new general results are presented. First, it is shown that the iterative squaring construction can equivalently be defined from a convolutional code whose trellis terminates. This convolutional code determines a simple encoder for the coset code considered, and the state and branch labelings of the associated trellis diagram become straightforward. Also, from the generator matrix of the code in its convolutional code form, much information about the trade-off between the state connectivity and complexity at each section, and the parallel structure of the trellis, is directly available. Based on this generator matrix, it is shown that the parallel branches in the trellis diagram of the convolutional code represent the same coset code C1 of smaller dimension and shorter length. Utilizing this fact, a two-stage optimum trellis decoding method is devised. The first stage decodes C1 while the second stage decodes the associated convolutional code, using the branch metrics delivered by stage 1. Finally, a bidirectional decoding of each received block starting at both ends is presented. If about the same number of computations is required, this approach remains very attractive from a practical point of view as it roughly doubles the decoding speed. This fact is particularly interesting whenever the second half of the trellis is the mirror image of the first half, since the same decoder can be implemented for both parts |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/26.536916 | IEEE Transactions on Communications |
Keywords | Field | DocType |
block codes,convolutional codes,decoding,iterative methods,matrix algebra,bidirectional decoding,block codes,branch labeling,code dimension,code length,coset codes,decoding speed,encoder,generator matrix,iterative squaring construction,parallel structure,state connectivity,state labeling,terminated convolutional codes,trellis diagram,two-stage optimum trellis decoding method | Discrete mathematics,Generator matrix,Convolutional code,Computer science,Binary code,Block code,Serial concatenated convolutional codes,Linear code,Space–time trellis code,Decoding methods | Journal |
Volume | Issue | ISSN |
44 | 9 | 0090-6778 |
Citations | PageRank | References |
3 | 0.43 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc P. C. Fossorier | 1 | 1094 | 84.96 |
| Shu Lin | 2 | 575 | 133.22 |