Skip to search formSkip to main contentSkip to account menu

Circular convolution

Known as: Cyclic convolution, Periodic convolution 
The circular convolution, also known as cyclic convolution, of two aperiodic functions (i.e. Schwartz functions) occurs when one of them is convolved… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
AutocorrelationCirculant matrixConvolutionDiscrete Fourier transform

Broader (1)

Image processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Hardware-Efficient Realization of Prime-Length DCT Based on Distributed Arithmetic
This paper presents an efficient decomposition scheme for hardware-efficient realization of discrete cosine transform (DCT) based… 
2010
2010
Scattering from a finite array of circular cylinders using a model of layered cylindrical arrays
2004
2004
An efficient 2-D DCT/IDCT core design using cyclic convolution and adder-based realization
This paper proposes an efficient two-dimensional (2-D) discrete cosine and inverse discrete cosine transform (DCT/IDCT) core… 
2003
2003
A Lagrangian for von Karman equations of large deflection problem of thin circular plate
2000
2000
An efficient parallel adder based design for one dimensional discrete Fourier transform
This paper presents a new efficient parallel adder (PA) based design for the one-dimensional (1-D) anylength discrete Fourier… 
2000
2000
An efficient design for one-dimensional discrete Hartley transform using parallel additions
This paper presents a new efficient design for the one-dimensional (1-D) any-length discrete Hartley transform (DHT). Using a… 
1995
1995
A class of fast cyclic convolution algorithms based on block pseudocirculants
Pseudocirculant matrices have been studied in the past in the context of FIR filtering, block filtering, polyphase networks and… 
Highly Cited
1992
Highly Cited
1992
The efficient memory-based VLSI array designs for DFT and DCT
Efficient memory-based VLSI arrays and a new design approach for the discrete Fourier transform (DFT) and discrete cosine… 
1987
1987
High speed 1-D FIR digital filtering architectures using polynomial convolution
  • H. KwanM. Tsim
  • ICASSP '87. IEEE International Conference on…
  • 1987
  • Corpus ID: 61605047
Two sets of 1-D FIR digital filtering architectures are proposed to reduce computational complexity and to increase throughput… 
1981
1981
On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
Consider a polynomialP (z) of degreen whose zeros are known to lie inn closed disjoint discs, each disc containing one and only… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)