Everything about Circular convolution
Mathematical operation
Circular convolution, also known as cyclic convolution, is a special case of periodic convolution, which is the convolution of two periodic functions that have the same period. Periodic convolution arises, for example, in the context of the discrete-time Fourier transform (DTFT). In particular, the DTFT of the product of two discrete sequences is the periodic convolution of the DTFTs of the individual sequences. And each DTFT is a periodic summation of a continuous Fourier transform function. Although DTFTs are usually continuous functions of frequency, the concepts of periodic and circular convolution are also directly applicable to discrete sequences of data. In that context, circular convolution plays an important role in maximizing the efficiency of a certain kind of common filtering operation. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Circular convolutionA 5-minute orientation
- Skim a recent paper: A fast 3D gravity forward algorithm based on circular convolutionInfluential work since 2022
- Pick up a classic book: Mathematical Methods in the Physical SciencesThe most-reprinted book on the subject
- Read the landmark paper: On the free convolution with a semi-circular distributionCited 125 times
- Go sideways: Discrete-time Fourier transformA closely related topic
- Go sideways: Convolution theoremA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
On the free convolution with a semi-circular distribution
Design of alignment-free cancelable fingerprint templates via curtailed circular convolution
A multiple circular path convolution neural network system for detection of mammographic masses
Efficient Implementation of Filter Bank Multicarrier Systems Using Circular Fast Convolution
EEG-CDILNet: a lightweight and accurate CNN network using circular dilated convolution for motor imagery classification
Advanced Low-Complexity Multicarrier Schemes Using Fast-Convolution Processing and Circular Convolution Decomposition
Free vibration and bending analysis of circular Mindlin plates using singular convolution method
Series Arc Fault Detection Method Based on Signal-Type Enumeration and Zoom Circular Convolution Algorithm
🆕 Influential since 2022
A fast 3D gravity forward algorithm based on circular convolution
Efficient and Accurate Pattern Synthesis of Circular Antenna Array Employing Iterative Fast Segmented Cyclic Convolution
Iris recognition based on local circular Gabor filters and multi-scale convolution feature fusion network
Analysis of reconstruction quality for computer-generated holograms using a model free of circular-convolution error
Prediction of Confined Flow Field Around a Circular Cylinder and Its Force Based on Convolution Neural Network
📚 Books worth reading
Mathematical Methods in the Physical SciencesMary L. Boas, Mary Layne Boas · 1966
DSP for MATLAB and LabVIEWForester W. Isen · 2008
Digital Signal Processing · 2006
Combinatorial Image AnalaysisReneta P. Barneva · 2012
Advances in Neural Networks – ISNN 2013Chengan Guo · 2013
BIOINFORMATICS ALGORITHMS,VOL.IIPhillip Compeau, Pavel Pevzner · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Discrete-time Fourier transform In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to a sequence of discrete values. The DTFT…
- Convolution theorem In mathematics, the convolution theorem states that under suitable conditions the Fourier transform of a convolution of two functions (or signals) is the…
- Discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) is a discrete version of the Fourier transform that converts a finite sequence of numbers into another…
- Finite impulse response In signal processing, a finite impulse response (FIR) filter is a filter whose impulse response (or response to any finite length input) is of finite duration…
- Dirac comb In mathematics, a Dirac comb (also known as sha function, impulse train or sampling function) is a periodic generalized function with the formula Ш T …
- Periodic summation In mathematics, any integrable function s ( t ) {\displaystyle s(t)} can be made into a periodic function s P ( t ) {\displaystyle s_{P}(t)} with period…
- Overlap–add method In signal processing, the overlap–add method is an efficient way to evaluate the discrete convolution of a very long signal x [ n ] {\displaystyle x[n]}…
- Wiener–Khinchin theorem In applied mathematics and statistics, the Wiener–Khinchin theorem or Wiener–Khintchine theorem, also known as the Wiener–Khinchin–Einstein theorem or…