检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]燕山大学信息科学与工程学院,河北秦皇岛066004
出 处:《北京邮电大学学报》2012年第6期30-33,共4页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(61201263;61172094);河北省自然科学基金项目(F2012203171)
摘 要:提出了一种基于任意相同阶的Hadamard矩阵,交织递归构造相互正交二元零相关区序列集的新方法,构造的序列集能达到二元零相关区序列集的理论界.利用参数矩阵对Hadamard序列进行加权,经交织递归构造出零相关区序列集,集合内序列数量是Hadamard矩阵阶数的2倍,且序列集间满足相互正交关系.构造结果表明,参数矩阵取值的多样性可提高相互正交零相关区序列集的数量,能获得大量新的相互正交二元零相关区序列集,为准同步码分多址系统提供更多便于硬件实施的二元地址码集.Based on a pair of Hadamard matrices of the same size, a new construction of mutually orthogonal binary sequence sets with zero correlation zone (ZCZ) is presented by interleaving recursion. The sequence sets proposed can achieve theoretical bound of binary ZCZ sequence sets. By interleaving recursion, ZCZ sequence sets can be constructed from Hadamard sequences weighted by the coefficient matrices, satisfying mutually orthogonality, in which the number of sequences doubles the size of Hadamard matrix. The construction results illustrate that the proposed method improves the number of mutually orthogonal binary sequence sets with ZCZ and obtains more new sequence sets, which are used in quasisynchronous code division multiple access system and implemented conveniently in hardware, by means of different choices of the coefficient matrices.
关 键 词:HADAMARD矩阵 零相关区 交织递归 相互正交 参数矩阵
分 类 号:TN911.2[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145