Implementation of BUS, Computer Engineering

Assignment Help:

Q. Implementation of BUS

Construction of a bus system for four registers employing 4×1 multiplexers is displayed below. Every register has four bits which are numbered 0 through 3. Every multiplexer has 4 data inputs, numbered 0 through 3 and two control or selection lines which are  C0 and C1. The data inputs of 0th MUX are associated to the respective 0th input of each register to form four lines of the bus. The 0th multiplexer multiplexes the four 0th bits of the registers and in the same way for the three other multiplexers. 

Because the same selection lines C0 and C1 are connected to all multiplexers so they choose the four bits of one register and transfer them in four-line common bus.

 

1517_Implementation of BUS.png

Figure: Implementation of BUS

When C1C0 = 00 the 0th data input of all multiplexers are selected and this causes bus lines to receive content of register A because the outputs of register A are associated to the 0th data inputs of the multiplexers which is then applied to output which forms the bus. In the same way when C1C0 = 01, register B is selected and so on. The subsequent table displays the register which is selected for every of the four possible values of selection lines: 

267_Implementation of BUS1.png

Figure: Bus Line Selection

To create a bus for 8 registers of 16 bits each you would need 16 multiplexers one for every line in the bus. Number of multiplexers required to construct the bus is equal to number of bits in every register. Every multiplexer should have eight data input lines as well as three selection lines (23 = 8) to multiplex one bit in eight registers.


Related Discussions:- Implementation of BUS

Classification based on grain size, Classification Based On Grain Size ...

Classification Based On Grain Size  This classification is based on identifying  the parallelism in a program to be implemented on a multiprocessor system. The plan is to recog

Explain the stack storage allocation model, Explain the stack storage alloc...

Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr

C++, minimum self program

minimum self program

SIDE EFFECT , EXPLAIN SIDE EFFECT OF SCAN CONVERSION WITH DIGRAM

EXPLAIN SIDE EFFECT OF SCAN CONVERSION WITH DIGRAM

Shell scripting, Write a script called addnames that is to be called as fol...

Write a script called addnames that is to be called as follows, where classlist is the name of the classlist file, and username is a particular student''s username. ./addnames cla

Explain function of network layer in tcp/ip protocol stack, Explain about t...

Explain about the function of network layer briefly in TCP/IP protocol stack. Internetwork Layer: The best-called TCP/IP protocol at internetwork layer is Internet Protoc

Describe about frameset, Q. Describe about Frameset? Now make a master ...

Q. Describe about Frameset? Now make a master page in which you write below code. My Frame Page -- The Master Page

What are the exceptions encountered for fp operation, What are the exceptio...

What are the exceptions encountered for FP operation? The exceptions encountered for FP operation are overflow, underflow. /0, inexact and invalid values.

Interpolation search, Interpolation Search The next task is to implemen...

Interpolation Search The next task is to implement a variable size decrease-and-conquer solution to search. See Levitin [2007] pp 190 for a detailed description of the interpol

.rapid technology, Choose one area of rapid technological change in IT or C...

Choose one area of rapid technological change in IT or Computer Science and research and report on recent developments and the outlook for the future in the area that you have chos

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