نویسندگان
1 دانشگاه مالک اشتر تهران - دانشجوی دکترای مخابرات سیستم
2 دانشگاه مالک اشتر تهران - عضو هیئت علمی دانشکده برق و الکترونیک - دکترای مخابرات
3 دانشگاه مالک اشتر، مجتمع دانشگاهی برق و الکترونیک، دانشیار و هیئت علمی مخابرات سیستم
چکیده
کلیدواژهها
عنوان مقاله [English]
نویسندگان [English]
This paper studies the problem of binary RS code parameters estimation in noisy scenario. This problem comes to military applications as well as cognitive radio receivers design. Despite the widespread application of the RS codes, so far just a few methods have been proposed to solve it. Most of these have a high complexity and are effective only in the very low noise. This paper proposes a new, effective and low-complexity method to identify the RS code parameters. In this method, the code length and primitive polynomial and then message length is determined. The estimation of parameters is based on the identification of a special set. The main feature of this set is the presence of transmitted codewords in the all codes belonging to it. In this paper, a test is proposed to identify the set codes. In this test, the parity check bits are generated again by the received message bits, and then compared with the received parity check bits. If the number of bit differences is greater than the threshold, presence of RS code is verified in the set. In this paper, two appropriate thresholds are proposed. The first threshold is designed based on Minimax decision rule and is depended on the channel error. However, the second threshold is experimental and is independent of channel error. The simulation verifies the high performance of this method. For example, the method can perfectly estimate the parameters of RS code with length of 63 up to 4×10-3 error rate.
کلیدواژهها [English]
)