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

Hsiao Hwa Chen, Yu Ching Yeh, Xi Zhang, Aiping Huang, Yang Yang, Jie Li, Yang Xiao, H. R. Sharif, A. J.H. Vinck

Research output: Contribution to journalArticlepeer-review

46 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)65-74
Number of pages10
JournalIEEE Journal on Selected Areas in Communications
Issue number1
Publication statusPublished - 2006 Jan

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Generalized pairwise complementary codes with set-wise uniform interference-free windows'. Together they form a unique fingerprint.

Cite this