Logic implementation using Programmable Logic Array (PLA)

Shilpa Rudrawar
27 Jul 202417:55

Summary

TLDRIn this HDL digital circuit design course, Professor Shilpakar Rudar from MIT Academy of Engineering, Pune, introduces Programmable Logic Array (PLA), a versatile IC that allows users to configure logic gates and flip-flops for various functions. The lecture covers PLA's structure, types, and programming process, including using Boolean functions and K-maps for optimization. It also discusses PLA's limitations, such as complexity, speed, power consumption, and scalability, alongside its advantages like flexibility, customization, compact design, high integration, and a simplified design process, providing a comprehensive understanding of PLA's role in digital logic implementation.

Takeaways

  • πŸ“˜ The course is about HDL digital circuit design, specifically focusing on Programmable Logic Array (PLA).
  • πŸ” PLAs are ICs that contain a large number of gates and flip-flops configurable by the user to perform various functions.
  • πŸ’‘ The lecture explains the concept of programmable logic devices (PLDs), which include PLAs and other types like PALs and PLOs.
  • 🌐 The programmability of PLAs involves both AND and OR arrays, which can be either fixed or programmable, defining different types of PLDs.
  • πŸ”‘ The process of programming a PLA involves using programming software or a programming process to configure the logic gates and switches.
  • πŸ› οΈ The script provides an example of implementing a Boolean function using PLA, detailing the process of generating product terms and connecting them to OR gates.
  • πŸ”„ The use of XOR gates in PLAs is explained for inverting logic at the output side without the need for additional NOT gates.
  • πŸ“Š The script includes a step-by-step guide on using a truth table and Karnaugh Maps (K-maps) to derive Boolean equations for PLA implementation.
  • 🚧 The limitations of PLAs are discussed, including complexity and cost, speed limitations due to logic delays, higher power consumption, and scalability issues.
  • πŸ›‘ Advantages of PLAs highlighted include flexibility in logic implementation, customization to meet specific requirements, compact and high integration design, and a simplified design process.
  • πŸ‘¨β€πŸ« The lecture is delivered by Professor Shilpakar Rudar from the School of ENTC Engineering at MIT Academy of Engineering in Alandi, Pune.

Q & A

  • What is the main topic of the course presented in the script?

    -The main topic of the course is Programmable Logic Array (PLA) and how to program combination logic within it, including its limitations and advantages.

  • What does the acronym 'PLD' stand for in the context of the script?

    -PLD stands for Programmable Logic Device, which is an IC containing a large number of gates and flip-flops that can be configured by the user to perform different functions.

  • What are the different types of programmable logic devices mentioned in the script?

    -The different types of programmable logic devices mentioned are Programmable Array Logic (PAL), Programmable Logic Array (PLA), and Programmable Read-Only Memory (PROM).

  • What is the role of the AND and OR arrays in a PLA?

    -In a PLA, both the AND and OR arrays are programmable. The AND array generates product terms based on the inputs, which are then fed into the OR array to produce the required logic functions.

  • How can the script's explanation of Boolean functions be utilized in circuit design?

    -The explanation of Boolean functions in the script can be used to implement specific logic functions using a PLA by determining the required product terms and connecting the AND and OR gates accordingly.

  • What is the purpose of the XOR gate mentioned in the script?

    -The XOR gate is used to provide the option to invert the output logic if required, without needing an additional NOT gate, by connecting one of its terminals to logic one or zero.

  • How does the script describe the process of implementing digital logic using a PLA?

    -The script describes the process by starting with a truth table, using a Karnaugh map (K-map) to simplify the Boolean equations, and then programming the AND and OR arrays in the PLA according to these equations.

  • What are some limitations of using a PLA as mentioned in the script?

    -Limitations include complexity and cost due to a large number of programmable links, speed limitations due to multiple levels of logic, higher power consumption, and difficulty in scaling for very large designs compared to devices like FPGAs.

  • What advantages does the script highlight for using a PLA?

    -Advantages highlighted include flexibility in logic implementation, customization to meet specific requirements, compact design, high integration enabling complex digital systems on a single chip, and a simplified design process due to programmability of the AND and OR arrays.

  • How does the script explain the optimization of logic functions in a PLA?

    -The script explains optimization by showing how common product terms in Boolean equations can be shared, reducing the number of AND gates needed, thus simplifying the circuit.

  • What is the significance of the script's mention of the programmability of both AND and OR arrays in a PLA?

    -The programmability of both AND and OR arrays in a PLA allows for high flexibility and customization in logic design, making it suitable for a wide range of applications and enabling the implementation of complex digital systems.

