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

Parallel Cyclic Convolution Based on Recursive Formulations of Block Pseudocirculant Matrices

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)
Teixeira, M. ; Dept. of Electr. & Comput. Eng. & Comput. Sci., Polytech. Univ. of Puerto Rico, Hato Rey ; Rodroguez, Y.I.

In this paper, we show how novel recursive formulations of block pseudocirculant matrices lead to a new class of parallel cyclic convolution algorithms that exhibit a high degree of regularity and modularity and are suitable for parallel or pipelined implementation into today's very large scale integration (VLSI) circuits, multifield-programmable gate arrays (multi-FPGAs) systems, and multiprocessor architectures. In addition to the architectural advantages, the proposed formulations offer a comparable number of parallel subsections, and a reduction in the number of pre/postprocessing vector operations, for the same range of decimation rates proposed by the most efficient alternative algorithm. The proposed algorithms do not impose any of the traditional constraints, such as the demand that the convolution length be factorable into mutually prime factors. The use of recursion results in the definition of two new mathematical constructs, which are intrinsic to these novel architectures, the higher order block pseudocirculant or superblock pseudocirculant matrix and the block pseudocyclic shift operator that leads to unfolded data-flow graphs of cyclic shifts.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 7 )

Date of Publication:

July 2008

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.