DocumentCode
2172644
Title
A novel development for parallel cyclic convolution: The super block pseudocirculant matrix
Author
Teixeira, Marvi ; Rodriguez, Y. Ivan ; Gonzalez, Angel
Author_Institution
Electr. & Comput. Eng. & Comput. Sci. Dept., Polytech. Univ. of Puerto Rico, Hato Rey
fYear
2007
fDate
April 30 2007-May 2 2007
Firstpage
1
Lastpage
6
Abstract
As opposed to prime factor type algorithms, the only requirement made by parallel cyclic convolution techniques based on block pseudocirculant matrices is that the convolution length be composite. Highly composite lengths, in particular, give a larger variety of implementation choices. In this paper we offer an introduction to new mathematical constructs, the super block pseudocirculant matrix, and the block pseudocyclic shift operator, as a base to derive further structures for this important class of parallel, one dimensional, cyclic convolution algorithms based on block pseudocirculant matrices. Their modular composition makes them suitable for implementation in VLSI, FPGA or multiprocessor computers in either a pipelined or a parallel fashion. Block pseudocirculants appear in fields such as precoding systems, transmultiplexers, polyphase networks, block filtering, QMF banks, and others, therefore the new mathematical constructs introduced in this paper may have an impact that transcend its sole applications to parallel cyclic convolution and its related applications.
Keywords
block codes; convolution; convolutional codes; cyclic codes; matrix algebra; parallel algorithms; FPGA; VLSI; block pseudocyclic shift operator; cyclic convolution algorithms; multiprocessor computers; parallel cyclic convolution; super block pseudocirculant matrix; Application software; Computer science; Concurrent computing; Convolution; Discrete cosine transforms; Field programmable gate arrays; Filter bank; Filtering; Tin; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Sarnoff Symposium, 2007 IEEE
Conference_Location
Nassau Inn, Princeton, NJ
Print_ISBN
978-1-4244-2483-2
Type
conf
DOI
10.1109/SARNOF.2007.4567391
Filename
4567391
Link To Document