Properties of carry value transformation

DOI10.1155/2012/174372MaRDI QIDQ417244zbMATHOpenAlexDBLPWikidataFDO

Authors Suryakanta Pal, Sudhakar Sahoo, Birendra Kumar Nayak

Publication date 14 May 2012

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.0178

Mathematics Subject Classification ID

Abstract: The notion of Carry Value Transformation (CVT) is a model of Discrete Deterministic Dynamical System. In this paper, we have studied some interesting properties of CVT and proved that (1) the addition of any two non-negative integers is same as the sum of their CVT and XOR values. (2) While performing the repeated addition of CVT and XOR of two non-negative integers "a" and "b" (where a >= b), the number of iterations required to get either CVT=0 or XOR=0 is at most the length of "a" when both are expressed as binary strings. A similar process of addition of Modified Carry Value Transformation (MCVT) and XOR requires a maximum of two iterations for MCVT to be zero. (3) An equivalence relation is defined in the set (Z x Z) which divides the CV table into disjoint equivalence classes.

Recommendations

• Natural and efficient subtraction operation in carry value transformation (CVT)-exclusive OR (XOR) paradigm
• On the number of carries occurring in an addition mod \(2^k -1\)
• Analysis of Carry Propagation in Addition: An Elementary Approach
• scientific article; zbMATH DE number 503278
• scientific article; zbMATH DE number 1055635

Cited in

(2)

• Natural and efficient subtraction operation in carry value transformation (CVT)-exclusive OR (XOR) paradigm
• Property transformation under specification change

This page was built for publication: Properties of carry value transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417244)