SlideShare une entreprise Scribd logo
1  sur  20
A typical digital computer has many registers, and
paths must be provided to transfer information from
one to another register for performing various
operations in the computer system. The number of
wires will be excessive if separate lines are used
between each register to all other register. A more
efficient and widely used method for transferring data
between multiple register is common bus line system.
A bus structure consist a set of common lines each for
each register, through which binary information can
transfer one at time. Control signal determine that
which register is connected with a bus line at time to
transfer the information.
Here we will see two ways to construct the bus :
By using multiplexers.
By three state buffer.
One way of constructing bus system is by using
multiplexers. The multiplexer select the one register who ‘s
information is transfer to another one destination register.
In a bus system, multiplex K register of n bits each to
produce an n lines common bus .The number of multiplexers
needed to construct the bus is equal to n.Size of each mux is
must be k-1multiplexer hence multiplexer have n data lines.
Example: For common bus system using multiplexer
for 16 register each of 32 bit data transformation.
solution: In this system we require 32(number of bits)
multiplexer each having size of 16-1 multiplexer(number
of register) and number of selection inputs are 4 .
 The construction of bus system for four bit, four
register is given below:
As we know that for n bit we require n multiplexer,
for k register transfer we require k-1 size of
multiplexer.
Here we have n=4 and k=4 hence here we use four
multiplexer each having 4-1 size.
Here each register have 4 positive triggered flip-
flop set. because each mux is 4-1 each multiplexer
have 2 selection inputs in the bus.
we denote it by S0 and S1. This selection input
select the one line output from 0 to 3 available in
the each multiplexer, and applied to the output
that form a bus system.
To avoid the complicated figure we just write
output and input at the connection. For example
output A1 of register A is connected with the input
line 0 of mux(1) because that input is labeled as A1.
The two selection lines S and S are connected to the
selection inputs of all four multiplexers.
The selection lines choose the four bits of one register
and transfer them into the four-line common bus.
When S1S0 =00, the 0 data inputs of all four
multiplexers are selected and applied to the outputs that
form the bus.
This causes the bus lines to receive the content of
register A since the outputs of this register are connected
to the 0 data inputs of the multiplexers.
Similarly, register B is selected if S1S0= 0 1, and so on.
Table 1 shows the register that is selected by the bus for
each of the four possible binary value of the selection
lines.
TABLE 1 Function Table for Bus of Fig. 1
The transfer of information from a bus into one of
many destination registers can be accomplished by
connecting the bus lines to the inputs of all
destination registers and activating the load control of
the particular destination register selected.
The symbolic statement for a bus transfer may
mention the bus or its presence may be implied in the
statement.
When the bus is includes in the statement, the
register transfer is symbolized as follows.
The content of register C is placed on the bus, and the
content of the bus is loaded into register R1 by
activating its load control input.
If the bus is known to exist in the system, it may be
convenient just to show the direct transfer.
From this statement the designer knows which control
signals must be activated to produce the transfer
through the bus.
Memory Transfer The transfer of information from a
memory word to the outside environment is called a
read operation.
The transfer of new information to be stored into the
memory is called a write operation.
A memory word will be symbolized by the letter M.
The particular memory word among the many
available is selected by the memory address during
the transfer.
It is necessary to specify the address of M when
writing memory transfer operations.
This will be done by enclosing the address in square
brackets following the letter M.
The address register, symbolized by AR.
The data are transferred to another register, called
the data register, symbolized by DR.
The read operation can be stated as follows:
memory write this causes a transfer of information
into DR from the memory word M selected by the
address in AR.
The write operation transfers the content of a data
register to a memory word M selected by the
address.
Assume that the input data are in register R1 and
the address is in AR.
The write operation can be stated symbolically as
follows
Bus Construction Using Multiplexers

Contenu connexe

Tendances

Register Transfer Language,Bus and Memory Transfer
Register Transfer Language,Bus and Memory TransferRegister Transfer Language,Bus and Memory Transfer
Register Transfer Language,Bus and Memory Transferlavanya marichamy
 
