(Enter summary)
Abstract: N-digit, radix-a bases are proposed for VLSI
implementation of redundant arithmetic, mod m, where a
= 1 ,
# 1 , for 0 < j < N and m is prime. These bases simplify
arithmetic overflow and are well suited to redundant arithmetic. The
representations provide competitive, multiplierless T-point Number
Theoretic Transforms, mod m, where T | N or T | 2N. (Update)
Active bibliography (related documents): More All
0.0: Optimizing Computations for Effective Block-Processing - Lalgudi, Papaefthymiou.. (2000)
(Correct)
0.0: Unknown - Describes
(Correct)
0.0: Comparison of Two Algorithms for Decoding Alternant Codes - Fitzpatrick, Jennings (1997)
(Correct)
Similar documents based on text: More All
1.0: Unusual-Length Number-Theoretic Transforms Using Recursive.. - Parker, Benaissa (1995)
(Correct)
0.9: Fault-Tolerant Linear Convolution Using Residue Number Systems - Parker, Benaissa (1994)
(Correct)
0.7: High-Performance Implementation of Convolution on.. - Meyer-Bäse, Wolf..
(Correct)
BibTeX entry: (Update)
@article{ parker97modular,
author = "M. G. Parker and Mohammed Benaissa",
title = "Modular Arithmetic Using Low Order Redundant Bases",
journal = "IEEE Transactions on Computers",
volume = "46",
number = "5",
pages = "611-616",
year = "1997",
url = "citeseer.ist.psu.edu/514292.html" }
Citations (may not include all citations):
59
Fast Algorithms for Digital Signal Processing (context) - Blahut - 1985
1
Generalized Fermat-Mersenne Number Theoretic Transform (context) - Dimitrov, Cooklev et al. - 1994
Documents on the same site (http://www.ii.uib.no/~matthew/MattWeb.html): More
Legendre and Twin Prime Sequences: Trace and Multi-Rate.. - Parker University Of (1999)
(Correct)
A Modified Jacobi Sequence Construction Using Multi-Rate Legendre .. - Parker
(Correct)
Generalised Rudin-Shapiro Constructions - Parker (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC