Cart (Loading....) | Create Account
Close category search window

A New Algorithm for Real Data Convolutions With j -Circulants

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Simois, F.J. ; Dept. of Signal Process. & Commun., Univ. de Sevilla, Sevilla, Spain ; Acha, J.I.

A new algorithm for efficient linear convolution of real signals is presented. It is shown that the circulant required in traditional overlap-and-save (OLS) and overlap-and-add (OLA) methods can be substituted by a j-circulant, that is, a circulant matrix where the shifted elements are multiplied by the imaginary unit. Such j-circulant can be implemented easily and efficiently with half-length complex Fast Fourier Transforms. The latency remains the same as that of OLS and OLA. This method results in computational savings when compared to OLA and OLS, reducing the total arithmetic operations and particularly the execution time.

Published in:

Signal Processing Letters, IEEE  (Volume:18 ,  Issue: 11 )

Date of Publication:

Nov. 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.