Accordingly, this paper proposes a novel architecture for a nonrestoring divisor based on the radix-2 signed-digit (SD2) representation. This notation has been chosen to achieve fast computation, as proposed by Avizienis (IEEE Transactions on Electronic Computers, vol. EC-10, no. 3, pp. ...
Data compression is a way of encoding digital data into an encoded representation that uses fewer bits than the original data. Representing the data in fewer bits means that the data occupies less storage space and requires less transmission bandwidth....
which can be rewritten using matrix representation as $$ \mathbf{x}(t+1)=A\mathbf{x}(t)\text{ mod } m $$ (2) where $$ A=\left( \begin{array}{cc} 1 & \quad \alpha \\ \beta & \quad \alpha\cdot\beta+1 \end{array}\right), $$ \((\alpha ,\beta )\in \mathbb {...
Data compression is a way of encoding digital data into an encoded representation that uses fewer bits than the original data. Representing the data in fewer bits means that the data occupies less storage space and requires less transmission bandwidth. In general, data compression compresses a ...
447–457 36. J-R Ohm, in Multimedia communication technology: representation, transmission and identification of multimedia signals. Linear systems and transforms (Springer-Verlag, New York, 2004), pp. 96–104 Page 18 of 18 http-equiv="content-type" ...
It is a fixed point format but it works in fractional representation (Xfracε[−1,1[,i.e Xfrac=Xint*2−15). In fact, point is put just after the sign bit:This format avoids using floating points representation and processing at the expense of some accuracy (and the need for ...
To avoid rounding errors associated with the limited representation of significant digits when applying the floating-point Krawtchouk transform in image processing, we present an integer and reversible version of the Krawtchouk transform (IRKT). This proposed IRKT generates integer-valued coefficients with...
The original number in binary representation is split into pairs of bits, and the calculation starts with the most significant pair of bits. Two numbers are obtained at each iteration: the minuend and the subtrahend. The minuend is formed by concatenating the remainder from the previous ...
3. Construction of the Integer–Reversible Krawtchouk Transform In this section, we propose an integer–reversible Krawtchouk transform (IRKT), which can be applied on integer data and generate integer Krawtchouk coefficients (integer- based representation), and its inverse IRKT can exactly restore ...