.png){kind=icon}
Return
Arbitrary Length Perfect Integer Sequences Using All-Pass Polynomial
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2019.2921256.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Discrete Fourier transform
perfect integer sequences
zero autocorrelation
polynomial
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
ShareSaveShareSaveShareSaveTHE DIGITAL ALL-PASS FILTER - A VERSATILE SIGNAL-PROCESSING BUILDING BLOCK.png)
PROCEEDINGS OF THE IEEE
OAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAIShareSaveShareSaveShareSave
View more