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

Generalized pairwise complementary codes with set-wise uniform interference-free windows
复制标题

DOI:
10.1109/jsac.2005.858878
复制
发表时间:
2006-09
影响因子:
16.4
通讯作者:
Hsiao-Hwa Chen;Y.-C. Yeh;Xi Zhang;Aiping Huang;Yang Yang-Yang;Jie Li;Yang Xiao;H. Sharif;A. Vinck
Hsiao-Hwa Chen;Y.-C. Yeh;Xi Zhang;Aiping Huang;Yang Yang-Yang;Jie Li;Yang Xiao;H. Sharif;A. Vinck
中科院分区:
计算机科学1区
文献类型:
--
作者:
Hsiao-Hwa Chen;Y.-C. Yeh;Xi Zhang;Aiping Huang;Yang Yang-Yang;Jie Li;Yang Xiao;H. Sharif;A. Vinck

文献摘要

被引文献

相似文献

本文介绍了一种生成广义成对互补 (GPC) 代码的方法,该方法在整个代码集中提供统一的无干扰窗口 (IFW)。 GPC 代码成对工作,可以适应极其节能的正交载波调制解调器。 GPC码的特征包括:集合大小为2K,处理增益为4NK,集合中所有代码的IFW宽度相同为8N,其中K是进行Walsh-Hadamard展开的次数,N是种子补码的元素码长。因此,通过使用不同的N,可以在保持GPC码集大小不变的情况下调整GPC码集的IFW宽度。每个GPC码集由两个码组组成,每个码组有K个码,并且它们在IFW之外具有稀疏且均匀分布的自相关旁瓣和互相关级别。
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.