Arbitrary Length Perfect Integer Sequences Using All-Pass Polynomial

You are here

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

Arbitrary Length Perfect Integer Sequences Using All-Pass Polynomial

By: 
Soo-Chang Pei; Kuo-Wei Chang

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.

SPS on Twitter

  • We are happy to welcome Prof. Jiebo Luo as the new Editor-in-Chief of IEEE Transactions on Multimedia beginning in… https://t.co/9ZgBrgkFXv
  • wants your talents! Our tenure-track position in engineering applications of information and data science a… https://t.co/QrqTAFGlyM
  • If you’re missing out on , don’t worry - we’ll be tweeting all week long. Follow along with us to see the action!

SPS Videos


Signal Processing in Home Assistants

 


Multimedia Forensics


Careers in Signal Processing             

 


Under the Radar