Register transfer language
Register transfer languageRegister transfer language
Register transfer languageSanjeev Patel
 
Register transfer language & its micro operations
Register transfer language & its micro operationsRegister transfer language & its micro operations
Register transfer language & its micro operationsLakshya Sharma
 
Stack organization
Stack organizationStack organization
Stack organizationchauhankapil
 
Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA)Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA)Gaditek
 
Data transfer and manipulation
Data transfer and manipulationData transfer and manipulation
Data transfer and manipulationSanjeev Patel
 
Logical and shift micro operations
Logical and shift micro operationsLogical and shift micro operations
Logical and shift micro operationsSanjeev Patel
 
Types of Instruction Format
Types of Instruction FormatTypes of Instruction Format
Types of Instruction FormatDhrumil Panchal
 
Computer instruction
Computer instructionComputer instruction
Computer instructionSanjeev Patel
 
Microprogram Control
Microprogram Control Microprogram Control
Microprogram Control Anuj Modi
 
Computer architecture data representation
Computer architecture  data representationComputer architecture  data representation
Computer architecture data representationAnil Pokhrel
 
Memory Reference Instructions
Memory Reference InstructionsMemory Reference Instructions
Memory Reference InstructionsRabin BK
 
Difference between OSI Layer & TCP/IP Layer
Difference between OSI Layer & TCP/IP LayerDifference between OSI Layer & TCP/IP Layer
Difference between OSI Layer & TCP/IP LayerNetwax Lab
 
Memory organization (Computer architecture)
Memory organization (Computer architecture)Memory organization (Computer architecture)
Memory organization (Computer architecture)Sandesh Jonchhe
 
Input output organization
Input output organizationInput output organization
Input output organizationabdulugc
 
Register organization, stack
Register organization, stackRegister organization, stack
Register organization, stackAsif Iqbal
 
Instruction set of 8086
Instruction set of 8086Instruction set of 8086
Instruction set of 80869840596838
 

Tendances (20)

Register Transfer Language,Bus and Memory Transfer
Register Transfer Language,Bus and Memory TransferRegister Transfer Language,Bus and Memory Transfer
Register Transfer Language,Bus and Memory Transfer
 
Register transfer language
Register transfer languageRegister transfer language
Register transfer language
 
Basic Computer Organization and Design
Basic  Computer  Organization  and  DesignBasic  Computer  Organization  and  Design
Basic Computer Organization and Design
 
Register transfer language & its micro operations
Register transfer language & its micro operationsRegister transfer language & its micro operations
Register transfer language & its micro operations
 
Stack organization
Stack organizationStack organization
Stack organization
 
Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA)Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA)
 
Data transfer and manipulation
Data transfer and manipulationData transfer and manipulation
Data transfer and manipulation
 
Microoperations
MicrooperationsMicrooperations
Microoperations
 
Logical and shift micro operations
Logical and shift micro operationsLogical and shift micro operations
Logical and shift micro operations
 
Modes of data transfer
Modes of data transferModes of data transfer
Modes of data transfer
 
Types of Instruction Format
Types of Instruction FormatTypes of Instruction Format
Types of Instruction Format
 
Computer instruction
Computer instructionComputer instruction
Computer instruction
 
Microprogram Control
Microprogram Control Microprogram Control
Microprogram Control
 
Computer architecture data representation
Computer architecture  data representationComputer architecture  data representation
Computer architecture data representation
 
Memory Reference Instructions
Memory Reference InstructionsMemory Reference Instructions
Memory Reference Instructions
 
Difference between OSI Layer & TCP/IP Layer
Difference between OSI Layer & TCP/IP LayerDifference between OSI Layer & TCP/IP Layer
Difference between OSI Layer & TCP/IP Layer
 
Memory organization (Computer architecture)
Memory organization (Computer architecture)Memory organization (Computer architecture)
Memory organization (Computer architecture)
 
Input output organization
Input output organizationInput output organization
Input output organization
 
Register organization, stack
Register organization, stackRegister organization, stack
Register organization, stack
 
Instruction set of 8086
Instruction set of 8086Instruction set of 8086
Instruction set of 8086
 

En vedette

Registers and-common-bus
Registers and-common-busRegisters and-common-bus
Registers and-common-busAnuj Modi
 
Lecture 2
Lecture 2Lecture 2
Lecture 2GIKI
 
Page replacement algorithm
Page replacement algorithmPage replacement algorithm
Page replacement algorithmLavina Gehlot
 
Slideshare Powerpoint presentation
Slideshare Powerpoint presentationSlideshare Powerpoint presentation
Slideshare Powerpoint presentationelliehood
 

En vedette (9)

Bus system
Bus systemBus system
Bus system
 
Registers and-common-bus
Registers and-common-busRegisters and-common-bus
Registers and-common-bus
 
Lecture 2
Lecture 2Lecture 2
Lecture 2
 
Ofdm(tutorial)
Ofdm(tutorial)Ofdm(tutorial)
Ofdm(tutorial)
 
Process State & Life Cycle
Process  State & Life CycleProcess  State & Life Cycle
Process State & Life Cycle
 
Page replacement algorithm
Page replacement algorithmPage replacement algorithm
Page replacement algorithm
 
Apurva
ApurvaApurva
Apurva
 
Slideshare Powerpoint presentation
Slideshare Powerpoint presentationSlideshare Powerpoint presentation
Slideshare Powerpoint presentation
 
Slideshare ppt
Slideshare pptSlideshare ppt
Slideshare ppt
 

Similaire à Bus Construction Using Multiplexers

REGISTER TRANSFER AND MICRO OPERATIONS
REGISTER TRANSFER AND MICRO OPERATIONSREGISTER TRANSFER AND MICRO OPERATIONS
REGISTER TRANSFER AND MICRO OPERATIONSAnonymous Red
 
5. Encoder and Decoder-Bus and memory.pdf
5. Encoder and Decoder-Bus and memory.pdf5. Encoder and Decoder-Bus and memory.pdf
5. Encoder and Decoder-Bus and memory.pdfSourabhRaj29
 
Computer Organization & Architecture.ppt
Computer Organization & Architecture.pptComputer Organization & Architecture.ppt
Computer Organization & Architecture.pptGauravSharmaIAHAP
 
temp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdf
temp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdftemp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdf
temp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdfBhureVedika
 
Register transfer and micro operation
Register transfer and micro operationRegister transfer and micro operation
Register transfer and micro operationKamal Acharya
 
student important knowledge on computer data .pptx
student important knowledge on computer data .pptxstudent important knowledge on computer data .pptx
student important knowledge on computer data .pptxjainyshah20
 
CS304PC:Computer Organization and Architecture Session 2 Registers .pptx
CS304PC:Computer Organization and Architecture Session 2 Registers .pptxCS304PC:Computer Organization and Architecture Session 2 Registers .pptx
CS304PC:Computer Organization and Architecture Session 2 Registers .pptxAsst.prof M.Gokilavani
 
UNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSI
UNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSIUNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSI
UNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSIVLSICS Design
 
Instruction FormatMachine instruction has an opcode and zero or m.pdf
Instruction FormatMachine instruction has an opcode and zero or m.pdfInstruction FormatMachine instruction has an opcode and zero or m.pdf
Instruction FormatMachine instruction has an opcode and zero or m.pdfpritikulkarni20
 
Presentation 4.pptx
Presentation 4.pptxPresentation 4.pptx
Presentation 4.pptxIRAH34
 
ESIstream specification v1.1.A1
ESIstream specification v1.1.A1ESIstream specification v1.1.A1
ESIstream specification v1.1.A1ESIstream
 
AMBA AHB Protocols
AMBA AHB ProtocolsAMBA AHB Protocols
AMBA AHB ProtocolsJoe Andelija
 

Similaire à Bus Construction Using Multiplexers (20)

