Enhanced Blind Interleaver Parameters Estimation Algorithm for Noisy Environment
Authors:
Open Access
- 20 September 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 5910-5915
Abstract
This paper proposes a blind interleaver parameters estimation method enhanced by identifying relatively error-less partial symbols among intercepted streams. By exploiting the distribution of the ranks of the random matrices, we can choose partial symbols having relatively small errors. Calculating the rank of the matrix constructed using these symbols can improve estimation of the blind interleaver parameters. Experimental results show that the proposed algorithm performs better than the previous ones.Keywords
Funding Information
- Signal Intelligence Research Center supervised by Defense Acquisition Program Administration and Agency for Defense Development of Korea
This publication has 10 references indexed in Scilit:
- Classification of Error Correcting Codes and Estimation of Interleaver Parameters in a Noisy Transmission EnvironmentIEEE Transactions on Broadcasting, 2017
- Parameter Estimation of Convolutional and Helical Interleavers in a Noisy EnvironmentIEEE Access, 2017
- Parameter estimation of block and helical scan interleavers in the presence of bit errorsDigital Signal Processing, 2017
- Blind identification of code word length for non-binary error-correcting codes in noisy transmissionEURASIP Journal on Wireless Communications and Networking, 2015
- Rank analysis of sparse random matrices over finite fields with network coding applications2014
- The Rank of Random Binary Matrices and Distributed Storage ApplicationsIEEE Communications Letters, 2012
- Blind Detection of Interleaver Parameters for Non-Binary Coded Data Streams2009
- Blind detection of interleaver parametersSignal Processing, 2009
- Detection and recognition of a binary linear codeDiscrete Applied Mathematics, 2001
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998