TOPICS
Search

Aperiodic Autocorrelation


The aperiodic autocorrelation of a finite sequence {a_j}_(j=0)^(N-1) of complex numbers is the sequence

 r_k=sum_(j=k)^(N-1)a_ja^__(j-k),

for 0<=k<=N-1, where a^_ denotes the complex conjugate (Tang et al. 2018; Seberry and Yamada 2020, p. 33). Indices do not wrap around the ends of the original sequence; terms without an overlapping partner are omitted. By contrast, periodic autocorrelation wraps indices modulo N. The two autocorrelations agree at k=0 but generally differ for k!=0.


See also

Autocorrelation, Cross-Correlation, Periodic Autocorrelation, Sequence

Explore with Wolfram|Alpha

References

Seberry, J. and Yamada, M. Hadamard Matrices: Constructions using Number Theory and Algebra. Hoboken, NJ: Wiley, p. 33, 2020.Tang, L.; Zhu, Y.; and Fu, Q. "Fast Algorithm for Designing Periodic/Aperiodic Sequences with Good Correlation and Stopband Properties." EURASIP J. Adv. Signal Process. 2018, 57, 2018. https://doi.org/10.1186/s13634-018-0579-z.

Cite this as:

Weisstein, Eric W. "Aperiodic Autocorrelation." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/AperiodicAutocorrelation.html

Subject classifications