DocumentCode :
109449
Title :
On the PMEPR of Binary Golay Sequences of Length 2^{n}
Author :
Zilong Wang ; Parker, Matthew G. ; Guang Gong ; Gaofei Wu
Author_Institution :
State Key Lab. of Integrated Service Networks, Xidian Univ., Xi´an, China
Volume :
60
Issue :
4
fYear :
2014
fDate :
Apr-14
Firstpage :
2391
Lastpage :
2398
Abstract :
In this paper, some questions on the distribution of the peak-to-mean envelope power ratio (PMEPR) of standard binary Golay sequences are solved. For n odd, we prove that the PMEPR of each standard binary Golay sequence of length 2n is exactly 2, and determine the location(s), where peaks occur for each sequence. For n even, we prove that the envelope power of such sequences can never reach 2n+1 at time points t ∈ {(v/2u)|0 ≤ v ≤ 2u, v,u ∈ N}. We further identify eight sequences of length 24 and eight sequences of length 26 that have PMEPR exactly 2, and raise the question whether, asymptotically, it is possible for standard binary Golay sequences to have PMEPR less than 2 - ϵ, where, ϵ > 0.
Keywords :
Golay codes; binary sequences; PMEPR; location determination; peak-to-mean envelope power ratio; sequence identification; standard binary Golay sequences; Boolean functions; Educational institutions; Peak to average power ratio; Polynomials; Power control; Standards; Aperiodic autocorrelation; Boolean function; Golay sequences; Littlewood polynomials; Rudin–Shapiro polynomials; peak-to-mean envelope power ratio (PMEPR);
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2014.2300867
Filename :
6746126
Link To Document :
بازگشت