Abstract—In digital communication systems, an interleaver
rearranges the bits in a channel encoded data to overcome burst
errors. Since the interleaved data is encrypted for any receiver
ignorant of the parameters of the interleaver, non-cooperative
contexts must estimate the interleaver parameters from an
unknown interleaved data. In this paper, we propose a method
of estimating an interleaving period, based on the linear
characteristics of Reed-Muller code. First, we calculate the ratio
of ‘1’ bits in the matrix which is generated by a Gaussian
elimination process. Then, we check the minimum value of the
ratio and count the number of rows that have a smaller ratio
than a certain threshold. To validate the proposed method, we
show the correct detection probabilities for an interleaving
period in a noisy channel through computer simulations.
Index Terms—Interleaver, interleaving period estimation,
reed-muller code.
The authors are with the Department of Electronics and Computer
Engineering, Hanyang University, Seoul 133-791, Korea (e-mail:
ysjang83@gmail.com, jhjeong@hanyang.ac.kr, hyl@hanyang.ac.kr,
dwyoon@hanyang.ac.kr).
[PDF]
Cite: Yeonsoo Jang, Jinwoo Jeong, Hyeongyong Lim, and Dongweon Yoon, "Estimation of Interleaving Period for Reed-Muller Coded Signals," International Journal of Future Computer and Communication vol. 5, no. 2, pp. 116-119, 2016.
