On Blind Recognition of Channel Codes Within a Candidate Set
Authors:
- 3 February 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 20 (4) , 736-739
Abstract
Existing schemes for blind recognition of channel codes make use of the average log-likelihood ratio (LLR) of each code's parity checks. There are difficulties in setting necessary thresholds and in theoretical analysis of the method. This letter proposes to use the average likelihood difference (LD) of the parity checks. The computational complexity is reduced while the recognition performance is kept comparable to that of the LLR method. Moreover, an optimum decoding-based blind recognition is also described. Simulations show that, for rate 1/2 convolutional codes, this new method notably improves the performance.Keywords
This publication has 8 references indexed in Scilit:
- Gibbs sampling based parameter estimation for RSC sub-codes of turbo codes2014
- Fast Blind Recognition of Channel CodesIEEE Transactions on Communications, 2014
- A Least Square Method for Parameter Estimation of RSC Sub-Codes of Turbo CodesIEEE Communications Letters, 2014
- Novel Blind Identification of LDPC Codes Using Average LLR of Syndrome a Posteriori ProbabilityIEEE Transactions on Signal Processing, 2013
- Theoretical analysis of a MAP based blind frame synchronizerIEEE Transactions on Wireless Communications, 2009
- Dual Code Method for Blind Identification of Convolutional Encoder for Cognitive Radio Receiver Design2009
- Blind frame synchronization for error correcting codes having a sparse parity check matrixIEEE Transactions on Communications, 2009
- Recognition of a code in a noisy environment2007