Discrete convolution based on polynomial residue representation

Robert Smyk

Discrete convolution based on polynomial residue representation

Abstract

This paper presents the study of fast discrete convolution calculation with use of the Polynomial Residue Number System (PRNS). Convolution can be based the algorithm similar to polynomial multiplication. The residue arithmetic allows for fast realization of multiplication and addition, which are the most important arithmetic operations in the implementation of convolution. The practical aspects of hardware realization of PRNS convolution in Xilinx FPGA are also presented.

Author (1)

Robert Smyk dr inż.

Cite as

Full text

full text is not available in portal

Keywords

Details

Category:: Articles
Type:: artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
Published in:: Poznan University of Technology Academic Journals. Electrical Engineering pages 167 - 175,
ISSN: 1897-0737
Language:: English
Publication year:: 2010
Bibliographic description:: Smyk R.: Discrete convolution based on polynomial residue representation// Poznan University of Technology Academic Journals. Electrical Engineering. -., nr. nr 63 (2010), s.167-175
Verified by:: Gdańsk University of Technology