Everything about Arithmetic shift
Shift operator in computer programming
In computer programming, an arithmetic shift is a shift operator, sometimes termed a signed shift. The two basic types are the arithmetic left shift and the arithmetic right shift. For binary numbers it is a bitwise operation that shifts all of the bits of its operand; every bit in the operand is simply moved a given number of bit positions, and the vacant bit-positions are filled in. Instead of being filled with all 0s, as in logical shift, when shifting to the right, the leftmost bit in ones' complement and two's complement representations is replicated to fill in all the vacant positions. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Arithmetic shiftA 5-minute orientation
- Skim a recent paper: On the Limits of LFSR Perturbation for Binary Shift Chaotic Maps in Fixed-Point ArithmeticInfluential work since 2022
- Pick up a classic book: A planar approximation for the least reliable bit log-likelihood ratio of 8-PSK modulationThe most-reprinted book on the subject
- Read the landmark paper: Arithmetic crosscorrelations of feedback with carry shift register sequencesCited 66 times
- Go sideways: Bitwise operationA closely related topic
- Go sideways: Logical shiftA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Arithmetic crosscorrelations of feedback with carry shift register sequences
Secure binary arithmetic coding based on digitalized modified logistic map and linear feedback shift register
Computing Number of Bits to be processed using Shift and Log in Arithmetic Coding
Chaotic image encryption using circular shift and modular arithmetic
Xilinx FPGA Implementation of Arithmetic Logic Shift Unit (ALSU) .
Real-time Video Target Tracking Based on Improved Mean Shift Arithmetic
Enhancing Construction Shift Schedules With the Sand Cat Arithmetic Optimization Algorithm
An application of linear feedback shift registers in the computation of polynomial arithmetic
🆕 Influential since 2022
📚 Books worth reading
- 📕A planar approximation for the least reliable bit log-likelihood ratio of 8-PSK modulationWilliam H. Thesling · 1994
Ergodic Theory, Dynamical Systems, and the Continuing Influence of John C. OxtobyJoseph Auslander, Aimee Johnson · 2017
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Bitwise operation In computer programming, a bitwise operation operates on a bit string, a bit array or a binary numeral (considered as a bit string) at the level of its…
- Logical shift In computer science, a logical shift is a bitwise operation that shifts all the bits of its operand. The two base variants are the logical left shift and…
- Two's complement Two's complement is the most common method of representing signed (positive, negative, and zero) integers on computers, and more generally, fixed point…
- Bitwise operations in C In the C programming language, operations can be performed on a bit level using bitwise operators. Bitwise operations are contrasted by byte-level operations…
- Fixed-point arithmetic In computing, fixed-point is a method of representing fractional (non-integer) numbers by storing a fixed number of digits of their fractional part. Dollar…
- Arithmetic logic unit In computing, an arithmetic logic unit (ALU) is a combinational digital circuit that performs arithmetic and bitwise operations on integer binary numbers…
- Signed zero Signed zero is zero with an associated sign. In ordinary arithmetic, the number 0 does not have a sign, and −0, +0 and 0 are three ways of writing the…
- Overflow flag In computer processors, the overflow flag (sometimes called the V flag) is usually a single bit in a system status register used to indicate when an arithmetic…