Explain about indexed addressing scheme, Computer Engineering

Assignment Help:

In this technique, operand field of instruction includes an address and an index register thatcomprises an offset. This addressing scheme is normally used to address the consecutive locations of memory (that may store the elements of an array). Index register is a special CPU register which contains an index value. Contents of the operand field A are taken to be address of the initial or reference location (or first element of array). The index register specifies distance between the starting address and address of that operand. 

For illustration: to address of an element B[i] of an array B[1], B[2],....B[n] with every element of array stored in two consecutive locations and starting address of array is presumed to be 101, the operand field A in instruction shall comprises the number 101 and index register R will contain the value of expression (i - 1) × 2. 

So for first element of the array index register will hold 0. For addressing 5th element of the array A=101 while index register will hold:

(5- 1) × 2 = 8

So address of 5th element of array B is=101+8=109. In B[5] but the element will be stored in location 109 and 110. To address any other element of array changing the content of index register will serve. 

So the effective address in this technique is calculated as:

EA = A +(R)

D = (EA)

(DA is Direct address)

As the index register is employed for iterative applications so the value of index register is decremented or incremented after each reference to it. In numerous systems this operation is performed automatically at the time of the course of an instruction cycle. This feature is termed as auto-indexing. Auto indexing can be auto-decrementing or auto-incrementing. The choice of register to be employed as an index register varies from machine to machine. Some machines use general-purpose registers for this purpose whereas other machines can specify special purpose registers referred to as index registers.

1400_Explain about Indexed Addressing Scheme.png

Figure: For Displacement Addressing


Related Discussions:- Explain about indexed addressing scheme

Explain time slot interchange, Discuss the basic structure and principle of...

Discuss the basic structure and principle of operation of Time Slot Interchange (TSI) switch with the help of a neat diagram. Principle of time slot interchange  Time

Write an html program segment that contains hypertext links, Write an HTML ...

Write an HTML program segment that contains hypertext links from one document to another . HTML permits any item to be placed as a hypertext reference. Therefore a single word

Two - bit correlating predictor, The history file, history.txt, is the bran...

The history file, history.txt, is the branch history of a run of the gcc compiler (the first field is the address of the branch instruction, the second field is the target branch a

Explain advantages and disadvantages of macro pre-processor, What are the a...

What are the advantages and disadvantages of macro pre-processor? Advantages Any of existing conventional assembler can be improved in this way to incorporate macro proces

How we get assignments, Hello i am a freelancer how I get a assignments ?

Hello i am a freelancer how I get a assignments ?

In how many ways the data can be passed to functions, Object Oriented Progr...

Object Oriented Programming 1. Describe that in how many ways the Data can be passed to functions? Explain with the help of one example. 2. Describe how you create class a

Block diagram of a microcomputer system, Q. Block Diagram of a Microcompute...

Q. Block Diagram of a Microcomputer System? Before going on to consider the I/O sub/systems of a computer, let's discuss how a digital computer system can be realized by a micr

Layout for the assumed penalty, Solve the following 8-department problem us...

Solve the following 8-department problem using the MIP method.  What is the resulting layout and flow-distance score?  Note that the aspect ratio of each department should be 2.

Megaflops, Speed in scientific computing is measured in megaflops, gigaflop...

Speed in scientific computing is measured in megaflops, gigaflops, teraflops and petaflops. A megaflop is 10 6 floating point arithmetic operations (+, -, *, /) in one second What

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