Convolution
29,904 resources related to Convolution
IEEE Organizations related to Convolution
Back to TopConferences related to Convolution
Back to Top2014 IEEE International Conference on Systems, Man and Cybernetics  SMC
SMC2014 targets advances in Systems Science and Engineering, HumanMachine Systems, and Cybernetics involving stateofart technologies interacting with humans to provide an enriching experience and thereby improving the quality of lives including theories, methodologies, and emerging applications.
2013 45th Southeastern Symposium on System Theory (SSST)
SSST invites papers generally focused on the subject of system theory, including topics such as control, modeling, differential and difference equations, computational methods and intelligence, neural systems, and applications of system theory.
2013 IEEE 24th International Conference on Applicationspecific Systems, Architectures and Processors (ASAP)
The conference will cover the theory and practice of applicationspecific systems, architectures and processors. The 2013 conference will build upon traditional strengths in areas such as arithmetic, cryptography, compression, signal and image processing, applicationspecific instruction processors, etc.
Periodicals related to Convolution
Back to TopCircuits and Systems for Video Technology, IEEE Transactions on
Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, highspeed realtime circuits, VLSI architecture and implementation for video technology, multiprocessor systemshardware and software ...
Education, IEEE Transactions on
Educational methods, technology, and programs; history of technology; impact of evolving research on education.
Image Processing, IEEE Transactions on
Signalprocessing aspects of image processing, imaging systems, and image scanning, display, and printing. Includes theory, algorithms, and architectures for image coding, filtering, enhancement, restoration, segmentation, and motion estimation; image formation in tomography, radar, sonar, geophysics, astronomy, microscopy, and crystallography; image scanning, digital halftoning and display, andcolor reproduction.
Multimedia, IEEE Transactions on
The goal of IEEE Transactions on Multimedia is to integrate all aspects of multimedia systems and technology, signal processing, and applications. It will cover various aspects of research in multimedia technology and applications including, but not limited to: circuits, algorithms and macro/microarchitectures, software, detailed design, synchronization, interaction, joint processing and coordination of multimedia and multimodal signals/data, compression, storage, retrieval, communication, ...
Signal Processing, IEEE Transactions on
The technology of transmission, recording, reproduction, processing, and measurement of speech; other audiofrequency waves and other signals by digital, electronic, electrical, acoustic, mechanical, and optical means; the components and systems to accomplish these and related aims; and the environmental, psychological, and physiological factors of thesetechnologies.
Xplore Articles related to Convolution
Back to TopA fast d.f.t. algorithm using complex integer transforms
I. S. Reed; T. K. Truong Electronics Letters, 1978
For certain large transform lengths, Winograd's algorithm for computing the discrete Fourier transform (d.f.t.) is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields developed previously by the authors. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (f.f.t.) or Winograd's more ...
Heterogeneity exploration for multiple 2D filter designs
C. S. Bouganis; P. Y. K. Cheung; G. A. Constantinides International Conference on Field Programmable Logic and Applications, 2005., 2005
Many image processing applications require fast convolution of an image with a set of large 2D filters. Fieldprogrammable gate arrays (FPGAs) are often used to achieve this goal due to their fine grain parallelism and reconfigurability. This paper presents a novel algorithm for the class of designs that implement a convolution with a set of 2D filters. Firstly, it explores ...
Iterative SourceChannel Decoding Using Short Block Codes
T. Clevorn; P. Vary; M. Adrat 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, 2006
Iterative sourcechannel decoding (ISCD) exploits the residual redundancy of the source, e.g., codec parameters, for quality improvements. In contrast to the wellknown convolutional coded ISCD systems, we propose in this paper an ISCD scheme which features a superior performance but is based solely on two short block codes. The block codes serve as highly redundant index assignment and rate1 inner ...
Timespace tradeoffs for branching programs contrasted with those for straightline programs
Karl Abrahamson 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 1986
This paper establishes timespace tradeoffs for some algebraic problems in the branching program model. For a finite field F, convolution of nvectors over F requires ST = Θ(n2 log F), where S is space and T is time, in good agreement with corresponding results for straightline programs. Our result for n × n matrix multiplication over F, ST2 = Θ(n6 ...
Receding Horizon Control of Spatially Distributed Systems over Arbitrary Graphs
Nader Motee; Ali Jadbabaie Proceedings of the 45th IEEE Conference on Decision and Control, 2006
In this paper, we study the problem of receding horizon control of spatially distributed systems with arbitrary interconnection topologies. The key idea is the introduction of spatially decaying operators (SD) which serve as the main ingredient in the cost function that couples the state and control of individual agents with those of others. It is shown that coupling between subsystems ...
More Xplore Articles
Educational Resources on Convolution
Back to TopeLearning
A fast d.f.t. algorithm using complex integer transforms
I. S. Reed; T. K. Truong Electronics Letters, 1978
For certain large transform lengths, Winograd's algorithm for computing the discrete Fourier transform (d.f.t.) is extended considerably. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields developed previously by the authors. This new algorithm requires fewer multiplications than either the standard fast Fourier transform (f.f.t.) or Winograd's more ...
Heterogeneity exploration for multiple 2D filter designs
C. S. Bouganis; P. Y. K. Cheung; G. A. Constantinides International Conference on Field Programmable Logic and Applications, 2005., 2005
Many image processing applications require fast convolution of an image with a set of large 2D filters. Fieldprogrammable gate arrays (FPGAs) are often used to achieve this goal due to their fine grain parallelism and reconfigurability. This paper presents a novel algorithm for the class of designs that implement a convolution with a set of 2D filters. Firstly, it explores ...
Iterative SourceChannel Decoding Using Short Block Codes
T. Clevorn; P. Vary; M. Adrat 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, 2006
Iterative sourcechannel decoding (ISCD) exploits the residual redundancy of the source, e.g., codec parameters, for quality improvements. In contrast to the wellknown convolutional coded ISCD systems, we propose in this paper an ISCD scheme which features a superior performance but is based solely on two short block codes. The block codes serve as highly redundant index assignment and rate1 inner ...
Timespace tradeoffs for branching programs contrasted with those for straightline programs
Karl Abrahamson 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 1986
This paper establishes timespace tradeoffs for some algebraic problems in the branching program model. For a finite field F, convolution of nvectors over F requires ST = Θ(n2 log F), where S is space and T is time, in good agreement with corresponding results for straightline programs. Our result for n × n matrix multiplication over F, ST2 = Θ(n6 ...
Receding Horizon Control of Spatially Distributed Systems over Arbitrary Graphs
Nader Motee; Ali Jadbabaie Proceedings of the 45th IEEE Conference on Decision and Control, 2006
In this paper, we study the problem of receding horizon control of spatially distributed systems with arbitrary interconnection topologies. The key idea is the introduction of spatially decaying operators (SD) which serve as the main ingredient in the cost function that couples the state and control of individual agents with those of others. It is shown that coupling between subsystems ...
More eLearning Resources
IEEEUSA EBooks

This appendix contains sections titled: Case 1: Wn f ref Case 2: 1/T Wn f ref Case 3: Wn 1/T f ref Variance of Sampled Noise (1/T f ref) Convolution of PSDs Representing Squared PSDs

Appendix A: Convolution Properties
This chapter contains sections titled: Identity Commutativity Associativity Distributivity Circularity

The Discriminative Power of a Dynamical Model Neuron
This chapter contains sections titled: Introduction, Review of VC Dimension, An Integrateandfire Classifier, Convolution as a Product, Special Cases and Extensions, Discussion

This book is Volume IV of the series DSP for MATLAB™ and LabVIEW™. Volume IV is an introductory treatment of LMS Adaptive Filtering and applications, and covers cost functions, performance surfaces, coefficient perturbation to estimate the gradient, the LMS algorithm, response of the LMS algorithm to narrowband signals, and various topologies such as ANC (Active Noise Cancelling) or system modeling, Noise Cancellation, Interference Cancellation, Echo Cancellation (with single and dualH topologies), and Inverse Filtering/Deconvolution. The entire series consists of four volumes that collectively cover basic digital signal processing in a practical and accessible manner, but which nonetheless include all essential foundation mathematics. As the series title implies, the scripts here will run on both MATLAB™ and LabVIEW™. The text for all volumes contains many examples, and many useful computational scripts, augmented by demonstration scripts and LabVIEW&# 482; Virtual Instruments (VIs) that can be run to illustrate various signal processing concepts graphically on the user's computer screen. Volume I consists of four chapters that collectively set forth a brief overview of the field of digital signal processing, useful signals and concepts (including convolution, recursion, difference equations, LTI systems, etc), conversion from the continuous to discrete domain and back (i.e., analogtodigital and digitaltoanalog conversion), aliasing, the Nyquist rate, normalized frequency, sample rate conversion and Mulaw compression, and signal processing principles including correlation, the correlation sequence, the Real DFT, correlation by convolution, matched filtering, simple FIR filters, and simple IIR filters. Chapter 4 of Volume I, in particular, provides an intuitive or "first principle" understanding of how digital filtering and frequency transforms work. Volume II provides detailed coverage of discrete frequency transforms, includi g a brief overview of common frequency transforms, both discrete and continuous, followed by detailed treatments of the Discrete Time Fourier Transform (DTFT), the zTransform (including definition and properties, the inverse ztransform, frequency response via ztransform, and alternate filter realization topologies including Direct Form, Direct Form Transposed, Cascade Form, Parallel Form, and Lattice Form), and the Discrete Fourier Transform (DFT) (including Discrete Fourier Series, the DFTIDFT pair, DFT of common signals, bin width, sampling duration, and sample rate, the FFT, the Goertzel Algorithm, Linear, Periodic, and Circular convolution, DFT Leakage, and computation of the Inverse DFT). Volume III covers digital filter design, including the specific topics of FIR design via windowedideallowpass filter, FIR highpass, bandpass, and bandstop filter design from windowedideal lowpass filters, FIR design using the transition bandoptimized Frequency Sampling technique (impleme ted by InverseDFT or Cosine/Sine Summation Formulas), design of equiripple FIRs of all standard types including Hilbert Transformers and Differentiators via the Remez Exchange Algorithm, design of Butterworth, Chebyshev (Types I and II), and Elliptic analog prototype lowpass filters, conversion of analog lowpass prototype filters to highpass, bandpass, and bandstop filters, and conversion of analog filters to digital filters using the Impulse Invariance and Bilinear Transform techniques. Certain filter topologies specific to FIRs are also discussed, as are two simple FIR types, the Comb and Moving Average filters. Table of Contents: Introduction To LMS Adaptive Filtering / Applied Adaptive Filtering

Convolutional Representations of ContinuousTime Systems
This chapter contains sections titled: Introduction, The LTransform Convolution Theorem, Convolution and General LTI Systems, Causality and Stability, Summary, Exercises for Chapter 10, Problems for Chapter 10

Rigorous Diffraction Theory for 360?? ComputerGenerated Holograms
Most algorithms for a computergenerated hologram using FFT are effective only under the condition that both the input and observation surfaces are finite planes that are parallel to each other. To synthesize a 360 degree hologram in a computer, a numerical simulation of the diffraction on the non planar observation surfaces is required. At first, we propose a simple but rigorous equation which describes the relation between the diffracted wavefront of a 3D object and its 3D Fourier spectrum. In this method, an exact solution of the diffraction integral is given by the Green function. This principle gives us an intuitive understanding of calculation processes for various diffraction situation. Alternatively, fast computation solutions for spherical computer generated hologram employing PSF (convolution method) is proposed. We start with Helmholtz equation, with considering a boundary value problem in spherical coordinates. The solution define the transfer function and the spectral decomposition of the wave field in the spherical surface. Using the transfer function and the wave spectrum we can develop a spectral propagation formula (for spherical surfaces in spherical coordinates) analogous to the angular spectrum formula. Some computer simulation and experimental results are presented.

This chapter contains sections titled: Introduction Four Performance Measures Nine Algorithm Constraints Three Construction Approaches Algorithm Data Mapping Relabeling Convolution Approach Prime Factor Approach MixedRadix Approach Comparison Matrices Conclusions This chapter contains sections titled: References

This chapter contains sections titled: Vectors Basic Concepts of Matrix Algebra Some Commonly Used Functions Convolution The Fourier Transform The Radon Transform This chapter contains sections titled: Exercises

Linear TimeInvariant (LTI) Systems
This chapter contains sections titled: Linear Systems Linear TimeInvariant (LTI) Systems The Convolution Integral The UnitImpulse Sifting Property Convolution This chapter contains sections titled: Problems

Elements of Risk Evaluation Methods
Chapter 4 describes fundamental methods for simple system risk evaluation and comprehensive techniques for risk assessment of largescale and complex systems, including: Probability convolution Series and parallel networks Markov equations Frequencyduration approaches State enumeration Nonsequential Monte Carlo simulation Sequential Monte Carlo simulation