Relevant bibliographies by topics / Circular discrete convolution

Contents

  1. Journal articles
  2. Book chapters

Academic literature on the topic 'Circular discrete convolution'

Author: Grafiati
Published: 4 June 2025
Last updated: 6 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Circular discrete convolution.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Circular discrete convolution"

1

Okoloko, Innocent E. "Discrete Time Convolution is Multiplication without Carry." European Journal of Electrical Engineering and Computer Science 5, no. 5 (2021): 64–68. http://dx.doi.org/10.24018/ejece.2021.5.5.358.

Full text
Abstract:
In this paper an analysis of discrete-time convolution is performed to prove that the convolution sum is polynomial multiplication without carry, whether the sequences are finite or not, by using several examples to compare the results computed using the existing approaches to the polynomial multiplication approach presented here. In the design and analysis of signals and systems the concept of convolution is very important. While software tools are available for calculating convolution, for proper understanding it is important to learn now to calculate it by hand. To this end, several popular methods are available. The idea that the convolution sum is indeed polynomial multiplication without carry is demonstrated in this paper. The concept is further extended to deconvolution, N-point circular convolution and the Z-transform approach.
APA, Harvard, Vancouver, ISO, and other styles
2

Okoloko, Innocent E. "Unified Vector Multiplication Approach for Calculating Convolution and Correlation." European Journal of Engineering and Technology Research 6, no. 4 (2021): 129–34. http://dx.doi.org/10.24018/ejers.2021.6.4.2488.

Full text
Abstract:
This paper is a theoretical analysis of discrete time convolution and correlation and to introduce a unified vector multiplication approach for calculating discrete convolution and correlation, both of which are important concepts in the design and analysis of signals and systems and are usually encountered in the first course in signals and systems analysis. There are software tools for calculating them, however, it is important to learn now to compute them by hand. Several methods have been proposed to compute them by hand, most of which can be very involving. However, a closer look at the concepts reveal that the convolution and correlation sums are actually vector multiplication with diagonalwise addition and for finite sequences, can be computed by hand the same way. The method is also extended to N-point circular convolution. The method also makes it clearer to see the similarities and differences between convolution and correlation.
APA, Harvard, Vancouver, ISO, and other styles
3

Okoloko, Innocent E. "Unified Vector Multiplication Approach for Calculating Convolution and Correlation." European Journal of Engineering and Technology Research 6, no. 4 (2021): 129–34. http://dx.doi.org/10.24018/ejeng.2021.6.4.2488.

Full text
Abstract:
This paper is a theoretical analysis of discrete time convolution and correlation and to introduce a unified vector multiplication approach for calculating discrete convolution and correlation, both of which are important concepts in the design and analysis of signals and systems and are usually encountered in the first course in signals and systems analysis. There are software tools for calculating them, however, it is important to learn now to compute them by hand. Several methods have been proposed to compute them by hand, most of which can be very involving. However, a closer look at the concepts reveal that the convolution and correlation sums are actually vector multiplication with diagonalwise addition and for finite sequences, can be computed by hand the same way. The method is also extended to N-point circular convolution. The method also makes it clearer to see the similarities and differences between convolution and correlation.
APA, Harvard, Vancouver, ISO, and other styles
4

Duh, W. J., and J. L. Wu. "Two-stage circular-convolution-like algorithm/architecture for the discrete cosine transform." IEE Proceedings F Radar and Signal Processing 137, no. 6 (1990): 465. http://dx.doi.org/10.1049/ip-f-2.1990.0067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chiper, Doru Florin, and Arcadie Cracan. "New Systolic Array Algorithms and VLSI Architectures for 1-D MDST." Sensors 23, no. 13 (2023): 6220. http://dx.doi.org/10.3390/s23136220.

Full text
Abstract:
In this paper, we present two systolic array algorithms for efficient Very-Large-Scale Integration (VLSI) implementations of the 1-D Modified Discrete Sine Transform (MDST) using the systolic array architectural paradigm. The new algorithms decompose the computation of the MDST into modular and regular computational structures called pseudo-circular correlation and pseudo-cycle convolution. The two computational structures for pseudo-circular correlation and pseudo-cycle convolution both have the same form. This feature can be exploited to significantly reduce the hardware complexity since the two computational structures can be computed on the same linear systolic array. Moreover, the second algorithm can be used to further reduce the hardware complexity by replacing the general multipliers from the first one with multipliers with a constant that have a significantly reduced complexity. The resulting VLSI architectures have all the advantages of a cycle convolution and circular correlation based systolic implementations, such as high-speed using concurrency, an efficient use of the VLSI technology due to its local and regular interconnection topology, and low I/O cost. Moreover, in both architectures, a cost-effective application of an obfuscation technique can be achieved with low overheads.
APA, Harvard, Vancouver, ISO, and other styles
6

Matthé, Maximilian, Luciano Mendes, Ivan Gaspar, Nicola Michailow, Dan Zhang, and Gerhard Fettweis. "Precoded GFDM transceiver with low complexity time domain processing." EURASIP Journal on Wireless Communications and Networking 2016, no. 1 (2016): 138. https://doi.org/10.1186/s13638-016-0633-1.

Full text
Abstract:
Future wireless communication systems are demanding a more flexible physical layer. GFDM is a block filtered multicarrier modulation scheme proposed to add multiple degrees of freedom and to cover other waveforms in a single framework. In this paper, GFDM modulation and demodulation is presented as a frequency-domain circular convolution, allowing for a reduction of the implementation complexity when MF, ZF and MMSE filters are employed as linear demodulators. The frequency-domain circular convolution shows that the DFT used in the GFDM signal generation can be seen as a precoding operation. This new point-of-view opens the possibility to use other unitary transforms, further increasing the GFDM flexibility and covering a wider set of applications. The following three precoding transforms are considered in this paper to illustrate the benefits of precoded GFDM: (i) Walsh Hadamard Transform; (ii) CAZAC transform and; (iii) Discrete Hartley Transform. The PAPR and symbol error rate of these three unitary transform combined with GFDM are analyzed as well.
APA, Harvard, Vancouver, ISO, and other styles
7

Yuan, Z., and X. Wang. "Non-linear buckling analysis of inclined circular cylinder-in-cylinder by the discrete singular convolution." International Journal of Non-Linear Mechanics 47, no. 6 (2012): 699–711. http://dx.doi.org/10.1016/j.ijnonlinmec.2011.11.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Civalek, Omer. "Discrete singular convolution method and applications to free vibration analysis of circular and annular plates." Structural Engineering and Mechanics 29, no. 2 (2008): 237–40. http://dx.doi.org/10.12989/sem.2008.29.2.237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ersoy, Hakan, Lutfiye Ozpolat, and Omer Civalek. "Free vibration of circular and annular membranes with varying density by the method of discrete singular convolution." Structural Engineering and Mechanics 32, no. 5 (2009): 621–34. http://dx.doi.org/10.12989/sem.2009.32.5.621.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Koguchi, Hideo, Shuma Suzuki, and Masahiro Taroura. "Contact analysis of an anisotropic half-domain with micropatterns considering friction." International Journal of Computational Materials Science and Engineering 03, no. 01 (2014): 1450005. http://dx.doi.org/10.1142/s2047684114500055.

Full text
Abstract:
In the present study, a contact problem between a spherical indenter and a half-anisotropic elastic region with a micropattern is solved under normal and tangential forces considering friction. The surface Green's function, and the discrete convolution and fast Fourier transform (DC–FFT) method are used to calculate the displacements on a contact area, and the conjugate gradient (CG) method is used to calculate the contact pressure, the contact area, shear tractions, and the stick-slip region. The influences of the shape and density (the pattern area per unit area) of the micropattern and the material anisotropy in the substrate on the friction property of the substrate are investigated. In the present study, substrates with circular and square micropatterns are used in the analysis. The results of the analysis revealed that the shear tractions are concentrated at the edges and corners of the circular and square patterns, respectively. The apparent friction coefficient varies with the direction of the anisotropic principal axis.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Circular discrete convolution"

1

Pineda Manuel, Roger Folch Jose, Perez Juan, and Puche Ruben. "Very Fast and Easy to Compute Analytical Model of the Magnetic Field in Induction Machines with Distributed Windings." In Studies in Applied Electromagnetics and Mechanics. IOS Press, 2008. https://doi.org/10.3233/978-1-58603-895-3-72.

Full text
Abstract:
Torque and e.m.f. of an induction motor can be derived from the air-gap flux density. The paper shows a new method for computing the flux density distribution of constant air-gap width machines, neglecting magnetic saturation, by making use of very efficient techniques widely used in the field of discrete signals processing: the Fast Fourier Transform (FFT) and the Discrete Circular Convolution. The mutual inductances between the phases of the machine are obtained with a single, very simple formula, in terms of the machine's windings distribution and the geometric dimensions, which is solved with the FFT. As the method can handle arbitrary winding conductor distributions, it is highly suitable to the analysis of the magnetic field and electromagnetic torque in machines with stator or rotor faults, such as inter-turn short circuits or broken bars.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Circular discrete convolution' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography