Two-dimensional polynomial residue number system
Resource
Signal Processing 40 (2-3): 295-306
Journal
Signal Processing
Journal Volume
40
Journal Issue
2-3
Pages
295-306
Date Issued
1994
Author(s)
Abstract
The polynomial residue number system (PRNS) has been considered as a useful tool for digital signal processing (DSP) since it can support parallel, carry-free, high speed arithmetic with minimum multiplication count provided that an appropriate modular ring is chosen. In this paper, the properties of two-dimensional (2-D) PRNS are investigated in detail. It is shown that in the 2-D PRNS system, the theoretical lower bound for multiplication count of polynomial products can be achieved in some carefully chosen ring. Application of the proposed 2-D PRNS for computing 2-D circular convolution, which involves intensive multiplication operations, is also presented. © 1994.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
38.pdf
Size
708.24 KB
Format
Adobe PDF
Checksum
(MD5):1b4dfa801256b8e3df3efecdeaec299a