Professional Documents
Culture Documents
1, 2012
EXPLORING STRANGE NUMBER SYSTEM: LATENT TALENT TO BE USED IN PLACE OF TRADITIONAL NUMBER SYSTEM
Debasis Das1 and Dr. U. A. Lanjewar2
1
Assistant Professor, MCA, VMV Commerce, JMT Arts & JJP Science College, Nagpur, Maharashtra, India debasis_das2005@rediffmail.com
2
Professor, MCA, VMV Commerce, JMT Arts & JJP Science College, Nagpur, Maharashtra, India ualanjewar@gmail.com
Abstract
People count by tens and machines count by twos-that pretty much sums up the way we do arithmetic on this planet. The cultural preference for base 10 and the engineering advantages of base 2 have nothing to do with any intrinsic properties of the decimal and binary numbering systems. But there are countless other ways to count. The numbers in strange number system (SNS) are those numbers which are other than the numbers of traditional number system viz. decimal (base 10), binary (base-2), octal (base-8) and hexadecimal (base 16). Some of the strange numbers are unary, ternary, , Nonary, ..., unodecimal, , vigesimal sexagesimal, etc. These number systems are not as widely known or widely used as traditional number system in computing, but they have charms all their own having a genuine mathematical distinction in its favour. By one plausible measure, it is the most efficient of all integer bases; it offers the most economical way of representing numbers. Today, the complexity of traditional number system is steadily increasing in computing. Due to this fact, strange number system is investigated for efficiently describing and implementing in digital systems. In computing the study of strange number system (SNS) will useful to all researchers. Their awareness and detailed explanation is necessary for understanding various digital aspects. In this paper we have elaborate the concepts of strange number system (SNS), needs, number representation, arithmetic operations and inter conversion with different bases, represented in tabulated form. This paper will also helpful for knowledge seekers to easy understanding and practicing of number systems as well as to memories them.
January
preference to the binary number system in electronic computers. The famous John von Neumann Principles include three basic ideas of electronic computer design: binary number system, binary logic and binary memory element. With the invention of computers, Boolean algebra got, its important, applications in computer technology, binary number system has occupied the core of computer arithmetic, and binary memory element have become inseparable in computing and storing. The exclusive success of Binary Machines has led to an erroneous impression (familiar among computer scientists) that; BASE 2 is the only base system which can be adapted to build Arithmetic Machines. Many Computer Scientists give little or no research-time to the many other forms of realizable Alternate Base Machines, to the sole benefit of Binary Systems. However, research in the field of number systems has continued in modern computer science. A basic motivation of this paper is to overcome a number of essential deficiencies of the binary number system. The most well known of these are (a) the sign problem (it is impossible to represent negative numbers and perform arithmetical operations over them in direct code) that complicates arithmetical computer structures, (b) the problem of zero redundancy (all binary code combinations are permitted) and (c) limitation of speed of modern computers in performing the arithmetic operations such as addition, subtraction and multiplication suffer from carry propagation delay that does not allow the checking of informational processes in processors and computers effectively. Due to the increasing the complexity of traditional number system in computing, strange number system is widely used. The first attempt to overcome the sign problem of the binary number system was made a ternary computer, called Setun by Nikolai P. Brousentsov in 1958 at Moscow University in Russia. To overcome the problem of zero redundancy, another original discovery in number-system theory, called Tau System was made by the American mathematician George Bergman in 1957 and in QSD number system carry propagation chain are eliminated which reduce the computation time substantially and enhancing the speed of the machine [3, 4]. Since last few decades strange number system has been possible alternative to binary logic. Unfortunately, the development of strange number system was not keeping up with the speed of the binary counterparts. But the strange number system (SNS) does have a genuine mathematical distinction in its favor. The potential advantages of strange number system distinguish them from the traditional number system and make them worth an extra look; some of these features include [1]: Greater speed of arithmetic operations realization Greater density of memorized information Better usage of transmission paths Decreasing of interconnections complexity and interconnections area Decreasing of pin number of integrated circuits and printed boards Avoid sign problem and zero redundancy problem Although many researcher and knowledge seeker know only the traditional number system such as decimal, binary, octal and hexadecimal and are very comfortable with performing operations using this system, it is important for them to understand that traditional number system is not the only system. By studying other number system such as quadrovigesimal (base-24), hexavigesimal (base-26), heptovigesimal (base-27), trigesimal (base-30), duotrigesimal (base-32), hexatrigesimal (base-36), quadragesimal (base-40), pentagesimal (base-50), sexagesimal (base-60), duosexagesimal (base-62), quadrosexagesimal (base-60), pentaoctagesimal (base-85) and octovicentimal (base-128), researcher will gain a better understanding of how number systems work in general. When discussing how a computer stores information, the binary number system becomes very important since this is the system that computers use. It is important that students understand that computers store and transmit data using electrical pulses, and these pulses can take two forms - "on" (1) or "off" (0). This paper will stimulate the readers interest to the strange number system beyond traditional number system. In this particular paper, we are taking under the consideration a tabulated format for few strange number systems. It covers each systems number representation, their uses, their arithmetic and inter-conversion of numbers from one system to another.
January
Duodecimal
12
10 11 12
13 14 15
January
13 14 15
17 18 19
16
Vigesimal
20
17 18 19 20 21 22 23 24 25 26 27 28 29
Quadrovigesimal Hexavigesimal Septemvigesimal Trigesimal Duotrigesimal Hexatrigesimal Quadragesimal Pentagesimal Sexagesimal Duosexagesimal Quadrosexagesima l Pentaoctagesimal Octovicentimal
24 26 27 30 32 36 40 50 60 62 64 85 128
Resource location and discovery based protocol PASW Statistics Software TCP/IP and as an atomic number of potassium in science Dzongkha, the national language of Bhutan , Munda language of India, the Ainu language In East Asia, Nakh languages, Basque language, Georgian language, Albanian language, Scottish Gaelic, French language, Danish language, Breton language, Welsh language, Irish language, Slavic languages, Slovenian language in Italy, old British currency system, Celtic numerals, Maya numerals Umbu-Ungu or kakoli, Tokapu, BASE24-atm, BASE24-eps, BASE24-infobase and BASE24-pos Used to represent the serial number, if the entire alphabet is used Telefol and Oksapmin languages Arabic numerals and recurring fractions Base32 encoding and the Ngiti language. Base36 encoding Music theory, music analysis, music query, and the visualization of tonal music Sign Language Typology Project The Babylonian and Hellenistic numerals, Hebrew calendar, measuring angles, geographic coordinates, and time Base62 encoding Base64 encoding, data URI scheme, PHP obfuscation Ascii85 encoding Islamic calendar, bar codes, military, transportation, IPv6, Graphics cards, ASCII and many other fields in computing
MSD
LSD
Figure 1. Ordering of Fixed point Number The number representation of strange number system is as follows:
January
232 + 031 + 130 + 03-1 + 23-2 342 + 041 + 240 + 04-1 + 34-2 452 + 051 + 350 + 05-1 + 45-2 562 + 061 + 460 + 06-1 + 56-2 672 + 071 + 570 + 07-1 + 67-2 892 + 091 + 790 + 09-1 + 89-2 A112 + 0111 + 1110 + 011-1 + 211-2 B122 + 0121 + 1120 + 012-1 + 212-2 C132 + 0131 + 2130 + 013-1 + 313-2 D142 + 0141 + 3140 + 014-1 + 414-2 E152 + 0151 + 4150 + 015-1 + 515-2 G172 + 0171 + 5170 + 017-1 + 617-2 H182 + 0181 + 7180 + 018-1 + 818-2 I192 + 0191 + 7190 + 019-1 + 819-2 J202 + 0201 + 7200 + 020-1 + 820-2 N242 + 0241 + 7240 + 024-1 + A24-2 P262 + 0261 + 7260 + 026-1 + B26-2 Q272 + 0271 + 7270 + 027-1 + C27-2 T302 + 0301 + 7300 + 030-1 + D30-2 V322 + 0321 + 7320 + 032-1 + E32-2 Z362 + 0361 + 7360 + 036-1 + F36-2 d402 + 0401 + 7400 + 040-1 + G40-2 n502 + 0501 + 7500 + 050-1 + H50-2 x602 + 0601 + 7600 + 060-1 + I60-2 z622 + 0621 + 7620 + 062-1 + J62-2 x642 + /641 + 7640 + 064-1 + I64-2
28
Pentaoctagesimal
85
(z*7.0J)85
29
Octovicentimal
128
(J03.0D)128
January
Figure2. The Ternary Calculating Machine of Thomas Fowler 4.1.2 Setun At the dawn of computer era, Setun was a more complicated ternary machine, built by Nikolai P. Brousentsov and his colleagues at Moscow State University in Russia in 1958. This machine is regarded as experimental, and as an educational training program for engineers. The machine contains 4,000 magnetic cores, 4,000 germanium diodes, approximately 100 transistors, and 40 vacuum tubes. It operates at a 200-kilocycle clock rate. It uses 1 MC transistors, which are rated at 150 mill watts dissipation at 25 degree centigrade, but can tolerate a maximum of 100 degree centigrade. Setun has only 81 words of storage and 27 different instructions. It is a single-address, fixed-point machine, with 18 ternary digits per word. There is no divide instruction. Setun is a sequential computer containing the fast multiplier, thanks to the speed of operation as in parallel devices is achieved. However, simplicity, economy and elegancy of computer architecture are the direct and practically very important consequence of the ternarity, more exactly signed bit representation by code with digits 0, +1, -1, decreases the amount of conditional instructions and the arithmetic operations allow free variation of the length of operands and may be executed with different lengths; the ideal rounding is achieved simply by truncation, i.e. the truncation coincides with the rounding and there is the best approximation the rounding number by rounded.
January
Setun worked correctly at once without even debugging and began to execute the existing programs. At 1960 it was sufficient amount of programs and it was possible to present Setun for the official testing. Such testing was passed in Apr. 1960 very successfully and recommended for production. It was found that ternary computer is very favorable for seizing and application [11]. 4.1.3 Setun 70 On the base of Setuns positive experience it was designed and exhaustively determined in Algollike programming language the architecture of other ternary computer. This computer named Setun 70 was introduced in 1970. In Setun 70 the peculiarities of ternarity are embodied with more understanding and completeness. It is a two-stack computer. Stack of operands is the evolution of accumulator of one-address Setun. The return stack is the base of automata that controls the nesting of subprograms. The simple improvement of such mechanism permits to transform Setun 70 into some computer for the proposed Dijkstra E.W. structured programming. However, Setun 70 was the last ternary computer and after it the research was stopped [14]. 4.1.4 Ternac In 1973 Gideon Frieder and his colleagues at the State University of New York at Buffalo designed a complete base-3 machine they called ternac, and created a software emulator of it. In TERNAC both fixed-point and floating-point capability were provided. The fixed-point words were 24 trits in length and the floating-point words had 42 trits for mantissa and 6 trits for exponent. The TERNAC computer implementation was intended primarily to discover if the implementation of a nonbinary structure on a binary computer is feasible, and to discover the cost in memory storage and time for such an implementation. As a feasibility test, this effort was successful, and the first version of this implementation has proved that both the speed and price are on the order of the speed and price of binary computers.
January
January
appear in several science fiction stories: Carl Sagan's novel Contact references a message hidden inside pi that is most striking in base 11, as that permits it to be displayed in binary code. . The unodecimal number system is also used to check digit for ISBN. The number system with base twelve is known as the duodecimal number system. In this system twelve symbols are used to represent numbers and these are numerals 0 through 9 and alphabets A and B. Duodecimal number system have received its name from the division of unity into 12 equal parts. This number system combines all the advantages of the senary and decimal number system. The number system with base thirteen is known as the tridecimal number system. In this system thirteen symbols are used to represent numbers and these are numerals 0 through 9 and alphabets A, B and C. The Conway base 13 function is used as a counterexample to the converse of the intermediate value theorem that is discontinuous at every point. The number system with base fourteen is known as the quadrodecimal number system. It requires fourteen symbols. Since there are only ten common decimal digits, the notation can be extended by using letters A, B, C and D to represent values 10, 11, 12 and 13 respectively. This system is infrequently used. It finds applications in mathematics as well as fields such as programming for the HP 9100A/B calculator, image processing applications and other specialized uses. The number system with base fifteen is known as the pentadecimal number system. In this system fifteen symbols are used to represent numbers and these are numerals 0 through 9 and alphabets A, B, C, D and E. This system is infrequently used. It finds applications in mathematics as well as fields such as telephony routing over IP and other specialized uses. The number system with base seventeen is known as the heptadecimal number system. In this system seventeen symbols are used to represent numbers and these are numerals 0 through 9 and alphabets A, B, C, D, E, F and G. This number system is very important for many scientific applications, as well as for engineering and other practical uses. The number system with base eighteen is known as the octodecimal number system. It requires eighteen symbols. Since there are only ten common decimal digits, the notation can be extended by using letters A, B, C, D, E, F, G and H to represent values 10, 11, 12, 13, 14, 15, 16 and 17 respectively. The number system with base nineteen is known as the nonadecimal number system. It requires nineteen symbols. Since there are only ten common decimal digits, the notation can be extended by using letters A, B, C, D, E, F, G, H and I to represent values 10, 11, 12, 13, 14, 15, 1, 17 and 18 respectively. This system is used in TCP/IP for chargen and as an atomic number of potassium in science. The number system with base twenty is known as the vigesimal number system. It requires twenty symbols. Since there are only ten common decimal digits, the notation can be extended by using letters A, B, C, D, E, F, G,H, I, and J to represent values 10, 11, 12, 13, 14, 15, 16, 17, 18, and 19 respectively. This system is widely used nearly all over the world in various languages. Vigesimal number system (base-20) is unique to our current decimal system.
January
..243242241240.24-124-224-3.. The arithmetic operations like addition, subtraction, multiplication and division operations of decimal numbers can be also performed on quadrovigesimal numbers. In practical applications, the nuisance of recurring decimals is encountered less often when quadrovigesimal (or duodecimal) notation is used.
January
In trigesimal number system the leftmost bit is known as most significant bit (MSB) and the right most bit is known as least significant bit (LSB). The following expression shows the position and the power of the base 30: ..303302301300.30-130-230-3.. The arithmetic operations like addition, subtraction, multiplication and division operations of decimal numbers can be also performed on heptovigesimal numbers. From a mathematical viewpoint, 30 is a convenient choice for a base in that it is the 4th primorial number; many vulgar fractions are easily expressed in base 30. On the other hand, base 30 has poor radix economy, and it shares the problem with base 60 of its radix falling between twin primes, resulting in few recurring fractions having short periods.
January
January
sexagesimal is not used so much in modern times as a means for general computations, or in logic, but rather, it is used in measuring angles, geographic coordinates, and time.
January
In pentaoctagesimal number system the leftmost bit is known as most significant bit (MSB) and the right most bit is known as least significant bit (LSB). The following expression shows the position and the power of the base 85: ..853852851850.85-185-285-3.. The arithmetic operations like addition, subtraction, multiplication and division operations of decimal numbers can be also performed on pentaoctagesimal numbers. This number system is used in ASCII 85 encoding system to encode binary data to text format.
Addition
(11)3 + (02)3 = (20)3 (36)4 + (06)4 = (120)4 (42)5 + (16)5 = (113)5
Subtraction
(11)3 - (02)3 = (02)3 (36)4 - (06)4 = (30)4 (42)5 - (16)5 = (21)5
Multiplication
(11)3 * (02)3 = (22)3 (36)4 * (06)4 = (1230)4 (42)5 * (16)5 = (1432)5
Division
(11)3 / (02)3 = (02)3 (36)4 / (06)4 = (03)4 (42)5 / (16)5 = (02)5
January
International Journal of Advances in Science and Technology Senary Septenary Nonary Unodecimal Duodecimal Tridecimal Quadrodecimal Pentadecimal Heptadecimal Octodecimal Nonadecimal Vigesimal Quadrovigesimal Hexavigesimal Septemvigesimal Trigesimal Duotrigesimal Hexatrigesimal Quadragesimal Pentagesimal Sexagesimal Duosexagesimal Quadrosexagesimal Pentaoctagesimal Octovicentimal (52)6 + (24)6 = (120)6 (26)7 + (13)7 = (42)7 (38)9 + (05)9 = (44)9 (2A)11 + (04)11= (33)11 (2B)12 + (05)12 = (34)12 (1C)13 + (05)13 = (24)13 (1D)14 + (09)14 = (28)14 (1E)15 + (02)15 = (31)15 (1G)17 + (03)17 = (22)17 (1H)18 + (05)18 = (24)18 (2I)19 + (07)19 = (36)19 (1J)20 + (03)20 = (22)20 (3N)24 + (05)24 = (44)24 (2P)26 + (07)26 = (36)26 (2Q)27 + (08)27 = (37)27 (20)30 + (05)30 = (25)30 (1V)32 + (03)32 = (22)32 (0Z)36 + (05)36 = (14)36 (0d)40 + (03)40 = (12)40 (0n)50 + (07)50 = (16)50 (10)60 + (05)60 = (15)60 (1z)62 + (03)62 = (22)62 (1z)64 + (05)64 = (22)64 (10)85 + (05)85 = (15)85
(12)128 + (05)128 = (17)128
(52)6 - (24)6 = (24)6 (26)7 - (13)7 = (13)7 (38)9 - (05)9 = (33)9 (2A)11 - (04)11 = (26)11 (2B)12 - (05)12 = (26)12 (1C)13 - (05)13 = (17)13 (1D)14 - (09)14 = (14)14 (1E)15 - (02)15 = (3C)15 (1G)17 - (03)17 = (1D)17 (1H)18 - (05)18 = (1C)18 (2I)19 - (07)19 = (2B)19 (1J)20 - (03)20 = (1G)20 (3N)24 - (05)24 = (3I)24 (2P)26 - (07)26 = (2I)26 (2Q)27 - (08)27 = (2I)27 (20)30 - (05)30 = (1P)30 (1V)32 - (03)32 = (1S)32 (0Z)36 - (05)36 = (0U)36 (0d)40 - (03)40 = (0a)40 (0n)50 - (07)50 = (0g)50 (10)60 - (05)60 = (0t)60 (1z)62 - (03)62 = (1w)62 (1z)64 - (05)64 = (1u)64 (10)85 - (05)85 = (0_)85
(12)128 - (05)128 = (0 )128
(52)6 * (24)6 = (2212)6 (26)7 * (13)7 = (404)7 (38)9 * (05)9 = (214)9 (2A)11 * (04)11 = (107)11 (2B)12 * (05)12 = (127)12 (1C)13 * (05)13 = (98)13 (1D)14 * (09)14 = (135)14 (1E)15 * (02)15 = (5D)15 (1G)17 * (03)17 = (5E)17 (1H)18 * (05)18 = (9D)18 (2I)19 * (07)19 = (11C)19 (1J)20 * (03)20 = (5H)20 (3N)24 * (05)24 = (JJ)24 (2P)26 * (07)26 = (KJ)26 (2Q)27 * (08)27 = (NJ)27 (20)30 *(05)30 = (A0)30 (1V)32 * (03)32 = (5T)32 (0Z)36 * (05)36 = (4V)36 (0d)40 * (03)40 = (2b)40 (0n)50 * (07)50 = (6h)50 (10)60 * (05)60 = (50)60 (1z)62 * (03)62 = (5x)62 (1z)64 * (05)64 = (9n)64 (10)85 * (05)85 = (50)85
(12)128 * (05)128 = (5A)128
(52)6 / (24)6 = (02)6 (26)7 / (13)7 = (02)7 (38)9 / (05)9 = (07`)9 (2A)11 / (04)11= (08)11 (2B)12 / (05)12 = (07)12 (1C)13 / (05)13 = (05)13 (1D)14 / (09)14 = (03)14 (1E)15 / (02)15 = (17)15 (1G)17 / (03)17 = (11)17 (1H)18 / (05)18 = (07)18 (2I)19 / (07)19 = (08)19 (1J)20 / (03)20 = (0D)20 (3N)24 / (05)24 = (0J)24 (2P)26 / (07)26 =(0B)26 (2Q)27 / (08)27 =(0A)27 (20)30 / (05)30 = (0C)30 (1V)32 / (03)32 =(0L)32 (0Z)36 / (05)36 = (07)36 (0d)40 / (03)40 = (0D)40 (0n)50 / (07)50 = (07)50 (10)60 / (05)60 = (0C)60 (1z)62 / (03)62 = (0f)62 (1z)64 / (05)64 = (0P)64 (10)85 / (05)85 = (0H)85
(12)128 / (05)128 =(0Q)128
This section describes the conversion of one base to another. The best way to develop facility in the understanding positional number notation in a variety of bases is to be able to convert numbers from any starting base ra to any destination base rb. Such conversion usually requires base divide and multiply method. There is a general procedure for the operation of converting a decimal number to a number in base r. If the number includes a base point, it is necessary to separate the number into an integer part and a fraction part, since each part must be converted differently. To convert an integer number from decimal to some other base, we divide the number successively by the destination base until the quotient becomes zero. The remainders form the answer, with the first remainder serving as the least significant bit (LSB) and the last remainder the most significant bit (MSB).
January
One way to convert an integer number from any other base to decimal equivalent is the sum-ofweights method. Here, we determine the set of weights (which are in powers of source base) whose sum is the number in question. In general, conversion of a fractional number from some other base to decimal is just a straightforward extension of the conversion algorithm for integers. This calculation is accomplished starting from the radix point and proceeding outwards. Then the separate contribution to the number of each numeral extending rightwards from the radix point must be determined by multiplying the place value expressed in decimal by that numeral. Finally, the sum of the contributions of all numerals of the original number must be taken. To convert a decimal fraction to a specific base, we multiply the number successively by the base of this number, removing the carry in each step, until the fractional product is zero or until the desired number of bits is collected. The carries form the answer, with the first carry serving as the MSB and the last as the LSB. In the converting values, especially fractional values between bases, there might be instances when the values are to be corrected within a specific number of places. This may be done by truncation or rounding. In truncation, we simply chop a portion off from the fraction. In rounding, we need to examine the leading digit of the portion we intend to remove. It is important to be able to convert a number from any arbitrary base to any other base. This is generally difficult to do, since the arithmetic has to be carried out in the starting base, and the rules for division in the general case of base r are different from the rules of decimal arithmetic that we are used to from daily living. The easiest way to accomplish this goal, convert first to decimal and then to the target base. Therefore, in general to convert from base r1 to base r2, just convert first from base r1 to decimal, and then from decimal to base r2. When performing these conversions, it becomes important for all to indicate the base that the number is written in, as it will become very easy to confuse how the number is being represented. Table III shows the inter-conversions between various bases. Table 4. Base Interconversion of Strange Number Systems
Base Inter Conversion
Part-A
Step-1 Decimal to any base [unary, , vigesimal, ..] Integer: repeated division by base Fraction: repeated multiplication by base Step-2 Binary to any base [quaternary, octal, hexadecimal, ...] To quaternary: replace group of 2-binary bits by quaternary digit To octal: replace group of 3-binary bits by octal digit To hexadecimal: replace group of 4-binary bits by hexadecimal digit To duotrigesimal: replace group of 5-binary bits by duotrigesimal digit Step-3 Ternary to any base [nonary, heptovigesimal, unooctagesimal, ...] To nonary: replace group of 2-trinary bits by nonary digit
To heptovigesimal: replace group of 3-trinary bits by heptovigesimal digit To unooctagesimal: replace group of 4-trinary bits by
Part-B
Any base [unary, , vigesimal, ..] to decimal Integer: sum of [(+ve weights)(integer)] Fraction: sum of [(-ve weights) (fraction)] Any base [quaternary, octal, hexadecimal, ...] to binary From quaternary: replace each quaternary digit by 2bit binary From octal: replace each octal digit by 3-bit binary From hexadecimal: replace each hexadecimal digit by 4-bit binary From duotrigesimal: replace each duotrigesimal digit by 5-bit binary Any base [nonary, heptovigesimal, unooctagesimal, ...] to trinary From nonary: replace each nonary digit by 2-bit trinary
From heptovigesimal: replace each heptovigesimal digit by 3-bit trinary From unooctagesimal: replace each unooctagesimal digit
January
Step-4
(--)3,4,5,6,7,9,11, 12, 13, 14, 15, ... to (--)3,4,5,6,7,9,11, 12, 13, 14, 15, ... Direct conversion not applicable First (--)3,4,5,6,7,9,11, 12, 13, 14, 15, ... to (--)10 Then (--)10 to (--)3,4,5,6,7,9,11, 12, 13, 14, 15, ...
Radix compliment
Minuend + subtrahends radix compliment = result (Discard the carry or MSD of the result) Threes Compliment Fours Compliment Fives Compliment Sixs Compliment Sevens Compliment Nines Compliment Elevens Compliment Twelves Compliment Thirteens Compliment Fourteens Compliment Fifteens Compliment
(radix-1) compliment
Minuend + subtrahends (radix-1) compliment = result Add carry (if generated) to the result Twos Compliment Threes Compliment Fours Compliment Fives Compliment Sixs Compliment Eights Compliment Tens Compliment Elevens Compliment Twelves Compliment Thirteens Compliment Fourteens Compliment
Ternary Quaternary Quinary Senary Septenary Nonary Unodecimal Duodecimal Tridecimal Quadrodecimal Pentadecimal
January
International Journal of Advances in Science and Technology Heptadecimal Octodecimal Nonadecimal Vigesimal Quadrovigesimal Hexavigesimal Septemvigesimal Trigesimal Duotrigesimal Hexatrigesimal Quadragesimal Pentagesimal Sexagesimal Duosexagesimal Quadrosexagesimal Pentaoctagesimal Octovicentimal Seventeens Compliment Eighteens Compliment Nineteen Compliment Twentys Compliment Twenty Fours Compliment Twenty Sixs Compliment Twenty Sevens Compliment Thirtys Compliment Thirty Twos Compliment Thirty Sixs Compliment Fortys Compliment Fiftys Compliment Sixtys Compliment Sixty Twos Compliment Sixty Fours Compliment Eighty Fives Compliment One Hundred Twenty Eights Compliment Sixteens Compliment Seventeens Compliment Eighteens Compliment Nineteen Compliment Twenty Threes Compliment Twenty Fives Compliment Twenty Sixs Compliment Twenty Nines Compliment Thirty Ones Compliment Thirty Fives Compliment Thirty Nines Compliment Forty Nines Compliment Fifty Nines Compliment Sixty Ones Compliment Sixty Threes Compliment Eighty Fours Compliment One Hundred Twenty Sevens Compliment
8. Conclusion
Here we have elaborated the concepts of strange number system (SNS) and proposed an easy, short and simple approach to fulfill the needs, number representation, arithmetic operations and inter conversion with different bases, represented in tabulated form used in the digital world specially computer science and technology. As we have seen that, not only traditional numbers are used in digital world, but there are some strange numbers, which are also very common and frequently used in most of the digital technologies and devices. Due to the benefits of strange number representation, which include greater speed of arithmetic operations realization, greater density of memorized information, better usage of transmission paths and decreasing of pin number of integrated circuits, this paper concludes that strange number system even though they are not yet more commercially available, remain a viable field for research, and have a promising future as a replacement for traditional number system. This study will be very helpful for researchers and knowledge seekers to easy understanding and practicing of number systems as well as to memories them for those who are in the field of computer science and technology.
9. Acknowledgement
Handful of thanks to Dr. U A Lanjewar, Professor VMV Commerce, JMT Arts & JJP Science College, Wardhaman Nagar, Nagpur for his guidance, support and valuable instructions.
10. References
[1] Afolayan A. OBINIYI, Ezugwu E. ABSALOM, Kwanashie ADAKO, Arithmetic Logic Design with Color-Coded Ternary for Ternary Computing. International Journal of Computer Application Issues, Vol. 26, No. 11, July 2011. [2] Shahid LATIF, Junaid QAYYUM, Muhammad LAL, Faheem KHAN, Novel Approach to the Learning of Various Number Systems. International Journal of Computer Applications Issues, Vol. 26, No. 7, July 2011.
January
[3] Reena Rani, L.K. Singh, Neelam Sharma, A Novel Design of High Speed Adders Using Quaternary Signed Digit Number System, International Journal of Computer and Network Security, ISSN: 20762739, Vol. 2, Issue. 9, 2011, pp. 62-66. [4] Alexey Stakhov, Brousentsovs Ternary Principle, Bergmans Number System and Ternary Mirror-symmetrical Arithmetic, The Computer Journal, Vol. 45, No. 2, 2002. [5] Barry B BREY The Intel Microprocessors. Sixth edition, prentice hall of India private limited, New Delhi 110 001, 2002 [6] Ion PROFEANU, 2010, Ternary Arithmetic and Logic. Proceedings WCE 2010, London, U.K., ISBN: 978-988-17012-9-9. [7] Amarnath Murthy On the divisors of the unary sequence, Smarandache Notions Journal Vol. 11, 2000. [8] Davenport, Harold, The Higher Arithmetic:An Introduction to the Theory of Numbers (7th ed.), Cambridge University Press, Cambridge, UK,1999, ISBN 0-521-63446-6. [9] Number Representation and Computer Arithmetic, Article to appear in Encyclopedia of Information Systems, Academic Press, 2001. [10] Henning Gundersen, Yngvar Berg, A Novel Balanced Ternary Adder Using Recharged SemiFloating Gate Devices [11] Brousentsov N.P. Computing machine Setun of Moscow State University // New developments on computer technology. - Kiev , 1960. (In Russian). [12] Bergman's number Bergman_engl.html system, [Online]. Available: www.goldenmuseum.com/1405
[13] Mark Glusker, David M. Hogan, Pamela Vass. "The Ternary Calculating Machine of Thomas Fowler," IEEE Annals of the History of Computing, vol. 27, no. 3, pp. 4-22, July-September 2005. [14] Small digital computing machine Setun / N.P.Brousentsov, S.P.Maslov, V.P.Rosin, A.M.Tishulina - Moscow State Univ., 1965. (In Russian).
Authors Profile
Name Ph. No. Qualification About research - Debasis Das -9970615760, 0712-2733932 (Office) - MCA, MSc (Comp. Sc.). -Around 5 years teaching experience to Post-Graduate students. Member of IETE. Research interest includes Number System, Mobile Computing.
- Ujwal A. Lanjewar -9822727665, 0712-2726672 (Res.) -Ph.D., MCA, MSc (Stats.), MBA, Diploma in Industrial Engineering and Diploma in Export Management. About research -Around 16 years teaching and Research experience to Graduate, Post-Graduate and Doctoral degree students. Post doctoral research work is submitted in RTM Nagpur University for Doctor of science. Around 21 research papers are published in International peer reviewed journals. 4 students have already awarded doctoral degree. Research guide for five universities in the research area of Computer science and technology, Business management and applications, and statistics. Worked on various advisory committee of National and International Conferences.
January