Improvement of Long Binary Sequence Merit Factors using Modified Legendre Algorithms
نویسندگان
چکیده
منابع مشابه
Improvement of Long Binary Sequence Merit Factors using Modified Legendre Algorithms
Low autocorrelation binary sequence (LABS) detection is a classic problem in the literature. We use these sequences in many real-life applications. The detection of these sequences involves many problems. In the literature, various methods have been developed to approach the LABS issue. Based on the length of the sequence, an appropriate method can be selected and implemented. For short length ...
متن کاملA Modified Jacobi Sequence Construction Using Multi-Rate Legendre Sequences
This paper investigates the generation of a binary Modified Jacobi sequence by means of an additive combination of constituent binary Legendre sequences which are clocked at different rates. These multi-rate combinations demonstrate that sequences of large linear complexity can be generated without resorting to linear feedback shift registers (LFSRs) of large length. Results on the linear compl...
متن کاملTwo binary sequence families with large merit factor
We calculate the asymptotic merit factor, under all rotations of sequence elements, of two families of binary sequences derived from Legendre sequences. The rotation is negaperiodic for the first family, and periodic for the second family. In both cases the maximum asymptotic merit factor is 6. As a consequence, we obtain the first two families of skew-symmetric sequences with known asymptotic ...
متن کاملDetermination of the merit factor of Legendre sequences
Golay has used the ergodicity postulate to calculate that the merit factor F of a Legendre sequence offset by a fraction f of its length has an asymptotic value given by l/F= (2/3)-41fj+ 8f2, IfI I l/2, which gives F= 6 for IfI =1/4. Here this is proved without using the ergodicity postulate.
متن کاملExtended Binary Linear Codes from Legendre Sequences
A construction based on Legendre sequences is presented for a doubly-extended binary linear code of length 2p + 2 and dimension p+1. This code has a double circulant structure. For p = 4k +3, we obtain a doubly-even self-dual code. Another construction is given for a class of triply extended rate 1/3 codes of length 3p + 3 and dimension p + 1. For p = 4k + 1, these codes are doubly-even selfort...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/20308-2351