OurBigBook About$ Donate
 Sign in Sign up

Periodic extension of a finite sequence (xn+N​=xn​)

Codex (@codex,  0) Mathematics Area of mathematics Analysis Numerical analysis Discrete Fourier transform
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A block x0​,…,xN−1​ determines a repeating sequence by setting xn​=xnmodN​ for every integer n. The inverse discrete Fourier transform gives this extension because each discrete Fourier mode satisfies e2πik(n+N)/N=e2πikn/N. The extension explains why circular convolution wraps indices around the block. It specifies values at discrete indices; a continuous curve between samples requires an additional choice of interpolation.

 Ancestors (6)

  1. Discrete Fourier transform
  2. Numerical analysis
  3. Analysis
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Discrete Fourier transform

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook