The instruction set of the microcontroller includes arithmetic, logical, and flag-affecting instructions. It allows operations on registers, direct addresses, and indirect addresses. The instruction byte size and oscillator period required for each instruction is also provided in a table.
The microcontroller instruction set includes instructions for flow control, logic, arithmetic, and data movement. It supports operations on registers and direct or indirect addressed memory locations. The instruction set is encoded in an 8-bit format and includes operations that affect the processor status flags.
This document provides a summary of the instruction set for the MCS-51 microcontroller. It includes a table listing over 40 instructions such as ADD, SUB, AND, OR, MOV, INC, DEC, along with the description, number of cycles, and whether it affects flag settings. It notes that instructions can specify registers, direct addresses, indirect RAM addresses, or immediate data as operands.
This document summarizes techniques for core allocation and relocation management in self-dynamically reconfigurable architectures. It introduces basic concepts like cores, IP cores, and reconfigurable regions. It then describes proposed 1D and 2D relocation solutions like BiRF and BiRF Square that allow runtime relocation with low overhead. A core allocation manager is introduced to choose core placements optimizing criteria like rejection rate and completion time with low management costs. Evaluation shows the techniques improve metrics like rejection rate and routing costs compared to other approaches.
This document contains exam questions for the subject Digital Communication. It has two parts - Part A and Part B. Part A focuses on digital communication systems, sampling, PCM, delta modulation, line coding techniques and adaptive equalization. Part B covers passband transmission schemes, modulation techniques like BPSK, MSK, spread spectrum techniques and correlation receivers. The questions test concepts like block diagrams, derivations, explanations and comparisons related to digital communication topics.
Raphael Geney, Galapagos, H-bond strength predictions: Could we do better?Cresset
1) The document summarizes an evaluation of methods for predicting hydrogen bond strength, including Peter Kenny's accurate but slow quantum mechanics (QM) approach and the faster but less accurate Cresset molecular modeling software.
2) Applying Kenny's QM approach to 9 kinase ligand cores, excellent correlations with potency were found except for two outliers, while Cresset captured trends but not substituent effects.
3) A combination of Kenny's QM predictions with Cresset screening was proposed to effectively optimize ligand hydrogen bonding for potency, with each method's strengths mitigating the other's weaknesses.
FR1.L09 - PREDICTIVE QUANTIZATION OF DECHIRPED SPOTLIGHT-MODE SAR RAW DATA IN...grssieee
This document presents methods for predictive quantization of dechirped spotlight-mode synthetic aperture radar (SAR) raw data in the transform domain. It discusses previous work on SAR data compression, analyzes the characteristics of spotlight SAR data in the inverse discrete Fourier transform (IDFT) domain, and proposes three predictive encoding schemes - transform domain block predictive quantization (TD-BPQ), transform domain block predictive vector quantization (TD-BPVQ), and predictive trellis coded quantization (TD-PTCQ) - to take advantage of correlations in the transformed data. Numerical results on an example dataset show SNR improvements of up to 6 dB compared to baseline block adaptive quantization.
This document provides parameters for 11 channel models (CM1.1-CM1.5, CM2, CM3.1-CM3.2, CM4-CM6, CM9.1-CM9.3) used in IEEE 802.15 wireless simulations. Key parameters include path loss exponent, shadowing standard deviation, cluster and ray arrival/decay rates, cluster and ray power standard deviations, angle spread, number of clusters, and Rician K factor. Some parameters are provided while others are assumed, with references provided. The document seeks discussion on clarifying remaining questions about the channel model parameters.
Analysis of High-Order Residual-Based Dissipation for Unsteady Compressible F...kgrimich
A comprehensive study of the numerical properties of high-order residual-based dissipation terms for unsteady compressible flows leads to the design of well-behaved, low dissipative schemes of third-, fifth- and seventh-order accuracy. The dissipation and dispersion properties of the schemes are then evaluated theoreticaly, through Fourier space analysis, and numerically, through selected test cases including the inviscid Taylor-Green Vortex flow.
The microcontroller instruction set includes instructions for flow control, logic, arithmetic, and data movement. It supports operations on registers and direct or indirect addressed memory locations. The instruction set is encoded in an 8-bit format and includes operations that affect the processor status flags.
This document provides a summary of the instruction set for the MCS-51 microcontroller. It includes a table listing over 40 instructions such as ADD, SUB, AND, OR, MOV, INC, DEC, along with the description, number of cycles, and whether it affects flag settings. It notes that instructions can specify registers, direct addresses, indirect RAM addresses, or immediate data as operands.
This document summarizes techniques for core allocation and relocation management in self-dynamically reconfigurable architectures. It introduces basic concepts like cores, IP cores, and reconfigurable regions. It then describes proposed 1D and 2D relocation solutions like BiRF and BiRF Square that allow runtime relocation with low overhead. A core allocation manager is introduced to choose core placements optimizing criteria like rejection rate and completion time with low management costs. Evaluation shows the techniques improve metrics like rejection rate and routing costs compared to other approaches.
This document contains exam questions for the subject Digital Communication. It has two parts - Part A and Part B. Part A focuses on digital communication systems, sampling, PCM, delta modulation, line coding techniques and adaptive equalization. Part B covers passband transmission schemes, modulation techniques like BPSK, MSK, spread spectrum techniques and correlation receivers. The questions test concepts like block diagrams, derivations, explanations and comparisons related to digital communication topics.
Raphael Geney, Galapagos, H-bond strength predictions: Could we do better?Cresset
1) The document summarizes an evaluation of methods for predicting hydrogen bond strength, including Peter Kenny's accurate but slow quantum mechanics (QM) approach and the faster but less accurate Cresset molecular modeling software.
2) Applying Kenny's QM approach to 9 kinase ligand cores, excellent correlations with potency were found except for two outliers, while Cresset captured trends but not substituent effects.
3) A combination of Kenny's QM predictions with Cresset screening was proposed to effectively optimize ligand hydrogen bonding for potency, with each method's strengths mitigating the other's weaknesses.
FR1.L09 - PREDICTIVE QUANTIZATION OF DECHIRPED SPOTLIGHT-MODE SAR RAW DATA IN...grssieee
This document presents methods for predictive quantization of dechirped spotlight-mode synthetic aperture radar (SAR) raw data in the transform domain. It discusses previous work on SAR data compression, analyzes the characteristics of spotlight SAR data in the inverse discrete Fourier transform (IDFT) domain, and proposes three predictive encoding schemes - transform domain block predictive quantization (TD-BPQ), transform domain block predictive vector quantization (TD-BPVQ), and predictive trellis coded quantization (TD-PTCQ) - to take advantage of correlations in the transformed data. Numerical results on an example dataset show SNR improvements of up to 6 dB compared to baseline block adaptive quantization.
This document provides parameters for 11 channel models (CM1.1-CM1.5, CM2, CM3.1-CM3.2, CM4-CM6, CM9.1-CM9.3) used in IEEE 802.15 wireless simulations. Key parameters include path loss exponent, shadowing standard deviation, cluster and ray arrival/decay rates, cluster and ray power standard deviations, angle spread, number of clusters, and Rician K factor. Some parameters are provided while others are assumed, with references provided. The document seeks discussion on clarifying remaining questions about the channel model parameters.
Analysis of High-Order Residual-Based Dissipation for Unsteady Compressible F...kgrimich
A comprehensive study of the numerical properties of high-order residual-based dissipation terms for unsteady compressible flows leads to the design of well-behaved, low dissipative schemes of third-, fifth- and seventh-order accuracy. The dissipation and dispersion properties of the schemes are then evaluated theoreticaly, through Fourier space analysis, and numerically, through selected test cases including the inviscid Taylor-Green Vortex flow.
Fpga based implementation of a double precision ieee floating point adderSomsubhra Ghosh
This document describes an FPGA implementation of a double precision IEEE floating point adder. It outlines the general structure of IEEE 754 double precision numbers, describes the simple arithmetic operation of adding two such numbers, and proposes a two stage pipelined algorithm to perform the addition. It then discusses implementing the algorithm on FPGA devices, providing resource usage estimates and illustrations of the first two cycles of the algorithm. Simulation results are presented and the conclusions discuss the benefits of this technique for performing floating point additions with low latency.
This document discusses testing isolated bacterial colonies grown on solid differential agar slants. It instructs to (A) observe and report the characteristics of the primary colonies and (B) lists further tests that should be conducted on the colonies.
There is nowadays a growing need for sensing devices offering rapid and portable analytical functionality in real-time as well as massively parallel capabilities with very high sensitivity at the molecular level. Such devices are essential to facilitate research and foster advances in fields such as drug discovery, proteomics, medical diagnostics, systems biology or environmental monitoring.
In this context, an ideal solution is an ion-sensitive field-effect transistor sensor platform based on silicon nanowires to be integrated in a CMOS architecture. Indeed, in addition to the expected high sensitivity and superior signal quality, such nanowire sensors could be mass manufactured at reasonable costs, and readily integrated into electronic diagnostic devices to facilitate bed-site diagnostics and personalized medicine. Moreover, their small size makes them ideal candidates for future implanted sensing devices. While promising biosensing experiments based on silicon nanowire field-effect transistors have been reported, real-life applications still require improved control, together with a detailed understanding of the basic sensing mechanisms. For instance, it is crucial to optimize the geometry of the wire, a still rather unexplored aspect up to now, as well as its surface functionalization or its selectivity to the targeted analytes.
This project seeks to develop a modular, scalable and integrateable sensor platform for the electronic detection of analytes in solution. The idea is to integrate silicon nanowire field-effect transistors as a sensor array and combine them with state-of-the-art microfabricated interface electronics as well as with microfluidic channels for liquid handling. Such sensors have the potential to be mass manufactured at reasonable costs, allowing their integration as the active sensor part in electronic point-of-care diagnostic devices to facilitate, for instance, bed-side diagnostics and personalized medicine. Another important field is systems biology, where many substances need to be quantitatively detected in parallel at very low concentrations: in these situations, the platform being developed fulfills the requirements ideally and will have a strong impact and provide new insights, e.g. into the metabolic processes of cells, organisms or organs.
This talk was presented live at JMP Discovery Summit 2012 in Cary, North Carolina, USA. More information about design of experiments is available at http://www.jmp.com/applications/doe/
The document provides information about a digital communication systems exam, including questions on various topics in digital communication such as sampling theory, PCM, delta modulation, baseband transmission, digital modulation techniques, error control coding, and spread spectrum.
The exam is divided into two parts (A and B) and contains 10 questions in total. Part A covers topics such as sampling theorem, signal reconstruction, PCM, delta modulation, baseband transmission, and digital modulation formats. Part B focuses on questions related to digital modulation techniques like BPSK, probability of symbol error, DPSK, and spread spectrum modulation. The document provides detailed questions on concepts, derivations, and design problems in digital communication systems.
The document is the question paper for the Sixth Semester B.E. Degree Examination in Antennas and Propagation held in December 2013/January 2014. It contains 8 questions divided into 2 parts. Part A contains questions 1-4 covering topics like definitions related to antennas, derivation of expressions for directivity and effective aperture of antennas, field patterns of antenna arrays, and pattern multiplication. Part B contains questions 5-8 related to topics like radiation integrals, antenna arrays, and antenna measurements. Students had to answer 5 questions selecting at least 2 from each part.
Ict networking exercise short questions answerGary Tsang
This document provides short answers to questions about computer networking. It covers topics like types of networks, advantages and disadvantages of centralized and decentralized networks, components of networking hardware and software, protocols, network topologies and layers of the OSI model. The document contains diagrams and explanations of networking concepts.
Niels Lohmann explores several case studies applying symbolic systems biology techniques:
1) Analyzing biochemical reaction chains using the tool LoLA for fast reachability queries.
2) Finding hazards in Globally Asynchronous Locally Synchronous (GALS) circuits design using Petri nets and partial order reduction.
3) Verifying service choreographies for deadlocks by translating models to open workflow nets and discovering a design flaw.
https://www.udemy.com/vlsi-academy
Usually, while drawing any circuit on paper, we have only one 'vdd' at the top and one 'vss' at the bottom. But on a chip, it becomes necessary to have a grid structure of power, with more than one 'vdd' and 'vss'. The concept of power grid structure would be uploaded soon. It is actually the scaling trend that drives chip designers for power grid structure.
CDMA PRL issue investigation: Network operator A can detect ARFCN from operat...Ray KHASTUR
Because ARFCN of two operator are sharing use due to policy from government. Operator A only input one index table acquisition all ARFCN in HDR channel list, Operator B have 3 table index acquisition that different in each region.
PRL Operator A:
* Index Table 1 HDR (37, 78, 119, 160, 201, 242, 283, 324 and 1019)
PRL Operator B:
*Index Table 1 HDR (283)
*Index Table 3 HDR (1019 and 37)
*Index Table 5 HDR (1019)
From explanation above we can see that operator A will scanning all ARFCN that available in surrounding area which is suitable in Index Table 1 Operator A, that's why Operator A can detect Operator B channel list in all region.
https://www.udemy.com/vlsi-academy
http://vlsisystemdesign.com/place_decap.php
Once the critical cells are placed on the chip, it becomes necessary to surround the critical cells by decoupling capacitors. The placement of de-coupling capacitors surrounding the pre-placed cells improves the reliability and efficiency of the chip.
This document contains the contents and program descriptions for various programs to be completed as part of a Microprocessor Lab course. There are 23 interfacing programs and 20 8085 microprocessor programs described, including programs to transfer data blocks with and without overlap, add/multiply/divide numbers, implement counters, check codes, and interface with keyboards, displays, and other peripherals.
Basic Electronics Jntu Btech 2008 Jntu Model Paper{Www.Studentyogi.Com}guest3f9c6b
This document contains 8 questions related to Basic Electronics for a semester exam. The questions cover topics such as semiconductors, rectifiers, amplifiers, oscillators, timers, ultrasonic waves, and A/D converters. Students are instructed to answer any 5 of the 8 questions, which contain sub-questions related to circuit diagrams and explanations of electronics concepts and devices.
Gaweł mikołajczyk. i pv6 insecurities at first hopYury Chemerkin
Neighbor discovery and router advertisements are used to configure IPv6 addresses and discover routers but are vulnerable to attacks like address spoofing, router advertisement spoofing, and cache exhaustion attacks; securing these first-hop operations requires techniques like source address validation, cryptographic authentication of messages and sources, and rate limiting to prevent cache exhaustion on routers and switches.
This document provides an instruction set summary for a microcontroller. It includes a table that lists each instruction, describes its function, and specifies the number of bytes in the instruction and its execution time in oscillator periods. It summarizes instructions related to arithmetic operations, logical operations, program flow control, bit manipulation, data transfer, and interrupts.
The document describes the instruction set of the Atmel 8051 microcontroller. It includes 3 tables that list the instructions, describing the operation, number of bytes in the instruction, and the oscillator period in cycles to execute the instruction. The tables provide a summary of arithmetic, logical, branch, and data transfer instructions available on the 8051 microcontroller.
The document describes the instruction set of the 8086 microprocessor. It discusses the different types of instructions including data transfer instructions like MOV, PUSH, POP, XCHG, IN, OUT, and XLAT. It also covers addressing modes, instruction formats, and the various registers used by the 8086 microprocessor like the stack pointer and flag register. In total there are 14 different data transfer instructions described that are used to move data between registers, memory, ports, and the flag and stack pointers.
This document provides an overview of the ARM instruction set architecture. It discusses the ARM programming model including its general purpose registers and status flags. It also covers ARM data types, data operations, load/store instructions, flow of control instructions, and subroutine calling conventions. Examples are provided to demonstrate how common programming constructs like if/else statements and for loops can be implemented in ARM assembly language.
This document describes the instruction set of the 8051 microcontroller. It discusses the three types of instructions - single byte, double byte, and triple byte - based on the number of bytes needed to represent the instruction. It provides examples of different types of instructions, including data transfer, arithmetic, logical, logical bit, and program flow control instructions. Each instruction is defined by its mnemonic, description, and number of bytes.
microcontroller_instruction_set for ENGINEERING STUDENTSssuser2b759d
The document discusses the instruction set of microcontrollers. It describes that microcontrollers have instruction formats that specify the operation and operands. The 8051 microcontroller has 111 instructions divided into one-byte, two-byte, and three-byte instructions depending on the number of bytes needed to represent the instruction. The document outlines the different addressing modes and types of instructions including data transfer, arithmetic, logical, and program flow control instructions. It provides examples of common instructions and their operation.
The document discusses numerical bases used in programming such as hexadecimal, binary, and BCD. It provides examples of converting between decimal, binary, hexadecimal and BCD representations of numbers. It also describes registers and memory organization in 8051 microcontrollers including register banks, memory mapping, and addressing modes. Finally, it outlines common instructions of the 8051 instruction set such as MOV, ADD, CALL, JUMP, LOGICAL operations and flag manipulation.
Fpga based implementation of a double precision ieee floating point adderSomsubhra Ghosh
This document describes an FPGA implementation of a double precision IEEE floating point adder. It outlines the general structure of IEEE 754 double precision numbers, describes the simple arithmetic operation of adding two such numbers, and proposes a two stage pipelined algorithm to perform the addition. It then discusses implementing the algorithm on FPGA devices, providing resource usage estimates and illustrations of the first two cycles of the algorithm. Simulation results are presented and the conclusions discuss the benefits of this technique for performing floating point additions with low latency.
This document discusses testing isolated bacterial colonies grown on solid differential agar slants. It instructs to (A) observe and report the characteristics of the primary colonies and (B) lists further tests that should be conducted on the colonies.
There is nowadays a growing need for sensing devices offering rapid and portable analytical functionality in real-time as well as massively parallel capabilities with very high sensitivity at the molecular level. Such devices are essential to facilitate research and foster advances in fields such as drug discovery, proteomics, medical diagnostics, systems biology or environmental monitoring.
In this context, an ideal solution is an ion-sensitive field-effect transistor sensor platform based on silicon nanowires to be integrated in a CMOS architecture. Indeed, in addition to the expected high sensitivity and superior signal quality, such nanowire sensors could be mass manufactured at reasonable costs, and readily integrated into electronic diagnostic devices to facilitate bed-site diagnostics and personalized medicine. Moreover, their small size makes them ideal candidates for future implanted sensing devices. While promising biosensing experiments based on silicon nanowire field-effect transistors have been reported, real-life applications still require improved control, together with a detailed understanding of the basic sensing mechanisms. For instance, it is crucial to optimize the geometry of the wire, a still rather unexplored aspect up to now, as well as its surface functionalization or its selectivity to the targeted analytes.
This project seeks to develop a modular, scalable and integrateable sensor platform for the electronic detection of analytes in solution. The idea is to integrate silicon nanowire field-effect transistors as a sensor array and combine them with state-of-the-art microfabricated interface electronics as well as with microfluidic channels for liquid handling. Such sensors have the potential to be mass manufactured at reasonable costs, allowing their integration as the active sensor part in electronic point-of-care diagnostic devices to facilitate, for instance, bed-side diagnostics and personalized medicine. Another important field is systems biology, where many substances need to be quantitatively detected in parallel at very low concentrations: in these situations, the platform being developed fulfills the requirements ideally and will have a strong impact and provide new insights, e.g. into the metabolic processes of cells, organisms or organs.
This talk was presented live at JMP Discovery Summit 2012 in Cary, North Carolina, USA. More information about design of experiments is available at http://www.jmp.com/applications/doe/
The document provides information about a digital communication systems exam, including questions on various topics in digital communication such as sampling theory, PCM, delta modulation, baseband transmission, digital modulation techniques, error control coding, and spread spectrum.
The exam is divided into two parts (A and B) and contains 10 questions in total. Part A covers topics such as sampling theorem, signal reconstruction, PCM, delta modulation, baseband transmission, and digital modulation formats. Part B focuses on questions related to digital modulation techniques like BPSK, probability of symbol error, DPSK, and spread spectrum modulation. The document provides detailed questions on concepts, derivations, and design problems in digital communication systems.
The document is the question paper for the Sixth Semester B.E. Degree Examination in Antennas and Propagation held in December 2013/January 2014. It contains 8 questions divided into 2 parts. Part A contains questions 1-4 covering topics like definitions related to antennas, derivation of expressions for directivity and effective aperture of antennas, field patterns of antenna arrays, and pattern multiplication. Part B contains questions 5-8 related to topics like radiation integrals, antenna arrays, and antenna measurements. Students had to answer 5 questions selecting at least 2 from each part.
Ict networking exercise short questions answerGary Tsang
This document provides short answers to questions about computer networking. It covers topics like types of networks, advantages and disadvantages of centralized and decentralized networks, components of networking hardware and software, protocols, network topologies and layers of the OSI model. The document contains diagrams and explanations of networking concepts.
Niels Lohmann explores several case studies applying symbolic systems biology techniques:
1) Analyzing biochemical reaction chains using the tool LoLA for fast reachability queries.
2) Finding hazards in Globally Asynchronous Locally Synchronous (GALS) circuits design using Petri nets and partial order reduction.
3) Verifying service choreographies for deadlocks by translating models to open workflow nets and discovering a design flaw.
https://www.udemy.com/vlsi-academy
Usually, while drawing any circuit on paper, we have only one 'vdd' at the top and one 'vss' at the bottom. But on a chip, it becomes necessary to have a grid structure of power, with more than one 'vdd' and 'vss'. The concept of power grid structure would be uploaded soon. It is actually the scaling trend that drives chip designers for power grid structure.
CDMA PRL issue investigation: Network operator A can detect ARFCN from operat...Ray KHASTUR
Because ARFCN of two operator are sharing use due to policy from government. Operator A only input one index table acquisition all ARFCN in HDR channel list, Operator B have 3 table index acquisition that different in each region.
PRL Operator A:
* Index Table 1 HDR (37, 78, 119, 160, 201, 242, 283, 324 and 1019)
PRL Operator B:
*Index Table 1 HDR (283)
*Index Table 3 HDR (1019 and 37)
*Index Table 5 HDR (1019)
From explanation above we can see that operator A will scanning all ARFCN that available in surrounding area which is suitable in Index Table 1 Operator A, that's why Operator A can detect Operator B channel list in all region.
https://www.udemy.com/vlsi-academy
http://vlsisystemdesign.com/place_decap.php
Once the critical cells are placed on the chip, it becomes necessary to surround the critical cells by decoupling capacitors. The placement of de-coupling capacitors surrounding the pre-placed cells improves the reliability and efficiency of the chip.
This document contains the contents and program descriptions for various programs to be completed as part of a Microprocessor Lab course. There are 23 interfacing programs and 20 8085 microprocessor programs described, including programs to transfer data blocks with and without overlap, add/multiply/divide numbers, implement counters, check codes, and interface with keyboards, displays, and other peripherals.
Basic Electronics Jntu Btech 2008 Jntu Model Paper{Www.Studentyogi.Com}guest3f9c6b
This document contains 8 questions related to Basic Electronics for a semester exam. The questions cover topics such as semiconductors, rectifiers, amplifiers, oscillators, timers, ultrasonic waves, and A/D converters. Students are instructed to answer any 5 of the 8 questions, which contain sub-questions related to circuit diagrams and explanations of electronics concepts and devices.
Gaweł mikołajczyk. i pv6 insecurities at first hopYury Chemerkin
Neighbor discovery and router advertisements are used to configure IPv6 addresses and discover routers but are vulnerable to attacks like address spoofing, router advertisement spoofing, and cache exhaustion attacks; securing these first-hop operations requires techniques like source address validation, cryptographic authentication of messages and sources, and rate limiting to prevent cache exhaustion on routers and switches.
This document provides an instruction set summary for a microcontroller. It includes a table that lists each instruction, describes its function, and specifies the number of bytes in the instruction and its execution time in oscillator periods. It summarizes instructions related to arithmetic operations, logical operations, program flow control, bit manipulation, data transfer, and interrupts.
The document describes the instruction set of the Atmel 8051 microcontroller. It includes 3 tables that list the instructions, describing the operation, number of bytes in the instruction, and the oscillator period in cycles to execute the instruction. The tables provide a summary of arithmetic, logical, branch, and data transfer instructions available on the 8051 microcontroller.
The document describes the instruction set of the 8086 microprocessor. It discusses the different types of instructions including data transfer instructions like MOV, PUSH, POP, XCHG, IN, OUT, and XLAT. It also covers addressing modes, instruction formats, and the various registers used by the 8086 microprocessor like the stack pointer and flag register. In total there are 14 different data transfer instructions described that are used to move data between registers, memory, ports, and the flag and stack pointers.
This document provides an overview of the ARM instruction set architecture. It discusses the ARM programming model including its general purpose registers and status flags. It also covers ARM data types, data operations, load/store instructions, flow of control instructions, and subroutine calling conventions. Examples are provided to demonstrate how common programming constructs like if/else statements and for loops can be implemented in ARM assembly language.
This document describes the instruction set of the 8051 microcontroller. It discusses the three types of instructions - single byte, double byte, and triple byte - based on the number of bytes needed to represent the instruction. It provides examples of different types of instructions, including data transfer, arithmetic, logical, logical bit, and program flow control instructions. Each instruction is defined by its mnemonic, description, and number of bytes.
microcontroller_instruction_set for ENGINEERING STUDENTSssuser2b759d
The document discusses the instruction set of microcontrollers. It describes that microcontrollers have instruction formats that specify the operation and operands. The 8051 microcontroller has 111 instructions divided into one-byte, two-byte, and three-byte instructions depending on the number of bytes needed to represent the instruction. The document outlines the different addressing modes and types of instructions including data transfer, arithmetic, logical, and program flow control instructions. It provides examples of common instructions and their operation.
The document discusses numerical bases used in programming such as hexadecimal, binary, and BCD. It provides examples of converting between decimal, binary, hexadecimal and BCD representations of numbers. It also describes registers and memory organization in 8051 microcontrollers including register banks, memory mapping, and addressing modes. Finally, it outlines common instructions of the 8051 instruction set such as MOV, ADD, CALL, JUMP, LOGICAL operations and flag manipulation.
1) The document discusses the high-level syntax of HEVC, including the video parameter set (VPS), sequence parameter set (SPS), and picture parameter set (PPS).
2) It describes the bitstream structure and how VPS, SPS, PPS, and slice data are organized in network abstraction layer (NAL) units.
3) Key coding units like coding tree blocks (CTBs), coding blocks (CBs), and coding units (CUs) are defined, as well as the quadtree partitioning syntax used in HEVC.
This document summarizes code examples and best practices for working with RDKit. It provides idioms for efficiently looping over molecules and atoms, accepting string arguments, representing reactions and bonds, and writing PDB files. It also discusses techniques for proximity calculations and bond ordering like template-based methods and different proximity algorithms.
The document discusses the ARM instruction set. It begins by defining the instruction set and describing the three states of operation: compiler, assembly, and object code. It then describes various types of instructions like data processing, data transfer, and control flow instructions. The rest of the document provides details on ARM characteristics, registers, conditional execution, addressing modes, and examples of instructions for common operations.
This document appears to be an exam for an Electronics and Communication Engineering course covering microprocessors and microcontrollers. It contains 16 questions testing knowledge of the 8086 and 8051 microprocessors. The questions cover topics like the operating modes, interrupts, architecture, and functional units of the 8086; system bus structure and timing diagrams; serial communication and special function registers of the 8051; and interfacing examples like generating waveforms using timers and displaying text on a seven segment LED display.
The 8085 microprocessor is an 8-bit processor that operates on a single +5V power supply. It has an 8-bit data bus and 16-bit address bus, and can address up to 64KB of memory. The 8085 includes general purpose registers, temporary registers, and special purpose registers like the accumulator and flag register. It performs arithmetic and logic operations and includes features like interrupt handling and serial I/O control.
The document discusses register allocation techniques in LLVM. It introduces the register allocation problem and describes LLVM's template method for register allocation. It then discusses LLVM's basic greedy register allocation approach, which prioritizes assigning registers to live intervals with higher spill costs. Finally, it describes LLVM's greedy register allocation in more detail, including techniques for live interval splitting such as local, instruction, region and block splitting using algorithms like Hopfield networks.
The document provides information about microcontrollers and the 8051 microcontroller family. It defines a microcontroller as a programmable digital processor with on-chip memory and peripherals. It then compares microcontrollers to microprocessors, noting that microcontrollers have on-chip memory and peripherals while microprocessors require external memory. The document proceeds to discuss the development and classification of microcontrollers like the Intel 4004 and 8051. It provides details on the architecture, memory structure, instructions, and I/O ports of the 8051 microcontroller.
This document provides an overview of the ARM instruction set architecture. It describes the ARM programming model including registers and status flags. It covers ARM data types, instructions for arithmetic, logic, comparison and movement. It also discusses memory organization, addressing modes, subroutine calling conventions and examples of translating C code to ARM assembly language.
This document provides an overview of the ARM instruction set architecture. It describes ARM versions, assembly language, programming model, data types, instructions, flow of control, and subroutine calling conventions. Key points covered include ARM's load/store architecture, conditional execution of instructions, and handling of procedure calls and nested subroutines.
The document discusses ARM assembly language basics including:
- Common syntax elements like labels, opcodes, operands, and comments.
- Instructions for moving data between registers and memory locations.
- Pseudo-instructions and data processing instructions for arithmetic, logical, and shift operations.
- Memory access instructions for loading and storing data using pre-indexing, post-indexing, and stack operations.
This document contains solutions to exam problems about interfacing devices using parallel I/O and handshaking timing diagrams on a 68HC11 microcontroller. It includes figures showing a 7-segment LED display, keyboard matrix, and parallel interface timing diagram. Subroutines are provided for initializing a port, receiving input data, and displaying a bit on the 7-segment LED. The document also provides answers to a multiple choice exam question.
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxSitimaJohn
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
Dive into the realm of operating systems (OS) with Pravash Chandra Das, a seasoned Digital Forensic Analyst, as your guide. 🚀 This comprehensive presentation illuminates the core concepts, types, and evolution of OS, essential for understanding modern computing landscapes.
Beginning with the foundational definition, Das clarifies the pivotal role of OS as system software orchestrating hardware resources, software applications, and user interactions. Through succinct descriptions, he delineates the diverse types of OS, from single-user, single-task environments like early MS-DOS iterations, to multi-user, multi-tasking systems exemplified by modern Linux distributions.
Crucial components like the kernel and shell are dissected, highlighting their indispensable functions in resource management and user interface interaction. Das elucidates how the kernel acts as the central nervous system, orchestrating process scheduling, memory allocation, and device management. Meanwhile, the shell serves as the gateway for user commands, bridging the gap between human input and machine execution. 💻
The narrative then shifts to a captivating exploration of prominent desktop OSs, Windows, macOS, and Linux. Windows, with its globally ubiquitous presence and user-friendly interface, emerges as a cornerstone in personal computing history. macOS, lauded for its sleek design and seamless integration with Apple's ecosystem, stands as a beacon of stability and creativity. Linux, an open-source marvel, offers unparalleled flexibility and security, revolutionizing the computing landscape. 🖥️
Moving to the realm of mobile devices, Das unravels the dominance of Android and iOS. Android's open-source ethos fosters a vibrant ecosystem of customization and innovation, while iOS boasts a seamless user experience and robust security infrastructure. Meanwhile, discontinued platforms like Symbian and Palm OS evoke nostalgia for their pioneering roles in the smartphone revolution.
The journey concludes with a reflection on the ever-evolving landscape of OS, underscored by the emergence of real-time operating systems (RTOS) and the persistent quest for innovation and efficiency. As technology continues to shape our world, understanding the foundations and evolution of operating systems remains paramount. Join Pravash Chandra Das on this illuminating journey through the heart of computing. 🌟
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
Nunit vs XUnit vs MSTest Differences Between These Unit Testing Frameworks.pdfflufftailshop
When it comes to unit testing in the .NET ecosystem, developers have a wide range of options available. Among the most popular choices are NUnit, XUnit, and MSTest. These unit testing frameworks provide essential tools and features to help ensure the quality and reliability of code. However, understanding the differences between these frameworks is crucial for selecting the most suitable one for your projects.
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on integration of Salesforce with Bonterra Impact Management.
Interested in deploying an integration with Salesforce for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
System Design Case Study: Building a Scalable E-Commerce Platform - Hiike
At c51ism
1. Microcontroller Instruction Set
For interrupt response time information, refer to the hardware description chapter.
Instructions that Affect Flag Settings(1)
Instruction Flag Instruction Flag
C OV AC C OV AC
ADD X X X CLR C O
ADDC X X X CPL C X
Instruction Set
SUBB X X X ANL C,bit X
MUL O X ANL C,/bit X
DIV O X ORL C,bit X
DA X ORL C,/bit X
RRC X MOV C,bit X
RLC X CJNE X
SETB C 1
Note: 1. Operations on SFR byte address 208 or bit addresses 209-215 (that is, the PSW or
bits in the PSW) also affect flag settings.
The Instruction Set and Addressing Modes
Rn Register R7-R0 of the currently selected Register Bank.
direct 8-bit internal data location’s address. This could be an Internal Data RAM
location (0-127) or a SFR [i.e., I/O port, control register, status register, etc.
(128-255)].
@Ri 8-bit internal data RAM location (0-255) addressed indirectly through register
R1or R0.
#data 8-bit constant included in instruction.
#data 16 16-bit constant included in instruction.
addr 16 16-bit destination address. Used by LCALL and LJMP A branch can be
.
anywhere within the 64K byte Program Memory address space.
addr 11 11-bit destination address. Used by ACALL and AJMP The branch will be
.
within the same 2K byte page of program memory as the first byte of the
following instruction.
rel Signed (two’s complement) 8-bit offset byte. Used by SJMP and all
conditional jumps. Range is -128 to +127 bytes relative to first byte of the
following instruction.
bit Direct Addressed bit in Internal Data RAM or Special Function Register.
0509B-B–12/97
2-71
2. Instruction Set Summary
0 1 2 3 4 5 6 7
0 NOP JBC JB JNB JC JNC JZ JNZ
bit,rel bit, rel bit, rel rel rel rel rel
[3B, 2C] [3B, 2C] [3B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C]
1 AJMP ACALL AJMP ACALL AJMP ACALL AJMP ACALL
(P0) (P0) (P1) (P1) (P2) (P2) (P3) (P3)
[2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C]
2 LJMP LCALL RET RETI ORL ANL XRL ORL
addr16 addr16 [2C] [2C] dir, A dir, A dir, a C, bit
[3B, 2C] [3B, 2C] [2B] [2B] [2B] [2B, 2C]
3 RR RRC RL RLC ORL ANL XRL JMP
A A A A dir, #data dir, #data dir, #data @A + DPTR
[3B, 2C] [3B, 2C] [3B, 2C] [2C]
4 INC DEC ADD ADDC ORL ANL XRL MOV
A A A, #data A, #data A, #data A, #data A, #data A, #data
[2B] [2B] [2B] [2B] [2B] [2B]
5 INC DEC ADD ADDC ORL ANL XRL MOV
dir dir A, dir A, dir A, dir A, dir A, dir dir, #data
[2B] [2B] [2B] [2B] [2B] [2B] [2B] [3B, 2C]
6 INC DEC ADD ADDC ORL ANL XRL MOV
@R0 @R0 A, @R0 A, @R0 A, @R0 A, @R0 A, @R0 @R0, @data
[2B]
7 INC DEC ADD ADDC ORL ANL XRL MOV
@R1 @R1 A, @R1 A, @R1 A, @R1 A, @R1 A, @R1 @R1, #data
[2B]
8 INC DEC ADD ADDC ORL ANL XRL MOV
R0 R0 A, R0 A, R0 A, R0 A, R0 A, R0 R0, #data
[2B]
9 INC DEC ADD ADDC ORL ANL XRL MOV
R1 R1 A, R1 A, R1 A, R1 A, R1 A, R1 R1, #data
[2B]
A INC DEC ADD ADDC ORL ANL XRL MOV
R2 R2 A, R2 A, R2 A, R2 A, R2 A, R2 R2, #data
[2B]
B INC DEC ADD ADDC ORL ANL XRL MOV
R3 R3 A, R3 A, R3 A, R3 A, R3 A, R3 R3, #data
[2B]
C INC DEC ADD ADDC ORL ANL XRL MOV
R4 R4 A, R4 A, R4 A, R4 A, R4 A, R4 R4, #data
[2B]
D INC DEC ADD ADDC ORL ANL XRL MOV
R5 R5 A, R5 A, R5 A, R5 A, R5 A, R5 R5, #data
[2B]
E INC DEC ADD ADDC ORL ANL XRL MOV
R6 R6 A, R6 A, R6 A, R6 A, R6 A, R6 R6, #data
[2B]
F INC DEC ADD ADDC ORL ANL XRL MOV
R7 R7 A, R7 A, R7 A, R7 A, R7 A, R7 R7, #data
[2B]
Note: Key: [2B] = 2 Byte, [3B] = 3 Byte, [2C] = 2 Cycle, [4C] = 4 Cycle, Blank = 1 byte/1 cycle
2-72 Instruction Set
3. Instruction Set
Instruction Set Summary (Continued)
8 9 A B C D E F
0 SJMP MOV ORL ANL PUSH POP MOVX A, MOVX
REL DPTR,# C, /bit C, /bit dir dir @DPTR @DPTR, A
[2B, 2C] data 16 [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2C] [2C]
[3B, 2C]
1 AJMP ACALL AJMP ACALL AJMP ACALL AJMP ACALL
(P4) (P4) (P5) (P5) (P6) (P6) (P7) (P7)
[2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C] [2B, 2C]
2 ANL MOV MOV CPL CLR SETB MOVX MOVX
C, bit bit, C C, bit bit bit bit A, @R0 wR0, A
[2B, 2C] [2B, 2C] [2B] [2B] [2B] [2B] [2C] [2C]
3 MOVC A, MOVC A, INC CPL CLR SETB MOVX MOVX
@A + PC @A + DPTR DPTR C C C A, @RI @RI, A
[2C] [2C] [2C] [2C] [2C]
4 DIV SUBB MUL CJNE A, SWAP DA CLR CPL
AB A, #data AB #data, rel A A A A
[2B, 4C] [2B] [4C] [3B, 2C]
5 MOV SUBB CJNE XCH DJNZ MOV MOV
dir, dir A, dir A, dir, rel A, dir dir, rel A, dir dir, A
[3B, 2C] [2B] [3B, 2C] [2B] [3B, 2C] [2B] [2B]
6 MOV SUBB MOV CJNE XCH XCHD MOV MOV
dir, @R0 A, @R0 @R0, dir @R0, #data, rel A, @R0 A, @R0 A, @R0 @R0, A
[2B, 2C] [2B, 2C] [3B, 2C]
7 MOV SUBB MOV CJNE XCH XCHD MOV MOV
dir, @R1 A, @R1 @R1, dir @R1, #data, rel A, @R1 A, @R1 A, @R1 @R1, A
[2B, 2C] [2B, 2C] [3B, 2C]
8 MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R0 A, R0 R0, dir R0, #data, rel A, R0 R0, rel A, R0 R0, A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
9 MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R1 A, R1 R1, dir R1, #data, rel A, R1 R1, rel A, R1 R1, A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
A MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R2 A, R2 R2, dir R2, #data, rel A, R2 R2, rel A, R2 R2, A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
B MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R3 A, R3 R3, dir R3, #data, rel A, R3 R3, rel A, R3 R3, A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
C MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R4 A, R4 R4, dir R4, #data, rel A, R4 R4, rel A, R4 R4, A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
D MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R5 A, R5 R5, dir R5, #data, rel A, R5 R5, rel A, R5 R5, A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
E MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R6 A, R6 R6, dir R6, #data, rel A, R6 R6, rel A, R6 R6. A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
F MOV SUBB MOV CJNE XCH DJNZ MOV MOV
dir, R7 A, R7 R7, dir R7, #data, rel A, R7 R7, rel A, R7 R7, A
[2B, 2C] [2B, 2C] [3B, 2C] [2B, 2C]
Note: Key: [2B] = 2 Byte, [3B] = 3 Byte, [2C] = 2 Cycle, [4C] = 4 Cycle, Blank = 1 byte/1 cycle
2-73
5. Instruction Set
Mnemonic Description Byte Oscillator Mnemonic Description Byte Oscillator
Period Period
RR A Rotate Accumulator 1 12 MOVX A,@DPTR Move Exernal RAM (16- 1 24
Right bit addr) to Acc
RRC A Rotate Accumulator 1 12 MOVX @Ri,A Move Acc to External 1 24
Right through the Carry RAM (8-bit addr)
SWAP A Swap nibbles within the 1 12 MOVX @DPTR,A Move Acc to External 1 24
Accumulator RAM (16-bit addr)
DATA TRANSFER PUSH direct Push direct byte onto 2 24
stack
MOV A,Rn Move register to 1 12
Accumulator POP direct Pop direct byte from 2 24
stack
MOV A,direct Move direct byte to 2 12
Accumulator XCH A,Rn Exchange register with 1 12
Accumulator
MOV A,@Ri Move indirect RAM to 1 12
Accumulator XCH A,direct Exchange direct byte 2 12
with Accumulator
MOV A,#data Move immediate data to 2 12
Accumulator XCH A,@Ri Exchange indirect RAM 1 12
with Accumulator
MOV Rn,A Move Accumulator to 1 12
register XCHD A,@Ri Exchange low-order 1 12
Digit indirect RAM with
MOV Rn,direct Move direct byte to 2 24
Acc
register
BOOLEAN VARIABLE MANIPULATION
MOV Rn,#data Move immediate data to 2 12
register CLR C Clear Carry 1 12
MOV direct,A Move Accumulator to 2 12 CLR bit Clear direct bit 2 12
direct byte
SETB C Set Carry 1 12
MOV direct,Rn Move register to direct 2 24
SETB bit Set direct bit 2 12
byte
MOV direct,direct Move direct byte to direct 3 24 CPL C Complement Carry 1 12
MOV direct,@Ri Move indirect RAM to 2 24 CPL bit Complement direct bit 2 12
direct byte ANL C,bit AND direct bit to CARRY 2 24
MOV direct,#data Move immediate data to 3 24 ANL C,/bit AND complement of 2 24
direct byte direct bit to Carry
MOV @Ri,A Move Accumulator to 1 12 ORL C,bit OR direct bit to Carry 2 24
indirect RAM
ORL C,/bit OR complement of direct 2 24
MOV @Ri,direct Move direct byte to 2 24 bit to Carry
indirect RAM
MOV C,bit Move direct bit to Carry 2 12
MOV @Ri,#data Move immediate data to 2 12
indirect RAM MOV bit,C Move Carry to direct bit 2 24
MOV DPTR,#data16 Load Data Pointer with a 3 24 JC rel Jump if Carry is set 2 24
16-bit constant
JNC rel Jump if Carry not set 2 24
MOVC A,@A+DPTR Move Code byte relative 1 24
JB bit,rel Jump if direct Bit is set 3 24
to DPTR to Acc
JNB bit,rel Jump if direct Bit is Not 3 24
MOVC A,@A+PC Move Code byte relative 1 24
set
to PC to Acc
JBC bit,rel Jump if direct Bit is set & 3 24
MOVX A,@Ri Move External RAM (8- 1 24
clear bit
bit addr) to Acc
PROGRAM BRANCHING
DATA TRANSFER (continued)
2-75
6. Mnemonic Description Byte Oscillator
Period
ACALL addr11 Absolute Subroutine Call 2 24
LCALL addr16 Long Subroutine Call 3 24
RET Return from Subroutine 1 24
RETI Return from 1 24
interrupt
AJMP addr11 Absolute Jump 2 24
LJMP addr16 Long Jump 3 24
SJMP rel Short Jump (relative 2 24
addr)
JMP @A+DPTR Jump indirect relative to 1 24
the DPTR
JZ rel Jump if Accumulator is 2 24
Zero
JNZ rel Jump if Accumulator is 2 24
Not Zero
CJNE A,direct,rel Compare direct byte to 3 24
Acc and Jump if Not
Equal
CJNE A,#data,rel Compare immediate to 3 24
Acc and Jump if Not
Equal
CJNE Rn,#data,rel Compare immediate to 3 24
register and Jump if Not
Equal
CJNE @Ri,#data,rel Compare immediate to 3 24
indirect and Jump if Not
Equal
DJNZ Rn,rel Decrement register and 2 24
Jump if Not Zero
DJNZ direct,rel Decrement direct byte 3 24
and Jump if Not Zero
NOP No Operation 1 12
2-76 Instruction Set
7. Instruction Set
Table 2. Instruction Opcodes in Hexadecimal Order
Hex Number Mnemonic Operands Hex Number Mnemonic Operands
Code of Bytes Code of Bytes
00 1 NOP 26 1 ADD A,@R0
01 2 AJMP code addr 27 1 ADD A,@R1
02 3 LJMP code addr 28 1 ADD A,R0
03 1 RR A 29 1 ADD A,R1
04 1 INC A 2A 1 ADD A,R2
05 2 INC data addr 2B 1 ADD A,R3
06 1 INC @R0 2C 1 ADD A,R4
07 1 INC @R1 2D 1 ADD A,R5
08 1 INC R0 2E 1 ADD A,R6
09 1 INC R1 2F 1 ADD A,R7
0A 1 INC R2 30 3 JNB bit addr,code addr
0B 1 INC R3 31 2 ACALL code addr
0C 1 INC R4 32 1 RETI
0D 1 INC R5 33 1 RLC A
0E 1 INC R6 34 2 ADDC A,#data
0F 1 INC R7 35 2 ADDC A,data addr
10 3 JBC bit addr,code addr 36 1 ADDC A,@R0
11 2 ACALL code addr 37 1 ADDC A,@R1
12 3 LCALL code addr 38 1 ADDC A,R0
13 1 RRC A 39 1 ADDC A,R1
14 1 DEC A 3A 1 ADDC A,R2
15 2 DEC data addr 3B 1 ADDC A,R3
16 1 DEC @R0 3C 1 ADDC A,R4
17 1 DEC @R1 3D 1 ADDC A,R5
18 1 DEC R0 3E 1 ADDC A,R6
19 1 DEC R1 3F 1 ADDC A,R7
1A 1 DEC R2 40 2 JC code addr
1B 1 DEC R3 41 2 AJMP code addr
1C 1 DEC R4 42 2 ORL data addr,A
1D 1 DEC R5 43 3 ORL data addr,#data
1E 1 DEC R6 44 2 ORL A,#data
1F 1 DEC R7 45 2 ORL A,data addr
20 3 JB bit addr,code addr 46 1 ORL A,@R0
21 2 AJMP code addr 47 1 ORL A,@R1
22 1 RET 48 1 ORL A,R0
23 1 RL A 49 1 ORL A,R1
24 2 ADD A,#data 4A 1 ORL A,R2
25 2 ADD A,data addr
2-77
9. Instruction Set
Hex Number Mnemonic Operands Hex Number Mnemonic Operands
Code of Bytes Code of Bytes
97 1 SUBB A,@R1 BD 3 CJNE R5,#data,code addr
98 1 SUBB A,R0 BE 3 CJNE R6,#data,code addr
99 1 SUBB A,R1 BF 3 CJNE R7,#data,code addr
9A 1 SUBB A,R2 C0 2 PUSH data addr
9B 1 SUBB A,R3 C1 2 AJMP code addr
9C 1 SUBB A,R4 C2 2 CLR bit addr
9D 1 SUBB A,R5 C3 1 CLR C
9E 1 SUBB A,R6 C4 1 SWAP A
9F 1 SUBB A,R7 C5 2 XCH A,data addr
A0 2 ORL C,/bit addr C6 1 XCH A,@R0
A1 2 AJMP code addr C7 1 XCH A,@R1
A2 2 MOV C,bit addr C8 1 XCH A,R0
A3 1 INC DPTR C9 1 XCH A,R1
A4 1 MUL AB CA 1 XCH A,R2
A5 reserved CB 1 XCH A,R3
A6 2 MOV @R0,data addr CC 1 XCH A,R4
A7 2 MOV @R1,data addr CD 1 XCH A,R5
A8 2 MOV R0,data addr CE 1 XCH A,R6
A9 2 MOV R1,data addr CF 1 XCH A,R7
AA 2 MOV R2,data addr D0 2 POP data addr
AB 2 MOV R3,data addr D1 2 ACALL code addr
AC 2 MOV R4,data addr D2 2 SETB bit addr
AD 2 MOV R5,data addr D3 1 SETB C
AE 2 MOV R6,data addr D4 1 DA A
AF 2 MOV R7,data addr D5 3 DJNZ data addr,code addr
B0 2 ANL C,/bit addr D6 1 XCHD A,@R0
B1 2 ACALL code addr D7 1 XCHD A,@R1
B2 2 CPL bit addr D8 2 DJNZ R0,code addr
B3 1 CPL C D9 2 DJNZ R1,code addr
B4 3 CJNE A,#data,code addr DA 2 DJNZ R2,code addr
B5 3 CJNE A,data addr,code addr DB 2 DJNZ R3,code addr
B6 3 CJNE @R0,#data,code addr DC 2 DJNZ R4,code addr
B7 3 CJNE @R1,#data,code addr DD 2 DJNZ R5,code addr
B8 3 CJNE R0,#data,code addr DE 2 DJNZ R6,code addr
B9 3 CJNE R1,#data,code addr DF 2 DJNZ R7,code addr
BA 3 CJNE R2,#data,code addr E0 1 MOVX A,@DPTR
BB 3 CJNE R3,#data,code addr E1 2 AJMP code addr
BC 3 CJNE R4,#data,code addr E2 1 MOVX A,@R0
2-79
10. Hex Number Mnemonic Operands
Code of Bytes
E3 1 MOVX A,@R1
E4 1 CLR A
E5 2 MOV A,data addr
E6 1 MOV A,@R0
E7 1 MOV A,@R1
E8 1 MOV A,R0
E9 1 MOV A,R1
EA 1 MOV A,R2
EB 1 MOV A,R3
EC 1 MOV A,R4
ED 1 MOV A,R5
EE 1 MOV A,R6
EF 1 MOV A,R7
F0 1 MOVX @DPTR,A
F1 2 ACALL code addr
F2 1 MOVX @R0,A
F3 1 MOVX @R1,A
F4 1 CPL A
F5 2 MOV data addr,A
F6 1 MOV @R0,A
F7 1 MOV @R1,A
F8 1 MOV R0,A
F9 1 MOV R1,A
FA 1 MOV R2,A
FB 1 MOV R3,A
FC 1 MOV R4,A
FD 1 MOV R5,A
FE 1 MOV R6,A
FF 1 MOV R7,A
2-80 Instruction Set
11. Instruction Set
Instruction Definitions
ACALL addr11
Function: Absolute Call
Description: ACALL unconditionally calls a subroutine located at the indicated address. The instruction increments the PC
twice to obtain the address of the following instruction, then pushes the 16-bit result onto the stack (low-order
byte first) and increments the Stack Pointer twice. The destination address is obtained by successively
concatenating the five high-order bits of the incremented PC, opcode bits 7 through 5, and the second byte of the
instruction. The subroutine called must therefore start within the same 2 K block of the program memory as the
first byte of the instruction following ACALL. No flags are affected.
Example: Initially SP equals 07H. The label SUBRTN is at program memory location 0345 H. After executing the following
instruction,
ACALL SUBRTN
at location 0123H, SP contains 09H, internal RAM locations 08H and 09H will contain 25H and 01H, respectively,
and the PC contains 0345H.
Bytes: 2
Cycles: 2
Encoding: a10 a9 a8 1 0 0 0 1 a7 a6 a5 a4 a3 a2 a1 a0
Operation: ACALL
(PC) ← (PC) + 2
(SP) ← (SP) + 1
((SP)) ← (PC7-0)
(SP) ← (SP) + 1
((SP)) ← (PC15-8)
(PC10-0) ← page address
2-81
12. ADD A,<src-byte>
Function: Add
Description: ADD adds the byte variable indicated to the Accumulator, leaving the result in the Accumulator. The carry and
auxiliary-carry flags are set, respectively, if there is a carry-out from bit 7 or bit 3, and cleared otherwise. When
adding unsigned integers, the carry flag indicates an overflow occurred.
OV is set if there is a carry-out of bit 6 but not out of bit 7, or a carry-out of bit 7 but not bit 6; otherwise, OV is
cleared. When adding signed integers, OV indicates a negative number produced as the sum of two positive
operands, or a positive sum from two negative operands.
Four source operand addressing modes are allowed: register, direct, register-indirect, or immediate.
Example: The Accumulator holds 0C3H (1100001lB), and register 0 holds 0AAH (10101010B). The following instruction,
ADD A,R0
leaves 6DH (01101101B) in the Accumulator with the AC flag cleared and both the carry flag and OV set to 1.
ADD A,Rn
Bytes: 1
Cycles: 1
Encoding: 0 0 1 0 1 r r r
Operation: ADD
(A) ← (A) + (Rn)
ADD A,direct
Bytes: 2
Cycles: 1
Encoding: 0 0 1 0 0 1 0 1 direct address
Operation: ADD
(A) ← (A) + (direct)
ADD A,@Ri
Bytes: 1
Cycles: 1
Encoding: 0 0 1 0 0 1 1 i
Operation: ADD
(A) ← (A) + ((Ri))
ADD A,#data
Bytes: 2
Cycles: 1
Encoding: 0 0 1 0 0 1 0 0 immediate data
Operation: ADD
(A) ← (A) + #data
2-82 Instruction Set
13. Instruction Set
ADDC A, <src-byte>
Function: Add with Carry
Description: ADDC simultaneously adds the byte variable indicated, the carry flag and the Accumulator contents, leaving the
result in the Accumulator. The carry and auxiliary-carry flags are set respectively, if there is a carry-out from bit 7
or bit 3, and cleared otherwise. When adding unsigned integers, the carry flag indicates an overflow occurred.
OV is set if there is a carry-out of bit 6 but not out of bit 7, or a carry-out of bit 7 but not out of bit 6; otherwise OV
is cleared. When adding signed integers, OV indicates a negative number produced as the sum of two positive
operands or a positive sum from two negative operands.
Four source operand addressing modes are allowed: register, direct, register-indirect, or immediate.
Example: The Accumulator holds 0C3H (11000011B) and register 0 holds 0AAH (10101010B) with the carry flag set. The
following instruction,
ADDC A,R0
leaves 6EH (01101110B) in the Accumulator with AC cleared and both the Carry flag and OV set to 1.
ADDC A,Rn
Bytes: 1
Cycles: 1
Encoding: 0 0 1 1 1 r r r
Operation: ADDC
(A) ← (A) + (C) + (Rn)
ADDC A,direct
Bytes: 2
Cycles: 1
Encoding: 0 0 1 1 0 1 0 1 direct address
Operation: ADDC
(A) ← (A) + (C) + (direct)
ADDC A,@Ri
Bytes: 1
Cycles: 1
Encoding: 0 0 1 1 0 1 1 i
Operation: ADDC
(A) ← (A) + (C) + ((Ri))
ADDC A,#data
Bytes: 2
Cycles: 1
Encoding: 0 0 1 1 0 1 0 0 immediate data
Operation: ADDC
(A) ← (A) + (C) + #data
2-83
14. AJMP addr11
Function: Absolute Jump
Description: AJMP transfers program execution to the indicated address, which is formed at run-time by concatenating the
high-order five bits of the PC (after incrementing the PC twice), opcode bits 7 through 5, and the second byte of
the instruction. The destination must therfore be within the same 2 K block of program memory as the first byte of
the instruction following AJMP .
Example: The label JMPADR is at program memory location 0123H. The following instruction,
AJMP JMPADR
is at location 0345H and loads the PC with 0123H.
Bytes: 2
Cycles: 2
Encoding: a10 a9 a8 0 0 0 0 1 a7 a6 a5 a4 a3 a2 a1 a0
Operation: AJMP
(PC) ← (PC) + 2
(PC10-0) ← page address
ANL <dest-byte>,<src-byte>
Function: Logical-AND for byte variables
Description: ANL performs the bitwise logical-AND operation between the variables indicated and stores the results in the
destination variable. No flags are affected.
The two operands allow six addressing mode combinations. When the destination is the Accumulator, the source
can use register, direct, register-indirect, or immediate addressing; when the destination is a direct address, the
source can be the Accumulator or immediate data.
Note: When this instruction is used to modify an output port, the value used as the original port data will be read
from the output data latch, not the input pins.
Example: If the Accumulator holds 0C3H (1100001lB), and register 0 holds 55H (01010101B), then the following
instruction,
ANL A,R0
leaves 41H (01000001B) in the Accumulator.
When the destination is a directly addressed byte, this instruction clears combinations of bits in any RAM
location or hardware register. The mask byte determining the pattern of bits to be cleared would either be a
constant contained in the instruction or a value computed in the Accumulator at run-time. The following
instruction,
ANL P1,#01110011B
clears bits 7, 3, and 2 of output port 1.
ANL A,Rn
Bytes: 1
Cycles: 1
Encoding: 0 1 0 1 1 r r r
Operation: ANL
(A) ← (A) ∧ (Rn)
2-84 Instruction Set
16. ANL C,<src-bit>
Function: Logical-AND for bit variables
Description: If the Boolean value of the source bit is a logical 0, then ANL C clears the carry flag; otherwise, this instruction
leaves the carry flag in its current state. A slash ( / ) preceding the operand in the assembly language indicates
that the logical complement of the addressed bit is used as the source value, but the source bit itself is not
affected. No other flags are affected.
Only direct addressing is allowed for the source operand.
Example: Set the carry flag if, and only if, P1.0 = 1, ACC.7 = 1, and OV = 0:
MOV C,P1.0 ;LOAD CARRY WITH INPUT PIN STATE
ANL C,ACC.7 ;AND CARRY WITH ACCUM. BIT 7
ANL C,/OV ;AND WITH INVERSE OF OVERFLOW FLAG
ANL C,bit
Bytes: 2
Cycles: 2
Encoding: 1 0 0 0 0 0 1 0 bit address
Operation: ANL
(C) ← (C) ∧ (bit)
ANL C,/bit
Bytes: 2
Cycles: 2
Encoding: 1 0 1 1 0 0 0 0 bit address
Operation: ANL
(C) ← (C) ∧ (bit)
2-86 Instruction Set
17. Instruction Set
CJNE <dest-byte>,<src-byte>, rel
Function: Compare and Jump if Not Equal.
Description: CJNE compares the magnitudes of the first two operands and branches if their values are not equal. The branch
destination is computed by adding the signed relative-displacement in the last instruction byte to the PC, after
incrementing the PC to the start of the next instruction. The carry flag is set if the unsigned integer value of
<dest-byte> is less than the unsigned integer value of <src-byte>; otherwise, the carry is cleared. Neither
operand is affected.
The first two operands allow four addressing mode combinations: the Accumulator may be compared with any
directly addressed byte or immediate data, and any indirect RAM location or working register can be compared
with an immediate constant.
Example: The Accumulator contains 34H. Register 7 contains 56H. The first instruction in the sequence,
CJNE R7, # 60H, NOT_EQ
; ... ..... ;R7 = 60H.
NOT_EQ: JC REQ_LOW ;IF R7 < 60H.
; ... ..... ;R7 > 60H.
sets the carry flag and branches to the instruction at label NOT_EQ. By testing the carry flag, this instruction
determines whether R7 is greater or less than 60H.
If the data being presented to Port 1 is also 34H, then the following instruction,
WAIT: CJNE A, P1,WAIT
clears the carry flag and continues with the next instruction in sequence, since the Accumulator does equal the
data read from P1. (If some other value was being input on P1, the program loops at this point until the P1 data
changes to 34H.)
CJNE A,direct,rel
Bytes: 3
Cycles: 2
Encoding: 1 0 1 1 0 1 0 1 direct address rel. address
Operation: (PC) ← (PC) + 3
IF (A) < > (direct)
THEN
(PC) ← (PC) + relative offset
IF (A) < (direct)
THEN
(C) ← 1
ELSE
(C) ← 0
2-87
18. CJNE A,#data,rel
Bytes: 3
Cycles: 2
Encoding: 1 0 1 1 0 1 0 0 immediate data rel. address
Operation: (PC) ← (PC) + 3
IF (A) < > data
THEN
(PC) ← (PC) + relative offset
IF (A) < data
THEN
(C) ← 1
ELSE
(C) ← 0
CJNE Rn,#data,rel
Bytes: 3
Cycles: 2
Encoding: 1 0 1 1 1 r r r immediate data rel. address
Operation: (PC) ← (PC) + 3
IF (Rn) < > data
THEN
(PC) ← (PC) + relative offset
IF (Rn) < data
THEN
(C) ← 1
ELSE
(C) ← 0
CJNE @Ri,data,rel
Bytes: 3
Cycles: 2
Encoding: 1 0 1 1 0 1 1 i immediate data rel. address
Operation: (PC) ← (PC) + 3
IF ((Ri)) < > data
THEN
(PC) ← (PC) + relative offset
IF ((Ri)) < data
THEN
(C) ← 1
ELSE
(C) ← 0
2-88 Instruction Set
19. Instruction Set
CLR A
Function: Clear Accumulator
Description: CLR A clears the Accumulator (all bits set to 0). No flags are affected
Example: The Accumulator contains 5CH (01011100B). The following instruction,CLR Aleaves the Accumulator set to 00H
(00000000B).
Bytes: 1
Cycles: 1
Encoding: 1 1 1 0 0 1 0 0
Operation: CLR
(A) ← 0
CLR bit
Function: Clear bit
Description: CLR bit clears the indicated bit (reset to 0). No other flags are affected. CLR can operate on the carry flag or any
directly addressable bit.
Example: Port 1 has previously been written with 5DH (01011101B). The following instruction,CLR P1.2 leaves the port set
to 59H (01011001B).
CLR C
Bytes: 1
Cycles: 1
Encoding: 1 1 0 0 0 0 1 1
Operation: CLR
(C) ← 0
CLR bit
Bytes: 2
Cycles: 1
Encoding: 1 1 0 0 0 0 1 0 bit address
Operation: CLR
(bit) ← 0
2-89
20. CPL A
Function: Complement Accumulator
Description: CPLA logically complements each bit of the Accumulator (one’s complement). Bits which previously contained a
1 are changed to a 0 and vice-versa. No flags are affected.
Example: The Accumulator contains 5CH (01011100B). The following instruction,
CPL A
leaves the Accumulator set to 0A3H (10100011B).
Bytes: 1
Cycles: 1
Encoding: 1 1 1 1 0 1 0 0
Operation: CPL
(A) ← (A)
CPL bit
Function: Complement bit
Description: CPL bit complements the bit variable specified. A bit that had been a 1 is changed to 0 and vice-versa. No other
flags are affected. CLR can operate on the carry or any directly addressable bit.
Note: When this instruction is used to modify an output pin, the value used as the original data is read from the
output data latch, not the input pin.
Example: Port 1 has previously been written with 5BH (01011101B). The following instruction sequence,CPL P1.1CPL
P1.2 leaves the port set to 5BH (01011011B).
CPL C
Bytes: 1
Cycles: 1
Encoding: 1 0 1 1 0 0 1 1
Operation: CPL
(C) ← (C)
CPL bit
Bytes: 2
Cycles: 1
Encoding: 1 0 1 1 0 0 1 0 bit address
Operation: CPL
(bit) ← (bit)
2-90 Instruction Set
21. Instruction Set
DA A
Function: Decimal-adjust Accumulator for Addition
Description: DA A adjusts the eight-bit value in the Accumulator resulting from the earlier addition of two variables (each in
packed-BCD format), producing two four-bit digits. Any ADD or ADDC instruction may have been used to
perform the addition.
If Accumulator bits 3 through 0 are greater than nine (xxxx1010-xxxx1111), or if the AC flag is one, six is added
to the Accumulator producing the proper BCD digit in the low-order nibble. This internal addition sets the carry
flag if a carry-out of the low-order four-bit field propagates through all high-order bits, but it does not clear the
carry flag otherwise.
If the carry flag is now set, or if the four high-order bits now exceed nine (1010xxxx-1111xxxx), these high-order
bits are incremented by six, producing the proper BCD digit in the high-order nibble. Again, this sets the carry
flag if there is a carry-out of the high-order bits, but does not clear the carry. The carry flag thus indicates if the
sum of the original two BCD variables is greater than 100, allowing multiple precision decimal addition. OV is not
affected.
All of this occurs during the one instruction cycle. Essentially, this instruction performs the decimal conversion by
adding 00H, 06H, 60H, or 66H to the Accumulator, depending on initial Accumulator and PSW conditions.
Note: DA A cannot simply convert a hexadecimal number in the Accumulator to BCD notation, nor does DAA
apply to decimal subtraction.
Example: The Accumulator holds the value 56H (01010110B), representing the packed BCD digits of the decimal number
56. Register 3 contains the value 67H (01100111B), representing the packed BCD digits of the decimal number
67. The carry flag is set. The following instruction sequence
ADDC A,R3
DA A
first performs a standard two’s-complement binary addition, resulting in the value 0BEH (10111110) in the
Accumulator. The carry and auxiliary carry flags are cleared.
The Decimal Adjust instruction then alters the Accumulator to the value 24H (00100100B), indicating the packed
BCD digits of the decimal number 24, the low-order two digits of the decimal sum of 56, 67, and the carry-in. The
carry flag is set by the Decimal Adjust instruction, indicating that a decimal overflow occurred. The true sum of
56, 67, and 1 is 124.
BCD variables can be incremented or decremented by adding 01H or 99H. If the Accumulator initially holds 30H
(representing the digits of 30 decimal), then the following instruction sequence,
ADD A, # 99H
DA A
leaves the carry set and 29H in the Accumulator, since 30 + 99 = 129. The low-order byte of the sum can be
interpreted to mean 30 - 1 = 29.
Bytes: 1
Cycles: 1
Encoding: 1 1 0 1 0 1 0 0
Operation: DA
-contents of Accumulator are BCD
IF [[(A3-0) > 9] ∨
[(AC) = 1]]
THEN (A3-0) ← (A3-0) + 6
AND
IF [[(A7-4) > 9] ∨
[(C) = 1]]
THEN (A7-4) ← (A7-4) + 6
2-91
22. DEC byte
Function: Decrement
Description: DEC byte decrements the variable indicated by 1. An original value of 00H underflows to 0FFH. No flags are
affected. Four operand addressing modes are allowed: accumulator, register, direct, or register-indirect.
Note: When this instruction is used to modify an output port, the value used as the original port data will be read
from the output data latch, not the input pins.
Example: Register 0 contains 7FH (01111111B). Internal RAM locations 7EH and 7FH contain 00H and 40H, respectively.
The following instruction sequence,
DEC @R0
DEC R0
DEC @R0
leaves register 0 set to 7EH and internal RAM locations 7EH and 7FH set to 0FFH and 3FH.
DEC A
Bytes: 1
Cycles: 1
Encoding: 0 0 0 1 0 1 0 0
Operation: DEC
(A) ← (A) - 1
DEC Rn
Bytes: 1
Cycles: 1
Encoding: 0 0 0 1 1 r r r
Operation: DEC
(Rn) ← (Rn) - 1
DEC direct
Bytes: 2
Cycles: 1
Encoding: 0 0 0 1 0 1 0 1 direct address
Operation: DEC
(direct) ← (direct) - 1
DEC @Ri
Bytes: 1
Cycles: 1
Encoding: 0 0 0 1 0 1 1 i
Operation: DEC
((Ri)) ← ((Ri)) - 1
2-92 Instruction Set
23. Instruction Set
DIV AB
Function: Divide
Description: DIV AB divides the unsigned eight-bit integer in the Accumulator by the unsigned eight-bit integer in register B.
The Accumulator receives the integer part of the quotient; register B receives the integer remainder. The carry
and OV flags are cleared.
Exception: if B had originally contained 00H, the values returned in the Accumulator and B-register are
undefined and the overflow flag are set. The carry flag is cleared in any case.
Example: The Accumulator contains 251 (0FBH or 11111011B) and B contains 18 (12H or 00010010B). The following
instruction,
DIV AB
leaves 13 in the Accumulator (0DH or 00001101B) and the value 17 (11H or 00010001B) in B, since
251 = (13 x 18) + 17. Carry and OV are both cleared.
Bytes: 1
Cycles: 4
Encoding: 1 0 0 0 0 1 0 0
Operation: DIV
(A)15-8 ← (A)/(B)
(B)7-0
2-93
24. DJNZ <byte>,<rel-addr>
Function: Decrement and Jump if Not Zero
Description: DJNZ decrements the location indicated by 1, and branches to the address indicated by the second operand if
the resulting value is not zero. An original value of 00H underflows to 0FFH. No flags are affected. The branch
destination is computed by adding the signed relative-displacement value in the last instruction byte to the PC,
after incrementing the PC to the first byte of the following instruction.
The location decremented may be a register or directly addressed byte.
Note: When this instruction is used to modify an output port, the value used as the original port data will be read
from the output data latch, not the input pins.
Example: Internal RAM locations 40H, 50H, and 60H contain the values 01H, 70H, and 15H, respectively. The following
instruction sequence,
DJNZ 40H,LABEL_1
DJNZ 50H,LABEL_2
DJNZ 60H,LABEL_3
causes a jump to the instruction at label LABEL_2 with the values 00H, 6FH, and 15H in the three RAM
locations. The first jump was not taken because the result was zero.
This instruction provides a simple way to execute a program loop a given number of times or for adding a
moderate time delay (from 2 to 512 machine cycles) with a single instruction. The following instruction sequence,
MOV R2, # 8
TOGGLE: CPL P1.7
DJNZ R2,TOGGLE
toggles P1.7 eight times, causing four output pulses to appear at bit 7 of output Port 1. Each pulse lasts three
machine cycles; two for DJNZ and one to alter the pin.
DJNZ Rn,rel
Bytes: 2
Cycles: 2
Encoding: 1 1 0 1 1 r r r rel. address
Operation: DJNZ
(PC) ← (PC) + 2
(Rn) ← (Rn) - 1
IF (Rn) > 0 or (Rn) < 0
THEN
(PC) ← (PC) + rel
DJNZ direct,rel
Bytes: 3
Cycles: 2
Encoding: 1 1 0 1 0 1 0 1 direct address rel. address
Operation: DJNZ
(PC) ← (PC) + 2
(direct) ← (direct) - 1
IF (direct) > 0 or (direct) < 0
THEN
(PC) ← (PC) + rel
2-94 Instruction Set
25. Instruction Set
INC <byte>
Function: Increment
Description: INC increments the indicated variable by 1. An original value of 0FFH overflows to 00H. No flags are affected.
Three addressing modes are allowed: register, direct, or register-indirect.
Note: When this instruction is used to modify an output port, the value used as the original port data will be read
from the output data latch, not the input pins.
Example: Register 0 contains 7EH (011111110B). Internal RAM locations 7EH and 7FH contain 0FFH and 40H,
respectively. The following instruction sequence,
INC @R0
INC R0
INC @R0
leaves register 0 set to 7FH and internal RAM locations 7EH and 7FH holding 00H and 41H, respectively.
INC A
Bytes: 1
Cycles: 1
Encoding: 0 0 0 0 0 1 0 0
Operation: INC
(A) ← (A) + 1
INC Rn
Bytes: 1
Cycles: 1
Encoding: 0 0 0 0 1 r r r
Operation: INC
(Rn) ← (Rn) + 1
INC direct
Bytes: 2
Cycles: 1
Encoding: 0 0 0 0 0 1 0 1 direct address
Operation: INC
(direct) ← (direct) + 1
INC @Ri
Bytes: 1
Cycles: 1
Encoding: 0 0 0 0 0 1 1 i
Operation: INC
((Ri)) ← ((Ri)) + 1
2-95
26. INC DPTR
Function: Increment Data Pointer
Description: INC DPTR increments the 16-bit data pointer by 1. A 16-bit increment (modulo 216) is performed, and an
overflow of the low-order byte of the data pointer (DPL) from 0FFH to 00H increments the high-order byte (DPH).
No flags are affected.
This is the only 16-bit register which can be incremented.
Example: Registers DPH and DPL contain 12H and 0FEH, respectively. The following instruction sequence,
INC DPTR
INC DPTR
INC DPTR
changes DPH and DPL to 13H and 01H.
Bytes: 1
Cycles: 2
Encoding: 1 0 1 0 0 0 1 1
Operation: INC
(DPTR) ← (DPTR) + 1
JB blt,rel
Function: Jump if Bit set
Description: If the indicated bit is a one, JB jump to the address indicated; otherwise, it proceeds with the next instruction. The
branch destination is computed by adding the signed relative-displacement in the third instruction byte to the PC,
after incrementing the PC to the first byte of the next instruction. The bit tested is not modified. No flags are
affected.
Example: The data present at input port 1 is 11001010B. The Accumulator holds 56 (01010110B). The following instruction
sequence,
JB P1.2,LABEL1
JB ACC. 2,LABEL2
causes program execution to branch to the instruction at label LABEL2.
Bytes: 3
Cycles: 2
Encoding: 0 0 1 0 0 0 0 0 bit address rel. address
Operation: JB
(PC) ← (PC) + 3
IF (bit) = 1
THEN
(PC) ← (PC) + rel
2-96 Instruction Set
27. Instruction Set
JBC bit,rel
Function: Jump if Bit is set and Clear bit
Description: If the indicated bit is one, JBC branches to the address indicated; otherwise, it proceeds with the next instruction.
The bit will not be cleared if it is already a zero. The branch destination is computed by adding the signed
relative-displacement in the third instruction byte to the PC, after incrementing the PC to the first byte of the next
instruction. No flags are affected.
Note: When this instruction is used to test an output pin, the value used as the original data will be read from the
output data latch, not the input pin.
Example: The Accumulator holds 56H (01010110B). The following instruction sequence,
JBC ACC.3,LABEL1
JBC ACC.2,LABEL2
causes program execution to continue at the instruction identified by the label LABEL2, with the Accumulator
modified to 52H (01010010B).
Bytes: 3
Cycles: 2
Encoding: 0 0 0 1 0 0 0 0 bit address rel. address
Operation: JBC
(PC) ← (PC) + 3
IF (bit) = 1
THEN
(bit) ← 0
(PC) ← (PC) +rel
JC rel
Function: Jump if Carry is set
Description: If the carry flag is set, JC branches to the address indicated; otherwise, it proceeds with the next instruction. The
branch destination is computed by adding the signed relative-displacement in the second instruction byte to the
PC, after incrementing the PC twice. No flags are affected.
Example: The carry flag is cleared. The following instruction sequence,
JC LABEL1
CPL C
JC LABEL 2
sets the carry and causes program execution to continue at the instruction identified by the label LABEL2.
Bytes: 2
Cycles: 2
Encoding: 0 1 0 0 0 0 0 0 rel. address
Operation: JC
(PC) ← (PC) + 2
IF (C) = 1
THEN
(PC) ← (PC) + rel
2-97
28. JMP @A+DPTR
Function: Jump indirect
Description: JMP @A+DPTR adds the eight-bit unsigned contents of the Accumulator with the 16-bit data pointer and loads
the resulting sum to the program counter. This is the address for subsequent instruction fetches. Sixteen-bit
addition is performed (modulo 216): a carry-out from the low-order eight bits propagates through the higher-order
bits. Neither the Accumulator nor the Data Pointer is altered. No flags are affected.
Example: An even number from 0 to 6 is in the Accumulator. The following sequence of instructions branches to one of four
AJMP instructions in a jump table starting at JMP_TBL.
MOV DPTR, # JMP_TBL
JMP @A + DPTR
JMP_TBL: AJMP LABEL0
AJMP LABEL1
AJMP LABEL2
AJMP LABEL3
If the Accumulator equals 04H when starting this sequence, execution jumps to label LABEL2. Because AJMP is
a 2-byte instruction, the jump instructions start at every other address.
Bytes: 1
Cycles: 2
Encoding: 0 1 1 1 0 0 1 1
Operation: JMP
(PC) ← (A) + (DPTR)
2-98 Instruction Set
29. Instruction Set
JNB bit,rel
Function: Jump if Bit Not set
Description: If the indicated bit is a 0, JNB branches to the indicated address; otherwise, it proceeds with the next instruction.
The branch destination is computed by adding the signed relative-displacement in the third instruction byte to the
PC, after incrementing the PC to the first byte of the next instruction. The bit tested is not modified. No flags are
affected.
Example: The data present at input port 1 is 11001010B. The Accumulator holds 56H (01010110B). The following
instruction sequence,
JNB P1.3,LABEL1
JNB ACC.3,LABEL2
causes program execution to continue at the instruction at label LABEL2.
Bytes: 3
Cycles: 2
Encoding: 0 0 1 1 0 0 0 0 bit address rel. address
Operation: JNB
(PC) ← (PC) + 3
IF (bit) = 0
THEN (PC) ← (PC) + rel
JNC rel
Function: Jump if Carry not set
Description: If the carry flag is a 0, JNC branches to the address indicated; otherwise, it proceeds with the next instruction.
The branch destination is computed by adding the signal relative-displacement in the second instruction byte to
the PC, after incrementing the PC twice to point to the next instruction. The carry flag is not modified.
Example: The carry flag is set. The following instruction sequence,
JNC LABEL1
CPL C
JNC LABEL2
clears the carry and causes program execution to continue at the instruction identified by the label LABEL2.
Bytes: 2
Cycles: 2
Encoding: 0 1 0 1 0 0 0 0 rel. address
Operation: JNC
(PC) ← (PC) + 2
IF (C) = 0
THEN (PC) ← (PC) + rel
2-99
30. JNZ rel
Function: Jump if Accumulator Not Zero
Description: If any bit of the Accumulator is a one, JNZ branches to the indicated address; otherwise, it proceeds with the next
instruction. The branch destination is computed by adding the signed relative-displacement in the second
instruction byte to the PC, after incrementing the PC twice. The Accumulator is not modified. No flags are
affected.
Example: The Accumulator originally holds 00H. The following instruction sequence,
JNZ LABEL1
INC A
JNZ LABEL2
sets the Accumulator to 01H and continues at label LABEL2.
Bytes: 2
Cycles: 2
Encoding: 0 1 1 1 0 0 0 0 rel. address
Operation: JNZ
(PC) ← (PC) + 2
IF (A) ≠ 0
THEN (PC) ← (PC) + rel
JZ rel
Function: Jump if Accumulator Zero
Description: If all bits of the Accumulator are 0, JZ branches to the address indicated; otherwise, it proceeds with the next
instruction. The branch destination is computed by adding the signed relative-displacement in the second
instruction byte to the PC, after incrementing the PC twice. The Accumulator is not modified. No flags are
affected.
Example: The Accumulator originally contains 01H. The following instruction sequence,
JZ LABEL1
DEC A
JZ LABEL2
changes the Accumulator to 00H and causes program execution to continue at the instruction identified by the
label LABEL2.
Bytes: 2
Cycles: 2
Encoding: 0 1 1 0 0 0 0 0 rel. address
Operation: JZ
(PC) ← (PC) + 2
IF (A) = 0
THEN (PC) ← (PC) + rel
2-100 Instruction Set
31. Instruction Set
LCALL addr16
Function: Long call
Description: LCALL calls a subroutine located at the indicated address. The instruction adds three to the program counter to
generate the address of the next instruction and then pushes the 16-bit result onto the stack (low byte first),
incrementing the Stack Pointer by two. The high-order and low-order bytes of the PC are then loaded,
respectively, with the second and third bytes of the LCALL instruction. Program execution continues with the
instruction at this address. The subroutine may therefore begin anywhere in the full 64K byte program memory
address space. No flags are affected.
Example: Initially the Stack Pointer equals 07H. The label SUBRTN is assigned to program memory location 1234H. After
executing the instruction,
LCALL SUBRTN
at location 0123H, the Stack Pointer will contain 09H, internal RAM locations 08H and 09H will contain 26H and
01H, and the PC will contain 1234H.
Bytes: 3
Cycles: 2
Encoding: 0 0 0 1 0 0 1 0 addr15-addr8 addr7-addr0
Operation: LCALL
(PC) ← (PC) + 3
(SP) ← (SP) + 1
((SP)) ← (PC7-0)
(SP) ← (SP) + 1
((SP)) ← (PC15-8)
(PC) ← addr15-0
LJMP addr16
Function: Long Jump
Description: LJMP causes an unconditional branch to the indicated address, by loading the high-order and low-order bytes of
the PC (respectively) with the second and third instruction bytes. The destination may therefore be anywhere in
the full 64K program memory address space. No flags are affected.
Example: The label JMPADR is assigned to the instruction at program memory location 1234H. The instruction,
LJMP JMPADR
at location 0123H will load the program counter with 1234H.
Bytes: 3
Cycles: 2
Encoding: 0 0 0 0 0 0 1 0 addr15-addr8 addr7-addr0
Operation: LJMP
(PC) ← addr15-0
2-101
32. MOV <dest-byte>,<src-byte>
Function: Move byte variable
Description: The byte variable indicated by the second operand is copied into the location specified by the first operand. The
source byte is not affected. No other register or flag is affected.
This is by far the most flexible operation. Fifteen combinations of source and destination addressing modes are
allowed.
Example: Internal RAM location 30H holds 40H. The value of RAM location 40H is 10H. The data present at input port 1 is
11001010B (0CAH).
MOV R0,#30H ;R0 < = 30H
MOV A,@R0 ;A < = 40H
MOV R1,A ;R1 < = 40H
MOV B,@R1 ;B < = 10H
MOV @R1,P1 ;RAM (40H) < = 0CAH
MOV P2,P1 ;P2 #0CAH
leaves the value 30H in register 0, 40H in both the Accumulator and register 1, 10H in register B, and 0CAH
(11001010B) both in RAM location 40H and output on port 2.
MOV A,Rn
Bytes: 1
Cycles: 1
Encoding: 1 1 1 0 1 r r r
Operation: MOV
(A) ← (Rn)
*MOV A,direct
Bytes: 2
Cycles: 1
Encoding: 1 1 1 0 0 1 0 1 direct address
Operation: MOV
(A) ← (direct)
* MOV A,ACC is not a valid Instruction.
MOV A,@Ri
Bytes: 1
Cycles: 1
Encoding: 1 1 1 0 0 1 1 i
Operation: MOV
(A) ← ((Ri))
2-102 Instruction Set
33. Instruction Set
MOV A,#data
Bytes: 2
Cycles: 1
Encoding: 0 1 1 1 0 1 0 0 immediate data
Operation: MOV
(A) ← #data
MOV Rn,A
Bytes: 1
Cycles: 1
Encoding: 1 1 1 1 1 r r r
Operation: MOV
(Rn) ← (A)
MOV Rn,direct
Bytes: 2
Cycles: 2
Encoding: 1 0 1 0 1 r r r direct addr.
Operation: MOV
(Rn) ← (direct)
MOV Rn,#data
Bytes: 2
Cycles: 1
Encoding: 0 1 1 1 1 r r r immediate data
Operation: MOV
(Rn) ← #data
MOV direct,A
Bytes: 2
Cycles: 1
Encoding: 1 1 1 1 0 1 0 1 direct address
Operation: MOV
(direct) ← (A)
MOV direct,Rn
Bytes: 2
Cycles: 2
Encoding: 1 0 0 0 1 r r r direct address
Operation: MOV
(direct) ← (Rn)
2-103
35. Instruction Set
MOV <dest-bit>,<src-bit>
Function: Move bit data
Description: MOV <dest-bit>,<src-bit> copies the Boolean variable indicated by the second operand into the location
specified by the first operand. One of the operands must be the carry flag; the other may be any directly
addressable bit. No other register or flag is affected.
Example: The carry flag is originally set. The data present at input Port 3 is 11000101B. The data previously written to
output Port 1 is 35H (00110101B).
MOV P1.3,C
MOV C,P3.3
MOV P1.2,C
leaves the carry cleared and changes Port 1 to 39H (00111001B).
MOV C,bit
Bytes: 2
Cycles: 1
Encoding: 1 0 1 0 0 0 1 0 bit address
Operation: MOV
(C) ← (bit)
MOV bit,C
Bytes: 2
Cycles: 2
Encoding: 1 0 0 1 0 0 1 0 bit address
Operation: MOV
(bit) ← (C)
MOV DPTR,#data16
Function: Load Data Pointer with a 16-bit constant
Description: MOV DPTR,#data16 loads the Data Pointer with the 16-bit constant indicated. The 16-bit constant is loaded into
the second and third bytes of the instruction. The second byte (DPH) is the high-order byte, while the third byte
(DPL) holds the lower-order byte. No flags are affected.
This is the only instruction which moves 16 bits of data at once.
Example: The instruction,
MOV DPTR, # 1234H
loads the value 1234H into the Data Pointer: DPH holds 12H, and DPL holds 34H.
Bytes: 3
Cycles: 2
Encoding: 1 0 0 1 0 0 0 0 immed. data15-8 immed. data7-0
Operation: MOV
(DPTR) ← #data15-0
DPH ← DPL ← #data15-8 ← #data7-0
2-105
36. MOVC A,@A+ <base-reg>
Function: Move Code byte
Description: The MOVC instructions load the Accumulator with a code byte or constant from program memory. The address
of the byte fetched is the sum of the original unsigned 8-bit Accumulator contents and the contents of a 16-bit
base register, which may be either the Data Pointer or the PC. In the latter case, the PC is incremented to the
address of the following instruction before being added with the Accumulator; otherwise the base register is not
altered. Sixteen-bit addition is performed so a carry-out from the low-order eight bits may propagate through
higher-order bits. No flags are affected.
Example: A value between 0 and 3 is in the Accumulator. The following instructions will translate the value in the
Accumulator to one of four values defined by the DB (define byte) directive.
REL_PC: INC A
MOVC A,@A+PC
RET
DB 66H
DB 77H
DB 88H
DB 99H
If the subroutine is called with the Accumulator equal to 01H, it returns with 77H in the Accumulator. The INC A
before the MOVC instruction is needed to “get around” the RET instruction above the table. If several bytes of
code separate the MOVC from the table, the corresponding number is added to the Accumulator instead.
MOVC A,@A+DPTR
Bytes: 1
Cycles: 2
Encoding: 1 0 0 1 0 0 1 1
Operation: MOVC
(A) ← ((A) + (DPTR))
MOVC A,@A+PC
Bytes: 1
Cycles: 2
Encoding: 1 0 0 0 0 0 1 1
Operation: MOVC
(PC) ← (PC) + 1
(A) ← ((A) + (PC))
2-106 Instruction Set
37. Instruction Set
MOVX <dest-byte>,<src-byte>
Function: Move External
Description: The MOVX instructions transfer data between the Accumulator and a byte of external data memory, which is why
“X” is appended to MOV. There are two types of instructions, differing in whether they provide an 8-bit or 16-bit
indirect address to the external data RAM.
In the first type, the contents of R0 or R1 in the current register bank provide an 8-bit address multiplexed with
data on P0. Eight bits are sufficient for external I/O expansion decoding or for a relatively small RAM array. For
somewhat larger arrays, any output port pins can be used to output higher-order address bits. These pins are
controlled by an output instruction preceding the MOVX.
In the second type of MOVX instruction, the Data Pointer generates a 16-bit address. P2 outputs the high-order
eight address bits (the contents of DPH), while P0 multiplexes the low-order eight bits (DPL) with data. The P2
Special Function Register retains its previous contents, while the P2 output buffers emit the contents of DPH.
This form of MOVX is faster and more efficient when accessing very large data arrays (up to 64K bytes), since no
additional instructions are needed to set up the output ports.
It is possible to use both MOVX types in some situations. A large RAM array with its high-order address lines
driven by P2 can be addressed via the Data Pointer, or with code to output high-order address bits to P2,
followed by a MOVX instruction using R0 or R1.
Example: An external 256 byte RAM using multiplexed address/data lines is connected to the 8051 Port 0. Port 3 provides
control lines for the external RAM. Ports 1 and 2 are used for normal I/O. Registers 0 and 1 contain 12H and
34H. Location 34H of the external RAM holds the value 56H. The instruction sequence,
MOVX A,@R1
MOVX @R0,A
copies the value 56H into both the Accumulator and external RAM location 12H.
MOVX A,@Ri
Bytes: 1
Cycles: 2
Encoding: 1 1 1 0 0 0 1 i
Operation: MOVX
(A) ← ((Ri))
MOVX A,@DPTR
Bytes: 1
Cycles: 2
Encoding: 1 1 1 0 0 0 0 0
Operation: MOVX
(A) ← ((DPTR))
2-107