Instruction set and effective addressing techniques, Computer Engineering

Assignment Help:

The term addressing mode is a technique of stating the input and output of an instruction; it is termed the effective address. There are 6 effective addresses in the 68HC11 set of instructions

Immediate data
 
Here the operand 'data 'follows the opcode 'Instruction' in memory, normally only a byte is used.
 
  addb #$1    i.e. add to b  data 1 hex 
 
Direct addressing

 Here the operand contains the lower order byte of the address, the remaining upper byte of the 16 bit address is assumed to be zero . This allows a fast read/write of memory between 0x0000 and 0x00ff.
 
  addb $ff  i.e. add to b data from address 00ff hex
 
Extended addressing

  Here the address is contained in the next two bytes after the opcode i.e. high byte first, followed by low byte. This allows a read/write of the full address space i.e. 0x0000 to 0xffff

  addb $ffff  i.e. add to b data from address ffff hex
 
Indexed Addressing

  Here the address is calculated using an index register (IX, IY) and a 8 bit unsigned immediate offset. The address is calculated by temporary adding the contents of the index register to the immediate offset and using that as the extended address. This type is addressing is often termed a pointer or page addressing 
 
  addb $ff,X   i.e. add to b data from address in X + ff hex 
 
Relative addressing

   Here the address is stored as the operand and comprises of a signed 8 bit number, the effective address comprises of the current program counter + the signed 8 bit number. This is often used in branches etc. but with the use of re-locatable assemblers, the uses of labels have made this transparent.

  bne $04    i.e. jump forward 4 spaces
  bne $84    i.e. jump back 4 spaces


Related Discussions:- Instruction set and effective addressing techniques

Boolean algebra, Prove the following Boolean identities using the laws of B...

Prove the following Boolean identities using the laws of Boolean algebra (A + B)(A  + C) = A + BC Ans. (A+B)(A+C)=A+BC LHS AA+AC+AB+BC=A+AC+AB+BC OR  A((C+1)+A(B+1))+BC

Example of arrays pointers, Q. Example of arrays pointers? General form...

Q. Example of arrays pointers? General form of declaration of array in Fortran 90 is type, DIMENSION(bound) [,attr] :: name E.g. the declaration          INTEGER, D

Explain naming convention scripts, Explanation:- A script within Rationa...

Explanation:- A script within Rational Robot is a file that haves a sequence of SQABasic code. The extension of the file is always ".REC". Syntax [FEATURE] + "_" + [FUNCTION

System analysis and design, write an algorithm on railway reservation ticke...

write an algorithm on railway reservation ticket window

Difference between top-down and bottom-up programming, What is the differen...

What is the difference between top-down and bottom-up, programming? Ans: Top-down and Bottom-up Approaches In Top-down programming approach, we begin by identifying the main

With what symbolic names can be associated, Symbolic names can be associate...

Symbolic names can be associated with? Ans. With data or instruction symbolic names associated.

Electric circuit analysis, mmmmmmmmmmmmm mmmmmmm s s s s s s s s s d d d ...

mmmmmmmmmmmmm mmmmmmm s s s s s s s s s d d d d d d d d d d d d d d f f ff g gg g g g g gg r r r rr r w ww w w ww w w

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd