Generalized pairwise complementary codes with set-wise uniform interference-free windows

  • Authors:
  • Hsiao-Hwa Chen;Yu-Ching Yeh;Xi Zhang;Aiping Huang;Yang Yang;Jie Li;Yang Xiao;H. R. Sharif;A. J.H. Vinck

  • Affiliations:
  • Inst. of Commun. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan;-;-;-;-;-;-;-;-

  • Venue:
  • IEEE Journal on Selected Areas in Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.07

Visualization

Abstract

This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire code set. The GPC codes work in pairs and can fit extremely power efficient quadrature carrier modems. The characteristic features of the GPC codes include: the set size is 2K, the processing gain is 4NK, and the IFW's width is 8N identically for all codes in a set, where K is the times to perform Walsh-Hadamard expansions and N is element code length of seed complementary codes. Therefore, by using different N, the IFW width of a GPC code set can be adjusted with its set size unchanged. Each GPC code set consists of two code groups, with each having K codes, and they have sparsely and uniformly distributed autocorrelation side lobes and cross-correlation levels outside the IFWs.