Back to Search
Start Over
On (n, n - 1) convolutional codes with low trellis complexity. (Transactions Papers)
- Source :
- IEEE Transactions on Communications. Jan, 2002, Vol. 50 Issue 1, p37, 11 p.
- Publication Year :
- 2002
-
Abstract
- We show that the state complexity profile of a convolutional code C is the same as that of the reciprocal of the dual code of C in case that minimal encoders for both codes are used. Then, we propose an optimum permutation for any given (n, n - 1) binary convolutional code that will yield an equivalent code with the lowest state complexity. With this permutation, we are able to find many (n, n - 1) binary convolutional codes which are better than punctured convolutional codes of the same code rate and memory size by either lower decoding complexity or better weight spectra. Index Terms--Convolutional codes, decoding, trellis codes.
- Subjects :
- Codes -- Analysis
Decoders -- Usage
Subjects
Details
- ISSN :
- 00906778
- Volume :
- 50
- Issue :
- 1
- Database :
- Gale General OneFile
- Journal :
- IEEE Transactions on Communications
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.84151020