DocumentCode :
1282049
Title :
Redundant radix representations of rings
Author :
Nielsen, Asger Munk ; Kornerup, Peter
Author_Institution :
MIPS Technol. Inc., Copenhagen, Denmark
Volume :
48
Issue :
11
fYear :
1999
fDate :
11/1/1999 12:00:00 AM
Firstpage :
1153
Lastpage :
1165
Abstract :
This paper presents an analysis of radix representations of elements from general rings; in particular, we study the questions of redundancy and completeness in such representations. Mappings into radix representations, as well as conversions between such, are discussed, in particular where the target system is redundant. Results are shown valid for normed rings containing only a finite number of elements with a bounded distance from zero, essentially assuring that the ring is “discrete.” With only brief references to the more usual representations of integers, the emphasis is on various complex number systems, including the “classical” complex number systems for the Gaussian integers, as well as the Eisenstein integers, concluding with a summary on properties of some low-radix representations of such systems
Keywords :
digital arithmetic; redundant number systems; Eisenstein integers; complex number systems; computer arithmetic; number system conversion; radix number systems; radix representations; redundancy; Atomic measurements; Concurrent computing; Digital arithmetic; Hardware; Mathematics; Microprocessors; Modules (abstract algebra); Polynomials; Signal processing; Signal processing algorithms;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.811100
Filename :
811100
Link To Document :
بازگشت