REGISTER TRANSFER AND MICRO OPERATIONS
REGISTER TRANSFER AND MICRO OPERATIONSREGISTER TRANSFER AND MICRO OPERATIONS
REGISTER TRANSFER AND MICRO OPERATIONS
 
Ch4
Ch4Ch4
Ch4
 
5. Encoder and Decoder-Bus and memory.pdf
5. Encoder and Decoder-Bus and memory.pdf5. Encoder and Decoder-Bus and memory.pdf
5. Encoder and Decoder-Bus and memory.pdf
 
Computer Organization & Architecture.ppt
Computer Organization & Architecture.pptComputer Organization & Architecture.ppt
Computer Organization & Architecture.ppt
 
COA pptx.pptx
COA pptx.pptxCOA pptx.pptx
COA pptx.pptx
 
temp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdf
temp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdftemp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdf
temp-1e80a1dc-6041-493a-af5a-e9ac6efabc65.pdf
 
Bus and Memory transfer
Bus and Memory transferBus and Memory transfer
Bus and Memory transfer
 
Register transfer and micro operation
Register transfer and micro operationRegister transfer and micro operation
Register transfer and micro operation
 
COA (Unit_1.pptx)
COA (Unit_1.pptx)COA (Unit_1.pptx)
COA (Unit_1.pptx)
 
student important knowledge on computer data .pptx
student important knowledge on computer data .pptxstudent important knowledge on computer data .pptx
student important knowledge on computer data .pptx
 
CS304PC:Computer Organization and Architecture Session 2 Registers .pptx
CS304PC:Computer Organization and Architecture Session 2 Registers .pptxCS304PC:Computer Organization and Architecture Session 2 Registers .pptx
CS304PC:Computer Organization and Architecture Session 2 Registers .pptx
 
CO By Rakesh Roshan
CO By Rakesh RoshanCO By Rakesh Roshan
CO By Rakesh Roshan
 
UNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSI
UNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSIUNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSI
UNIVERSAL ROTATE INVERT BUS ENCODING FOR LOW POWER VLSI
 
Instruction FormatMachine instruction has an opcode and zero or m.pdf
Instruction FormatMachine instruction has an opcode and zero or m.pdfInstruction FormatMachine instruction has an opcode and zero or m.pdf
Instruction FormatMachine instruction has an opcode and zero or m.pdf
 
Presentation 4.pptx
Presentation 4.pptxPresentation 4.pptx
Presentation 4.pptx
 
coa
coacoa
coa
 
io intweface.pptx
io intweface.pptxio intweface.pptx
io intweface.pptx
 
ESIstream specification v1.1.A1
ESIstream specification v1.1.A1ESIstream specification v1.1.A1
ESIstream specification v1.1.A1
 
Bss Interface
Bss InterfaceBss Interface
Bss Interface
 
AMBA AHB Protocols
AMBA AHB ProtocolsAMBA AHB Protocols
AMBA AHB Protocols
 

Plus de Siddhi Viradiya

network convergence problem and solutions
network convergence  problem and solutionsnetwork convergence  problem and solutions
network convergence problem and solutionsSiddhi Viradiya
 
Pagereplacement algorithm(computional concept)
Pagereplacement algorithm(computional concept)Pagereplacement algorithm(computional concept)
Pagereplacement algorithm(computional concept)Siddhi Viradiya
 
chapter 1 intoduction to operating system
chapter 1 intoduction to operating systemchapter 1 intoduction to operating system
chapter 1 intoduction to operating systemSiddhi Viradiya
 
functional dependencies with example
functional dependencies with examplefunctional dependencies with example
functional dependencies with exampleSiddhi Viradiya
 
non linear data structure -introduction of tree
non linear data structure -introduction of treenon linear data structure -introduction of tree
non linear data structure -introduction of treeSiddhi Viradiya
 

Plus de Siddhi Viradiya (7)

network convergence problem and solutions
network convergence  problem and solutionsnetwork convergence  problem and solutions
network convergence problem and solutions
 
Pagereplacement algorithm(computional concept)
Pagereplacement algorithm(computional concept)Pagereplacement algorithm(computional concept)
Pagereplacement algorithm(computional concept)
 
chapter 1 intoduction to operating system
chapter 1 intoduction to operating systemchapter 1 intoduction to operating system
chapter 1 intoduction to operating system
 
functional dependencies with example
functional dependencies with examplefunctional dependencies with example
functional dependencies with example
 
non linear data structure -introduction of tree
non linear data structure -introduction of treenon linear data structure -introduction of tree
non linear data structure -introduction of tree
 
AEM Fourier series
 AEM Fourier series AEM Fourier series
AEM Fourier series
 
global warming ch-07
 global warming ch-07 global warming ch-07
global warming ch-07
 

Dernier

main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidNikhilNagaraju
 
Correctly Loading Incremental Data at Scale
Correctly Loading Incremental Data at ScaleCorrectly Loading Incremental Data at Scale
Correctly Loading Incremental Data at ScaleAlluxio, Inc.
 
IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024Mark Billinghurst
 
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETEINFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETEroselinkalist12
 
Artificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptxArtificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptxbritheesh05
 
Introduction-To-Agricultural-Surveillance-Rover.pptx
Introduction-To-Agricultural-Surveillance-Rover.pptxIntroduction-To-Agricultural-Surveillance-Rover.pptx
Introduction-To-Agricultural-Surveillance-Rover.pptxk795866
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxJoão Esperancinha
 
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsyncWhy does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsyncssuser2ae721
 
An introduction to Semiconductor and its types.pptx
An introduction to Semiconductor and its types.pptxAn introduction to Semiconductor and its types.pptx
An introduction to Semiconductor and its types.pptxPurva Nikam
 
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdfCCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdfAsst.prof M.Gokilavani
 
Application of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptxApplication of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptx959SahilShah
 
Biology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptxBiology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptxDeepakSakkari2
 
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...srsj9000
 
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdfCCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdfAsst.prof M.Gokilavani
 
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfRisk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfROCENODodongVILLACER
 
Arduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.pptArduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.pptSAURABHKUMAR892774
 

Dernier (20)

young call girls in Green Park🔝 9953056974 🔝 escort Service
young call girls in Green Park🔝 9953056974 🔝 escort Serviceyoung call girls in Green Park🔝 9953056974 🔝 escort Service
young call girls in Green Park🔝 9953056974 🔝 escort Service
 
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfid
 
Correctly Loading Incremental Data at Scale
Correctly Loading Incremental Data at ScaleCorrectly Loading Incremental Data at Scale
Correctly Loading Incremental Data at Scale
 
IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024IVE Industry Focused Event - Defence Sector 2024
IVE Industry Focused Event - Defence Sector 2024
 
9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf
9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf
9953056974 Call Girls In South Ex, Escorts (Delhi) NCR.pdf
 
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETEINFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
INFLUENCE OF NANOSILICA ON THE PROPERTIES OF CONCRETE
 
Artificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptxArtificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptx
 
🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...
🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...
🔝9953056974🔝!!-YOUNG call girls in Rajendra Nagar Escort rvice Shot 2000 nigh...
 
Introduction-To-Agricultural-Surveillance-Rover.pptx
Introduction-To-Agricultural-Surveillance-Rover.pptxIntroduction-To-Agricultural-Surveillance-Rover.pptx
Introduction-To-Agricultural-Surveillance-Rover.pptx
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
 
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsyncWhy does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
 
An introduction to Semiconductor and its types.pptx
An introduction to Semiconductor and its types.pptxAn introduction to Semiconductor and its types.pptx
An introduction to Semiconductor and its types.pptx
 
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdfCCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
 
Application of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptxApplication of Residue Theorem to evaluate real integrations.pptx
Application of Residue Theorem to evaluate real integrations.pptx
 
Biology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptxBiology for Computer Engineers Course Handout.pptx
Biology for Computer Engineers Course Handout.pptx
 
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
 
POWER SYSTEMS-1 Complete notes examples
POWER SYSTEMS-1 Complete notes  examplesPOWER SYSTEMS-1 Complete notes  examples
POWER SYSTEMS-1 Complete notes examples
 
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdfCCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
 
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdfRisk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdf
 
Arduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.pptArduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.ppt
 

Bus Construction Using Multiplexers

  • 1.
  • 2. A typical digital computer has many registers, and paths must be provided to transfer information from one to another register for performing various operations in the computer system. The number of wires will be excessive if separate lines are used between each register to all other register. A more efficient and widely used method for transferring data between multiple register is common bus line system.
  • 3. A bus structure consist a set of common lines each for each register, through which binary information can transfer one at time. Control signal determine that which register is connected with a bus line at time to transfer the information. Here we will see two ways to construct the bus : By using multiplexers. By three state buffer.
  • 4. One way of constructing bus system is by using multiplexers. The multiplexer select the one register who ‘s information is transfer to another one destination register. In a bus system, multiplex K register of n bits each to produce an n lines common bus .The number of multiplexers needed to construct the bus is equal to n.Size of each mux is must be k-1multiplexer hence multiplexer have n data lines.
  • 5. Example: For common bus system using multiplexer for 16 register each of 32 bit data transformation. solution: In this system we require 32(number of bits) multiplexer each having size of 16-1 multiplexer(number of register) and number of selection inputs are 4 .
  • 6.
  • 7.  The construction of bus system for four bit, four register is given below:
  • 8. As we know that for n bit we require n multiplexer, for k register transfer we require k-1 size of multiplexer. Here we have n=4 and k=4 hence here we use four multiplexer each having 4-1 size. Here each register have 4 positive triggered flip- flop set. because each mux is 4-1 each multiplexer have 2 selection inputs in the bus.
  • 9. we denote it by S0 and S1. This selection input select the one line output from 0 to 3 available in the each multiplexer, and applied to the output that form a bus system. To avoid the complicated figure we just write output and input at the connection. For example output A1 of register A is connected with the input line 0 of mux(1) because that input is labeled as A1.
  • 10.
  • 11. The two selection lines S and S are connected to the selection inputs of all four multiplexers. The selection lines choose the four bits of one register and transfer them into the four-line common bus. When S1S0 =00, the 0 data inputs of all four multiplexers are selected and applied to the outputs that form the bus. This causes the bus lines to receive the content of register A since the outputs of this register are connected to the 0 data inputs of the multiplexers. Similarly, register B is selected if S1S0= 0 1, and so on.
  • 12. Table 1 shows the register that is selected by the bus for each of the four possible binary value of the selection lines. TABLE 1 Function Table for Bus of Fig. 1
  • 13.
  • 14. The transfer of information from a bus into one of many destination registers can be accomplished by connecting the bus lines to the inputs of all destination registers and activating the load control of the particular destination register selected. The symbolic statement for a bus transfer may mention the bus or its presence may be implied in the statement. When the bus is includes in the statement, the register transfer is symbolized as follows.
  • 15. The content of register C is placed on the bus, and the content of the bus is loaded into register R1 by activating its load control input. If the bus is known to exist in the system, it may be convenient just to show the direct transfer. From this statement the designer knows which control signals must be activated to produce the transfer through the bus.
  • 16.
  • 17. Memory Transfer The transfer of information from a memory word to the outside environment is called a read operation. The transfer of new information to be stored into the memory is called a write operation. A memory word will be symbolized by the letter M. The particular memory word among the many available is selected by the memory address during the transfer. It is necessary to specify the address of M when writing memory transfer operations. This will be done by enclosing the address in square brackets following the letter M.
  • 18. The address register, symbolized by AR. The data are transferred to another register, called the data register, symbolized by DR. The read operation can be stated as follows:
  • 19. memory write this causes a transfer of information into DR from the memory word M selected by the address in AR. The write operation transfers the content of a data register to a memory word M selected by the address. Assume that the input data are in register R1 and the address is in AR. The write operation can be stated symbolically as follows