Recovering the interleaver of an unknown turbo-code
Authors:
- 1 June 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2784-2788
Abstract
We give here an efficient algorithm for recovering the permutation of an unknown turbo-code when several noisy codewords are given. The algorithm presented here uses the same information as some other algorithms given previously for this problem but in an optimal fashion. This paper also clarifies the link between this problem and the BCJR decoding algorithm.Keywords
This publication has 18 references indexed in Scilit:
- Focus on theoretical properties of blind convolutional codes identification methods based on rank criterion2012
- Some interesting dual-code properties of convolutional encoder for standards self-recognitionIET Communications, 2012
- Blind Identification of Convolutional Encoder Parameters over GF(2m) in the Noiseless Case2011
- Reconstruction of a turbo-code interleaver from noisy observation2010
- Dual Code Method for Blind Identification of Convolutional Encoder for Cognitive Radio Receiver Design2009
- Reconstruction of convolutional codes from noisy observation2009
- Reconstruction of punctured convolutional codes2009
- A Method for Blind Recognition of Convolution Code Based on Euclidean Algorithm2007
- Parameter Estimation of a Convolutional Encoder from Noisy Observations2007
- Reconstruction of turbo-code encoders2005