Complementary Sets of Non-Power-of-Two Length for Peak-to-Average Power Ratio Reduction in OFDM

Chen, Chao-Yu

doi:10.1109/tit.2016.2613994

Cited by 69 publications

(44 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the upper bound of PAPR of a CS is not based on the length of the constituent sequences [8], there are certain practical scenarios where CSs having different lengths other than 2 α can be used efficiently. For example, the number of occupied sub-carriers for 20 MHz bandwidth is 1200 in long term evolution (LTE) systems where a number of sub-carriers at band edges are reserved for guard bands to prevent the adjacent channel interference [11]. Recently, in search of CSs having sequences of length other than 2 α , Chen [11] in 2016 proposed a novel construction of CSs of length 2 m−1 + 2 v (m ∈ N, 0 ≤ v < m) for set size of 4 and length 2 m−1 + 1 for set size 2 k+1 by using truncated GBFs.…”

Section: Introductionmentioning

confidence: 99%

Generalized Constructions of Complementary Sets of Sequences of Lengths Non-Power-of-Two

Wang

Adhikary

Zhou

et al. 2020

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean functions (GBFs), are of length 2 α (α is a natural number). Recently some works have been reported on construction of CSs having lengths non-power of two, i.e., in the form of 2 m−1 + 2 v (m is natural number, 0 ≤ v < m), N +1 and N +2, where N is a length for which q-ary complementary pairs exist. In this paper, we propose a construction of CSs of lengths M + N for set size 4n, using concatenation of CSs of lengths M and N , and set size 4n, where M and N are lengths for which q-ary complementary pairs exists. Also, we construct CSs of length M + P for set size 8n by concatenating CSs of lengths M and P , and set size 8n, where M and P are lengths for which q-ary complementary pairs and complementary sets of size 4 exists, respectively. The proposed constructions cover all the previous constructions as special cases in terms of lengths and lead to more CSs of new sequence lengths which have not been reported before.Index Terms-Complementary sets (CSs), Golay complementary pair (GCP).

show abstract

Section: Introductionmentioning

confidence: 99%

Generalized Constructions of Complementary Sets of Sequences of Lengths Non-Power-of-Two

Wang

Adhikary

Zhou

et al. 2020

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

show abstract

“…In this paper, we have presented new constructions of GCSs and MOCSs based on GBFs with flexible lengths. First, a construction of GCSs with flexible lengths is proposed in Theorem 3, which includes the results in [25], [26] as special cases. In addition, new constructions of MOCSs have been proposed in Theorem 4 and Corollary 5.…”

Section: Discussionmentioning

confidence: 99%

“…For a GBF f with m variables, the corresponding sequence f defined above is of length 2 m . Considering the sequence of length = 2 m , we define the corresponding truncated sequence f (L) of the GBF f by removing the last 2 m − L elements of the sequence f [25]. That is,…”

Section: Generalized Boolean Functions (Gbfs)mentioning

confidence: 99%

“…, t for a positive integer t, then j ≥ i + 2 t . Lemma 7: [25,Lemma 3] For an integer i with 2 m−1 ≤ i ≤ 2 m−1 + 2 t − 1 where 1 ≤ t ≤ m − 1 and m ≥ 2, if i ′ is an integer with binary representation (i 1 , i 2 , . .…”

Section: Appendix a Proof Of Theoremmentioning

confidence: 99%

“…Existing complementary sequences constructed based on GBFs are mostly limited to lengths with powers of two. Recently, some research attempts have been made by Chen for GCSs with more flexible lengths [25]- [27]. GCSs with flexible lengths are of interest to practical OFDM systems with varying numbers of subcarriers.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?

Chen

Liu

2021

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

Mutually orthogonal complementary sets (MOCSs) have received significant research attention in recent years due to their wide applications in communications and radar. Existing MOCSs which are constructed based on generalized Boolean functions (GBFs) mostly have lengths of power-of-two. How to construct MOCSs with non-power-of-two lengths whilst having large set sizes is a largely open problem. With the aid of GBFs, in this paper, we present new constructions of such MOCSs and show that the maximal achievable set size is 1/2 of the flock size of an MOCS.

show abstract

New sets of non-orthogonal spreading sequences with low correlation and low PAPR using extended Boolean functions

Liu

Zhou

Adhikary

et al. 2023

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Complementary Sets of Non-Power-of-Two Length for Peak-to-Average Power Ratio Reduction in OFDM

Cited by 69 publications

References 17 publications

Generalized Constructions of Complementary Sets of Sequences of Lengths Non-Power-of-Two

Generalized Constructions of Complementary Sets of Sequences of Lengths Non-Power-of-Two

How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?

New sets of non-orthogonal spreading sequences with low correlation and low PAPR using extended Boolean functions

Contact Info

Product

Resources

About