Results 1  10
of
594
ERROR DETECTING DECIMAL DIGITS
"... Decimaloriented error detection schemes are explored in the context of one particular company project. ..."
Abstract
 Add to MetaCart
Decimaloriented error detection schemes are explored in the context of one particular company project.
A New Image Steganography Based on DecimalDigits Representation
"... Steganography is the art and science of hiding important information by embedding message within other file. In this paper, a new technique to hide text message in image by using what is called image steganography. By representing the ASCII code decimal value of each character, in the secret message ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
message, as a set of separated single decimaldigit, also represent each decimal pixel value in the stegoimage as a set of separated single decimaldigit. The technique creates a matching list between the decimaldigits of the characters in the secret message with the decimaldigits of the pixels
ASSOCIATED. ADDITIVE DECIMAL DIGITAL BRACELETS 1 "
"... A bracelet is one period of a simply periodic series considered as a closed sequence with terms equally spacedaround a circle. Distances between terms may be measured in degrees or in spaces. A bracelet may be regenerated by starting at any arbitrary point to apply the generating law. A bracelet may ..."
Abstract
 Add to MetaCart
the process. (Some bracelets generated from a sequence of four digits have been discussed previously [ l] , [2]). This is equivalent to using the recurrence formula u 2 = u +u and, in the decimal system, reducing each sum modulo 10. When all operations of addition and multiplication are reduced modulo 10
#include <nag.h> #include <nagx02.h> Integer nag_decimal_digits
"... NAG Library Function Document nag_decimal_digits (X02BEC) nag_decimal_digits (X02BEC) returns the maximum number of decimal digits which can be accurately represented over the whole range of floatingpoint numbers. ..."
Abstract
 Add to MetaCart
NAG Library Function Document nag_decimal_digits (X02BEC) nag_decimal_digits (X02BEC) returns the maximum number of decimal digits which can be accurately represented over the whole range of floatingpoint numbers.
Single Flux Quantum OneDecimalDigit RNS Adder
"... Residue number system (RNS) arithmetic has a promising role for faulttolerant high throughput superconducting single flux quantum (SFQ) circuits for digital signal processing (DSP) applications. We have designed one of the basic computational blocks used in DSP circuits, onedecimaldigit RNS adder ..."
Abstract
 Add to MetaCart
Residue number system (RNS) arithmetic has a promising role for faulttolerant high throughput superconducting single flux quantum (SFQ) circuits for digital signal processing (DSP) applications. We have designed one of the basic computational blocks used in DSP circuits, onedecimaldigit RNS
Computation of 2700 billion decimal digits of Pi using a Desktop Computer
, 2010
"... This article describes some of the methods used to get the world record of the computation of the digits of π digits using an inexpensive desktop computer. 1 Notations We assume that numbers are represented in base B with B = 2 64. A digit in base B is called a limb. M(n) is the time needed to multi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This article describes some of the methods used to get the world record of the computation of the digits of π digits using an inexpensive desktop computer. 1 Notations We assume that numbers are represented in base B with B = 2 64. A digit in base B is called a limb. M(n) is the time needed
DESIGN OF HIGH SPEED AREA OPTIMIZED BINARY CODED DECIMAL DIGIT ADDER
"... Decimal arithmetic is necessary for computations in the field of banking systems,tax calculations,telephone billings etc. The main problem in the prevailing decimal arithmetic is the requirement of the correction of the result in its binary form. This results in larger area and implementation delay. ..."
Abstract
 Add to MetaCart
Decimal arithmetic is necessary for computations in the field of banking systems,tax calculations,telephone billings etc. The main problem in the prevailing decimal arithmetic is the requirement of the correction of the result in its binary form. This results in larger area and implementation delay
Computation of the nth decimal digit of π with low memory, preprint (2003) nthdecimaldigit.pdf
"... This paper presents an algorithm that computes directly the nth decimal digit of π in subquadratic time and very low memory. It improves previous results of Simon Plouffe, later refined by Fabrice Bellard. The problem of the nth digit computation in base 2 had already been successfully treated th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents an algorithm that computes directly the nth decimal digit of π in subquadratic time and very low memory. It improves previous results of Simon Plouffe, later refined by Fabrice Bellard. The problem of the nth digit computation in base 2 had already been successfully treated
The computation of to 29,360,000 decimal digits using Borweins' quartically convergent algorithm
 Mathematics of Computation
, 1988
"... In a recent work [6], Borwein and Borwein derived a class of algorithms based on the theory of complete elliptic integrals that yield very rapidly convergent approximations to elementary constants. The author has implemented Borweins ' quartically convergent algorithm for 1 = , using a prime mo ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
modulus transform multiprecision technique, to compute over 29,360,000 digits of the decimal expansion of. The result was checked by using a di erent algorithm, also due to the Borweins, that converges quadratically to. These computations were performed as a system test of the Cray2 operated
The Computation of pi to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
, 1987
"... In a recent work [6], Borwein and Borwein derived a class of algorithms based on the theory of complete elliptic integrals that yield very rapidly convergent approximations to elementary constants. The author has implemented Borweins ' quartically convergent algorithm for l/r, using a prime mo ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
modulus transform multiprecision technique, to compute over 29,360,000 digits of the decimal expansion of r. The result was checked by using a different algorithm, also due to the Borweins, that converges quadratically to r. These computations were performed as a system test of the Cray2 operated
Results 1  10
of
594