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

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

Implement a memory management system , There should be 1 server thread and ...

There should be 1 server thread and N client threads, where N is supplied by the user as a command line argument. The server opens a file called "all_requests.dat", the file has

What are the update types possible, What are the update types possible? ...

What are the update types possible? The following update types are possible: Update type A: The matchcode data is updated asynchronously to database changes. Update

Explain time switching, Explain Time Switching. Time Switches: The ...

Explain Time Switching. Time Switches: The principle of a time switch is demonstrated in figure. This connects an incoming n channel PCM highway to an outgoing n channel PC

What is artificial intelligence language processing, Artificial intelligenc...

Artificial intelligence language processing (AILP) is a field of computer science and linguistics concerned with the interactions among computers and human (natural) languages; it

Prints the hundreds digit in two integers , Write an application that prin...

Write an application that prints the hundreds digit  in two integers read from the keyboard. For example if the data values are 1456 and 255 respectably, output should include the

What are the major components of a web browser, What are the major componen...

What are the major components of a web browser? A browser contains a set of clients, a controller and a set of interpreters which manages them. All browsers must have an HTML

What is the bios full form, BIOS - Basic Input Output System, Power On ...

BIOS - Basic Input Output System, Power On Self Test (POST) and Loading Bootloader from the Hard disk drive Boot Sector is being completed by BIOS. It started the system for

Sun and nis law, Q. What is Sun and Nis Law? The Sun and Ni's Law is a ...

Q. What is Sun and Nis Law? The Sun and Ni's Law is a simplification of Amdahl's Law and Gustafson's Law. The basic concept underlying Sun and Ni's Law is to find solution to a

Algorithm to have a good best case running time, How can we change almost a...

How can we change almost any algorithm to have a good best case running time? Check whether the input constitutes an input at the very starting Or else run the original algo

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