.png){kind=icon}
返回
Arbitrary Length Perfect Integer Sequences Using All-Pass Polynomial
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2019.2921256.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel method is proposed to construct arbitrary length perfect integer sequences based on all-pass polynomial. It uses a fact that associative sequence of an all-pass polynomial is guaranteed to be perfect. In addition, geometric series method is our special case. Moreover, perfect Gaussian integer sequences can also be constructed. Furthermore, this approach can be applied to symmetric perfect sequences design. Finally, perfect sequence with low degree of freedom can be achieved by the difference set. Concrete examples are illustrated.
Keyword:
Discrete Fourier transform
perfect integer sequences
zero autocorrelation
polynomial
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W