Search
Abstract
Convolution is one of the main algorithms performed in the digital signal processing. The algorithm is similar to polynomial multiplication and very intensive computationally. This paper presents a new convolution algorithm based on the Polynomial Residue Number System (PRNS). The use of the PRNS allows to decompose the computation problem and thereby reduce the number of multiplications. The algorithm has been implemented in Xilinx FPGA using residue arithmetic.
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- Proceedings of CSE 2010 International Scientific Conference on Computer Science and Engineering strony 171 - 177
- Language:
- English
- Publication year:
- 2010
- Bibliographic description:
- Smyk R.: Implementation of discrete convolution using polynomial residue representation// Proceedings of CSE 2010 International Scientific Conference on Computer Science and Engineering/ ed. ed. J. Kollar. - Departament of Computers and Informatics. Košice: DCI, 2010, s.171-177
- Verified by:
- Gdańsk University of Technology
seen 102 times