摘要
针对置换序列码(PSC)的构造方法,以及对PSC码的自相关和互相关特性的对比,对GF(2m)域满足生成PSC码的本原根进行存在分析,给出了此种本原根的个数下限,提出了生成这种本原根的方法.将PSC应用于超宽带系统中,仿真结果表明,使用PSC码的超宽带系统的性能明显优于使用其他码型的系统.
Baed on the way to construct permutation sequence code （PSC） and comparisons of the characteristics of auto-correlation and cross-correlation, the existence and the low bound of the primitive number in GF（2^m ） were analyzed. A method on calculating the primitive was proposed. The simulation result shows that PSC code is a kind of efficient code for ultra wide band.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2005年第5期114-116,共3页
Journal of Beijing University of Posts and Telecommunications
关键词
置换序列码
有限域
超宽带
跳时码
permutation sequence code
galois field
ultra wide band
timing hopping code
