uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On Prime Root-of-Unity Sequences with Perfect Periodic Correlation
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control.
2014 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 62, no 20, 5458-5470 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, Perfect Root-of-Unity Sequences (PRUS) with entries in $\alpha_p = \{ x \in \complexC ~ |~ x^p =1\}$ (where $p$ is a prime) are studied. A lower bound on the number of distinct phases that are used in PRUS over $\alpha_p$ is derived. We show that PRUS of length $L \geq p(p-1)$ must use all phases in $\alpha_p$. Certain conditions on the lengths of PRUS are derived. Showing that the phase values of PRUS must follow a given difference multiset property, we derive a set of equations (which we call the principal equations) that give possible lengths of a PRUS over $\alpha_p$ together with their phase distributions. The usefulness of the principal equations is discussed, and guidelines for efficient construction of PRUS are provided. Through numerical results, also contributions are made to the current state-of-knowledge regarding the existence of PRUS. In particular, a combination of the developed ideas allowed us to numerically settle the problem of existence of PRUS with $(L,p)=(28,7)$ within about two weeks--- a problem whose solution (without using the ideas in this paper) would likely take more than three million years on a standard PC.

Place, publisher, year, edition, pages
2014. Vol. 62, no 20, 5458-5470 p.
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:uu:diva-229414DOI: 10.1109/TSP.2014.2349881ISI: 000341982900021OAI: oai:DiVA.org:uu-229414DiVA: diva2:736575
Available from: 2014-08-07 Created: 2014-08-07 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Soltanalian, MojtabaStoica, Petre

Search in DiVA

By author/editor
Soltanalian, MojtabaStoica, Petre
By organisation
Automatic controlDivision of Systems and Control
In the same journal
IEEE Transactions on Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 396 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf