期刊文献+

基于Zadoff-Chu矩阵的最优码本构造方法 被引量:1

Construction method of optimal codebook based on Zadoff-Chu matrix
下载PDF
导出
摘要 具有低相关性质的码本在同步码分多址系统(CDMA)、量子信息理论以及压缩感知领域都有重要应用。为扩展码本数量,放宽了变换矩阵的限制条件。基于Zadoff-Chu矩阵,利用差集、几乎差集以及有限域特征和构造了新的码本,得到的码本依照Welch界限或Levenstein界是最优或几乎最优的。通过实验仿真发现,基于该类码本构造的确定性测量矩阵在压缩感知中具有良好的性能。 Codebooks with low-coherence have wide utilization in code division multiple access(CDMA)communications,quantum information theory,compressed sensing and so on.In order to expand the number of codebooks,the restrictions on the transformation matrix were relaxed.Based on the Zadoff-Chu matrix,new codebooks were constructed using the difference set,almost difference set,and finite field character sum.The proposed codebooks were optimal or near optimal according to the Welch bound or Levenstein bound.Through experimental simulation,it is found that the deterministic measurement matrices constructed using these codebooks also have good performance in the process of compressed sensing.
作者 李玉博 刘胜毅 张景景 贾冬艳 LI Yubo;LIU Shengyi;ZHANG Jingjing;JIA Dongyan(School of Information Science&Engineering,Yanshan University,Qinhuangdao 066004,China;Hebei Key Laboratory of Information Transmission and Signal Processing,Qinhuangdao 066004,China;School of Mathematics and Information Science&Technology,Hebei Normal University of Science&Technology,Qinhuangdao 066004,China)
出处 《通信学报》 EI CSCD 北大核心 2020年第3期112-119,共8页 Journal on Communications
基金 国家自然科学基金资助项目(No.61501395)。
关键词 码本 差集 几乎差集 Welch界 Levenstein界 codebook difference set almost difference set Welch bound Levenstein bound
  • 相关文献

参考文献3

二级参考文献11

  • 1Massey J L, Mittelholzer T. Welch bound and sequence sets for code-division multiple-access systems. In:Sequences Ⅱ:Methods in Communication, Security and Computer Science. Berlin:Springer, 1993. 63-78.
  • 2Wootters W, Fields B. Optimal-determination by multually unbiaesd measurements. Ann Phys, 2005, 19:363-381.
  • 3Welch L. Lower bounds on the maximam cross correlation of signals. IEEE Trans Inform Theory, 1974, 20:397-399.
  • 4Ding C S. Complex codebooks from combinatorial designs. IEEE Trans Inform Theory, 2006, 52:4229-4235.
  • 5Ding C S, Feng T. Codebooks from almost difference sets. Des Codes Cryptogr, 2008, 46:113-126.
  • 6Zhang A X, Feng K Q. Construction of cyclotomic codebooks nearly meeting the Welch bound. Des Codes Cryptogr, 2012, 63:209-224.
  • 7Zhang A X, Feng K Q. Two classes of codebooks nearly meeting the Welch bound. IEEE Trans Inform Theory, 2012, 58:2507-2511.
  • 8Ding C S, Pott A, Wang Q. Constructions of almost difference sets from finite fields. Des Codes Cryptogr, 2014, 72:581-592.
  • 9Berndt B C, Evans R J, Williams K S. Gauss and Jacobi Sums. New York:Wiley, 1998.
  • 10王威扬,张爱仙,冯克勤.利用Gauss和与Jacobi和构造近似MUB和SIC-POVM[J].中国科学:数学,2012,42(10):971-984. 被引量:3

共引文献4

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部