• Source: Sign extension

Sign extension (sometimes abbreviated as sext, particularly in mnemonics) is the operation, in computer arithmetic, of increasing the number of bits of a binary number while preserving the number's sign (positive/negative) and value. This is done by appending digits to the most significant side of the number, following a procedure dependent on the particular signed number representation used.
For example, if six bits are used to represent the number "00 1010" (decimal positive 10) and the sign extends operation increases the word length to 16 bits, then the new representation is simply "0000 0000 0000 1010". Thus, both the value and the fact that the value was positive are maintained.
If ten bits are used to represent the value "11 1111 0001" (decimal negative 15) using two's complement, and this is sign extended to 16 bits, the new representation is "1111 1111 1111 0001". Thus, by padding the left side with ones, the negative sign and the value of the original number are maintained.
In the Intel x86 instruction set, for example, there are two ways of doing sign extension:

using the instructions cbw, cwd, cwde, and cdq: convert the byte to word, word to doubleword, word to extended doubleword, and doubleword to quadword, respectively (in the x86 context a byte has 8 bits, a word 16 bits, a doubleword and extended doubleword 32 bits, and a quadword 64 bits);
using one of the sign extended moves, accomplished by the movsx ("move with sign extension") family of instructions.




Zero extension


A similar concept is zero extension (sometimes abbreviated as zext). In a move or convert operation, zero extension refers to setting the high bits of the destination to zero, rather than setting them to a copy of the most significant bit of the source. If the source of the operation is an unsigned number, then zero extension is usually the correct way to move it to a larger field while preserving its numeric value, while sign extension is correct for signed numbers.
In the x86 and x64 instruction sets, the movzx instruction ("move with zero extension") performs this function. For example, movzx ebx, al copies a byte from the al register to the low-order byte of ebx and then fills the remaining bytes of ebx with zeroes.
On x64, most instructions that write to the entirety of lower 32 bits of any of the general-purpose registers will zero the upper half of the destination register. For example, the instruction mov eax, 1234 will clear the upper 32 bits of the rax register.




See also


Arithmetic shift and logical shift




References


Mano, Morris M.; Kime, Charles R. (2004). Logic and Computer Design Fundamentals (3rd ed.), pp 453. Pearson Prentice Hall. ISBN 0-13-140539-X.




Notes

Kata Kunci Pencarian:

• NASCAR Seri Piala Sprint musim 2014
• MotoGP musim 2024
• NASCAR Seri Piala Sprint musim 2013
• Harry Souttar
• Joakim Noah
• Shinji Okazaki
• NASCAR Seri Piala Sprint musim 2015
• Max Ehmer
• MotoGP musim 2016
• MotoGP musim 2018
• Sign extension
• Sign bit
• Two's complement
• Domain Name System Security Extensions
• Extension (semantics)
• At sign
• Straight leg raise
• Life extension
• Arithmetic shift
• Plantar reflex