Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

CORR
2011
Springer

favoriteEmaildiscussreport

124views Education» more CORR 2011»

Redundancy of minimal weight expansions in Pisot bases

13 years 5 months ago

Redundancy of minimal weight expansions in Pisot bases

Download www.liafa.jussieu.fr

Abstract. Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer n as a sum n = k εkUk, where the digits εk are taken from a ﬁnite alphabet Σ and (Uk)k is a linear recurrent sequence of

Peter J. Grabner, Wolfgang Steiner

Real-time Traffic

CORR 2011 | Education | Linear Recurrent Sequence | Redundant Number Representations | ﬁnite Alphabet |

claim paper

Related Content

» Minimal weight expansions in Pisot bases

» Model Reduction in the TimeDomain Using Laguerre Polynomials and Krylov Methods

» Postrouting redundant via insertion and line end extension with via density consideration

» Low power synthesis of dynamic logic circuits using finegrained clock gating

» DoubleBase Number System for Multiscalar Multiplications

» Saliency Driven Total Variation Segmentation

» Perceptual audio coding using adaptive pre and postfilters and lossless compression

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Peter J. Grabner, Wolfgang Steiner

Comments (0)