Outlines

00:00

πŸ“š Introduction to Programmable Logic Array (PLA)

The first paragraph introduces the topic of the video script, focusing on the concept of Programmable Logic Array (PLA) within HDL digital circuit design. Shilpakar Rudar, the assistant professor at MIT Academy of Engineering, explains the basics of PLA, which is a type of programmable logic device (PLD) containing a large number of gates and flip-flops that can be configured by users. The explanation includes the programmability of both AND and OR arrays, the use of programmable switches to implement logic functions, and the types of PLAs including AND-OR-INVERT (AOI) and other variations. The paragraph sets the stage for a deeper dive into PLA programming and its applications.

05:01

πŸ” Exploring PLA Configuration and XOR Gate Function

This paragraph delves into the configuration of PLA, discussing the programmable AND and OR arrays and their roles in creating combination logic. It explains how inputs are provided to the AND array, which can be complemented using inverters, to generate product terms. These terms are then fed into the OR array to produce the desired output functions. The paragraph also introduces the use of an XOR gate for inverting logic outputs when necessary, providing a truth table for the XOR gate and explaining how its inputs can be manipulated to achieve the desired output inversion. This section clarifies the technical aspects of PLA configuration and the flexibility offered by the inclusion of an XOR gate for output modification.

10:02

πŸ› οΈ Implementing Digital Logic with PLA using K-Maps

The third paragraph presents a step-by-step guide on how to implement digital logic using a PLA, with a practical example involving a truth table for two functions based on three inputs. The explanation covers the use of K-maps (Karnaugh maps) for simplifying Boolean equations derived from the truth table. It details the process of filling out the K-map, applying grouping rules to minimize the logic expression, and optimizing the circuit by reducing the number of product terms. The summary also touches on the use of complements to further simplify the logic design, leading to a more efficient implementation within the PLA.

15:04

πŸš€ Advantages and Limitations of PLA in Digital Circuit Design

The final paragraph summarizes the advantages and limitations of using PLA in digital circuit design. It acknowledges the flexibility and customization capabilities of PLA due to its programmable AND and OR arrays, making it suitable for a wide range of applications. The paragraph also highlights the compact and high integration design of PLA, which allows for complex digital systems to be implemented on a single chip. However, it also discusses the limitations, including complexity and cost due to the large number of programmable links, potential speed issues due to multiple logic levels, higher power consumption, and scalability challenges compared to more advanced devices like FPGAs. The summary concludes by emphasizing the simplified design process facilitated by PLA's programmability.

Mindmap

Keywords

πŸ’‘HDL digital circuit design

HDL, which stands for Hardware Description Language, is a specialized language used to describe the structure and behavior of electronic systems such as digital circuits. In the context of the video, HDL digital circuit design refers to the process of creating digital circuits using a hardware description language. The video's theme revolves around the design and programming of digital circuits, specifically using Programmable Logic Array (PLA), which is a type of digital logic that can be programmed to perform various functions.

πŸ’‘Programmable Logic Array (PLA)

A Programmable Logic Array (PLA) is an integrated circuit that contains a grid of logic gates, both AND and OR gates, which can be programmed to perform a variety of logical functions. The video explains how to program PLAs to implement specific combinational logic. PLAs are significant in the video as they are the main topic and the focus of the course content.

πŸ’‘Combinational logic

Combinational logic refers to a type of digital logic circuit where the output is determined by the current input values only, without any memory of past inputs. The video discusses programming PLAs to implement combinational logic, which is a fundamental concept in digital circuit design.

πŸ’‘AND array

An AND array is a set of AND gates arranged in a matrix form within a PLA. It is responsible for generating product terms based on the inputs provided. In the video, the AND array is described as being programmable, allowing for the creation of various product terms that are essential for implementing the desired logic functions.

πŸ’‘OR array

An OR array is a collection of OR gates that combine the output of the AND array to produce the final output of the PLA. The video explains that in a PLA, the OR array is also programmable, which means that it can be configured to combine the product terms from the AND array in various ways to achieve the required logic functions.

πŸ’‘Boolean function

A Boolean function is a mathematical function that takes Boolean values (true or false, often represented as 1 or 0) as inputs and produces a Boolean value as output. The video uses Boolean functions as examples to illustrate how to program PLAs to achieve specific logical operations.

πŸ’‘Karnaugh map (K-map)

A Karnaugh map is a graphical method used to simplify Boolean algebra expressions. The video mentions using K-maps to solve for the equations needed to program the PLA based on a given truth table. K-maps are essential in minimizing the complexity of the logic and reducing the number of gates required.

πŸ’‘Product term

A product term in Boolean algebra is a conjunction (AND operation) of literals or variables. In the context of the video, product terms are generated by the AND array and are used as inputs to the OR array to produce the final output of the PLA.

πŸ’‘Inverter

An inverter is a digital logic gate that performs the NOT operation, inverting the input signal to produce the opposite output. The video explains that inverters are used within the PLA to generate complements of inputs, which are necessary for creating the required product terms.

πŸ’‘XOR gate

An XOR gate is a logic gate that outputs true or 1 only when the number of true inputs is odd. In the video, an XOR gate is used to invert the output of the OR array if needed, providing flexibility in the design to achieve the desired logic function.

πŸ’‘Optimization

Optimization in digital circuit design refers to the process of simplifying and improving the circuit to reduce the number of components, cost, and power consumption, while maintaining the required functionality. The video discusses optimizing the PLA by reducing the number of product terms and gates, which is an important aspect of efficient circuit design.

πŸ’‘Limitations

The video outlines several limitations of using PLAs, such as complexity and cost due to the large number of programmable links, speed limitations due to multiple levels of logic, higher power consumption due to dense interconnections, and scalability issues when compared to more advanced programmable devices like FPGAs.

πŸ’‘Advantages

Despite the limitations, the video also highlights the advantages of PLAs, including flexibility in logic implementation, customization to meet specific requirements, compact design, high integration enabling complex systems on a single chip, and a simplified design process due to the programmability of both AND and OR arrays.

Highlights

Introduction to Programmable Logic Array (PLA) and its role in HDL digital circuit design.

Explanation of programmable logic devices (PLDs) as ICs containing configurable gates and flip-flops.

Description of how PLDs can be programmed using software or a programming process.

Differentiation between types of PLDs: PAL, PLA, and PLO based on the programmability of AND and OR arrays.

Visual representation of fixed and programmable logic arrays in diagrams.

The process of programming AND and OR arrays in a PLA to implement specific logic functions.

Use of Boolean functions to demonstrate the implementation of logic in PLA.

Role of XOR gates in inverting logic outputs when required.

Explanation of how to implement digital logic using PLA with an example truth table.

Utilization of Karnaugh Maps (K-maps) for simplifying Boolean equations from a truth table.

Optimization of circuit design by reducing the number of product terms using complements.

Cross-connections in programmable AND and OR arrays to implement the logic equations.

Limitations of PLA including complexity, cost, speed, power consumption, and scalability.

Advantages of PLA such as flexibility, customization, compact design, high integration, and simplified design process.

Practical example of implementing combination logic using PLA and optimizing the circuit.

Conclusion summarizing the key points of PLA's functionality, limitations, and advantages.

Invitation to the next session and encouragement for continued learning in digital circuit design.

Transcripts

play00:01

welcome to the course of HDL digital

play00:03

circuit design today's topic is

play00:05

programmable logic array I'll be

play00:07

explaining how to program particular

play00:10

combination logic in pla and its

play00:13

limitation and advantages myself

play00:16

shilpakar rudar assistant Pro Professor

play00:18

School of entc Engineering MIT Academy

play00:20

of engineering alandi Pune so moving

play00:23

ahead with the topic programmable logic

play00:25

uh array so in the previous section we

play00:28

have seen what is mean by plld

play00:30

programmable uh logic devices uh which

play00:34

is an IC containing large number of

play00:36

gates flip flops which can be configured

play00:39

by the user to perform different

play00:41

functions and it is a single IC on which

play00:44

you are implementing digital logic and

play00:47

uh here uh there are programmable

play00:50

devices which can be programmed using

play00:52

programming software or programming

play00:54

process so here you are able to see on

play00:57

the left hand side this diagram indicat

play01:00

GES that plld is there in which you are

play01:02

having logic gates and programmable

play01:04

switches inputs will be given to the

play01:07

input side and depending upon logic you

play01:09

are implementing uh that will be

play01:12

programmed by making switches on and off

play01:16

and that way you'll be getting your

play01:17

output that is the function over here at

play01:20

the output side now there are different

play01:23

types of PD as we have seen in the

play01:25

previous section previous lecture that

play01:27

is programmable array logic programmable

play01:30

logic array and pron

play01:33

basic logic uh device over here is the

play01:36

and array and or array depending upon

play01:39

which is programmable and which is fixed

play01:41

or both are programmable depending upon

play01:44

that we are defining which type of uh

play01:47

PLS are that so uh over here you are

play01:50

able to see that is yellow indicates fix

play01:53

uh array logic and blue color indicates

play01:56

the programmable one so when and array

play02:00

is fixed and or array is programmable

play02:04

then it is a programmable readon memory

play02:08

that is one type of plld second you are

play02:11

able to see that and array is

play02:13

programmable and or array is fixed at

play02:16

that time that particular plld is

play02:18

programmable array logic and when both

play02:22

are programmable as you are able to see

play02:24

green color or blue color whatever you

play02:25

are able to see so that is both are

play02:28

programmable that you are able to

play02:30

program and array as well as our array

play02:32

then it is called as a pla now we are

play02:35

starting with the pla programmable array

play02:38

uh programmable logic array here you are

play02:41

able to see this is and array and this

play02:44

is or array in pla both are programmable

play02:47

and that's why it is shown by this color

play02:49

here input to the and array are shown by

play02:51

the N inputs so here there might be

play02:54

multiple input present each uh input can

play02:57

be inverted so if I'm giving input a b

play03:01

and c so I am able to generate a bar B

play03:04

Bar C bar also because of inverter

play03:06

present so these are what are the number

play03:08

of inputs to the and gate now it will be

play03:11

generating K product terms over here and

play03:13

that output will be given to the orgate

play03:16

so number of orgate will depend upon

play03:18

number of functions you require so here

play03:21

I will be explaining this things uh

play03:23

using this Boolean function suppose you

play03:25

need to implement this Boolean function

play03:27

means I am having function w X and Y so

play03:31

there are three functions that is three

play03:33

output I require that's why I require

play03:35

three orgate over here so array of

play03:38

orgate will will be having three input

play03:40

over there for the r next over here um

play03:44

we are having how many product terms so

play03:46

1 2 3 4 5 6 7 that way I'll be requiring

play03:50

seven and Gates over here because I

play03:53

require seven product terms now when I

play03:56

am giving a b c d over here because a b

play04:00

c and d these are the inputs available

play04:02

uh because of this inverter it will be

play04:04

generating a bar B Bar C Bar D Bar also

play04:07

so whenever in the product terms I

play04:09

require complement uh of C complement of

play04:12

D that is inverted uh D so it will be

play04:16

possible using this inverter once that

play04:18

product terms are getting generated that

play04:20

will be given to the r input over here

play04:23

so for generating W function over here I

play04:26

require to apply this product term coms

play04:30

over here so product term generated from

play04:32

this particular and gate will be given

play04:34

to this and one input of orgate and

play04:37

second uh productor will be given to the

play04:39

second input of orgid and that way this

play04:41

will be the function W in the same way

play04:44

I'll be generating X and Y so I require

play04:48

total three or gate at the output side

play04:52

or in our array so hope the things are

play04:55

clear now one question is over here that

play04:57

why this exor gate is shown because this

play05:00

is the orgate and this I told you that

play05:03

depending upon function you'll be having

play05:05

that many or Gates over there but here

play05:07

you are able to see the xor git now what

play05:10

is the role of this xor gate now as this

play05:12

is the plld D which is over here it's a

play05:15

pla sometimes you require the inverted

play05:18

logic at the output side there should

play05:20

not be any requirement of not get I for

play05:23

inverting that logic and that's why this

play05:26

inversion is provided using this xor

play05:29

gate now here for your reference I have

play05:32

shown uh truth table of xor gate where 0

play05:35

0 gives the output 0 0 1 gives the

play05:38

output 1 1 Z gives the output one and 1

play05:41

one is uh uh for one one output is one

play05:45

uh sorry 0 so 0 1 1 0 you are able to

play05:48

see it or not I'm not that way sure so

play05:52

over here so you're able to see 1 one

play05:55

output is zero so now just check if my

play05:58

output is over over here and I want that

play06:01

to be inverted so I need to connect one

play06:05

terminal of this xor gate to the logic

play06:07

one so that whatever data I am getting

play06:10

over here will get inverted now how that

play06:12

is possible so over here you are able to

play06:15

see when one of the input of your XR

play06:18

gate is zero connected fixed to the zero

play06:21

output you'll be getting depending upon

play06:23

whatever present on the second terminal

play06:25

that is if zero is present you'll be

play06:27

getting zero and one is uh given then

play06:29

you'll be getting one so consider the

play06:32

same logic over here if I have connected

play06:35

one input of xor gate to the zero that

play06:37

is over here suppose this is zero and

play06:39

this link is closed so I have connected

play06:41

it to the zero meaning of that whatever

play06:44

coming on the second terminal that here

play06:46

it is mentioned by B so same output

play06:49

you'll be getting over here so if I'm

play06:51

having one over here I'll be getting one

play06:52

so there will not be inverted output but

play06:56

if I want my logic to be inverted that

play06:59

is my requirement and don't want to use

play07:01

uh extra not gate over there so that

play07:04

will be done through this xor gate now

play07:07

suppose I'm connecting one of the

play07:08

terminal to logic one one of the

play07:10

terminal of this X or get to logic one

play07:12

so see over here you are having one

play07:14

connected to one of the terminal so

play07:16

whatever present on the second input

play07:18

will get inverted uh at the output so if

play07:22

zero is given one you'll be getting when

play07:24

one is given zero you'll be getting so

play07:26

here you are able to see same thing if

play07:28

one is connected to the the one terminal

play07:30

of XR G then whatever data you are

play07:32

getting over here that is getting

play07:34

inverted at this particular time um

play07:37

output so that there is no need of extra

play07:40

not gate connection hope the things are

play07:43

clear to

play07:44

you moving ahead with the next slide now

play07:48

if you want to implement any logic

play07:51

digital logic using pla so how to

play07:54

implement it so for that I have taken

play07:56

one example here you are able to see

play07:59

that one truth table has been given

play08:01

inputs are a b c and two functions are

play08:04

there fub1 and FS2 now as there are

play08:07

three inputs there are total eight

play08:09

possibilities that is 0 0 0 to 111 and

play08:12

depending upon that you are able to see

play08:14

this outputs are present now whenever

play08:16

truth table is given and whenever you

play08:18

need to have a equation out of that you

play08:20

need to solve it using uh kmap and hope

play08:23

the Kap concept is uh already uh you

play08:26

know in the first year itself but just

play08:29

for your understanding I'll be briefing

play08:31

in uh short so here as there are eight

play08:34

options available so you need to have a

play08:37

block of 8 over here 2 by 4 over here so

play08:42

whatever is the MSB you need to write it

play08:44

over here 0 one and whatever is the LSB

play08:47

bits are there b c you need to write

play08:50

here as there is only one variable

play08:52

options are zero and one as there are

play08:54

two variables options are 0 0 0 1 1 0

play08:57

and 1 1 here you you using gray

play09:00

coding that is after 01 I'm not writing

play09:03

1 Z I'm writing 1 one because if I'm

play09:06

writing it near to this 0 1 and 1 Z both

play09:09

will get cancell and that's why your

play09:12

equation will not be proper and that's

play09:13

why you need to use binary uh coding

play09:16

over here uh gray code over here now how

play09:19

to solve it as you know that a is the uh

play09:23

MSB and B and C are the least

play09:25

significant bits over there so 0 0 0 for

play09:29

how many functions you are having that

play09:31

many kmaps you need to draw so there are

play09:32

two functions F1 and F2 that's why there

play09:35

are two kmaps has been drawn so here 0 0

play09:39

0 indicates this z b is also Z and C is

play09:43

also Z means this particular block will

play09:45

be 0o again 0 0 1 then this is 1 0 1 1

play09:51

this is three 0 1 0 that is in binary 0

play09:55

1 0 in decimal it is two like ways you

play09:58

need to right at the corner the number

play10:02

of that block so that it will be easy

play10:05

for you to um put that outputs over

play10:08

there so this is 0 1 2 3 4 5 6 and 7

play10:14

just do it by your own and just uh uh

play10:18

see whether it is coming same or not so

play10:20

according to this I'll be writing F1 uh

play10:23

output over here so 0 0 0 output is one

play10:26

that's why in this box it is written one

play10:28

because this is this is the zero block

play10:30

first block you are having one again it

play10:32

has been it has been written like that

play10:34

for two it is one and this is three

play10:36

because of gray code and this is two

play10:38

that's why it is one that way you need

play10:40

to fill up this particular blocks over

play10:42

there and then you need to apply uh the

play10:44

grouping uh rules over there so you can

play10:48

make this as a one group you can make

play10:50

this as a one group and you can make

play10:52

this and this as a one

play10:56

group whenever you are solving you need

play10:58

to solve in this way I'll be explaining

play11:00

this particular part over here what is

play11:04

the uh equation for this that is one one

play11:08

if I'm grouping this 1 one so 0o and one

play11:11

that is a is z a is one so that is

play11:13

getting cancelled and you are having Z 0

play11:16

that is B bar and C bar so that's why

play11:18

this particular equation uh in which you

play11:20

are getting B bar and C bar plus because

play11:23

this equation has been solved this

play11:25

grouping has been solved then solve this

play11:26

grouping now here a is what zero 0 means

play11:29

a bar and here 0 0 and 0 1 where 0 0 is

play11:33

constant but this Z is changing with one

play11:36

and that's why C is changing from 0 to

play11:38

one so whatever is changing just uh

play11:40

remove that and whatever is the constant

play11:42

you need to take it that is B bar so a

play11:45

bar and B bar this is what is your this

play11:48

answer of this particular group then

play11:51

solve this this and this in same way

play11:53

you'll be getting a bar c bar now if you

play11:56

want to complement you can complement if

play11:58

you want to leave it like that just

play12:00

leave it so I'll be telling you why they

play12:02

have taken like this uh over there now

play12:05

same way you need to solve F2 and after

play12:08

solving you are getting F2 as a A+ a C+

play12:11

a bar B Bar C bar why you are getting a

play12:13

bar B Bar C bar because there is no

play12:16

group form for this this is the single

play12:19

um digit you are having there is no

play12:21

grouping possible and that's why this is

play12:22

a bar B Bar C bar because 0 0 0 and

play12:25

that's why it is coming in three um bits

play12:29

over there now uh you need to try to

play12:32

reduce the implementation as far as

play12:35

possible so over here if I'm taking this

play12:38

equation and this equation so number of

play12:40

product terms are 1 2 3 4 5 6 but if I'm

play12:45

taking complement of this which is over

play12:48

here F1 bar is find uh written so a bar

play12:52

B bar is written as a Ab a bar c bar is

play12:55

written as a AC B Bar C bar is written

play12:56

as a BC so in this equ equation and in

play13:00

this equation you are able to see ab and

play13:02

AC are common and that way you are

play13:04

reducing two and Gates over there and

play13:07

that is uh very much required to

play13:10

optimize the uh circuit so here final

play13:13

output you are able to see AB plus AC

play13:16

plus uh BC and this is the second one

play13:18

now moving ahead with this thing now as

play13:21

you have got this particular thing out

play13:23

of which two are common and that's why

play13:24

it is taken once and that's why total

play13:27

product terms requir are 1 2 3 and and

play13:29

four over here you are able to see and

play13:31

array and this or array both are

play13:33

programmable and that's why we are

play13:35

making the cross connections over here

play13:37

uh by this way so both are programmable

play13:40

if that is dot it is fixed now as I told

play13:43

you at the input side you are giving a

play13:45

as well as its complement so this is

play13:46

shown by this particular um figure or

play13:49

symbol and depending upon your product a

play13:52

b so I'll be taking this a and this B

play13:56

over here and I'll be shorting this a

play13:59

short this B short means this is my ab

play14:02

so it is written over here same way AC

play14:05

same way BC and same way a bar B Bar C

play14:08

and that way over here for fub1 I

play14:11

required AB AC and a bar B Bar C so it

play14:15

is given to the one orgate and second it

play14:17

has been given to the second orgate

play14:22

now so whatever function you want to

play14:24

complement that way you need to program

play14:26

this xor gate so if you want Inver then

play14:29

connect one of the terminal of X orgate

play14:31

with one and if you want to give as it

play14:34

is then connect it with the zero and

play14:36

rest of the input you need to connect

play14:38

the output of this orgate so that way

play14:40

complement function is possible over

play14:44

here now we have seen how to implement

play14:48

uh combination logic using pla so what

play14:50

are the limitations of this particular

play14:53

pla so you are able to see the first

play14:56

limitation is complexity and cost that

play14:58

is pla can be complex and costly to

play15:00

manufacture due to large number of

play15:02

programmable links because you need to

play15:03

program all and array links and all or

play15:07

array that's why it is uh somewhat uh

play15:09

large number of links uh you need to

play15:13

program so it is somewhat complex and

play15:16

costly second point that is the speed

play15:18

the multiple level of logic within the

play15:20

pla can introduce delays making them

play15:23

slower compared to the some of the types

play15:25

some of these uh plds that is fpga p

play15:29

over there so as you are uh programming

play15:32

all and array and all or array so

play15:36

somewhat speed limitation will be there

play15:38

it will not be that way faster but it

play15:40

will be making it somewhat slower third

play15:43

point that is the power consumption the

play15:46

dense interconnection of logic gates can

play15:48

result in higher power consumption which

play15:50

might not be suitable for low power

play15:53

application so because of density over

play15:56

here the power consumption will be more

play15:59

next is scalability pla may not be

play16:01

easily scaled for very large designs

play16:04

especially when compared to more

play16:06

advanced programmable devices like fpga

play16:09

so you are not able to scale it as uh

play16:12

far as the fpga which is used for

play16:15

implementing complex logic so that is

play16:18

the next limitation now what are the

play16:20

advantages first advantages you are able

play16:22

to see that is flexibility in logic

play16:24

implementation as both the arrays and

play16:27

and or are programming able so

play16:29

flexibility is very high over there so

play16:32

you are able to program both the arrays

play16:35

then customization over here that is

play16:37

second Point user can customize the

play16:40

logic design to meet specific

play16:41

requirements making pla suitable for a

play16:43

wide range of application so over here

play16:47

customization is possible because you

play16:49

are able to program both the arrays

play16:52

compact design pla allows for the

play16:55

implementation of multiple logic

play16:57

functions within a single device

play16:59

reducing the need of multiple discrete

play17:01

ises because inverting also is done in

play17:04

the in pla only itself only so that's

play17:08

why no need to have uh uh no need to use

play17:10

different IC so compact design is

play17:12

possible next is high integration they

play17:15

offers a high degree of integration

play17:17

enabling the design of complex digital

play17:20

systems on a single chip that is

play17:22

integration means you are integrating

play17:24

everything on a single chip and last one

play17:27

simplified design process the

play17:28

programmability of um that and and or

play17:31

array simplifies the design process and

play17:34

uh this is what is the limitation and

play17:37

advantages of pla hope the things are

play17:40

clear to you and uh uh I have explained

play17:44

it using one example implementation also

play17:47

so thank you everyone we'll meet in next

play17:49

session so thank you happy learning

Rate This
β˜…
β˜…
β˜…
β˜…
β˜…

5.0 / 5 (0 votes)

Related Tags
HDL DesignCircuit DesignPLAProgrammable LogicDigital LogicEngineering EducationMIT AcademyCombination LogicLogic OptimizationTechnical Learning